A new heuristic algorithm for multicast connections in packet networks

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

Abstrakty

EN

There have been many heuristic algorithms determining multicast connection trees proposed over the past few years. However, the proposed methods are only approximations of the most favourable solutions and thus, a necessity of finding a better and more suitable algorithm is still topical and up-to-date. The present article aims at presenting the attempts of finding a constrain algorithm that would be more effective than those presented in relevant literature so far.

Słowa kluczowe

EN

multicast; algorithm; packet networks; heuristics

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

Twórcy

autor

Zwierzykowski P.

autor

Piechowiak M.

autor

Żódź A.

• Poznan University of Technology

Bibliografia

• [1]Carlos A. S. Oliveira, Panos M. Pardalos: A survey of combinatorial optimization bproblems in multicast routing, Computers&Operations Research, 32:1953-1981, 2005.
• [2]Wang Z., CrowcroftJ.: Quality-of-service routing for supporting multimedia applications, Journal on Selected Area in Communications, 14(7): 1228-1234, 1996.
• [3]Juttner A., Szviatovszki B., Mecs I., Rajko Z.: Lagrange Relaxation Based Method for the QoS Routing Problem, INFOCOM, 2001.
• [4]Widyono R.: The design and evaluation of routing algorithms for realtime channels, Technical Report TR-94-024, University of California at Berkely, 1994.
• [5]Karp R.: Reducibility among combinatorial problems, Complexity of Computer Computations, pp. 85-104, 1972.
• [6]Kou L., Markowsky G., Berman L.: A fast algorithm for Steiner trees, Acta Informatica, no. 15, pp. 141-145, 1981.
• [7]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, 1998.
• [8]Zhu Q., Parsa M., Garcia-Luna-Aceves J.J.: A source-based algorithm for delayconstrained minimum-cost multicasting, 14th Annual Joint Conference of the IEEE Computer and Communication Societies (vol. 1), 1995.
• [9]Krunz M., Zhang B., Chen C.: A fast delay-constrained multicast routing algorithm, ICC, Helsinki, Finland, 2001.
• [10]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.
• [11]Sun Q., Langendoerfer H.: Efficient multicast routing for delay-sensitive applications, 2nd Workshop Protocols Multimedia Systems (PROMS ‘95), pp. 452-458, 1995.
• [12]Waxmann B.: Routing of multipoint connections, Journal on Selected Area in Communications, 6:1617-1622, 1988.
• [13]Barabasi A.L., Albert R.: Emergence of scaling in random networks, Science , pp. 509-512,1999.
• [14]Medina A., Lakhin A., MattaL, ByersJ.: BRITE: An Approach to Universal Topology Generation, IEEE/ACM MASCOTS, s. 346-356, 2001.
• [15]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.
• [16]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.
• [17]ŻodźA.: Heuristic algorithms for the multicast routing, Poznań University of Technology, Master’s Thesis, Institute of Electronics and Telecommunications, 2006.