Name
Abstract | ||
|---|---|---|
Using a simple model of saturated, synchronized and homogeneous sources of TCP Reno with drop-tail queue management and a discrete-time framework, we derive formulae for stationary as well as transient queueing behavior that shed light on the relationship between large buffers and work conservation (queue never empties). Using simulations, the relevance of the results for the case of non-synchronized sources is demonstrated. In particular, we demonstrate that a certain simple lower bound for the stationary queue length applies also to the case where the sources are non-stationary. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/INFCOM.2004.1356964 | IEEE INFOCOM 2004: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS |
Keywords | Field | DocType |
discrete time,queue management,web server,propagation delay,protocols,sun,automation,internet,lower bound,fluid flow,queueing theory,transport protocols | Bulk queue,Propagation delay,Homogeneous,Upper and lower bounds,Computer science,Queue,Computer network,Queueing theory,Queue management system,TCP congestion-avoidance algorithm,Distributed computing | Conference |
Volume | Issue | ISSN |
2 | null | 0743-166X |
Citations | PageRank | References |
10 | 0.61 | 19 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinsheng Sun | 1 | 356 | 32.12 |
| Moshe Zukerman | 2 | 1660 | 175.61 |
| King-Tim Ko | 3 | 333 | 28.73 |
| Guanrong Chen | 4 | 12378 | 1130.81 |
| Sammy Chan | 5 | 419 | 22.86 |