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.展开更多
The paper points out the relationship between the bottleneck and the minimum cutset of the network, and presents a capacity expansion algorithm of network optimization to solve the network bottleneck problem. The comp...The paper points out the relationship between the bottleneck and the minimum cutset of the network, and presents a capacity expansion algorithm of network optimization to solve the network bottleneck problem. The complexity of the algorithm is also analyzed. As required by the algorithm, some virtual sources are imported through the whole positive direction subsection in the network, in which a certain capacity value is given. Simultaneously, a corresponding capacity-expanded network is constructed to search all minimum cutsets. For a given maximum flow value of the network, the authors found an adjustment value of each minimum cutset arcs group with gradually reverse calculation and marked out the feasible flow on the capacity-extended networks again with the adjustment value increasing. All this has been done repeatedly until the original topology structure is resumed. So the algorithm can increase the capacity of networks effectively and solve the bottleneck problem of networks.展开更多
文摘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.
基金supported by the Natural Science Foundation(Grant No.2001ABB013)the Key Science and Technology Foundation of Hubei Province(Grant No.2001AA104A05)
文摘The paper points out the relationship between the bottleneck and the minimum cutset of the network, and presents a capacity expansion algorithm of network optimization to solve the network bottleneck problem. The complexity of the algorithm is also analyzed. As required by the algorithm, some virtual sources are imported through the whole positive direction subsection in the network, in which a certain capacity value is given. Simultaneously, a corresponding capacity-expanded network is constructed to search all minimum cutsets. For a given maximum flow value of the network, the authors found an adjustment value of each minimum cutset arcs group with gradually reverse calculation and marked out the feasible flow on the capacity-extended networks again with the adjustment value increasing. All this has been done repeatedly until the original topology structure is resumed. So the algorithm can increase the capacity of networks effectively and solve the bottleneck problem of networks.
