Abstract
Purchase PDF (387 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (80 K)
doi:10.1016/j.comcom.2003.08.006 
Copyright © 2003 Elsevier B.V. All rights reserved.
Fair bandwidth sharing between unicast and multicast flows in best-effort networks
Received 8 August 2003;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper, we propose a simple scheduler called Service-Based Queuing (SBQ) to share the bandwidth fairly between unicast and multicast flows according to a new definition of fairness referred as the inter-service fairness. We also describe a new active queue management mechanism called Multicast Fair Queuing to fairly share the allowed multicast bandwidth among competing flows in the multicast queue.
The simulation results obtained for very heterogeneous sources and links characteristics suggest that, on the one hand, SBQ achieves the expected aggregated bandwidth sharing among unicast and multicast service, and on the other hand the multicast flows remain TCP-friendly.
Keywords: Multicast fairness; Fair bandwidth sharing; Two classes scheduler mechanism; Active queue management; Membership information
Article Outline
- 1. Introduction
- 2. Inter-service fairness
- 3. Fluid model algorithm
- 4. The service-based queuing (SBQ) scheduler
- 4.1. Principles and architecture
- 4.2. Scheduler configuration
- 4.3. Weights updating time
- 4.4. Counting unicast connections
- 5. The multicast fair queuing (MFQ) mechanism
- 5.1. Multicast bandwidth allocation module
- 5.2. Buffer management module
- 5.3. MFQ and layered multicast
- 6. Complexity and implementation issues
- 7. Simulation methodology and results
- 8. Conclusions and future works
- Acknowledgements
- appendix a. The pseudo-code of MFQ mechanism
- appendix b. The algorithm for counting unicast connections
- References
