A routing protocol for finding two node-disjoint paths in computer networks

Abstract

I n this paper, we presen,t a routing protocol f0rfi.ding two node-disjoint paths between each pair of nodes in a computer network. I n the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology such as an adjacent n,ode on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load.The concept of spanning tree-based kernel construction is introduced t o synchronize procedures under the distributed control of the protocol. The routing scheme based on the protocol possesses the en,hanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Furthermore, even if topology changes occur iuhich damage the obtained disjoint paths, the paths themselves can be updated eficiently.

Congestion-triggered Multipath Routing based on Shortest Path Information

“…Table II shows the top 10 link utilizations, as well as the average link utilizations over all links. As can be seen in Table II, the highest link utilization is 65.1% on link (5,2) under PV routing, 66.52% on link (7,8) under ECMP, and 65.1% on link (5,2) under CTMP. In this scenario, there are no packet drops on any of the links.…”

“…A number of algorithms have been proposed in the literature to find disjoint paths between source and destination nodes in a network [8]- [12]. The shortest pairs of disjoint paths problem (SPDP) can be defined as follows: Given a destination node d and for each node s = d, find a pair of disjoint paths from s to d of minimum total length.…”

“…In multipath routing, packets belonging to a source-destination pair may be transmitted over multiple paths. Some of the potential benefits of multipath routing include load balancing [4], higher network throughput [4], [5], reduction of routing oscillation, the alleviation of congestion [6], [7], and improved packet delivery reliability [8].…”

Finding Minimum-Cost Paths with Minimum Sharability

“…Potential benefits of multiple paths include improved reliability (e.g. [7], [12], [15], [17], [18], [19], [20], [21], [22]), load balancing (e.g. [6], [16]), higher network throughput (e.g.…”

Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network

“…Finding multiple paths between a source and a destination has been proposed. Potential benefits of multiple paths include improved reliability (e.g., [8], [13], [17], [18], and [20]- [24]), load balancing (e.g., [7] and [16]), higher network throughput (e.g., [9] and [16]), and alleviation of congestion (e.g., [2] and [8]). It is desirable that multiple paths are link-and/or node-disjoint.…”