Abstract
In this paper, we formalize the problem of finding a routing path for the streaming of continuous media (e.g., video or audio files) that maximizes the probability that the streaming is successful, over a network with nonuniform edge delays and capacities, and arbitrary timedependent edge reliabilities. We call such a problem the most sustainable path (MSP) problem. We address the MSP problem in two network routing models: the wormhole and the circuit-switching routing models. We present fully-distributed polynomial-time algorithms for the streaming of constant-size data in the wormhole model, and for arbitrary-size data in the circuit-switching model. Our algorithms are simple and assume only local knowledge of the network topology at each node. The algorithms evolved from a variation of the classical Bellman-Ford shortest-path algorithm. One of the main contributions of this paper was to show how to extend the ideas in the Bellman-Ford algorithm to account for arbitrary time-dependent edge reliabilities.
Supported in part by NSF CAREER Award CCR-9985284.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R. K.: Minimum cost reliability problem. Computers and Operations Research 16 (1988) 83–89
Barrett, C., Bisset, K., Konjevod, G., Jacob, R., Marathe, M.: Routing problems in time-dependent and labeled networks, submitted to SODA 2002
Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall, (1992)
Chen, Y. L., Chin, Y. H.: The quickest path problem. Computers and Operations Research 17, no. 2 (1990) 153–161
Cooke, K., Halsey, E.: The shortest route through a network with time dependent internodal transit times. Journal of mathematical analysis and applications 14 (1966) 493–498
Gibson, G. A., Vitter, J. S., Wilkes, J.: Strategic Direction in Storage I/O issues in large-scale computing. In Proceedings of the ACMWorkshop on Strategic Directions in Computing Research, ACM Computing Surveys 28, no. 4 (1996) 779–793
Handel, R., Huber, M. N.: Integrated Broadband Networks: An Introduction to ATM-Based Networks. Addison-Wesley (1991)
Miller-Hooks, E., Patterson S. S.: The time-dependent quickest flow problem. Submitted to Operations Research 2000
McDysan, D. E., Spohn, D. L.: ATM: Theory and Application. McGraw-Hill (1995)
Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the Association for Computing 37, no. 3 (1990) 607–625
Orda, A., Rom, R.: Distributed shortest-path protocols for time-dependent networks. Distributed Computing 10 (1996) 49–62
Scheideler, C.: Universal routing strategies for interconnection networks. Springer (1998)
Sung, K., Bell, M., Seong, M., Park, S.: Shortest paths in a network with timedependent flow speeds. European Journal of Operational Research 121 (2000) 32–39
Tragoudas, S.: The most reliable path transmission. Performance, Computing, and Communications Conference, 1999 IEEE International (1999) 15–19
Vogel, R., Herrtwich, R.G., Kalfa, W., Wittig, H., Wolf, L.C.: QoS-based routing of multimedia streams in computer networks. IEEE Journal on Selected Areas in Communications 14, no. 7 (1996) 1235–1244
Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Jornal on Selected Areas in Communications 14, no. 7 (1996) 1228–1234
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Konjevod, G., Oh, S., Richa, A.W. (2002). Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_39
Download citation
DOI: https://doi.org/10.1007/3-540-45995-2_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43400-9
Online ISBN: 978-3-540-45995-8
eBook Packages: Springer Book Archive