Distributed Network Control for Optical Networks Presented by, Sree Rama Nomula

Slides:



Advertisements
Similar presentations
NETWORK LAYER (1) T.Najah AlSubaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.
Advertisements

Why to learn OSI reference Model? The answer is too simple that It tells us that how communication takes place between computers on internet but how??
Routing: Cores, Peers and Algorithms
1 Wide-Sense Nonblocking Multicast in a Class of Regular Optical Networks From: C. Zhou and Y. Yang, IEEE Transactions on communications, vol. 50, No.
Efficient Solutions to the Replicated Log and Dictionary Problems
International Standards Organization Open Systems Interconnect (OSI) Reference Model Advanced Computer Networks.
CSCI 4550/8556 Computer Networks Comer, Chapter 11: Extending LANs: Fiber Modems, Repeaters, Bridges and Switches.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Routing.
Ad-hoc On-Demand Distance Vector Routing (AODV) Sirisha R. Medidi.
1 Internet Networking Spring 2006 Tutorial 3 Ad-hoc networks TBRPF (based on IETF tutorials on TBRPF)
1 Internet Networking Spring 2003 Tutorial 4 ICMP (Internet Control Message Protocol) usage TBRPF (Topology Broadcast based on Reverse Path Forwarding)
COMPUTER NETWORKS.
Connecting LANs, Backbone Networks, and Virtual LANs
Introduction to IT and Communications Technology Justin Champion C208 – 3292 Ethernet Switching CE
ICMP (Internet Control Message Protocol) Computer Networks By: Saeedeh Zahmatkesh spring.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
DEMIGUISE STORAGE An Anonymous File Storage System VIJAY KUMAR RAVI PRAGATHI SEGIREDDY COMP 512.
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Network Layer Internet Protocol (IP) layer Introduction.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
Mobile Adhoc Network: Routing Protocol:AODV
Ad hoc On-demand Distance Vector (AODV) Routing Protocol ECE 695 Spring 2006.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
The OSI Model.
Overview of computer communication and Networking Communication VS transmission Computer Network Types of networks Network Needs Standards.
The Network Layer & Routing
Chapter 3: Networking and Internetworking 1. Introduction Networking issues for distributed systems: Performance,scalability,reliability,security,mobility,
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
1 University of California, Irvine Done By : Ala Khalifeh (Note : Not Presented)
Lecture Topics: 11/27 Networks Layered Model Ethernet IP.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
Network Models.
Web Services. 2 Internet Collection of physically interconnected computers. Messages decomposed into packets. Packets transmitted from source to destination.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
Data Communications and Networks Chapter 1 - Classification of network topologies Data Communications and Network.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 CH. 8: SWITCHING & DATAGRAM NETWORKS 7.1.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 Module 10 Routing Fundamentals and Subnets.
Univ. of TehranComputer Network1 Advanced topics in Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr. Nasser Yazdani.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
Slides for Chapter 3: for CS Only Networking and Internetworking Pages –
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
6LoWPAN Ad Hoc On-Demand Distance Vector Routing Introduction Speaker: Wang Song-Ferng Advisor: Dr. Ho-Ting Wu Date: 2014/03/31.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.
Operating Systems Network Structures. Topics –Background –Motivation –Topology –Network Types –Communication –Design Strategies Topics –Background –Motivation.
Doc.: IEEE /0174r1 Submission Hang Liu, et al. March 2005 Slide 1 A Routing Protocol for WLAN Mesh Hang Liu, Jun Li, Saurabh Mathur {hang.liu,
1 LAN switching and Bridges Relates to Lab Outline Interconnection devices Bridges/LAN switches vs. Routers Bridges Learning Bridges Transparent.
Network Models.
Scaling the Network Chapters 3-4 Part 2
Distributed Systems CS
Networking Devices.
ECE 544 Protocol Design Project 2016
Sensor Network Routing
SWITCHING Switched Network Circuit-Switched Network Datagram Networks
Routing.
ECE 544 Protocol Design Project 2016
ECE 544 Protocol Design Project 2016
CS 4594 Broadband PNNI Signaling.
Viet Nguyen Jianqing Liu Yaqin Tang
Design & development of impairment-aware routing and wavelength assignment algorithms for Future Internet Mohammad Shoyaib Student ID: Image.
Distributed Systems CS
Chapter 3 Part 3 Switching and Bridging
Vinay Singh Graduate school of Software Dongseo University
A Routing Protocol for WLAN Mesh
Routing.
Distributed Systems CS
Presentation transcript:

Distributed Network Control for Optical Networks Presented by, Sree Rama Nomula

Introduction What are Optical Networks? Optical network is a network with transmission links that are optical fibers, and with an architecture that is designed to exploit the unique features of the fibers.

WDM Networks Technique used in optical communications networks by which two or more optical signal having different wavelengths may be simultaneously transmitted in the same direction over one fiber and separated by wavelength at the end.

Controller Communication Network The Network E BA C D Controller Switching Node

Controllers Switches in a node are controlled by a controller. Controllers communicate with each other over communication network, either in- band or out-of-band. Assumption: – The transport protocol for message passing between controllers is reliable.

Controllers Keeps track of the connections in its associated node. – Connection Switch table(CST) – Connection update procedure – Topology update protocol

Connection Switch Table Every connection has a unique id. – – Sequence numbers can be same if two connections have different originators or destinations. A connection can be in the up or reserved state.

CST at Node A Connection-idPort State E,D,12 B, 3D, 1 up B,C,10 B, 1C, 3 up E,C,8 B, 2C, 2 reserved C,A,8 D, 3 I/Oup

Status bits For every port in a switch a status bit is attached, which can be modified by the controller. Status bit is 0 if the port is being used else it is set to 1. If a port recovers from failure, the status bit is set to 1.

CST recovery CST is lost if the controller goes down. Revival process. – Current switch settings in the node are read. – Ports with status bit = 1 are disregarded. – For ports with status bit = 0 an entry is made in the CST. – The connection-id is set to null. CST is updated by using a CST update protocol.

CST recovery(contd.) Status bit = 1 on (C, 3) and (B, 1). Status bit = 0 on (B, 3),(D, 1) and (D, 3) Connection-idPort State B, 3D, 1 up D, 3 I/Oup

Connection Update Procedure Periodically or whenever CST changes, messages are passed to the neighboring controller. The message contains a list of wavelength, id and state of all connections that go over the link connecting the two nodes. Ex: From node A to C – { [ 3, (B,C,10), up], [ 2, (E,C,8), reserved]}

Topology Update Procedure Each node periodically broadcasts pertinent topology information to other nodes. Also, event driven updates can be generated. A topological update message contains the list of up links adjacent to the nodes and their wavelength usage. Ex: Node A generates the message … – { (B, 1, 2, 3), (C, 2, 3 ), (D, 1, 3) }

Connection Setup Wavelength and Route Determination – Using the data in the topology and wavelength usage database, the route and wavelengths can be determined. Reservation – The originator node requests all the controllers on the connection to reserve wavelengths on all links on the path. This step makes sure that there are no loops of committed resources. Connection Setup/Release – If reservation is successful at all nodes in the path, switches are setup by the corresponding controllers. Otherwise all the reservations are released.

Takedown and Update For dropping a connection two procedures are employed. – Explicit TAKEDOWM messages. – CST Update. A TAKEDOWM message is sent to each controller on the connection. The controllers delete the entry corresponding to the connection in their CST. If some controllers are down it takes connection down at all working controllers.

Takedown and update(Contd.) Periodically or if there is a change in the CST, each controller sends update messages to its neighboring controllers. The Update message contains a list of wavelength, id and state of all connections that go over the link. On receiving the update, the controller matches it with the local CST. If no entry is found in the update message, corresponding to an entry in the local CST, the entry in the local CST is deleted.

CST Update If a controller deletes an entry, then related entries will be deleted at all controllers along the path. This will continue till the end of connection or failed controller is met. Similar is the case when a link or wavelength is failed. If the other end wants to takedown when the originator controller fails, then it will simply delete the appropriate entry. The switch setting remain the same till a new connection is requested.

Finite State Machine unused reserve d up confirme d up(no id) entry delete d RESERVE(id) SETUP(id) Controller recovery (status = 0) TAKEDOWN (id) RESERVE-TIMER(id) expires LST(related in confirmed) CONFIRM(id) LST(related no entry) TAKEDOWN(id) LST (no related entry)

Summary Proposed distributed protocols for setting up, taking down and maintaining the state of connections in a WDM optical network. These protocols can be used in networks – With different kinds of node architectures. – Different route computation algorithms and underlying constraints of the physical layer. – Different kinds of underlying mechanisms for the controllers communication.

Thank You !