Multipath Routing

Article Preview

Abstract:

Multipath routing can be effectively used for maximum utilization of network resources. It gives the node a choice of next hops for the same destination. We present two tree based algorithms, which we call MSPT and MBFT that can help a node to find multiple next hops for a destination. Both of them are distributed algorithm, allowing the traffic to switch off the shortest path and fully exploiting the path diversity of the network. MSPT has lower cost, while MBFT has less hops between the source and destination, end system can select next hop according to the application requirements. The simulation show that our algorithms can find more selectable next hops and have good reliability and fast recovery performance. In the process of simulation, we discovery that MSPT and MBFT have more disjoint paths, therefore we provide an Algorithm 2 to combine the MSPT and MBFT, the performance of Algorithm 2 is obviously superior than independently employs

You might also be interested in these eBooks

Info:

Periodical:

Pages:

288-293

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J. Moy, Rfc 2328: Ospf version 2, Internet Society (ISOC), (1998).

Google Scholar

[2] G. Lee and J. Choi, A survey of multipath routing for traffic engineering, Information and Communications University, Korea, (2002).

Google Scholar

[3] G. Apostolopoulos, Using multiple topologies for ip-only protection against network failures: A routing performance perspective, ICSFORTH, Greece, Tech. Rep, (2006).

Google Scholar

[4] S. Gjessing, Implementation of two resilience mechanisms using multi topology routing and stub routers, " in Telecommunications, 2006. AICTICIW, 06. International Conference on Internet and Web Applications and Services/Advanced International Conference on. IEEE, 2006, p.29.

DOI: 10.1109/aict-iciw.2006.110

Google Scholar

[5] T. Przygienda, Z. Sagl, N. Shen et al., M-isis: Multi topology (mt) routing, in in IS-IS, IETF RFC 5120. Citeseer, (2008).

Google Scholar

[6] P. Psenak, S. Mirtorabi, A. Roy, L. Nguen, and P. Pillay-Esnault, Mtospf: Multi topology (mt) routing in ospf, IETF, RFC4915 (June 2007), (2005).

DOI: 10.17487/rfc4915

Google Scholar

[7] M. Motiwala, M. Elmore, N. Feamster, and S. Vempala, Path splicing, in SIGCOMM, 2008, p.27–38.

DOI: 10.1145/1402946.1402963

Google Scholar

[8] D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, Resilient overlay networks, ACM SIGCOMM Computer Communication Review, vol. 32, no. 1, p.66–66, (2002).

DOI: 10.1145/510726.510740

Google Scholar