Shortest paths in stochastic networks

Lloyd-Smith, Bill and Kist, Alexander A. and Shrestha, N. and Harris, Richard J. (2004) Shortest paths in stochastic networks. In: 12th IEEE International Conference on Networks (ICON 2004), 16-19 Nov 2004, Singapore.


This paper discusses the sensitivity of network flows to uncertain link state information for various routing protocols. We show that the choice of probability distribution for the link metrics for a given network can have markedly different effects on the probabilities of path selection. Exact results are obtained for these probabilities but their computation is NP-hard. We provide simulation results for three networks to illustrate the sensitivity of shortest paths to different link metric distributions. We provide results for mean path costs and the k-shortest path algorithm as a comparison.

Statistics for USQ ePrint 7267
Statistics for this ePrint Item
Item Type: Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)
Refereed: Yes
Item Status: Live Archive
Additional Information: NB FoR code 1006 assigned to align with ARC conference list.
Faculty / Department / School: Historic - Faculty of Engineering and Surveying - Department of Electrical, Electronic and Computer Engineering
Date Deposited: 02 Apr 2010 08:08
Last Modified: 24 Mar 2014 02:57
Uncontrolled Keywords: optimisation, probability, routing protocols, stochastic processes, k-shortest path algorithm, link state information, routing protocol, stochastic network
Fields of Research : 10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks
10 Technology > 1006 Computer Hardware > 100699 Computer Hardware not elsewhere classified
Socio-Economic Objective: B Economic Development > 89 Information and Communication Services > 8901 Communication Networks and Services > 890101 Fixed Line Data Networks and Services

Actions (login required)

View Item Archive Repository Staff Only