Journal ArticleDOI
An extended least-hop distributed routing algorithm
TLDR
A routing strategy called NELHNET has been developed for networks with multiprecedence traffic and operating under dynamic traffic and topological conditions, which permits the network to function stably under more heavily loaded conditions than do the Arpanet strategies.Abstract:
A routing strategy called NELHNET has been developed for networks with multiprecedence traffic and operating under dynamic traffic and topological conditions. An adaptive distributed algorithm that uses least-hop and least-hop-plus-1 routes in a table of routing vectors, as opposed to the usual table of routing scalars, is described. Current delays are passed backward and forward with the packets to allow development of expected delays to each node via all acceptable routes. The route then selected is the acceptable route with the least expected delay. For speedier recovery, a node returning to service receives the current network status from an adjoining node as soon as the link connecting them is operational. The resultant algorithms show far greater than the marginal improvements originally expected over Arpanet simulations. NELHENET strategies also permit the network to function stably under more heavily loaded conditions than do the Arpanet strategies. >read more
Citations
More filters
Patent
Congestion control for connectionless traffic in data networks via alternate routing
TL;DR: In this article, a congestion control scheme for connectionless networks relieves congestion by routing a portion of traffic on a congested primary path onto a predefined alternate path constructed such that loop-freedom is guaranteed.
Proceedings ArticleDOI
Routing high-bandwidth traffic in max-min fair share networks
TL;DR: This work identifies a link-cost or cost metric for "shortest-path" routing that performs uniformly better than the minimal-hop routing and shortest-widest path routing algorithms and proposes a novel prioritized multi-path routing algorithm in which low priority paths share the bandwidth left unused by higher priority paths.
Journal ArticleDOI
Crossover switch discovery for wireless ATM LANs
TL;DR: Five CX discovery schemes are proposed to compute and select the optimised new partial path such that both the set-up latency and network resource consumption associated with the handover are small, and are suitable for wireless ATM LANs employing either the centralised or distributed connection management approach with either distance-vector or link-state-like minimumhop routing schemes.
Proceedings ArticleDOI
Alternate path routing for multicast
TL;DR: This paper proposes a general and modular architecture that integrates alternate path routing with the network's multicast services, which enables individual multicast receivers to reroute a multicast tree according to their needs, subject to policy restrictions.
Proceedings ArticleDOI
Performance comparison of routing protocols using MaRS: distance-vector versus link-state
TL;DR: It is shown, using a recently developed network simulator, MaRS, that a newly proposed distance-vector algorithm (ExBF) performs as well as SPF, suggesting that distance- vector algorithms are appropriate for very large wide-area networks.
References
More filters
Journal ArticleDOI
The New Routing Algorithm for the ARPANET
TL;DR: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations.
Journal ArticleDOI
A Minimum Delay Routing Algorithm Using Distributed Computation
TL;DR: A new global convergence theorem for noncontinuous iteration algorithms is developed that converges, with successive updates of the routing tables, to the minimum average delay over all routing assignments.
Journal ArticleDOI
Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology
Eli Gafni,Dimitri P. Bertsekas +1 more
TL;DR: It is argued that flooding schemes have significant drawbacks for such networks, and a general class of distributed algorithms for establishing new loop-free routes to the station for any node left without a route due to changes in the network topology is proposed.
Journal ArticleDOI
Routing Techniques Used in Computer Communication Networks
M. Schwartz,T.E. Stern +1 more
TL;DR: An overview is provided in this paper of the routing procedures used in a number of operating networks, as well as in two commercial network architectures, which include the IBM SNA and the DEC DNA.
Journal ArticleDOI
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
TL;DR: The algorithms are based on Gallager's method and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing and utilize second derivatives of the objective function.