摘要
带宽是网络通信中重要的性能指标。带宽资源是有限的,为了使信息在网络中尽量快地进行传输,寻找最大带宽路就是一种重要的方法。目前有两种经典的求解最大带宽路的算法:修正Dijkstra算法和修正Kruscal算法。该文提出一种新的最大带宽路算法,称为M-SPFA算法。与前两种算法相比,该算法具有更低的时间复杂度(O(m)),理解容易,实现也更加简单。
The bandwidth is an important parameter of network communication.It is not inexhaustible.In order to transmit information in the network as fast as possible,it is an important method to seek the maximum bandwidth path.So far,there are two classical algorithms to serve this purpose: the modified Dijkstra Algorithm and the modified Kruscal Algorithm.This paper proposes a new algorithm for calculating the maximum bandwidth path,which are called M-SPFA.Compared with the two earlier algorithms,it not only has lower time complexity,but also is easier to understand and accomplish.
出处
《电脑知识与技术（过刊）》
2011年第6X期4035-4037,共3页
Computer Knowledge and Technology
关键词
带宽
网络
最大带宽路
算法
路径
bandwidth
network
maximum bandwidth path
algorithms
path
