Optimum Route Design in 1+1 Protection with Network Coding for Instantaneous Recovery
スポンサーリンク
概要
- 論文の詳細を見る
1+1 protection provides instantaneous proactive recovery from any single link failure by duplicating and sending the same source data onto two disjoint paths. Other resource efficient recovery techniques to deal with single link failure require switching operations at least at both ends, which restrict instantaneous recovery. However, the 1+1 protection technique demands at least double network resources. Our goal is to minimize the resources required for 1+1 protection while maintaining the advantage of instantaneous recovery. It was reported that the network coding (NC) technique reduces resource utilization in 1+1 protection, and in order to determine an optimum NC aware set of routes that minimizes the required network resources for 1+1 protection, an Integer Quadratic Programming (IQP) formulation has already been addressed. Solving an IQP problem requires large amount of memory (cannot be determined exactly) and special algorithms by the mathematical programming solver. In this paper our contributions consist of two parts. First, we formulate the optimization problem, corresponding to the IQP model, as an Integer Linear Programming (ILP) formulation, which is solvable by any linear programming solver, and so its memory and time requirements are smaller. However, the presented ILP model works well in small-scale and medium-scale networks, but fails to support large-scale networks due to excessive memory requirements and calculation time. Second, to deal with these issues, a heuristic algorithm is proposed to determine the best possible NC aware set of routes in large-scale networks. Numerical results show that our strategies achieve almost double the resource saving effect than the conventional minimal-cost routing policy in the examined medium-scale and large scale networks.
著者
-
Oki Eiji
Dept. Of Communication Engineering And Informatics The University Of Electro-communications
-
OKI Eiji
Dept. of Communications Engineering and Informatics, The University of Electro-Communications
-
MUKTADIR Abu
Dept. of Communications Engineering and Informatics, The University of Electro-Communications
関連論文
- BS-4-8 Design and Architecture of Server Platform for Network Virtualization and Adaptive Network Control(BS-4. System, control and design technologies for emerging network)
- BS-12-34 Enhancing Bandwidth on Demand Service based on Virutual Network Topology Control(BS-12. Network Planning, Control, and Management)
- QoS Control Mechanism Based on Real-Time Measurement of Elephant Flows(Network)
- Latest Trends in Traffic Matrix Modeling and Its Application to Multilayer TE(Traffic Engineering and Multi-Layer Networking,Feature Topics on Latest Trends in Optical Networks)
- Optimal Routing by the Intermediate Model : Joining the Pipe and Hose Models
- Performance of Optimal Routing by Pipe, Hose, and Intermediate Models
- Estimation of Current Traffic Matrices from Long-Term Traffic Variations
- BS-12-35 Novel traffic engineering control systems considering impairment in all-optical networks(BS-12. Network Planning, Control, and Management)
- Inter-Domain Redundancy Path Computation Methods Based on PCE
- Extended Algorithm for Calculating Routes with Include Route Constraint in IP Networks(Network)
- Performance Evaluation of Dynamic Multi-Layer Routing Schemes in Optical IP Networks(Network)
- Scalable Network Emulator Architecture for IP Optical Network Management
- A New Multiple QoS Control Scheme with Equivalent-Window CAC in ATM Networks
- Scalable Multi-Layer GMPLS Networks Based on Hierarchical Cloud-Routers(Network)
- Generalized Traffic Engineering Protocol for Multi-Layer GMPLS Networks(Next Generation Photonic Network Technologies)
- ConSet : Hierarchical Concurrent Path Setup Scheme in Multi-Layer GMPLS Networks(Network)
- Bidirectional Path Setup Scheme Using on Upstream Label Set in Optical GMPLS Networks(Network)
- A Disjoint Path Selection Scheme with Shared Risk Link Group Constraints in GMPLS Networks(Network)
- Experimental 5-Tb/s Packet-by-Packet Wavelength Switching System Using 2.5-Gb/s × 8-λ WDM Links
- Analysis of Matching Dynamics of PIM with Multiple Iterations in an Input-Buffered Packet Switch
- Maximum and Maximal Weight Matching Dispatching Schemes for MSM Clos-Network Packet Switches
- Scalable 3-stage ATM Switch Architecture Using Optical WDM Grouped Links Based on Dynamic Bandwidth Sharing (Joint Special Issue on Photonics in Switching : Systems and Devices)
- Integrated Physical and Logical Layer Design of Multimedia ATM Networks
- OPTIMA : Scalable, Multi-Stage, 640-Gbit/s ATM Switching System Based on Advanced Electronic and Optical WDM Technologies
- A Distributed Traffic Control Scheme for Large-Scale Multi-Stage ATM Switching Systems (IEICE / IEEE Joint Special Issue on Recent Progress in ATM Technologies)
- A Dynamic Reference Single-Ended ECL Input Interface Circuit for MCM-Based 80-Gbps ATM Switch (Special Issue on Ultra-High-Speed IC and LSI Technology)
- High-Speed Multi-Stage ATM Switch Based on Hierarchical Cell Resequencing Architecture and WDM Interconnection (Joint Special Issue on Photonics in Switching : Systems and Devices)
- Scalable 3-Stage ATM Switch Architecture Using Optical WDM Grouped Links Based on Dynamic Bandwidth Sharing (Joint Special Issue on Photonics in Switching : Systems and Devices)
- High-Speed Multi-Stage ATM Switch Based on Hierarchical Cell Resequencing Architecture and WDM Interconnection (Joint Special Issue on Photonics in Switching : Systems and Devices)
- Optimization of OSPF Link Weights to Counter Network Failure
- BS-3-2 Performance of IP Tunneling Design for OSPF Network to Reduce Advertising Delay(BS-3. Management and Control Technologies for Innovative Networks)
- B-12-29 Hybrid Pump-Wavelength Configuration Scheme for Optical Packet Switch with Parametric Wavelength Converters
- Estimating ADSL Link Capacity by Measuring RTT of Different Length Packets
- Performance Analysis of Clos-Network Packet Switch with Virtual Output Queues
- A Scheme to Update OSPF Network Metrics without Loops while Minimizing Routing Instability Duration
- A Scheme to Update OSPF Network Metrics without Loops while Minimizing Routing Instability Duration
- A routing scheme distributing traffic using primary and backup ports of IP fast reroute
- Optimum Route Design in 1+1 Protection with Network Coding for Instantaneous Recovery
- Energy efficient routing for transferring data sets across networks