Abstract
Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per flow basis. However, they require per-packet relabeling in the core routers. We propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Furthermore, it does not need relabeling, which is commonly used in existing core-stateless schemes. Packets are labeled only once in the entrance of the network according to the characteristics of the flow to which the packets belong. No matter TCP or UDP flows can get their fair share rate by the proposed scheme. Moreover, the scheme employs an estimation of number of active flows in the core routers. The estimation can be used to provide fair share rate without maintaining per flow states. The packets belonging to the flows whose rates exceed the estimated fair share rate are dropped. The novel scheme is called core-stateless labeling fairness (CSLF). We present and discuss simulations on the performance under different traffic scenarios.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - LCN 2002 |
| Subtitle of host publication | 27th Annual IEEE Conference on Local Computer Networks |
| Publisher | IEEE Computer Society |
| Pages | 495-501 |
| Number of pages | 7 |
| ISBN (Electronic) | 0769515916 |
| DOIs | |
| Publication status | Published - 2002 Jan 1 |
| Event | 27th Annual IEEE Conference on Local Computer Networks, LCN 2002 - Tampa, United States Duration: 2002 Nov 6 → 2002 Nov 8 |
Publication series
| Name | Proceedings - Conference on Local Computer Networks, LCN |
|---|---|
| Volume | 2002-January |
Other
| Other | 27th Annual IEEE Conference on Local Computer Networks, LCN 2002 |
|---|---|
| Country | United States |
| City | Tampa |
| Period | 02-11-06 → 02-11-08 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Hardware and Architecture
Cite this
}
Core-stateless labeling fairness : An integrated architecture to approximate fair bandwidth allocations in high speed networks. / Li, Jung-Shian; Lo, Cheng Pong.
Proceedings - LCN 2002: 27th Annual IEEE Conference on Local Computer Networks. IEEE Computer Society, 2002. p. 495-501 1181822 (Proceedings - Conference on Local Computer Networks, LCN; Vol. 2002-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Core-stateless labeling fairness
T2 - An integrated architecture to approximate fair bandwidth allocations in high speed networks
AU - Li, Jung-Shian
AU - Lo, Cheng Pong
PY - 2002/1/1
Y1 - 2002/1/1
N2 - Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per flow basis. However, they require per-packet relabeling in the core routers. We propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Furthermore, it does not need relabeling, which is commonly used in existing core-stateless schemes. Packets are labeled only once in the entrance of the network according to the characteristics of the flow to which the packets belong. No matter TCP or UDP flows can get their fair share rate by the proposed scheme. Moreover, the scheme employs an estimation of number of active flows in the core routers. The estimation can be used to provide fair share rate without maintaining per flow states. The packets belonging to the flows whose rates exceed the estimated fair share rate are dropped. The novel scheme is called core-stateless labeling fairness (CSLF). We present and discuss simulations on the performance under different traffic scenarios.
AB - Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per flow basis. However, they require per-packet relabeling in the core routers. We propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Furthermore, it does not need relabeling, which is commonly used in existing core-stateless schemes. Packets are labeled only once in the entrance of the network according to the characteristics of the flow to which the packets belong. No matter TCP or UDP flows can get their fair share rate by the proposed scheme. Moreover, the scheme employs an estimation of number of active flows in the core routers. The estimation can be used to provide fair share rate without maintaining per flow states. The packets belonging to the flows whose rates exceed the estimated fair share rate are dropped. The novel scheme is called core-stateless labeling fairness (CSLF). We present and discuss simulations on the performance under different traffic scenarios.
UR - http://www.scopus.com/inward/record.url?scp=84948956654&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84948956654&partnerID=8YFLogxK
U2 - 10.1109/LCN.2002.1181822
DO - 10.1109/LCN.2002.1181822
M3 - Conference contribution
T3 - Proceedings - Conference on Local Computer Networks, LCN
SP - 495
EP - 501
BT - Proceedings - LCN 2002
PB - IEEE Computer Society
ER -