DocumentCode :
3431574
Title :
On M-route flows in a network
Author :
Kishimoto, W. ; Takeuchi, M.
Author_Institution :
Dept. of Electr. & Electron. Eng., Tokyo Inst. of Technol., Japan
fYear :
1992
fDate :
16-20 Nov 1992
Firstpage :
1386
Abstract :
In a flow network an m-F-ring, which corresponds to an m-route channel in a communication network, is defined. An m-route flow between two vertices is the sum of m- F-rings between them, and its value is defined to be the sum of values of those m-F-rings. The m-route capacity of a cut is also defined. The authors show that the maximum value of m-route flows is equal to the minimum value of m -route capacities of the cuts separating those vertices. A method for obtaining this maximum value is presented
Keywords :
channel capacity; network topology; telecommunication network routing; communication network; cuts; flow network; m-route capacity; m-route flows; vertices; Communication networks; Failure analysis; Intelligent networks; Joining processes; Niobium; Robustness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Singapore ICCS/ISITA '92. 'Communications on the Move'
Print_ISBN :
0-7803-0803-4
Type :
conf
DOI :
10.1109/ICCS.1992.255031
Filename :
255031
Link To Document :
بازگشت