Advertisement

On Shortest Path Problems with “Non-Markovian” Link Contribution to Path Lengths

  • Arunabha Sen
  • K. Selçuk Candan
  • Afonso Ferreira
  • Bruno Beauquier
  • Stephane Perennes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1815)

Abstract

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.

Keywords

Short Path Path Length Source Node Destination Node Short Path Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    R. Bellman, “On a Routing Problem”, Quarterly of Applied Mathematics, vol. 16, no. 1, pp. 87–90, 1958.zbMATHMathSciNetGoogle Scholar
  2. 2.
    D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, 1987.Google Scholar
  3. 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
  4. 4.
    E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs”, Numerische Mathematik, vol. 1, pp. 269–271, 1959.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    L.E. Ford and S.M. Johnson, “A Tournament Problem”, The American Mathematical Monthly, vol. 66, pp. 387–389, 1959.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    G.Y. Handler and I. Zang, “A Dual Algorithm for the Constrained Shortest Path Problem”, Networks, vol. 10, pp. 293–310, 1980.CrossRefMathSciNetGoogle Scholar
  7. 7.
    I. Ioachim et. al., “A Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs”, Networks, vol. 31, pp. 193–204, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    J.M. Jaffe, “Algorithms for Finding Paths with Multiple Constraints”, Networks, vol. 14, pp. 95–116, 1984.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    A. Orda and R. Rom, “Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Lengths”, Journal of the Association for Computing Machinery, vol. 37, no. 3, pp. 605–625, 1990.MathSciNetGoogle Scholar
  10. 10.
    A. Orda and R. Rom, “Minimum Weight Paths with Time-Dependent Networks”, Networks, vol. 21, pp. 295–319, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    J.B. Rosen, S. Z. Sun and G.L. Xue, “Algorithms for the Quickest Path Problem and the Enumeration of Quickest Paths”, Computers and Operation Research, vol. 18, no. 6, pp. 579–584, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 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. 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
  14. 14.
    Z. Wang and J. Crowcroft, “Quality-of-Service Routing for Supporting Multimedia Applications”, IEEE Journal on Selected Areas of Communications, vol. 14, no. 7, pp. 1228–1234, 1996.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Arunabha Sen
    • 1
  • K. Selçuk Candan
    • 1
  • Afonso Ferreira
    • 2
  • Bruno Beauquier
    • 2
  • Stephane Perennes
    • 2
  1. 1.Department of Computer Science and EngineeringArizona State UniversityTempeUSA
  2. 2.SLOOP, CNRS - INRIA - UNSASophia-AntipollisFrance

Personalised recommendations