The Incremental Deployability of Core-Stateless Fair Queuing

Authors:
Yannick Blanpain;Hung-Yun Hsieh;Raghupathy Sivakumar
Affiliations:
-;-;-
Venue:
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Year:
2001

Citing 3
Cited 0

Providing guaranteed services without per flow management

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Multicast Service Differentiation in Core-Stateless Networks

NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)

Quantified Score

Hi-index	0.00

Visualization

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.