Abstract
Multicast routing systems have the objective of simultaneously transferring data to multiple destination nodes while using a single “push” operation. This leads to cost savings associated with reduced bandwidth utilization, which results from a decrease in data duplication across network links. An important problem on multicast networks, known as the delay constrained multicast routing problem (DCMRP), asks for the determination of an optimal route for packet transfers between members of a multicast group. Several heuristics have been proposed in the last few years to solve the DCMRP, which is of great interest for telecommunication engineers. In this paper we propose a novel, hybrid metaheuristic approach for the DCMRP, where a greedy randomized adaptive search procedure is used along with variable neighborhood search algorithm to find near optimal solutions. Computational experiments show that the proposed technique provides superior solution quality, while it is also efficient in terms of the use of computational resources.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29, 393–430 (2003)
Ballardie, A., Francis, P., Crowcroft, J.: Core-based trees (CBT) – an architecture for scalable inter-domain multicast routing. Comput. Comm. Rev. 23(4), 85–95 (1993)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109–133 (1995)
Festa, P., Resende, M.G.C.: An annotated bibliography of grasp, part ii: Applications. Int. Trans. Oper. Res. 16, 131–172 (2009)
Ganjam, A., Zhang, H.: Internet multicast video delivery. Proc. IEEE 93(1), 159–170 (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco (1979)
Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16, 1–29 (1968)
Gomes, F.C., Pardalos, P.M., Oliveira, C.A.S., Resende, M.G.C.: Reactive GRASP with path relinking for channel assignment in mobile phone networks. In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 60–67. ACM Press, New York (2001)
Hong, S., Lee, H., Park, B.H.: An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership. In: Proceedings of IEEE INFOCOM’98, pp. 1433–1440 (1998)
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Optimal multicast routing with quality of service constraints. J. Network Syst. Manag. 4(2), 107–131 (1996)
Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res. 32(8), 1953–1981 (2005)
Oliveira, C.A.S., Pardalos, P.M.: Mathematical Aspects of Network Routing Optimization. Springer, New York (2010)
Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C.: GRASP with path-relinking for the QAP. In: 5th Metaheuristics International Conference, pp. 57.1–57.6, Kyoto, Japan, August (2003)
Pardalos, P.M., Du, D.-Z., Lu, B., Ngo, H.: Steiner tree problems. In: Floudas, C.A., Pardalos, P.M. (eds.), Encyclopedia of Optimization, vol. 5, pp. 277–290. Kluwer Academic, Dordrecht (2001)
Pardalos, P.M., Khoury, B.: A heuristic for the steiner problem on graphs. Comput. Optim. Appl. 6, 5–14 (1996)
Resende, M.G.C., Ribeiro, C.C.: A GRASP with path-relinking for private virtual circuit routing. Networks 41, 104–114 (2003)
Salama, H., Reeves, D., Viniotis, Y.: A distributed algorithm for delay-constrained unicast routing. In: Proc. IEEE INFOCOM’97, Kobe, Japan (1997)
Sriram, R., Manimaran, G., Siva Ram Murthy, C.: A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Trans. Network. 7(4), 514–529 (1999)
Yang, D.-N., Liao, W.J.: On bandwidth-efficient overlay multicast. IEEE Trans. Parallel Distr. Syst. 18(11), 1503–1515 (2007)
Yang, Y., Wang, J., Yang, M.: A service-centric multicast architecture and routing protocol. IEEE Trans. Parallel Distr. Syst. 19(1), 35–51 (2008)
Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for delay-constrained minimum-cost multicasting. In: Proc. IEEE INFOCOM95, pp. 377–385 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Oliveira, C.A.S., Pardalos, P.M. (2014). A Hybrid Metaheuristic for Routing on Multicast Networks. In: Batsyn, M., Kalyagin, V., Pardalos, P. (eds) Models, Algorithms and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics, vol 104. Springer, Cham. https://doi.org/10.1007/978-3-319-09758-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-09758-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09757-2
Online ISBN: 978-3-319-09758-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)