Abstract | ||
---|---|---|
Multipath routing is thought of as a promising direction of the current routing system as it can improve the network performance in terms of reliability and throughput. However, there are some challenging problems to solve towards Internet-wide multipath routing. One of them is the dramatically increasing control message overhead caused by network dynamics. More message overhead will consume more computing resources and more storage. Meanwhile, more message overhead will lead to slower convergence process for routing protocols due to longer processing time. In this paper, we present MORT to solve the above problem. MORT is based on a technique called ¿information hiding¿. The ¿information hiding¿ technique allows routers in network to hide some routing information such as link failures and link cost changes to other routers without introducing any serious bad effect to the routing protocols. Multipath routing protocols embedded with MORT will have fewer routing message overhead and shorter routing convergence time when facing network events such as link failures and link recoveries. In the simulations, we apply MORT to a newly presented multipath protocol to show that MORT can reduce message overhead significantly as well as shortening the routing convergence time. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/MSN.2009.85 | MSN |
Keywords | Field | DocType |
multipath routing,routing protocol,information hiding,network throughput,link cost changes,message overhead,routing efficiency,network performance,network reliability,fewer routing message overhead,link recovery,telecommunication network reliability,link failure,fault tolerance,data encapsulation,computer network performance evaluation,internet,mort,routing information,routing protocols,internet-wide multipath routing,improve routing efficiency,multipath routing protocol,network dynamics,current routing system,fault-tolerant multipath routing,routing convergence time,fault tolerant | Link-state routing protocol,Multipath routing,Dynamic Source Routing,Static routing,Policy-based routing,Computer science,Computer network,Routing domain,Routing protocol,Distributed computing,Zone Routing Protocol | Conference |
ISBN | Citations | PageRank |
978-1-4244-5468-6 | 0 | 0.34 |
References | Authors | |
7 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bin Dai | 1 | 0 | 0.68 |
Huabiao Lu | 2 | 13 | 2.70 |
Zhi-gang Sun | 3 | 41 | 14.15 |
Ziming Song | 4 | 7 | 1.93 |
Yanpeng Ma | 5 | 39 | 7.38 |
Su, Jinshu | 6 | 750 | 96.41 |