Data networks
Subtle design issues in the implementation of distributed, dynamic routing algorithms
Computer Networks and ISDN Systems
Routing management in very large-scale networks
Future Generation Computer Systems
The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Computer Networks and ISDN Systems
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Dynamics of distributed shortest-path routing algorithms
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Scalable inter-domain routing architecture
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A protocol for route establishment and packet forwarding across multidomain internets
IEEE/ACM Transactions on Networking (TON)
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Generalized Scheme for Topology-Update in Dynamic Networks
Proceedings of the 2nd International Workshop on Distributed Algorithms
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Increasing Reliability in Cable-Free Radio LANs Low Level Forwarding in HIPERLAN
Wireless Personal Communications: An International Journal
A scalable virtual circuit routing scheme for ATM networks
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Lazy flooding: a new technique for information dissemination in distributed network systems
IEEE/ACM Transactions on Networking (TON)
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Achieving convergence-free routing using failure-carrying packets
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Xl: an efficient network routing algorithm
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Unicast QoS routing in overlay networks
Network performance engineering
A routing algorithm for dynamic multicast trees with end-to-end path length control
Computer Communications
A game-theoretic approach to stable routing in max-min fair networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
A new family of routing algorithms for the distributed maintenance of routing information in large networks and internets is introduced. This family is called link vector algorithms (LVA), and is based on the selective diffusion of link-state information based on the distributed computation of preferred paths, rather than on the flooding of complete link-state information based on the distributed computation of preferred paths, rather than on the flooding of complete link-state information to all routers. According to LVA, each router maintains a subset of the topology that corresponds to the links used by its neighbor routers in their preferred paths to known destinations. Based on that subset of topology information, the router derives its own preferred paths and communicates the corresponding link-state information to its neighbors. An update message contains a vector of updates; each such update specifies a link and its parameters. LVAs can be used for different types of routing. The correctness of LVA is verified for arbitrary types of routing when correct and deterministic algorithms are used to select preferred paths at each router. LVA is shown to have smaller complexity than link-state and distance-vector algorithms, and to have better average performance than the ideal topology-broadcast algorithm and the distributed Bellman-Ford algorithm.