On the methodology for the evaluation of unconstrained multicast routing algorithms

Having in mind various implementations of methods for generating network topology [1], [2], [3], there is also a need for a wider mechanism determining receiving nodes in a network by geographical positioning, or one that would be related to link and node parameters. This will allow us to answer the question whether the way receiving nodes are distributed has any influence on the quality of multicast trees constructed by algorithms. The paper proposes methods that arrange group members in packet-switched networks. In the research we discuss the influence of the group arrangement method on the total cost of tree and the average cost of path in a tree for unconstrained routing algorithms for multicast connections. The methods for the receiving nodes distribution in the network have not been hitherto addressed and analyzed in literature.

[1]  John Crawford,et al.  Heuristics for ATM Multicast Routing , 1998 .

[2]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Piotr Zwierzykowski,et al.  Efficiency Analysis of Multicast Routing Algorithms in Large Networks , 2007, International Conference on Networking and Services (ICNS '07).

[4]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[5]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[7]  George C. Polyzos,et al.  Multicasting for multimedia applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[8]  S. Ramanathan,et al.  Multicast tree generation in networks with asymmetric links , 1996, TNET.

[9]  Piotr Zwierzykowski,et al.  Genetic routing algorithm for multicast connections in packet networks , 2008 .

[10]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[11]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[12]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[13]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[14]  Rocky K. C. Chang,et al.  A tree switching protocol for multicast state reduction , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  Anoop Ghanwani,et al.  Improved Neural Heuristics for Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[17]  David Thaler,et al.  Distributed Center-Location Algorithms , 1997, IEEE J. Sel. Areas Commun..

[18]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[19]  Duncan J. Watts,et al.  The Structure and Dynamics of Networks: (Princeton Studies in Complexity) , 2006 .

[20]  Anees Shaikh,et al.  Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..

[21]  P. Zwierzykowski,et al.  Performance of Fast Multicast Algorithms in Real Networks , 2007, EUROCON 2007 - The International Conference on "Computer as a Tool".

[22]  Mohamed F. Mokbel A Delay-Constrained Shortest Path Algorithm for Multicast Routing in Multimedia Applications , 2001 .

[23]  Sugih Jamin,et al.  Inet: Internet Topology Generator , 2000 .

[24]  L. Wei,et al.  The trade-offs of multicast trees and algorithms , 1994 .

[25]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..