A distributed adaptive routing algorithm
An algorithm for minimum delay routing in packet-switched networks which is capable of adapting to changes in network input traffic, the addition of new links and nodes, and the failure of existing links and nodes is developed and illustrated. The development is based on theoretical results of \textit{R. G. Gallage} [IEEE Trans. Commun. COM-25, 73-85 (1977; Zbl 0361.68086)] on distributed routing, Newton's method for convex minimization, and the formulation of two separate but cooperating distributed processes which constitute the algorithm itself. The first process, called the normal updating process, provides minimum delay routing given an initial loop-free routing assignment. The second, termed the disturbance adaptive process, generates a new loop-free routing for the first process in response to network changes. The algorithm is applied to a 10 node, 36 link network with 40 commodities, and response characteristics are presented and discussed.
- Enhanced-robustness Dijkstra algorithm for control of routing in the IP-networks
- An optimal distributed routing algorithm using dual decomposition techniques
- Demographically weighted traffic flow models for adaptive routing in packet-switched non-geostationary satellite meshed networks.
- Performance of a centrally directed hierarchical routing strategy with distance based and traffic based partitioning of network
- Optimal adaptive routing with efficient flapping prevention
- scientific article; zbMATH DE number 3887398 (Why is no real title available?)
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
- Updating routing tables after resource failure in a distributed computer network
- A coding-based approach to robust shortest-path routing
- scientific article; zbMATH DE number 4167813 (Why is no real title available?)
- scientific article; zbMATH DE number 3918061 (Why is no real title available?)
- Distributed asynchronous optimal routing in data networks
- Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
- Combined routing and flow control in computer communication networks: A two-level adaptive scheme
- An optimal adaptive routing algorithm
- Another adaptive distributed shortest path algorithm
- An optimal distributed routing algorithm
- A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks
- Extension of an Adaptive Distributed Routing Algorithm to Mixed Media Networks
- A minimum-hop routing algorithm based on distributed information
- Rate-adaptive multipath routing: distributed, centralized, and hybrid architectures
- scientific article; zbMATH DE number 220139 (Why is no real title available?)
- Adaptive routing with stale information
- Analysis of Link Reversal Routing Algorithms
- Computational Science - ICCS 2004
- Distributed routing of ads and bids through random walks in the IDOS system
- Adaptive routing with stale information
This page was built for publication: A distributed adaptive routing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095024)
