Maximum Network Flow Aware Multi-lightpath Survivable Routing in WDM Networks

Author(s):  
Dinesh Kumar Tyagi ◽  
V. K. Chaubey
Author(s):  
Robert Tarjan ◽  
Julie Ward ◽  
Bin Zhang ◽  
Yunhong Zhou ◽  
Jia Mao

2015 ◽  
Vol 35 ◽  
pp. 9-16 ◽  
Author(s):  
Abdullah N. Arslan ◽  
Dan He ◽  
Yu He ◽  
Xindong Wu

Author(s):  
Mohan Chandra Adhikari ◽  
Umila Pyakurel

The aim of the maximum network flow problem is to push as much flow as possible between two special vertices, the source and the sink satisfying the capacity constraints. For the solution of the maximum flow problem, there exists a number of algorithms. The existing algorithms can be divided into two families. First, augmenting path algorithms that satisfy the conservation constraints at intermediate vertices and the second preflow push relabel algorithms that violates the conservation constraints at the intermediate vertices resulting incoming flow more than outgoing flow.In this paper, we study different algorithms that determine the maximum flow in the static and dynamic networks.


2006 ◽  
Vol 50 (17) ◽  
pp. 3400-3415 ◽  
Author(s):  
Shi Xiao ◽  
Gaoxi Xiao ◽  
Yiu-Wing Leung

Sign in / Sign up

Export Citation Format

Share Document