When designing the topology architecture of a large network,or managing and controlling a run network,the battleneck is always changeable with the increase of the network flow,which must be considered. In this paper ,...When designing the topology architecture of a large network,or managing and controlling a run network,the battleneck is always changeable with the increase of the network flow,which must be considered. In this paper ,af-ter analyzing the Ford_Fulkerson algorithm,we point out the relationship between the network min-cutset and thenetwork bottleneck,present an optimal capacity expansion algorithm based on min-cutest ,and take a network instanceto analyze and prove our algorithm in detail. This algorithm can improve the capacity of network effectively and solvethe bottleneck problem of the network.展开更多
文摘When designing the topology architecture of a large network,or managing and controlling a run network,the battleneck is always changeable with the increase of the network flow,which must be considered. In this paper ,af-ter analyzing the Ford_Fulkerson algorithm,we point out the relationship between the network min-cutset and thenetwork bottleneck,present an optimal capacity expansion algorithm based on min-cutest ,and take a network instanceto analyze and prove our algorithm in detail. This algorithm can improve the capacity of network effectively and solvethe bottleneck problem of the network.
