Load Sharing with 1:1 Protection Switching Alan McGuire IEEE 802.1 Eilat.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

Slide 1 Load sharing in PBB-TE Zehavit Alon IEEE Interim Meeting May 2008.
Requirements of PBB-TE Segment Protection for Consideration Ao Wei Wu
Network Demarcation in 802.1aj Alan McGuire IEEE Eilat Interim May 2008.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
© Easy Guides Australia a work platform consisting of a work basket (platform), lifting mechanism and chassis that can raise and lower people and materials.
Segment Protection Scaling Bob Sultan Deng Zhusheng.
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
Preference-based Mobility Model and the Case for Congestion Relief in WLANs using Ad hoc Networks Wei-jen Hsu, Kashyap Merchant, Haw-wei Shu, Chih-hsin.
* Mellanox Technologies LTD, + Technion - EE Department
A child rights approach to child protection Child protection systems are provided for in the Convention.
The Tension Between High Video Rate and No Rebuffering Te-Yuan (TY) Huang Stanford University IRTF Open 87 July 30th, 2013 Joint work Prof.
Jan 13, 2006Lahore University of Management Sciences1 Protection Routing in an MPLS Network using Bandwidth Sharing with Primary Paths Zartash Afzal Uzmi.
Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.
Making Parallel Packet Switches Practical Sundar Iyer, Nick McKeown Departments of Electrical Engineering & Computer Science,
Restoration Routing in MPLS Networks Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
MPLS Local Restoration using Optimized Aggregate Information Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.
A Secure Network Access Protocol (SNAP) A. F. Al Shahri, D. G. Smith and J. M. Irvine Proceedings of the Eighth IEEE International Symposium on Computers.
IEEE in the Large: Observations at the IETF Meeting Henning Schulzrinne, Andrea G. Forte, Sangho Shin Department of Computer Science Columbia University.
Implementing a Highly Available Network
Bandwidth Estimation: Metrics Mesurement Techniques and Tools By Ravi Prasad, Constantinos Dovrolis, Margaret Murray and Kc Claffy IEEE Network, Nov/Dec.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
1 Terminology: Segment Protection M Vinod Kumar Abhay Karandikar.
Server Load Balancing. Introduction Why is load balancing of servers needed? If there is only one web server responding to all the incoming HTTP requests.
Capacity of Wireless Mesh Networks: Comparing Single- Radio, Dual-Radio, and Multi- Radio Networks By: Alan Applegate.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
A Distributed Framework for Correlated Data Gathering in Sensor Networks Kevin Yuen, Ben Liang, Baochun Li IEEE Transactions on Vehicular Technology 2008.
DISPERSITY ROUTING: PAST and PRESENT Seungmin Kang.
1 Terminology: Segment Protection M Vinod Kumar Abhay Karandikar.
Multiply the following two polynomials: (x + 3)(x+3). x + 3 x2x2.
Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,
KAIS T A Bidding Protocol for Deploying Mobile Sensors 발표자 : 권 영 진 Guiling Wang, Guohong Cao, Tom LaPorta The Pennsylvania State University IEEE, ICNP.
Doc.: IEEE /0648r0 Submission May 2014 Chinghwa Yu et. al., MediaTekSlide 1 Performance Observation of a Dense Campus Network Date:
too.
Submission doc.: IEEE /0869r0 July 2015 Hakan Persson, Ericsson ABSlide 1 OFDMA and VoIP Capacity Date: Authors:
Doc.: IEEE /0897r0 SubmissionJae Seung Lee, ETRISlide 1 Active Scanning considering Operating Status of APs Date: July 2012.
Queensland University of Technology CRICOS No J Protection of distributed generation connected networks with coordination of overcurrent relays.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Real-Time Networks – WAN Packet Scheduling.
A new Cooperative Strategy for Deafness Prevention in Directional Ad Hoc Networks Andrea Munari, Francesco Rossetto, and Michele Zorzi University of Padova,
Doc.: IEEE /1149r0 Submission September 2010 Jarkko Kneckt, Nokia CorporationSlide 1 Operation rules for > 40MHz Bandwidth Date: Authors:
Doc.: IEEE / Submission March 2013 Juho Pirskanen, Renesas Mobile CorporationSlide 1 Discussion On Basic Technical Aspects for HEW Date:
Time Remaining 20:00.
Doc.: IEEE /0212r3 Submission Feb 2016 TG ax Enterprise Scenario, Color and DSC Date: Authors: Graham Smith, SR TechnologiesSlide 1.
Performance Analysis of Inter-Domain Path Computation Methodologies draft-dasgupta-ccamp-path-comp-analysis-00.txt Sukrit Dasgupta, Jaudelice C. de Oliveira.
P2P Streaming Protocol (PPSP) Requirements draft-zong-ppsp-reqs-02 Ning Zong Yunfei Zhang Victor Pascual Carl Williams.
 Introduction  Main Functionality of SON  SON Architecture  SON Use Cases  Conclusion.
An Empirical Study on 3G Network Capacity and Performance INFOCOM2007 Wee Lum Tan, Fung Lam and Wing Cheong Lau Chinese University.
Potential Areas of Research Activity – March 2000
By // Ammar Hussain Aljanabi Dr . Hadi Adineh
Some aspects to be determined in PIRC July
Local Intelligent Circuit Breakers – A New Concept for the Refurbishment of Existing Distribution Network Pavel Novak – Germany – Session 1.
Network Load Balancing Functionality
Derivatives of inverse functions
學生:杜筱菡 指導教授:柯開維 教授 日期:2017/6/22
Verifying 11ax’s PAR by UL MU-MIMO
Discussion on Overlapped IPGs in 802.1Qbf
IEEE in the Large: Observations at the IETF Meeting
RNI Requirements Imposed by PBB-TE
Network Survivability
التدريب الرياضى إعداد الدكتور طارق صلاح.
10:00.
SP Spatial Sharing among BSSs: Resolution to CID 143
802.11e features for the enterprise
Team Red A The Mega Spreader Concept
Co-ordination Between Segment Protection and Global Protection
EHT Multi-link Operation
Channel usage in NGV: follow-up
Towards Predictable Datacenter Networks
Presentation transcript:

Load Sharing with 1:1 Protection Switching Alan McGuire IEEE Eilat

Load sharing without protection AB Link 1 Link 2 Link /3 Distribute traffic between links

Load sharing with protection AB Link 1 Link 2 Link /3 + ½(1/3) Total capacity = 3(1/3) (working) + 3(½(1/3)) (protection) = 1½ If one link fails then traffic is shared over remaining links 3 TESIs 1 Protection Group

Capacity as a function of number of links Let there be N links For load sharing the capacity on each link is

What about conventional 1:1 protection? AB Link 1 Link 2 Link TEPG Working Protection Total capacity = 1.5 As mechanism is 1:1 protection capacity is not used until required – so can overlap in middle link So can obtain B/W reuse in 1:1 and as such effectively load share

Capacity as a function of number of links with 1:1 Let there be N links For load sharing the capacity on each link is

What about uneven load in 1:1? AB Link 1 Link 2 Link TEPG Working Protection Total capacity = 1.8

What about uneven load sharing? AB Link 1 Link 2 Link ½(0.1) ½(0.8) Total capacity = = 1.805

Conclusions Load sharing can be achieved with conventional 1:1 by allowing overlapping protection capacity Overlapping capacity reduces total B/W required Protection TESIs can overlap Therefore do not need two mechanisms to achieve the same thing Conventional 1:1 provides load sharing in line with PAR