Volume 32 Issue 02
Feb.  2006
Turn off MathJax
Article Contents
Zhang Tao, Liu Zhongkan, Zhang Junet al. Algorithm for delay constraints optimal path calculation[J]. Journal of Beijing University of Aeronautics and Astronautics, 2006, 32(02): 209-213. (in Chinese)
Citation: Zhang Tao, Liu Zhongkan, Zhang Junet al. Algorithm for delay constraints optimal path calculation[J]. Journal of Beijing University of Aeronautics and Astronautics, 2006, 32(02): 209-213. (in Chinese)

Algorithm for delay constraints optimal path calculation

  • Received Date: 20 Jan 2005
  • Publish Date: 28 Feb 2006
  • As one of the most challenging problems in the QoS Routing and traffic engineering, the problem of delay constraints optimal path calculation has the non-polynomial(NP) complete complexity. The algorithm which is proposed in literature has some problem, such as not getting optimal path and being very hard complexity etc. So a delay constraints optimal path (DCOP) algorithm which can solve this problem well was proposed. By reduced the search region of the algorithm, the efficiency of algorithm can be improved effectively and an optimal loop-less path can be gotten. The self-adapting parameter design is adopted in this algorithm toimprove the adaptability on the network scale and the changing of complicated service. Using extensive simulations on random graphs and random assigned link weights, the huge improvement in complexity of the new algorithm is tested. The test also indicate that the algorithm has more adaptability and more practicability.

     

  • loading
  • [1] Wang Z, Crowcroft J. Quality of service routing for supporting multimedia applications[J] IEEE Journal on Selected Areas in Communications, 1996, 14(7):1219~1234 [2] Cheng S, Nahrstedt K. On finding multi-constrained paths . In:IEEE ICC`98 . Atlanta:IEEE Communication Society,1998. 874~879 [3] Korkmaz T, Krunz M. An efficient algorithm for finding a path subject to two additive constraints[J] Computer Communications, 2002, 25(3):225~238 [4] Hussein F, Douglas S, Viniotis Y. Evaluation of multicast routing algorithm for real-time communication on high-speed networks[J] IEEE Journal on Selected Areas in Communications, 1997, 15(3):332~345 [5] Widyono R. The design and evaluation of routing algorithms for real-time channels . TR-94-024, 1994 [6] Yuan X, Liu X. Heuristic algorithms for multi-constrained quality of service routing . In:Proceedings of the IEEE INFOCOM 2001 . Piscataway, NJ:IEEE Communication Society, 2001. 844~853 [7] Korkmaz T, Krunz M. Multi-constrained optimal path selection . In:Proc of the IEEE INFOCOM 2001.Conference Proc . Anchorage, Alaska:IEEE Communication Society, 2001. 834~843 [8] Calvert K I, Doar M B, Zegura E W. Modeling internet topology[J] IEEE Communications Magazine, 1997,35(6):160~163
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(2513) PDF downloads(1026) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return