Efficiency analysis of multicast routing algorithms in large networks

• Autorzy: Piechowiak M. , Zwierzykowski P.
• Konferencja: Poznan Telecommunications Workshop / sympozjum [11; December 7-8, 2006; Poznan]
• Języki publikacji: EN

Abstrakty

EN

The paper presents the research results of multicast heuristic algorithms. The paper is an extension of previous publications presented in [1.2] that discussed small network structures reflecting the real Internet topology. The paper approaches basic methods of generating the Internet topology - Waxman method and Barabasi-Albert method. Performance study of multicast trees constructed by the algorithms is carried out and analysed.

Słowa kluczowe

EN

routing algorithms; Internet topology; multicast connections

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Poznan University of Technology Academic Journals. Electrical Engineering
• Rocznik: 2007
• Tom: No 54
• Strony: 173--180
• Opis fizyczny: Bibliogr. 20 poz.

Twórcy

autor

Piechowiak M.

autor

Zwierzykowski P.

• Poznan University of Technology

Bibliografia

• [1]Piechowiak M., Zwierzykowski P.: The Application of Network Generation Methods in the Study of Multicast Routing Algorithms, in Proceedings of 4th International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks, Ilkley, UK, pp. 24/1-24/8, September 2006.
• [2]Piechowiak M., Zwierzykowski P.: The Infuence of Network Topology on the Effciency of QoS Multicast Heuristic Algorithms, in Proceedings of 5th International Symposium: Communication Systems Networks and Digital Signal Processing, Patras, Greece, pp. 115-119, July 2006.
• [3]Karp R.: Reducibility among combinatorial problems, Complexity of Computer Computations, pp. 85-104, 1972.
• [4]Kou L., Markowsky G., Berman L.: A fast algorithm for Steiner trees, Acta Informática, no. 15, pp. 141-145, 1981.
• [5]Crawford J.S., Waters A.G.: Heuristics for ATM Multicast Routing, in Proceedings of 6th IFIP Workshop on Performance Modeling and Evaluation of ATM Networks, pp. 5/1-5/18, July 1998.
• [6]Sun Q., Langendoerfer H.: Effcient Multicast Routing for Delay-Sensitive Applications, 2-nd Workshop on Protocols for Multimedia Systems (PROMS'95), pp. 452-458, October 1995.
• [7]Dijkstra E.: A note on two problems in connexion with graphs, Numerische Mathematik, vol. 1, pp. 269-271, 1959.
• [8]Bellman R.: On a routing problem, Quarterly of Applied Mathematics, vol. 16, no.l, pp. 87-90, 1958.
• [9]Jin C., Jamin S.: Inet: Internet topology generator, University of Michigan at Ann Arbor, Technical Research Report CSETR-433-00, 2000.
• [10]Zegura E.W., Donahoo M.J., Calvert K.L.: A Quantitative Comparison of Graphbased Models for Internet Topology,. IEEE/ACM Transactions on Networking, 1997.
• [11]Mokbel M.F., El-Haweet W.A., El-Derini M.N.: A delay constrained shortest path algorithm for multicast routing in multimedia applications, in Proceedings of IEEE Middle East Workshop on Networking, IEEE Computer Society, 1999.
• [12]V. P. Kompella V.P., Pasquale J., Polyzos G.C.: Multicasting for Multimedia Applications, in Proceedings of INFOCOM, pp. 2078-2085, 1992.
• [13]Zhang B., Krunz M., Chen C.: A fast delay-constrained multicast routing algorithm, in Proceedings of IEEE ICC 2001, Helsinki, Finland, pp. 2676-2680, 2001.
• [14]Zhu Q., Parsa M., Garcia-Luna-Aceves J.J.: A source-based algorithm for delayconstrained minimum-cost multicasting, In Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (vol. 1), IEEE Computer Society, pp. 377-385, 1995.
• [15]Waxmann B.: Routing of multipoint connections, IEEE Journal on Selected Area in Communications, vol. 6, pp. 1617-1622, 1988.
• [16]Barabasi A.L., Albert R.: Emergence of scaling in random networks, Science, pp. 509-512, 1999.
• [17]Medina A., Lakhina A., Matta I., Byers J.: BRITE: An Approach to Universal Topology Generation, IEEE/ACM MASCOTS, pp. 346-356, 2001.
• [18]Watts D.J., Strogatz S.H.: Collective dynamics of 'smallworld' networks, Nature, vol. 12, no. 393, pp. 440-442, 1998.
• [19]Faloutsos M., Faloutsos P., Faloutsos C.: On Power-Law Relationships of the Internet Topology, ACM Computer Communication Review, Cambridge, MA, pp. 111-122, 1999.
• [20]Bu T., Towsley D.: On distinguishing between Internet power law topology generators, In Proceedings of INFOCOM, NY, pp. 638-647, 2002.