JOURNAL ARTICLE
Dynamic models of shortest path routing algorithms for communication networks with multiple destinations
Abstract
This paper provides analysis and computational results relating to the dynamic behavior of shortest path routing algorithms for store and forward communication networks. A companion paper [1] focuses on networks with a single destination. The present work considers networks with multiple destinations.
Keywords:
Computer science Shortest path problem K shortest path routing Equal-cost multi-path routing Routing (electronic design automation) Private Network-to-Network Interface Adaptive routing Geographic routing Link-state routing protocol Path (computing) Routing algorithm Static routing Constrained Shortest Path First Distributed computing Computer network Algorithm Theoretical computer science Routing protocol Graph
Metrics
19
Cited By
1.44
FWCI (Field Weighted Citation Impact)
0
Refs
0.82
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Network Traffic and Congestion Control
Physical Sciences → Computer Science → Computer Networks and Communications
Advanced Optical Network Technologies
Physical Sciences → Engineering → Electrical and Electronic Engineering
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Dynamic behavior of shortest path routing algorithms for communication networks
Journal: IEEE Transactions on Automatic Control Year: 1982 Vol: 27 (1)Pages: 60-74
BOOK-CHAPTER
Shortest Path Routing Algorithms in Multihop Networks
IGI Global eBooks Year: 2009 Pages: 3452-3456
JOURNAL ARTICLE
Dynamic shortest path in stochastic dynamic networks: Ship routing problem
Journal: European Journal of Operational Research Year: 2002 Vol: 144 (1)Pages: 138-156