Abstract
Knowing the QoS requirement for each link involved in a multicast connection, such that overall QoS requirement is satisfied, would greatly assist both QoS-based multicast routing and resource reservation processes. In the case of delay, the question of what delay requirements should be imposed on each link of a source-based multicast tree, such that the overall source-to-destination delay and inter-destination delay variation requirements are satisfied at minimum total tree cost, is the focal point of this paper. A major contribution of this paper is the development of a number of heuristic algorithms for (near-)optimal allocation of delay requirements using Genetic Algorithms (GAs). Initial tests, with multicast trees of different sizes (10- and 30-node trees), configurations (in terms of number of destinations and destination distribution), and overall delay requirements, show the ability of the algorithms in providing good solutions within a reasonable amount of time.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35673-0_28
Chapter PDF
Similar content being viewed by others
Keywords
References
Akyildiz, I. F. and Yen, W. (1996). Multimedia group synchronization protocols for integrated services networks. IEEE JSAC, 14 (1): 162–173.
Ergun, F., Sinha, R., and Zhang, L. (2000). Qos routing with performance-dependent costs. In INFOCOM ‘2000, pages 137–146.
Forster, M. et al. (1999). Gtl - graph template library. http://www.infosun.fmi.uni-passau.de/GTL/.
Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.
Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
Ibaraki, T. and Katoh, N. (1998). Resource Allocation Problems. The MIT Press.
Kompella, V. N., Pasquale, J. C., and Polyzos, G. C. (1993). Multicast routing for multimedia communication. IEEE/ACM Transaction on Networking, 1: 286–292.
Lorenz, D. H. and Orda, A. (1998). Optimal partition of qos requirements on unicast paths and multicast trees. Research Report EE 1167, Department of Electrical Engineering, Technion, Haifa, Israel, http://ftp.technion.ac.il/pub/suported/ee/ Network/lor.mopq98.ps.
Lorenz, D. H. and Orda, A. (2002). Optimal partition of qos requirements on unicast paths and multicast trees. IEEE/A CM Transactions on Networking, 10: 102–114.
Lorenz, D. H., Orda, A., Raz, D., and Shavitt, Y. (2000). Efficient qos partition and routing of unicast and multicast. In IWQoS ‘2000, pages 75–83.
QNLB (2001). Brite: Boston university representative internet topology generator. http://www.cs.bu.edu/brite/.
Rouskas, G. N. and Baldin, I. (1997). Multicast routing with end-to-end delay and delay variation constraints. IEEE JSAC, 15: 346–347.
Salama, H. F., Reeves, D. S., and Viniotis, Y. (1997). Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE JSAC, 15: 332–345.
Wall, M. (1999). Galib. http://lancet.mit.edu/ga/.
Wang, B. and Hou, J. (2000). Qos-based multicast routing for distributing layered video to heterogeneous receivers in rate-based networks. In IEEE INFOCOM’ 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Tran, H.T., Harris, R.J. (2003). Near-Optimal Allocation of Delay Requirements on Multicast Trees. In: McDonald, C. (eds) Converged Networking. INTERWORKING 2002. IFIP — The International Federation for Information Processing, vol 119. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35673-0_26
Download citation
DOI: https://doi.org/10.1007/978-0-387-35673-0_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4870-3
Online ISBN: 978-0-387-35673-0
eBook Packages: Springer Book Archive