A Responsive Distributed Routing Algorithm for Computer Networks

Jaffe, Jeffrey M.; Moss, Franklin H.

doi:10.1109/tcom.1982.1095632

Cited by 150 publications

(73 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We have (14) where is increasing in and satisfies the recursion Remark: In Example III.C, we have which implies the unboundedness of the right-hand side of (14). This is consistent with the result provided in Section III-C, establishing that .…”

Section: Lemmasupporting

confidence: 85%

“…The authors in [4] and [5] provide various algorithms in which each node uses its local information in order to compute a local priority list of its neighbors. To a great extent these algorithms are, in their information structure, similar to the distributed Bellman-Ford algorithm (see [13] and [14]), and can be thought of the sample-path dependent extensions of the distributed Bellman-Ford algorithm. In all the distributed algorithms presented in [4] and [5], the priority list for each node is determined based on the node's local information.…”

Section: Distributed Computation Of the Optimal Policymentioning

confidence: 99%

See 1 more Smart Citation

Sensitivity analysis for an optimal routing policy in an ad hoc wireless network

Javidi

Teneketzis

Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367)

View full text Add to dashboard Cite

Abstract-We examine the sensitivity of optimal routing policies in ad hoc wireless networks with respect to estimation errors in channel quality. We consider an ad hoc wireless network where the wireless links from each node to its neighbors are modeled by a probability distribution describing the local broadcast nature of wireless transmissions. These probability distributions are estimated in real-time. We investigate the impact of estimation errors on the performance of a set of proposed routing policies.fo

show abstract

Section: Lemmasupporting

confidence: 85%

Section: Distributed Computation Of the Optimal Policymentioning

confidence: 99%

Sensitivity analysis for an optimal routing policy in an ad hoc wireless network

Javidi

Teneketzis

Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367)

View full text Add to dashboard Cite

show abstract

“…For brevity, we assume an undirected communication tree. As shown in [3], such a tree can be efficiently constructed and maintained using variations of Bellman-Ford algorithms [10]. Finally, we assume that failure is fail-stop and that the neighbors of a processor that is disconnected or reconnected for any reason are reported.…”

Section: Notations Assumptions and Problem Definitionmentioning

confidence: 99%

A Local Facility Location Algorithm for Sensor Networks

Krivitski

Schuster

Wolff

2005

Distributed Computing in Sensor Systems

View full text Add to dashboard Cite

Abstract. In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (possibly) very large number of clients. We show that a variation of the problem can be solved using a local algorithm. Local algorithms are extremely useful in a sensor network scenario. This is because they allow the communication range of the sensor to be restricted to the minimum, they can operate in routerless networks, and they allow complex problems to be solved on the basis of very little information, gathered from nearby sensors. The local facility location algorithm we describe is entirely asynchronous, seamlessly supports failures and changes in the data during calculation, poses modest memory and computational requirements, and can provide an anytime solution which is guaranteed to converge to the exact same one that would be computed by a centralized algorithm given the entire data.

show abstract

“…The occurrence of loops in routing algorithms is a fairly well studied area [7], [8], [9], [10], [11] that was active already in the 80's. However, the main focus has been on making distance-vector algorithms loop-free.…”

Section: Introductionmentioning

confidence: 99%

Loop-Free Link-State Routing

Fransson

Carr-Motyckova

2007

2007 16th International Conference on Computer Communications and Networks

View full text Add to dashboard Cite

Improving the robustness of today's intra-domain link-state networks is of increasing importance. This is because it is becoming commonplace for such networks to carry telephony, on-demand video and other kinds of real-time traffic. Since user requirements on real-time traffic are exacting, it is essential that the network is able to respond rapidly to network errors.A way of reaching fast reaction times in response to network errors is to precompute fail-over paths that can be utilized immediately when an error is detected. The fail-over path is thereafter in use until the network has converged, handling traffic that would otherwise have been lost due to the error. During convergence (when new paths are calculated) there is a caveat that needs to be avoided -the formation of temporary loops. Temporary loops can form naturally during convergence in link-state networks and can unfortunately prevent traffic from reaching a fail-over path. Traffic can therefore be lost even though a fail-over path is in place.We present an algorithm that can be used in conjunction with link-state routing, to ensure that temporary loops do not form during convergence. The algorithm improves on previous loop-free algorithms for link-state routing by reducing the number of state transitions necessary before a router can update its routing table to a new, guaranteed to exist, path for a wide variety of topological configurations. Because all new paths are guaranteed to exist at the time of a routing table update, the algorithm is also more robust against loss of data than the recently proposed loop-free algorithm by Francoise and Bonaventure.

show abstract

A Responsive Distributed Routing Algorithm for Computer Networks

Cited by 150 publications

References 5 publications

Sensitivity analysis for an optimal routing policy in an ad hoc wireless network

Sensitivity analysis for an optimal routing policy in an ad hoc wireless network

A Local Facility Location Algorithm for Sensor Networks

Loop-Free Link-State Routing

Contact Info

Product

Resources

About