Sciweavers

401 search results - page 34 / 81
» Random Early Marking
Sort
View
CN
2004
98views more  CN 2004»
15 years 2 months ago
Simulation analysis of RED with short lived TCP connections
Several objectives have been identified in developing the random early drop (RED): decreasing queueing delay, increasing throughput, and increasing fairness between short and long...
Eitan Altman, Tania Jiménez
CORR
2000
Springer
95views Education» more  CORR 2000»
15 years 2 months ago
Effect of different packet sizes on RED performance
We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTU...
Stefaan De Cnodder, Omar Elloumi, Kenny Pauwels
ICST
2010
IEEE
15 years 29 days ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
Abderrahmane Feliachi, Hélène Le Gue...

Publication
167views
15 years 2 months ago
A Network Coding Approach to IP Traceback
Traceback schemes aim at identifying the source(s) of a sequence of packets and the nodes these packets traversed. This is useful for tracing the sources of high volume traffic, e...
Pegah Sattari, Minas Gjoka, Athina Markopoulou
113
Voted
BMCBI
2007
154views more  BMCBI 2007»
15 years 2 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...