论文信息 - The Incremental Deployability of Core-Stateless Fair Queuing

The Incremental Deployability of Core-Stateless Fair Queuing

In this paper, we study the incremental deployability of the Core-Stateless Fair Queuing (CSFQ) approach to provide fair rate allocations in backbone networks. We define incremental deployability as the ability of the approach to gracefully provide increasingly better quality of service with each additional QoS-aware router deployed in the network. We use the ns2 network simulator for the simulations. We conclude that CSFQ does not exhibit good incremental deployability.

Raghupathy Sivakumar | Hung-Yun Hsieh | Yannick Blanpain

[1] Vaduvur Bharghavan,et al. Achieving per-flow weighted rate fairness in a core stateless network , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[2] Hui Zhang,et al. Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[3] Kevin R. Fall,et al. Ns: notes and documentation , 1997 .

[4] Kang-Won Lee,et al. Multicast Service Differentiation in Core-Stateless Networks , 1999, Networked Group Communication.

[5] Scott Shenker,et al. Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[6] P. V. Marsden,et al. Handbook of Survey Research , 1985 .

[7] Ion Stoica,et al. Providing guaranteed services without per flow management , 1999, SIGCOMM '99.