Network Resource Optimization for Quality of Service in Multimedia Multicasting

Authors

  • Vahe Aghazarian Islamic Azad University
  • Hossein Pedram Amir Kabir University of Technology

Abstract

Multicast is a bandwidth efficient mechanism for delivering the same data to multiple receivers simultaneously. In this paper, a well-organized method to build source specific multicast trees is proposed. This algorithm aims at reaching a high traffic balance in the network in order to avoid bandwidth bottlenecks and consequent network partitions, one of the main causes for low network performance. To do so, it computes multicast trees by dynamically selecting the least loaded available paths, obtaining an optimal distribution of network resources. Strictly integrated with the DiffServ Quality of Service (QoS) approach, the proposed multirate native multicast algorithm maps the QoS service requested by receivers into the proper DiffServ class, so as to respect the expected QoS requirements. The results are a better leverage of the network bandwidth resources, an improved QoS perceived by multicast group members, and time and resource saving due to its low computational complexity, as shown through general C++ based simulation.

References

L. H. Sahasrabuddhe and B. Mukherjee, “Multicast Routing Algorithms and Protocols: A Tutorial,” IEEE Network: The Magazine of Global Internetworking, vol. 14, issue 1, 2000, pp. 90-102.

J. L. Gross and J. Yellen, “Handbook of Graph Theory,” CRC Press, Discrete Mathematics and Its Applications, Volume: 25, Series Editor K. H. Rosen, 2003.

R. T. Wong, “A dual ascent approach for Steiner tree problems on a directed graph,” Mathematical Programming, 28:271-287, 1984.

H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math, Japonica 6, (1980) 573-577.

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, “Network Flows: Theory, Algorithms, and Applications, “Prentice Hall, February 1993.

Bhattacharyya, Kurose, and Towsley, “Efficient Multicast Flow Control using Multiple Multicast Groups,” CMPSCI Technical Report TR 97-15, March 10 1997.

Y. Birk and D. Crupnicoff, “A Multicast Transmission Schedule for Scalable Multi-RateDistribution of Bulk Data Using Non-Scalable Erasure-Correcting Codes,” IEEE Infocom 2003.

K. Nichols, S. Blake, F. Baker, and D. Black. “Definition of the Differentiated Services Field (DAS Field) in the Ipv4 and Ipv6 Headers,” RFC 2474, December 1998.

S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, “An Architecture for Differentiated Services,” RFC 2475, December 1998.

C. Cheng, R. Riley, S. P. R. Kumar, and J. J. Garcia-Luna-Aceves, “A loop-free Bellman- Ford Routing Protocol without bouncing effect”, in ACM Sigcomm ’89, pages 224-237, September 1989.

B. M. Waxman, “Routing of multipoint connections,” IEEE J. Selected Areas Commun. 6(9) (1998) 1617-1622.

K. Calvert, M. Doar, and E. Zegora, “Modeling Internet Topology,” IEEE Communications Magazine, June 1997.

A. Claus and N. Maculan. “Une Nouvelle Formulation du Probleme de Steiner sur un graphe,” Technical Report 280. Centre de Recerche sur les Transports, Universite de Montreal, 1983.

R. Fourer, D. M. Gay, and B. W. Kernighan. “AMPL: A Modeling Language for Mathematical Programming,” Duxbury Press / Brooks / Cole Publishing Company, 2002.

www.cplex.com

Downloads

Published

2021-12-10

How to Cite

Aghazarian, V. ., & Pedram, H. . (2021). Network Resource Optimization for Quality of Service in Multimedia Multicasting. Mathematical Problems of Computer Science, 28, 65–74. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/503