NDT 2012: Networked Digital Technologies pp 429-443 | Cite as
VND-CS: A Variable Neighborhood Descent Algorithm for Core Selection Problem in Multicast Routing Protocol
Conference paper
Abstract
Core Selection CS problem consists in choosing an optimal multicast router in the network as the root of the shared path multicast tree (SPT). The choice of this designated router (refer to as the “Rendezvous Point RP” in PIM-SM protocol and the “core” in CBT protocol) is the main problem concerning multicast tree construction; this choice influences multicast routing tree structure, and therefore influences performances of both multicast session and routing scheme. The determination of a best position of the Rendezvous Point is an NP complete problem: it needs to be solved with a heuristic algorithm. In this paper we propose a new Core Selection CS algorithm based on Variable Neighborhood Descent algorithm, based on a systematic neighborhood changing. VND-CS algorithm selects the core router by considering both cost and delay functions. Simulation results show that good performance is achieved in terms of multicast cost, end-to-end delay and tree construction delay.
Keywords
Core VND-CS PIM-SM SPT Multicast routingPreview
Unable to display preview. Download preview PDF.
References
- 1.Deering, S.E., Cheriton, D.R.: Multicast routing in datagram internetworks and extended lans. ACM Transactions on Computer Systems 8, 85–110 (1990)CrossRefGoogle Scholar
- 2.Zappala, D., Fabbri, A., Lo, V.M.: An evaluation of shared multicast trees with multiple cores. Telecommunication Systems 19(3-4), 461–479 (2002)CrossRefGoogle Scholar
- 3.Fenner, B., Handley, M., Holbrook, H., Kouvelas, I.: Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification (Revised). RFC 4601 (2006)Google Scholar
- 4.Ballardie, A.: Core based trees (CBT version 2) multicast routing – protocol specification. RFC 2189 (1997)Google Scholar
- 5.Ramalho, M.: Intra- and inter-domain multicast routing protocols: A survey and taxonomy. IEEE Communications Surveys and Tutorials 3(1), 2–25 (2000)CrossRefGoogle Scholar
- 6.Wall, D.W.: Mechanisms for Broadcast and Selective Broadcast. Ph.D. thesis, Stanford, CA, USA (1980)Google Scholar
- 7.Karaman, A., Hassanein, H.: Core-selection algorithms in multicast routing - comparative and complexity analysis. Comput. Commun. 29(8), 998–1014 (2006)CrossRefGoogle Scholar
- 8.Calvert, K.L., Zegura, E.W., Donahoo, M.J.: Core selection methods for multicast routing, pp. 638–642 (1995)Google Scholar
- 9.Mehlhorn, K.: A faster approximation algorithm for the steiner problem in graphs. Inf. Process. Lett. 27, 125–128 (1988)MathSciNetMATHCrossRefGoogle Scholar
- 10.Wei, L., Estrin, D.: The trade-offs of multicast trees and algorithms (1994)Google Scholar
- 11.Tagmouti, M., Gendreau, M., Potvin, J.Y.: A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs. Comput. Ind. Eng. 59 (2010)Google Scholar
- 12.Moy, J.: MOSPF: Analysis and Experience. RFC 1585 (Informational), Internet Engineering Task Force IETF (1994), http://www.ietf.org/rfc/rfc1585.txt
- 13.Farinacci, D., Li, T., Hanks, S., Meyer, D., Traina, P.: Protocol independent multicast - dense mode (pim-dm): Protocol specification (revised). RFC 3973 (2005)Google Scholar
- 14.Waitzman, D., Partridge, C., Deering, S.E.: RFC 1075: Distance vector multicast routing protocol (1988)Google Scholar
- 15.Shukla, S.B., Boyer, E.B., Klinker, J.E.: Multicast Tree Construction in Network Topologies with Asymmetric Link Loads. Ph.D. thesis (1994)Google Scholar
- 16.Bhaskar, N., Gall, A., Lingard, J., Venaas, S.: Bootstrap Router (BSR) Mechanism for Protocol Independent Multicast (PIM). RFC 5059 (Proposed Standard) (2008)Google Scholar
- 17.Carrabs, F., Laporte, G., Cordeau, J.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. Centre for Research on Transportation, Montréal, Québec (2005)Google Scholar
- 18.Sevkli, M., Aydin, M.E.: Variable neighbourhood search for job shop scheduling problems. JSW 1(2), 34–39 (2006)CrossRefGoogle Scholar
- 19.Burke, E., De Causmaecker, P., Petrovic, S., Berghe, G.V.: Variable neighborhood search for nurse rostering problems, pp. 153–172. Kluwer Academic Publishers, MA (2004)Google Scholar
- 20.Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449–467 (2001)MathSciNetMATHCrossRefGoogle Scholar
- 21.Shields, C., Garcia-Luna-Aceves, J.J.: The ordered core based tree protocol. In: Proceedings of the INFOCOM 1997. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, p. 884. IEEE Computer Society, Washington, DC (1997)Google Scholar
- 22.Hua, W., Xiangxu, M., Min, Z., Yanlong, L., et al.: Tabu search algorithm for RP selection in pim-sm multicast routing. Comput. Commun. 33(1), 35–42 (2010)CrossRefGoogle Scholar
- 23.Glover, F.: Tabu Search - Part II. INFORMS Journal on Computing 2(1), 4–32 (1990)MATHCrossRefGoogle Scholar
- 24.Kim, M., Bang, Y.-C., Choo, H.: On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 200–210. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 25.Hansen, P., Mladenovi, N.: Variable neighborhood search: Methods and recent applications. In: Proceedings of MIC 1999. pp. 275–280 (1999)Google Scholar
- 26.Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (2002), http://dx.doi.org/10.1109/49.12889 CrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2012