The incremental deployability of core-stateless fair queuing

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Blanpain, Y., Hsieh, H. Y., & Sivakumar, R. (2001). The incremental deployability of core-stateless fair queuing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2094, pp. 259–267). Springer Verlag. https://doi.org/10.1007/3-540-47734-9_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free