Abstract
In this paper, we propose a simple scheduler called SBQ (Service-Based Queuing) to share the bandwidth fairly between unicast and multicast flows according to a new definition of fairness referred as the inter-service fairness. We utilize our recently proposed active queue management mechanism MFQ (Multicast Fair Queuing) to fairly share the bandwidth among all competing flows in the multicast queue.
The simulation results obtained for very heterogeneous sources and links characteristics suggest that, on the one hand, our scheduler achieves the expected aggregated bandwidth sharing among unicast and multicast service, and on the other hand the multicast flows remain TCP-friendly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, A digital fountain approach to reliable distribution of bulk data transfer, In Proc. of ACM SIGCOMM’98, September 1998.
D. M. Chiu., Some Observations on Fairness of Bandwidth Sharing, In Proc. of ISCC’00, July 2000.
F. Filali and W. Dabbous, A Simple and Scalable Fair Bandwidth Sharing Mechanism for Multicast Flows, In Proc. of IEEE ICNP’02, November 2002.
F. Filali and W. Dabbous, SBQ: Service-Based Queuing, INRIA Research Report, March 2002.
S. Floyd, V. Jacobson, and V. Random, Early Detection gateways for Congestion Avoidance, IEEE/ACM TON, V. 1 No. 4, pp. 397–413, August 1993.
S. Floyd and V. Jacobson, Link-sharing and Resource Management Models for Packet Networks, IEEE/ACM TON, V. 3, No. 4, 1995.
S. Floyd, M. Handley, J. Padye, and J. Widmer, Equation-based congestion control for unicast applications, In Proc. of ACM SIGCOMM’00, August 2000.
T. N.H. Henderson and S. N. Bhatti, Protocol-independent multicast pricing, In Proc of NOSSDAV’00, June 2000.
F. Kelly, A. Maulloo and D. Tan, Rate control in communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research Society 49, pp. 237–252, 1998.
A. Legout, J. Nonnenmacher, and E. W. Biersack, Bandwidth Allocation Policies for Unicast and Multicast Flows, IEEE/ACM TON, V. 9 No. 4, August 2001.
D. Lin and R. Morris, Dynamics of Random Early Detection, In Proc. of ACM SIGCOMM’97, September 1997.
M. Luby, V. Goyal, and S. Skaria, Wave and Equation Based Rate Control: A massively scalable receiver driven congestion control protocol, draft-ietf-rmt-bb-webrc-00.txt, October 2001.
M. Luby, L. Vicisano, and A. Haken, Reliable Multicast Transport Building Block: Layered Congestion Control, Internet draft: draft-ietf-rmt-bb-lcc-00.txt, November 2000.
A Mankin, et al., IETF Criteria for evaluating Reliable Multicast Transport and Applications Protocols, IETF RFC 2357, June 1998.
I. Stoica, S. Shenker, and H. Zhang, Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks, In Proc. of SIGCOMM’98.
J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, Modeling TCP throughput: a simple model and its empirical validation, In Proc. of ACM SIGCOMM’98.
D. C. Stephens, J.C.R. Bennet, and H. Zhang, Implementing scheduling algorithms in high speed networks, IEEE JSAC, V. 17, No. 6, pp. 1145–1159, June 1999.
J. Widmer and M. Handley, TCP-Friendly Multicast Congestion Control (TFMCC): Protocol Specification, draft-ietf-rmt-bb-tfmcc-00.txt, November 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filali, F., Dabbous, W. (2002). SBQ: A Simple Scheduler for Fair Bandwidth Sharing Between Unicast and Multicast Flows. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds) From QoS Provisioning to QoS Charging. QofIS ICQT 2002 2002. Lecture Notes in Computer Science, vol 2511. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45859-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-45859-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44356-8
Online ISBN: 978-3-540-45859-3
eBook Packages: Springer Book Archive