计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (34): 46-48.

• 学术探讨 • 上一篇    下一篇

多路传输快速路的瓶颈扩容问题

陈光亭,柳 舟,张 玥   

  1. 杭州电子科技大学 运筹与控制研究所,杭州 310018
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-12-01 发布日期:2007-12-01
  • 通讯作者: 陈光亭

Bottleneck expanding problem with quickest path model

CHEN Guang-ting,LIU Zhou,ZHANG Yue   

  1. Institute of Operational Research and Cybernetics,Hangzhou Dianzi University,Hangzhou 310018,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-12-01 Published:2007-12-01
  • Contact: CHEN Guang-ting

摘要: 网络瓶颈扩容问题是QoS所关心的问题。就多路传输快速路的瓶颈扩容问题给出了相应的数学模型,证明该问题是NP-难问题并给出一个伪多项式时间算法。

关键词: 快速路, 瓶颈扩容问题, 伪多项式时间算法

Abstract: The bottleneck expanding problem is an important problem in QoS.Presents the model of this problem with quickest path.The NP completeness is proved and a pseudopolynomial time algorithm is designed.

Key words: quickest path, bottleneck expanding problem, pseudo-polynomial algorithm