Skip to main content
SpringerLink
Log in

A Scalable Algorithm for Finding Delay-Constraint Least-Cost End-to-End Path

  • Conference paper
Advances in Swarm Intelligence (ICSI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7332))

Included in the following conference series:

  • 2149 Accesses

Abstract

The Delay-Constrained Least-Cost(DCLC) routing problem is known to be NP complete, hence various heuristic methods have been proposed for this problem. However, these heuristic methods have poor scalability as the network scale increases. In this paper we propose a new method based on Markov Decision Process (MDP) theory to address the scalability issue of the DCLC routing problem. The proposed algorithm combines the benefit of the hierarchical routing with the advantage of the probabilistic routing in decreasing the advertisement of the network state information. Simulation results show that the proposed method improves the scalability significantly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 17(1), 36–42 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Widyono, R.: The design and evaluation of routing algorithms for realtime channels. Technical Report TR-94-024, University of California at Berekley (1994)

    Google Scholar 

  3. Reeves, D.S., Salama, H.F., Fang, Y.: A distributed algorithm for delay constrained unicast routing. IEEE/ACM Trans. Networking 8(20), 239–250 (2000)

    Article  Google Scholar 

  4. Juttner, A., Szviatovszki, B.: Lagrange relaxation based method for the QoS routing problem. In: INFOCOM, Alaska, pp. 239–250 (2001)

    Google Scholar 

  5. Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: INFOCOM, Alaska, pp. 834–843 (2001)

    Google Scholar 

  6. Sola, Y.E., Pourjavad, M.A.: Load balancing effects in DCUR QoS routing algorithm. In: ICCSIT, Beijing, pp. 2273–2278 (2009)

    Google Scholar 

  7. Agrawal, H., Grah, M.: Optimization of QoS Routing. In: ICIS, Melbourne, pp. 598–603 (2007)

    Google Scholar 

  8. Mohemmed, A.W., Sahoo, N.C.: Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem. Journal of Heuristics 16(4), 593–616 (2010)

    Article  MATH  Google Scholar 

  9. Dragos, S., Collier, M., Grah, M.: Macro-routing: a new hierarchical routing protocol. In: GLOBECOM, pp. 1510–1514 (2004)

    Google Scholar 

  10. Ghosh, D., Acharya, R.: A probabilistic scheme for hierarchical QoS routing. In: ICON, pp. 416–421 (2001)

    Google Scholar 

  11. Puterman, M.L.: Markov decision processes: discrete stochastic dynamic programming. Wiley-Interscience, Mathematics (2005)

    Google Scholar 

  12. Han, Y., Liu, Z.-J.: A two-time scale MDP-based routing algorithm for DCLC problem. In: IEEE ChinaCom, pp. 1–5 (2009)

    Google Scholar 

  13. Waxman, B.M.: Routing of multipoint connections. IEEE JSAC 6(9), 1617–1622 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ISN State Key Lab, Xidian University, Xi’an, China

    Yue Han, Zengji Liu, Mingwu Yao & Jungang Yang

  2. Xi’an Institute of Communications, Xi’an, China

    Yue Han & Jungang Yang

Authors
  1. Yue Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zengji Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mingwu Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jungang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Key Laboratory of Machine Perception (MOE), Peking University, Department of Machine Intelligence, School of Electronics Engineering and Computer Science, Peking University, 100871, Beijing, China

    Ying Tan

  2. Department of Electrical and Electronic Engineering, Xi’an Jiaotong-Liverpool University, Suzhou, China

    Yuhui Shi

  3. Shenzhen City Key Laboratory of Embedded System Design, College of Computer Science and Software Engineering, Shenzhen University, 518060, Shenzhen, China

    Zhen Ji

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, Y., Liu, Z., Yao, M., Yang, J. (2012). A Scalable Algorithm for Finding Delay-Constraint Least-Cost End-to-End Path. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31020-1_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31020-1_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31019-5

  • Online ISBN: 978-3-642-31020-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation