On Shortest Path Problems with “Non-Markovian” Link Contribution to Path Lengths
In this paper we introduce a new class of shortest path problems, where the contribution of a link to the path length computation depends not only on the weight of that link but also on the weights of the links already traversed. This class of problems may be viewed as “non-Markovian”. We consider a specific problem that belong to this class, which is encountered in the multimedia data transmission domain. We consider this problem under different conditions and develop algorithms. The shortest path problem in multimedia data transmission environment can be solved in O(n 2) or O(n 3) computational time.
KeywordsShort Path Path Length Source Node Destination Node Short Path Problem
- 2.D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, 1987.Google Scholar
- 3.K.S. Candan and Y. Yang, “Least-Cost High-Quality Object Retrieval for Distributed Multimedia Collaborations”, IEEE Multimedia Computing and Systems Conference, pp. 649–654, Florence, Italy, June 1999.Google Scholar
- 12.H.F. Salama, D.S. Reeves and Y. Viniotis, “A Distributed Algorithm for Delay-Constrained Unicast Routing”, IEEE INFOCOM’97, pp. 1c.2.1–1c.2.8, 1997.Google Scholar
- 13.A. Sen, K. S. Candan, A. Ferreira, B. Beauquier, S. Perennes, “On Shortest Path Problems with “non-Markovian” Link Contribution to Path Lengths”, Tech. Report-00-002, Dept. of Computer Science and Engineering, Arizona State University.Google Scholar