Presentation is loading. Please wait.

Presentation is loading. Please wait.

Tunable QoS-Aware Network Survivability Jose Yallouz Joint work with Ariel Orda Department of Electrical Engineering, Technion.

Published byBartholomew Quinn Modified over 8 years ago

Similar presentations

Presentation on theme: "Tunable QoS-Aware Network Survivability Jose Yallouz Joint work with Ariel Orda Department of Electrical Engineering, Technion."— Presentation transcript:

1 Tunable QoS-Aware Network Survivability Jose Yallouz Joint work with Ariel Orda Department of Electrical Engineering, Technion

2 INFOCOM 2013 Introduction Survivability – the capability of the network to maintain service continuity in the presence of failures. Single Link Failure Model assumes that at most one link failure should be handled in the network. Protection is a type of pre-planning process established before a failure occurs. Introduction 2

3 INFOCOM 2013 Tunable survivability Full survivability - (100%) protection against network single failures. Establishment of pairs of disjoint paths. This scheme is often too restrictive. Tunable survivability allows any desired degree of survivability in the range 0% to 100%. Increase the space of feasible solutions. In our work, we focus on the combination of survivability and other QoS additive criteria. delay, jitter, cost. common link Introduction 3

4 INFOCOM 2013 Model Formulation Problem formulation 4 1-0.01=(0.99)-survivability level

5 INFOCOM 2013 Model Formulation Problem formulation 5 CO-Weight: 1+10+100+1+1=113 CT-Weight: 100+10+1+1+2=114

6 INFOCOM 2013 Problem Illustration Transmission delay can be reduced drastically by slightly alleviating the survivability requirement of the connection. (1-0.01) 2 =(0.99) 2 -survivability level CT-Weight: 10+10+1+1+1=24 1-0.01=(0.99)-survivability level CT-Weight: 100+10+1+1+1=114 Problem formulation 6

7 INFOCOM 2013 Optimization Problems Problem formulation 7

8 INFOCOM 2013 The Structure of CT Solutions St critical link vivi vjvj The Structure of CT Solutions 8

9 INFOCOM 2013 The Structure of CT Solutions 9 St In-all-weight-shortest path links

10 INFOCOM 2013 The Structure of CT Solutions 10 St critical link vivi vjvj St vivi vjvj In-all-weight-shortest path links

11 INFOCOM 2013 Algorithmic Scheme Problem CT-CQMS is NP-Hard. A reduction from the Partition Problem (PP) Pseudo polynomial and Fully Polynomial Time Approximation Scheme (FPTAS) solutions are proposed Algorithm 11

12 INFOCOM 2013 Algorithm for the CT Problem– Establishing QoS Aware p-survivable connection Algorithm 12 s t survivable connection

13 INFOCOM 2013 Algorithm for the CT Problem– Establishing QoS Aware p-survivable connection Algorithm 13

14 INFOCOM 2013 Algorithm for the CT Problem S T P=0.01 W=4 P=0.03 W=1 P=0.02 W=1 P=0.01 W=1 P=0.01 W=3 Algorithm 14

15 INFOCOM 2013 Algorithm for the CT Problem ST P=0.01 W=4 P=0.03 W=1 P=0.02 W=1 P=0.01 W=1 P=0.01 W=3 Algorithm 15

16 INFOCOM 2013 Algorithm for the CT Problem ST P=0.01 W=4 P=0.03 W=1 P=0.02 W=1 P=0.01 W=1 P=0.01 W=3 S=-ln0.97 W=2 S=-ln0.98 W=2 S=-ln0.99 W=2 Algorithm 16

17 Algorithm for the CT Problem Algorithm 17 ST P=0.01 W=4 P=0.03 W=1 P=0.02 W=1 P=0.01 W=1 P=0.01 W=3 P=0 W=6 P=0 W=5 P=0 W=9

