Flow splitting approach for path provisioning and path protection problems
Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie - Trang 93-98
Tóm tắt
We consider off-line versions of path provisioning and path protection problems for general circuit switched networks. Both problems deal with a given network topology and a list of integral demand flows. The objective is to route the flows and to allocate the bandwidth in a way that minimizes the total amount of bandwidth used for working and protection paths. We consider path-based protection where, in the case of a single link failure, all the flows utilizing the failed link can be rerouted to a precomputed set of paths. We demonstrate that flow splitting can bring significant advantages for both provisioning and protection problems. Since the problem is NP-complete, we propose and analyze two simple heuristics. We show that one of these heuristics performs almost as well as the optimal solution.
Từ khóa
#Protection #Bandwidth #Switching circuits #Image motion analysis #Routing #Network topology #Wavelength division multiplexing #Switches #National electric code #LaboratoriesTài liệu tham khảo
10.1109/49.265708
kodialam, 2000, Dynamic routing of bandwidth guaranteed tunnels with restoration, Proc lNFOCOM
liu, 2001, Approximating optimal spare capacity allocation by successive survivable routing, Proc IEEE NFOCOM
10.1109/49.725189
sharma, 2001, Framework for MPLS-Based Recovery
10.1109/GLOCOM.1998.775799
10.1109/90.700896
10.1109/INFCOM.2000.832263
10.1109/INFCOM.2000.832193
10.1007/978-3-642-11120-4_3
10.1007/BF02139308
10.1109/24.93760
10.1109/90.879351