On-Demand Loop-Free Multipath Routing
- 技術優勢
- 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
- 技術應用
- This new invention has several applications in wired and wireless networks, such as: Mobile ad-hoc networks Wireless networks with static nodes Internet networks
- 詳細技術說明
- Scientists 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. This on-demand protocol limits the amount of bandwidth consumed by maintaining routes to only those destinations for which a source has data traffic. ROAM provides loop-free paths using only distances to destinations. The invention also provides a solution to the “counting-to-infinity problem” within existing on-demand routing protocols. In ROAM, a search query in a connected component results in either the source requesting a route to the destination to obtain its answer, or all the routers determining that the destination is unreachable. Therefore, ROAM eliminates the need for application-level mechanisms to prevent excessive flooding or searching if destinations are not reachable. The present invention satisfies all routing needs, and overcomes the deficiencies of previously developed routing protocols.
- *Abstract
-
Business activities are increasingly conducted over the internet, and thus, activities such as financial services, securities exchanges, and emergency services will require reliable Internet connectivity. On-demand routing protocols provide this reliability by providing multiple gateway links to the internet. These networks are useful in all tactical and commercial scenarios in which there is no base-station infrastructure present. However, one issue with using multiple links is the manual configuration of internal routers, which requires considerable planning and monitoring. The current systems also decrease network performance due to the counting-to-infinity problem. Flood search is a way to distribute routing information updates quickly to every node in a large network. Under current on-demand routing protocols, when a destination fails, the flood-search for the destination also fails, but the source is unable to determine whether it should start another flood search. This counting-to-infinity problem also causes the network to run a routing protocol that is susceptible to a unique form of attack. Moreover, a malicious router can indefinitely direct a network for a destination that does not exist, thus causing network congestion. Therefore, a need exists for an on-demand routing protocol that provides for bandwidth efficient routing without unnecessary search flooding.
- *IP Issue Date
- Apr 25, 2006
- *Principal Investigation
-
Name: Jose Joaquin(JJ Garcia-Luna-Aceves
Department:
Name: Jyoti Raju
Department:
- 附加資料
- Patent Number: US7035227B2
Application Number: US2001975089A
Inventor: Garcia Luna Aceves, Jose J. | Raju, Jyoti
Priority Date: 10 Oct 2000
Priority Number: US7035227B2
Application Date: 9 Oct 2001
Publication Date: 25 Apr 2006
IPC Current: H04L001228 | H04L001256
US Class: 370254 | 370351
Assignee Applicant: The Regents of the University of California
Title: On-demand loop-free multipath routing (ROAM)
Usefulness: On-demand loop-free multipath routing (ROAM)
Summary: For routing data packets using routing on-demand acyclic multi-path (ROAM) protocol in wired and wireless networks.
Novelty: Data packet routing method using routing on-demand acyclic multi-path protocol in wired and wireless data network, involves maintaining created routing table entry in router, based on reception of data packet in router
- 主要類別
- 信息和通信技術/電信
- 細分類別
- 電信
- 申請號碼
- 7035227
- 其他
-
Additional Technologies by these Inventors
- Scalable Integrated Services Architecture for Computer Networks
- Scalable 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 Networks with Heterogeneous Transmission Media
- Mpath: A Loop-Free Multipath Routing Algorithm
- 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 in Computer Networks
- HIDRA: Method for Hiding Mobility, Multiplexing, and Multi-Homing from Internet Applications
Tech ID/UC Case
10188/2000-351-0
Related Cases
2000-351-0
- 國家/地區
- 美國