18 Algorithm for the CT Problem Algorithm 18 ST Find the most survivable connection where its weight is restricted to 8 P=0 W=6 P=0 W=5 P=0 W=9 S=-ln0.97 W=2 S=-ln0.98 W=2 S=-ln0.99 W=2

19 INFOCOM 2013 Algorithm for the CT Problem S T P=0.01 W=4 P=0.03 W=1 P=0.02 W=1 P=0.01 W=1 P=0.01 W=3 Algorithm 19

20 INFOCOM 2013 Simulation Assuming different ratios of “slow” and “fast” delay links. Simulation 20 Delay improved by 50%

21 INFOCOM 2013 Conclusion Optimization problems combining the survivability level and an additive QoS criteria. Characterized fundamental properties of CT-problems. Established algorithmic schemes. Comprehensive simulations show the advantage of tunable survivability. Our scheme can be implemented in state of the art architectures such as MPLS. Conclusion 21

22 INFOCOM 2013 22

Download ppt "Tunable QoS-Aware Network Survivability Jose Yallouz Joint work with Ariel Orda Department of Electrical Engineering, Technion."

Similar presentations

APNOMS03 1 A Resilient Path Management for BGP/MPLS VPN Jong T. Park School of Electrical Eng. And Computer Science Kyungpook National University

APNOMS03 1 A Resilient Path Management for BGP/MPLS VPN Jong T. Park School of Electrical Eng. And Computer Science Kyungpook National University
Improving TCP over Wireless by Selectively Protecting Packet Transmissions Carla F. Chiasserini Michele Garetto Michela Meo Dipartimento di Elettronica.

Improving TCP over Wireless by Selectively Protecting Packet Transmissions Carla F. Chiasserini Michele Garetto Michela Meo Dipartimento di Elettronica.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
~1~ Infocom’04 Mar. 10th. 2004 On Finding Disjoint Paths in Single and Dual Link Cost Networks Chunming Qiao* LANDER, CSE Department SUNY at Buffalo *Collaborators:

~1~ Infocom’04 Mar. 10th On Finding Disjoint Paths in Single and Dual Link Cost Networks Chunming Qiao* LANDER, CSE Department SUNY at Buffalo *Collaborators:
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.

1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
Infocom 2003 An Approach to Alleviate Link Overload as Observed on an IP Backbone Tuesday, April 1 st Infocom 2003 Sundar Iyer 1,2, Supratik Bhattacharrya.

Infocom 2003 An Approach to Alleviate Link Overload as Observed on an IP Backbone Tuesday, April 1 st Infocom 2003 Sundar Iyer 1,2, Supratik Bhattacharrya.
Routing with Quality-of-Service Guarantees: Algorithm and Analysis Jun Huang, Xiaohong Huang, Yan Ma Beijing Univ. of Posts & Telecom.

Routing with Quality-of-Service Guarantees: Algorithm and Analysis Jun Huang, Xiaohong Huang, Yan Ma Beijing Univ. of Posts & Telecom.
1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,

1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.

Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.

Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National.

1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National.
AHOP Problem and QoS Route Pre-computation Adam Sachitano IAL.

AHOP Problem and QoS Route Pre-computation Adam Sachitano IAL.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.

Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.

Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.
The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks Ron Banner and Ariel Orda Department of Electrical Engineering Technion-

The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks Ron Banner and Ariel Orda Department of Electrical Engineering Technion-
Bottleneck Routing Games in Communication Networks Ron Banner and Ariel Orda Department of Electrical Engineering Technion- Israel Institute of Technology.

Bottleneck Routing Games in Communication Networks Ron Banner and Ariel Orda Department of Electrical Engineering Technion- Israel Institute of Technology.
Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.

Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.
Path Protection in MPLS Networks Ashish Gupta Design and Evaluation of Fault Tolerance Algorithms with Performance Constraints.

Path Protection in MPLS Networks Ashish Gupta Design and Evaluation of Fault Tolerance Algorithms with Performance Constraints.
ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,

ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,
Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.

Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.

Similar presentations

Ads by Google