Prof.Veeraraghavan Prof.Karri Haobo Wang:

Slides:



Advertisements
Similar presentations
New Timing Distribution Mechanism TICTOC WG, IETF 71th Philadelphia, USA draft-ji-tictoc-new-timing-distribution-mechanism-00.txt Kuiwen Ji
Advertisements

ITU-T Workshop on Security Seoul (Korea), May 2002 Telecommunication network reliability Dr. Chidung LAC.
Slide 111 May 2008 Point-to-Multipoint in 802.1Qay Nurit Sprecher, Nokia Siemens Networks Hayim Porat, Ethos Networks.
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
Chapter 9 Introduction to MAN and WAN
Protection and Restoration in Optical Network
Deployment of MPLS VPN in Large ISP Networks
IEEE Interim, Seoul, Sept 08 Case for Segment Protection or Local Repair M Vinod Kumar Tejas Networks.
Designing a New Routing Simulator for DiffServ MPLS Networks Peng Zhang Zhansong Ma Raimo Kantola {pgzhang, zhansong,
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
IP layer restoration and network planning based on virtual protection cycles 2000 IEEE Journal on Selected Areas in Communications Reporter: Jyun-Yong.
1 Chapter 10 Introduction to Metropolitan Area Networks and Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Introduction to Metropolitan Area Networks and Wide Area Networks TDC 362 / TDC 460.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Ashish Gupta (98130) Ashish Gupta (98131) Under guidance of Prof. B. N. Jain.
1 Chapter 10 Introduction to Metropolitan Area Networks and Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
Control and Traffic Management Paper: Banerjee et al.: ” Generalized multiprotocol label switching: an overview of signaling enhancements and recovery.
Analysis of RIP, OSPF, and EIGRP Routing Protocols using OPNET Group 5: Kiavash Mirzahossein Michael Nguyen Sarah Elmasry
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
Data Communications & Computer Networks, Second Edition1 Chapter 10 Introduction to Metropolitan Area Networks and Wide Area Networks.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
SMUCSE 8344 Protection & Restoration of Optical Networks.
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,
Protection and Restoration Definitions A major application for MPLS.
A Practical Approach for Providing QoS: MPLS and DiffServ
CSC Survivability Anuj Dewangan Parinda Gandhi.
Hardware Implementation of a Signaling Protocol Polytechnic University Center for Advanced Technology in Telecommunications Haobo Wang Malathi Veeraraghavan.
Two-layer Restoration Scheme for IP over Optical Networks with MPLS Jia Ke, L. Mason, Q. Yang ICIS, School of EEE, Nanyang Technological University
Survivable Traffic Grooming with Differentiated End-to-End Availability Guarantees in WDM Mesh Networks Proceedings of the 13th IEEE Workshop on Local.
11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics.
Challenges in the Next Generation Internet Xin Yuan Department of Computer Science Florida State University
1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.
Date of download: 6/21/2016 Copyright © 2016 SPIE. All rights reserved. Illustration for full link-disjoint protection algorithm (a) CERNET topology with.
William Stallings Data and Computer Communications
An evolutionary approach to G-MPLS ensuring a smooth migration of legacy networks Ben Martens Alcatel USA.
Unit 1:Frame Relay.
Architecture and Algorithms for an IEEE 802
Computer Network Collection of computers and devices connected by communications channels that facilitates communications among users and allows users.
draft-liu-pim-single-stream-multicast-frr-01
Network Layer Goals: Overview:
Introduction to Metropolitan Area Networks and Wide Area Networks
Distributed Control Plane
Protection & Restoration Design Team - CCAMP WG
Customer Presentation
SWITCHING Switched Network Circuit-Switched Network Datagram Networks
Network Survivability
Firewalls and GMPLS Networks: A token based approach
Optical Mesh network for Emerging Gigabit Applications
Hardware-Accelerated Signaling
Chapter 4 Frame Relay Chapter 4 Frame Relay.
Dynamic Circuit Service Hands-On GMPLS Engineering Workshop
ECE453 – Introduction to Computer Networks
Optical Layer Protection Schemes
Network Layer I have learned from life no matter how far you go
MPLS and GMPLS Li Yin CS294 presentation.
Haobo Wang, Ramesh Karri Polytechnic University
Chapter 9. Circuit Switching
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Label Switched VPNs – Scalability and Performance Analysis
SURVIVABILITY IN IP-OVER-WDM NETWORKS (2)
Optical communications & networking - an Overview
CIS679: Two Planes and Int-Serv Model
Chapter-5 Traffic Engineering.
Eusebi Calle, Jose L Marzo, Anna Urra. L. Fabrega
An Engineering Approach to Computer Networking
Research Issues in Middleware (Bhaskar)
Presentation transcript:

Prof.Veeraraghavan Prof.Karri Haobo Wang: haobo_w@photon.poly.edu Hardware Accelerated Signaling and its Application in Fast Network Restoration Prof.Veeraraghavan Prof.Karri Haobo Wang: haobo_w@photon.poly.edu

Background What’s signaling? Primarily implemented in software Signaling protocols are used in connection-oriented networks to set up and tear down connections. Primarily implemented in software Complexity and the requirement for flexibility What we pay is the performance Hardware accelerated signaling Why? 100x-1000x speedup How? FPGA+Hardware/software Codesign

Which is better? “Thin” hardware signaling engine Simple signaling addressed to single application Optical Circuit Signaling Protocol – OCSP Simple, for SONET network only Hardware accelerated signaling engine “Panacea” signaling – RSVP-TE for GMPLS Complex but covers all connection-oriented networks Hardware/Software Codesign Time-Critical functions->hardware Non-Time-Critical functions->software

Network and node view

Architecture of Prototype Board

Hardware Signaling Accelerator

Applications of Hardware signaling High throughput Support large scaled core switches – TCP switching Low call setup delay Fast restoration after network fails Illinois, May 1988, a fire at a local exchange center caused the loss of service to 35,000 residential telephones Today, data traffic prevails, more sensitive to loss One single fiber may carry T(era)bps of user traffic! Network survivability is essential

Trade-off of different recovery schemes Fast Recovery delay Slow Bad Good Resource utilization Protection Resource reserved in advance Linearly/Ring topology LAPS or SHR Line switching The failure is addressed locally, point-to-point Restoration react to failure dynamically Mesh networks Path switching The failure is addressed globally, end-to-end We want both! High resource utilization and low recovery delay Dynamic re-routing in mesh networks

Dynamic re-routing in Mesh network A disjoint back-up route is pre-calculated, but not allocated Routing table has entries for backup route Hardware signaling helps to set up backup path rapidly May be blocked  A B C D E F

Analysis and simulation (ongoing work) A 13-node, 22-link sample network, average number of hops on primary path is 2.4, on secondary path is 3.5. Analysis of dynamic provisioning (M/D/1/∞) Simulation of dynamic re-routing When link/node fails, all affected paths must be re-routed simultaneously. We use OPNET to model the dynamic re-routing behavior.