Dynamic Routing Algorithm Based on HIP Multicast Model

Article Preview

Abstract:

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 424-425)

Pages:

607-611

Citation:

Online since:

January 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Xue-yong Zhu. A secure multicast model using the host identity protocol, IEEE Press, pp.2979-2983 (2004).

Google Scholar

[2] Dijkstra E. Two problems in connection with graphs, Numerische Mathematik, vol. 1, pp.269-271 (2006).

Google Scholar

[3] Cormen T. H., Leiserson C. E. and Rivest R. L.: Introduction to algorithms, 2nd, Cambridge: MIT Press, pp.200-260 (2001).

Google Scholar

[4] Zheng Wang and Crowcroft J.: Quality of service routing for supporting multimedia applications, IEEE Journal Selected Areas in Communications, vol. 14, pp.1228-1234 (2006).

DOI: 10.1109/49.536364

Google Scholar

[5] Fu Xiang, Liu Jun-zhou and Wang Jie-yi: QoS routing based on genetic algorithm, Computer Communications, vol. 22, pp.1392-1399 (2000).

Google Scholar

[6] Doar M. and Leslie .: How bad is naïve multicast routing, Proceedings of the 10th Annual Joint Conference of IEEE Computer and Communications Societies. San Francisco: IEEE, pp.7-23 (2003).

DOI: 10.1109/infcom.1993.253246

Google Scholar

[7] Waxman B. M. Routing of multiple connections, IEEE Journal on Selected Areas in Communications, vol. 6, pp.1617-1622 (2002).

Google Scholar

[8] Klara N. : An overview of quality of service routing for next generation high-speed networks: problems and solutions, IEEE Network, vol. 12, pp.64-79 (2003).

DOI: 10.1109/65.752646

Google Scholar

[9] Cho J. and Breen J.: analysis of the performance of dynamic multicast routing algorithms, Computer Communications, vol. 22, pp.667-674 (2005).

DOI: 10.1016/s0140-3664(99)00009-2

Google Scholar

[10] Parekh A. K. and Gallagher R. G.: A generalized processor sharing approach to flow control in integrated services networks: the single node case, IEEE/ACM Transactions on Networking, vol. 1, pp.344-357 (2003).

DOI: 10.1109/90.234856

Google Scholar

[11] Hu Zhang: Service disciplines for guaranteed performance service in packet-switching networks, Proceedings of the IEEE, pp.1374-1396 (2006).

DOI: 10.1109/5.469298

Google Scholar