跳到主要导航 跳到搜索 跳到主要内容

A delay constraint optimal path algorithm for ad hoc MPLS networks

  • Tao Zhang*
  • , Jun Zhang
  • *此作品的通讯作者
  • Beihang University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

Multiple constraints optimal path (MCOP) problem is a key problem of Ad Hoc MPLS Networks. For the restricted computing and memory capability of Ad Hoc networks node equipments, the MCOP problem of Ad Hoc MPLS Networks is more difficult than the current networks. In this paper, a novel Ad Hoc networks delay constraint optimal path (ADCOP) algorithm is 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 to improve the adaptability on the network scale. 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 indicates that the algorithm has more adaptability and more practicability.

源语言英语
主期刊名ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings
出版商Institute of Electrical and Electronics Engineers Inc.
页745-748
页数4
ISBN(印刷版)0780395867, 9780780395862
DOI
出版状态已出版 - 2006
已对外发布是
活动ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings - Chengdu, 中国
期限: 21 6月 2006 → 23 6月 2006

丛书

姓名ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings

会议

会议ITST 2006 - 2006 6th International Conference on ITS Telecommunications, Proceedings
国家/地区中国
市Chengdu
时期21/06/06 → 23/06/06

学术指纹

探究 'A delay constraint optimal path algorithm for ad hoc MPLS networks' 的科研主题。它们共同构成独一无二的学术指纹。

引用此