On-Demand Loop-Free Multipath Routing
Tech ID: 10188 / UC Case 2000-351-0
BACKGROUNDBusiness activities are increasingly being conducted via the Internet. These applications, such as financial services, securities exchanges, and emergency services will require reliable Internet connectivity. On-demand routing protocols provide this reliability by allowing for multiple links with separate gateway links to the Internet. However, current systems are subject to the counting-to-infinity problem, which can decrease network performance. For example, when a destination fails or becomes unreachable from a network component, a source trying to obtain a path to the destination finds that its flood-search for the destination fails. It is unable to determine the mode of failure and may continue to repeat a search for an unreachable destination, which causes congestion due to the repeated queries. As a result, current systems require external mechanisms to stop sources from sending unnecessary queries. However, difficulties in these systems arise in determining the length of hold-down times and how many times a source should persist in requesting a destination path.
DESCRIPTIONScientists at the University of California have developed a novel on-demand routing protocol for wired and wireless networks. This routing on-demand acyclic multipath (ROAM) system establishes and maintains routes using diffusing computations and provides loop-free paths by using only distances to destinations.
APPLICATIONSThis new invention has several applications in wired and wireless networks, such as:
- Mobile ad-hoc networks;
- Wireless networks with static nodes;
- Internet networks.
ADVANTAGESThe new UC technology provides the following benefits:
- Provides multiple loop-free paths without the need for complete path information, periodically refreshed sequence numbers, or time stamps;
- Eliminates repeated flood searches by solving the search-to-infinity problem;
- Limits the amount of bandwidth consumed by only maintaining routes to those destinations for which a router has data traffic.
REFER ALSO TO UC CASES 2000-303, 2000-311, 2000-314, 2000-349 THROUGH 356, 2000-360, 2000-380, 2000-383 THROUGH 385
|United States Of America||Issued Patent||7,035,227||04/25/2006||2000-351|
- Garcia-Luna-Aceves, Jose Joaquin(JJ
- Raju, Jyoti
ADDITIONAL TECHNOLOGIES BY THESE INVENTORS
- Scalable Integrated Services Architecture For Computer Networks
- Multicast Routing Protocol For Wireless And Mobile Computer Networks
- Receiver Initiated Channel Hopping (Rich)
- Bandwidth Efficient Source Tracing (Best) For Wireless Networks
- Differentiating Congestion Vs. Random Loss: A Method For Improving Tcp Performance Over Wireless Links
- Improving Tcp Congestion Control Over Internets With Heterogeneous Transmission Media
- Mpath: A Loop-Free Multipath Routing Algorithm Using Predecessor Information
- Receiver Initiated Multiple Access For Ad-Hoc Networks
- Group Coordination Protocol For Networked Multimedia Systems
- System And Method For Ad Hoc Network Access Employing The Distributed Election Of A Shared Transmission Schedule
- Tree-Based Ordered Multicasting
PEOPLE WHO VIEWED THIS ALSO VIEWED THESE TECHNOLOGIES BY OTHER INVENTORS
- Successful web-based smoking cessation program yields 20% abstinence rates at one year.
- TCP Westwood With Priorities For Quality Of Service Differentiation At The Transport Layer
- Waveform Prefiltering For Broadband Full-Duplex Radio
- Novel Algorithms and Software for Mapping Complex Networks
- Calibration Of Multiple Cameras for Tracking, Surveillance, and Video Conferencing