DocumentCode :
2602417
Title :
Maximising the Amount of Transmitted Flow through Repairable Flow Networks
Author :
Todinov, Michael
Author_Institution :
Sch. of Technol., Oxford Brookes Univ., Oxford, UK
fYear :
2010
fDate :
24-26 March 2010
Firstpage :
163
Lastpage :
168
Abstract :
A fundamental theorem related to maximizing the flow in a repairable flow network with arbitrary topology has been stated and proved. `The flow transmitted through a repairable network with arbitrary topology and a single source and sink can be maximized by (i) determining, all possible flow paths from the start node (the source) to the end node (the sink); (ii) arranging the flow paths in ascending order according to their specific flow path resistance and (iii) setting up the flow in the network by a sequential saturation of the flow paths starting with the one with the smallest specific resistance, until the entire flow network is saturated´. Based on the proved theorem, a new method for maximizing the flow in repairable flow networks has been proposed. The method is based on the new concept `specific resistance of a flow path´. Finally, a new stochastic optimization method has been proposed for determining the network topology combining a maximum flow and minimum cost.
Keywords :
network topology; stochastic programming; arbitrary topology; flow path resistance; maximum flow; network topology; repairable flow network; sequential saturation; stochastic optimization; transmitted flow; Complex networks; Computational modeling; Computer networks; Computer simulation; Cost function; Design optimization; Network topology; Optimization methods; Random variables; Stochastic processes; flow path; maximum flow; repairable flow networks; specific flow resistance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Modelling and Simulation (UKSim), 2010 12th International Conference on
Conference_Location :
Cambridge
Print_ISBN :
978-1-4244-6614-6
Type :
conf
DOI :
10.1109/UKSIM.2010.37
Filename :
5481037
Link To Document :
بازگشت