摘要
在估计网络性能的过程中,通过删除某些饱和链路来确定子网络的容量,这种算法在迭代过程中避免了重复的计算,使计算速度和效率得到提高。
In the process of performance evaluation for a network, the algorithm, through deleting certain saturated links to confirm the capacity of subnetwork, has avoided the redundant computation in the iterative process, it can also enhance the computation speed and the efficiency.
出处
《山西电子技术》
2006年第6期58-59,90,共3页
Shanxi Electronic Technology
关键词
符号最小路径
单向链路
网络流
容量
signed minimal path
unilateral link
network flow
capacity
