A path-finding algorithm for loop-free routing

Garcia-Luna-Aceves, J.J.; Murthy, Shree

doi:10.1109/90.554729

Cited by 78 publications

(32 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In case of proactive routing protocols, like Adaptive Distance Vector [4] or Path-Finding Algorithm [9], all routing information are preserved at the level of each network node. By contrast, reactive routing protocols, like Dynamic Source Routing (DSR) [14] or Ad-hoc On-demand Distance-Vector [16], calculate routes only when communication is needed and they maintain these routes as long as the connection is needed.…”

Section: Resource Allocation In Vwsnmentioning

confidence: 99%

OMNeT++ Models for Resource Allocation in Wireless Networks

Todinca

Pescaru

Viţălariu

2008

Proceedings of the First International ICST Conference on Simulation Tools and Techniques for Communications Networks and Syste

View full text Add to dashboard Cite

Nowadays Wireless Networks have an important impact in many activity domains. Due to the hardware and bandwidth limitations of these networks, resource allocation represents an important issue, being in the same time a very active research area. Considering the complexity of the wireless networks, analytical solutions are hard to be found. Hence, simulation becomes the most used methodology and OMNeT++ proves to be a very useful tool for investigation. This paper presents our work concerning the performance of different resource allocation techniques for EGPRS and Wireless Sensor Networks.

show abstract

Section: Resource Allocation In Vwsnmentioning

confidence: 99%

OMNeT++ Models for Resource Allocation in Wireless Networks

Todinca

Pescaru

Viţălariu

2008

Proceedings of the First International ICST Conference on Simulation Tools and Techniques for Communications Networks and Syste

View full text Add to dashboard Cite

show abstract

“…The problem of distributed tree construction has been widely studied from a theoretical perspective. However, most of this work is not designed for large-scale systems and computes spanning [1,9,20] or shortest path [14] trees based on precise information about the underlying network topology. Further in contrast to our approach, changes are not localized nor are temporary routing loops avoided.…”

Section: Related Workmentioning

confidence: 99%

Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks

Frey¹,

Murphy

2008

2008 Eighth International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

show abstract

“…Several algorithms have been proposed in the past to provide loop-free paths at every instant for the case of single-path routing (e.g., the Jaffe-Moss algorithm [15], DUAL [9], LPA [11], and the MerlinSegall algorithm [19]) and one algorithm, DASM, has been proposed for the case of multiple paths per destination [28]. All these algorithms are based on the exchange of vectors of distances, together with some form of coordination among routers spanning one or multiple hops.…”

Section: A New Framework For Minimum-delay Routingmentioning

confidence: 99%

A Practical Framework for Minimum-Delay Routing in Computer Networks

Vutukury¹,

Garcia-Luna-Aceves²

1999

View full text Add to dashboard Cite

The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, single-path routing exhibits oscillatory behavior and becomes unstable as traffic loads increase. On the other hand, minimum-delay routing approaches can minimize delays only when traffic is stationary or very slowly changing.We present a "near-optimal" routing framework that offers delays comparable to those of optimal routing and that is as flexible and responsive as single-path routing protocols proposed to date. First, an approximation to the Gallager's minimum-delay routing problem is derived, and then algorithms that implement the approximation scheme are presented and verified. We describe the first routing algorithm based on link-state information that provides multiple paths of unequal cost to each destination that are loop-free at every instant. We show through simulations that the delays obtained in our framework for minimum-delay routing are comparable to those obtained using Gallager's algorithm for minimum-delay routing. Also, we show that our framework renders far smaller delays and makes better use of resources than traditional single-path routing. Report Documentation PageForm Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.

show abstract

A path-finding algorithm for loop-free routing

Cited by 78 publications

References 14 publications

OMNeT++ Models for Resource Allocation in Wireless Networks

OMNeT++ Models for Resource Allocation in Wireless Networks

Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks

A Practical Framework for Minimum-Delay Routing in Computer Networks

Contact Info

Product

Resources

About