Name
Abstract | ||
|---|---|---|
In this paper we consider an output port of an ATM switch, where cell streams belonging to different TCP and UDP sessions arrive. During congestion the switch applies Early Packet Discard in order to reduce bandwidth waste. In order to guarantee fairness in the sense that only misbehaving sources get affected by the packet drop mechanism and to ensure high server utilization we propose an algorithm which also features simplicity. A salient feature of this algorithm is that it allows a predefined share alpha(i) to be associated with stream i. The algorithm (which we call the Weighted Fair EPD, WFEPD) attempts to provide this weighted share of the bandwidth for the streams in the long time average, A sliding window implementation of WFEPD allows us to demonstrate its efficiency in terms of fairness and bandwidth utilization. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/INFCOM.1999.751672 | IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW |
Keywords | Field | DocType |
bandwidth allocation,asynchronous transfer mode,packet switching,switches,bandwidth,protocols,queueing theory,robustness,tcpip | Sliding window protocol,Computer science,Bandwidth allocation,Network packet,Computer network,Internet protocol suite,Real-time computing,Asynchronous Transfer Mode,Bandwidth (signal processing),Queueing theory,Packet switching | Conference |
ISSN | Citations | PageRank |
0743-166X | 3 | 0.43 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| András Rácz | 1 | 138 | 13.77 |
| Gábor Fodor | 2 | 990 | 99.05 |
| Zoltán Turányi | 3 | 51 | 7.43 |