An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A distributed algorithm for delay-constrained unicast routing
IEEE/ACM Transactions on Networking (TON)
Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Transmission-efficient routing in wireless networks using link-state information
Mobile Networks and Applications
Crankback Prediction in Hierarchical ATM Networks
Journal of Network and Systems Management
Developing scalable protocols for three-metric QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distance-Vector QoS-Based Routing with Three Metrics
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Distributed Algorithm for Delay-Constrained Unicast Routing
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Analysis of Topology Aggregation techniques for QoS routing
ACM Computing Surveys (CSUR)
A hierarchical networking architecture based on new switching address
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Distributed multiple-path searching algorithm for fault detection
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Load balancing based on similarity multi-paths routing
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
The Journal of Supercomputing
| Hi-index | 0.07 |
We have present a new method for distributed routing in computer networks and internets using link-state information. Link vector algorithms (LVA) are introduced for the distributed maintenance of routing information in large networks and internets. According to an LVA, each router maintains a subset of the topology that corresponds to adjacent links and those 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. The LVA can be used for different types of routing. The correctness of the LVA is verified for arbitrary types of routing when correct and deterministic algorithms are used to select preferred paths at each router and each router is able to differentiate old updates from new. The LVA are shown to have better performance than the ideal link-state algorithm based on flooding and the distributed Bellman-Ford algorithm