Event driven topology broadcast without sequence numbers

Spinelli, John; Gallager, Robert G.

doi:10.1109/26.24597

“…In this respect, it is similar to other link-state algorithms (e.g., OSPF [20], SPTA [25], LVA [10], ALP [12]). …”

Section: Computingsupporting

confidence: 52%

A Practical Framework for Minimum-Delay Routing in Computer Networks

Vutukury¹,

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

“…The partial-topology dissemination algorithm (PDA) propagates enough link-state information in the network, so that each router has sufficient link-state information to compute shortest paths to all destinations. In this respect, it is similar to other link-state algorithms (e.g., OSPF [20], SPTA [25], LVA [10], ALP [12]). PDA combines the best features of LVA, ALP and SPTA.…”

Section: Computing D I Jmentioning

confidence: 56%

A Simple Approximation to Minimum-Delay Routing

Vutukury¹,

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, minimumdelay 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 introduce 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 are comparable to those obtained using the Gallager's minimum-delay routing. Also, we show that our framework renders far smaller delays and makes better use of resources than traditional single-path routing.

show abstract

“…When there is fine granularity in link costs metric, perhaps for accuracy, there is less likelihood that multiple paths with equal distance exist between each source-destination pair, which means the full connectivity of the network is still not used for load-balancing. Also, OSPF and other algorithms based on topology-broadcast (e.g., [4,5]) incur too much communication overhead, which forces the network administrators to partition the network into areas connected by a backbone. This makes OSPF complex in terms of router configuration required.…”

Section: Multipath Routing and Quality Of Servicementioning

confidence: 99%

Protocols for Secure Survivable Active Internetworking

Aceves¹

2002

0

View full text Add to dashboard Cite

Public reporting burden for this 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 this 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

show abstract

Event driven topology broadcast without sequence numbers

Cited by 41 publications

References 12 publications

A Practical Framework for Minimum-Delay Routing in Computer Networks

A Practical Framework for Minimum-Delay Routing in Computer Networks

A Simple Approximation to Minimum-Delay Routing

Protocols for Secure Survivable Active Internetworking

Contact Info

Product

Resources

About