CS 4594 Broadband PNNI Signaling.

Slides:



Advertisements
Similar presentations
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
Advertisements

1 Agenda TMA2 Feedback TMA3 T821 Bock 2. 2 Packet Switching.
Hierarchy of Routing Knowledge IP Routing: All routers within domains that carry transit traffic have to maintain both interior and exterior routing information.
Shalini Bhavanam. Key words: Basic Definitions Classification of Networks Types of networks Network Topologies Network Models.
MPLS H/W update Brief description of the lab What it is? Why do we need it? Mechanisms and Protocols.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
CSEE W4140 Networking Laboratory Lecture 5: IP Routing (OSPF and BGP) Jong Yul Kim
Announcements List Lab is still under construction Next session we will have paper discussion, assign papers,
Chapter 2 Network Models.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
CHAPTER 6: PNNI (Private Network Node Interface or Private Network-to-Network Interface) PNNI is a switch-to-switch protocol developed within the ATM Forum.
© J. Liebeherr, All rights reserved 1 IP Multicasting.
1 MPLS Architecture. 2 MPLS Network Model MPLS LSR = Label Switched Router LER = Label Edge Router LER LSR LER LSR IP MPLS IP Internet LSR.
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
NETWORKING CONCEPTS. OSI MODEL Established in 1947, the International Standards Organization (ISO) is a multinational body dedicated to worldwide agreement.
Chapter 13: WAN Technologies and Routing 1. LAN vs. WAN 2. Packet switch 3. Forming a WAN 4. Addressing in WAN 5. Routing in WAN 6. Modeling WAN using.
Routing and Routing Protocols Dynamic Routing Overview.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
Presentation on Osi & TCP/IP MODEL
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Atm-signaling1 ATM Signaling ATM signaling is mainly used for setup/release of virtual connections. A phased approach was taken for the introduction of.
Jon Maloy, Ericsson Steven Blake, Ericsson Maarten Koning, WindRiver draft-maloy-tipc-00.txt Transparent Inter Process Communication TIPC.
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
Spring 2006Computer Networks1 Chapter 2 Network Models.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
Cisco 3 - LAN Perrine. J Page 110/20/2015 Chapter 8 VLAN VLAN: is a logical grouping grouped by: function department application VLAN configuration is.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
1 Copyright © Monash University ATM Signalling Philip Branch Centre for Telecommunications and Information Engineering (CTIE) Monash University
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 9 Virtual Trunking Protocol.
Dynamic Routing Protocols II OSPF
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
SYSTEM ADMINISTRATION Chapter 2 The OSI Model. The OSI Model was designed by the International Standards Organization (ISO) as a structural framework.
CS440 Computer Networks 1 Packet Switching Neil Tang 10/6/2008.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Label Distribution Protocols LDP: hop-by-hop routing RSVP-TE: explicit routing CR-LDP: another explicit routing protocol, no longer under development.
3. INTERNETWORKING (PART 1) Rocky K. C. Chang Department of Computing The Hong Kong Polytechnic University 18 February
The OSI Model. History of OSI Model ISO began developing the OSI model in It is widely accepted as a model for understanding network communication.
Asstt. Professor Adeel Akram. Other Novel Routing Approaches Link reversal Aimed for highly dynamic networks Goal: to identify some path, as opposed.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
1 Computer Networks Chapter 5. Network layer The network layer is concerned with getting packets from the source all the way to the destination. Getting.
1 CMPT 471 Networking II OSPF © Janice Regan,
MPLS Virtual Private Networks (VPNs)
Network Models.
ROURING ALGORITHM: LINK STATE
Dynamic Routing Protocols II OSPF
Instructor Materials Chapter 5: Dynamic Routing
Chap. 2 Network Models.
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Routing Protocols and Concepts
Link-State Routing Protocols
Dynamic Routing Protocols part2
Single-Area OSPF (Open Shortest Path First Protocol)
SWITCHING Switched Network Circuit-Switched Network Datagram Networks
Lec 5 Layers Computer Networks Al-Mustansiryah University
Chapter 5: Dynamic Routing
Chapter 12: Wide Area Networks
Chapter 3: Open Systems Interconnection (OSI) Model
Dynamic Routing Protocols II OSPF
Link-State Routing Protocols
Using Link Cost as a Metric
ECE 544 Project3 Team member: BIAO LI, BO QU, XIAO ZHANG 1 1.
Link-State Routing Protocols
Dynamic Routing Protocols part3 B
Presentation transcript:

CS 4594 Broadband PNNI Signaling

PNNI PNNI = Private Network to Network Interface Can be used for both public and private networks

Two Parts of PNNI Topology Distribution Protocol: Establish structure on an unstructured network Signaling Protocol: Establish a connection in a network

PNNI – ATM Forum From the ATM Forum af-pnni-0055.000: PNNI consists of: A protocol is defined for distributing topology information between switches and clusters of switches. This information is used to compute paths through the network. A hierarchy mechanism ensures that this protocol scales well for large world-wide ATM networks. A key feature of the PNNI hierarchy mechanism is its ability to automatically configure itself in networks in which the address structure reflects the topology. PNNI topology and routing is based on the well-known link-state routing technique. A second protocol is defined for signaling, that is message flows used to establish point-to-point and point-to-multipoint connections across the ATM network. This protocol is based on the ATM Forum UNI signaling, with mechanisms added to support source routing, crankback, and alternate routing of call setup requests in case of connection setup failure.

Functions of the PNNI routing protocol Discovery of neighbors and link status. Election of PGLs. (Peer Group Leader) Construction of the routing hierarchy. Synchronization of topology databases.

Hello – establishes local topology Each node exchanges Hello packets with its immediate neighbors and thereby determines its local state information. This state information includes the identity and peer group membership of the node’s immediate neighbors, and the status of its links to the neighbors. Each node then bundles its state information in “PNNI Topology State Elements” (PTSEs), which are reliably flooded throughout the peer group.

Example Network – No Hierarchical Structure B.1.1 B.2.1 B.1.2 B.2.3 Source A.1.2.x B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 A.3.3 A.1.2 A.3.4 Destination B.3.3.y A.3.1 Level 96 Level 96

Structure Peer Groups are determined by addressing. Address levels are determined by how many bits are allocated to the peer group part of the address. Peer Group Leaders are determined by election. Reachability information is determined by exchange of information among nodes. Uplinks are established using physical links between members of different peer groups.

The Network Structured Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 96 A.3.3 Level 104 A.1.2 A.3.4 A.3.1 Level 96 Level 96

Some Uplinks Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2

The Logical Links are Supported by Uplinks Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 Source A.1.2.x B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 104 Level 96 A.3.3 A.1.2 A.3.4 Destination B.3.3.y A.3.1 Level 96 Level 96

Problem: Establish a Route Given: Source and Destination and Network as it is known at each node. Establish a route.

The Source and Destination Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 Source A.1.2.x B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 104 Level 96 A.3.3 A.1.2 A.3.4 Destination B.3.3.y A.3.1 Level 96 Level 96

Possible Route 1A Source A.1.2.x Destination B.3.3.y Level 64 A C B

Possible Route 1B Source A.1.2.x Destination B.3.3.y Level 64 A C B

Possible Route 2A Source A.1.2.x Destination B.3.3.y Level 64 A C B

Yet Another Route (3A) Source A.1.2.x Destination B.3.3.y Level 64 A C

Basic Concepts Designated Transit List (DTL) Call SETUP Message DTLs map out routes. DTLs work at different levels. A stack keeps track of the levels. Call SETUP Message is passed to next node. is saved at nodes that add new routes.

Some Problems The link between A.3.3 and B.1.2 is blocked (even though PNNI routing says it is OK) The link between A.3.3 and B.2.3 cannot support the high peak cell rate requested.

The Network with Problems Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 Source A.1.2.x B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 96 A.3.3 Level 104 A.1.2 A.3.4 Destination B.3.3.y A.3.1 Level 96 Level 96

Begin at the Source, Use Route 1 Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 Source A.1.2.x B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 104 Level 96 A.3.3 A.1.2 A.3.4 Destination B.3.3.y A.3.1 Level 96 Level 96

Find Route Through A and A.1 Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 Source A.1.2.x B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 104 Level 96 A.3.3 A.1.2 A.3.4 Destination B.3.3.y A.3.1 Level 96 Level 96

Call SETUP Begins SETUP Message saved at A.2.1 Message forwarded to next node.

Push Route from A to B DTL: [A, B], pointer-1 Source A.1.2.x Level 64

Push Route Through A DTL: [A.1, A.2, A.3], pointer-1 DTL: [A, B], pointer-1 Level 64 A C Source A.1.2.x B A.2 A.1.1 A.1 A.3 A.1.2 Level 72

Push Route Through A.1 DTL: [A.1.2, A.1.1], pointer-1 DTL: [A.1, A.2, A.3], pointer-1 DTL: [A, B], pointer-1 Level 64 A C Source A.1.2.x B A.2 A.1.1 A.1 A.3 A.1.2 Level 72

Move to Next Node in top DTL DTL: [A.1.2, A.1.1], pointer-2 DTL: [A.1, A.2, A.3], pointer-1 DTL: [A, B], pointer-1 Level 64 A C Source A.1.2.x B A.2 A.1.1 A.1 A.3 A.1.2 Level 72

Pop DTL Stack and Move to A.2 DTL: [A.1, A.2, A.3], pointer-2 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.1 A.3 Level 72

Push a Route through A.2 DTL: [A.2.2, A.2.3], pointer-1 DTL: [A.1, A.2, A.3], pointer-2 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.2.1 A.1 A.3 A.2.2 A.2.3 Level 72 Level 96

Call SETUP saved at node New route, so save SETUP message at node A.2.2.

Move through A.2 DTL: [A.2.2, A.2.3], pointer-2 DTL: [A.1, A.2, A.3], pointer-2 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.2.1 A.1 A.3 A.2.2 A.2.3 Level 72 Level 96

Route Through A.2 Source A.1.2.x Destination B.3.3.y Level 64 A C B

Pop DTL Stack and Move to A.3 DTL: [A.1, A.2, A.3], pointer-3 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.1 A.3 Level 72

Push a Route through A.3 DTL: [A.3.4, A.3.2, A.3.3], pointer-1 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.3.2 A.3.3 A.1 A.3 A.3.4 A.3.1 Level 72 Level 96

Save Call SETUP New route, so save SETUP message at A.3.4.

Move to next node DTL: [A.3.4, A.3.2, A.3.3], pointer-2 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.3.2 A.3.3 A.1 A.3 A.3.4 A.3.1 Level 72 Level 96

Go to end of A.3 DTL: [A.3.4, A.3.2, A.3.3], pointer-3 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.3.2 A.3.3 A.1 A.3 A.3.4 A.3.1 Level 72 Level 96

Pop DTL Stack DTL: [A.1, A.2, A.3], pointer-3 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.1 A.3 Level 72

Pop DTL Stack, Look for B DTL: [A, B], pointer-2 Level 64 A C B

Call is Blocked At this point the call is blocked – A.3.3 finds it cannot use the connection to B.1.2

Route 1 is Blocked into B Source A.1.2.x Destination B.3.3.y Level 64

Crankback begins at A.3.3 Source A.1.2.x Destination B.3.3.y Level 64

Crankback It cranks back to A.3.4 which attempts alternate routing.

Crankback to A.3.4 Source A.1.2.x Destination B.3.3.y Level 64 A C B

Crankback A.3.4 cannot find a route. It cranks back to A.1.2 which then attempts alternate routing. RELEASE message.

Crankback to A.1.2 Source A.1.2.x Destination B.3.3.y Level 64 A C B

Find an Alternate Route from A.1.2 to B Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 Source A.1.2.x B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 104 Level 96 A.3.3 A.1.2 A.3.4 Destination B.3.3.y A.3.1 Level 96 Level 96

Push DTLs Through A and A.1 DTL: [A.1.2, A.1.1], pointer-2 DTL: [A.1, A.2], pointer-1 DTL: [A, B], pointer-1 Level 64 A C Source A.1.2.x B A.2 A.1.1 A.1 A.3 A.1.2 Level 72

Pop A.1 and Move to A.2 DTL: [A.1, A.2], pointer-1 DTL: [A, B], pointer-1 Level 64 A C Source A.1.2.x B A.2 A.1.1 A.1 A.3 A.1.2 Level 72

Push Route through A.2 DTL: [A.2.2, A.2.1], pointer-2 DTL: [A, B], pointer-1 Level 64 A C B A.2 A.2.1 A.1 A.3 A.2.2 A.2.3 Level 72 Level 96

Pop A.2 DTL: [A.1, A.2], pointer-2 DTL: [A, B], pointer-1 Level 64 A C

Pop A.2 DTL: [A, B], pointer-2 Level 64 A C B

Continue the Path Into B Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 96 A.3.3 Level 104 A.1.2 A.3.4 A.3.1 Level 96 Level 96

Push DTLs Through B and B.1 DTL: [B.1.1, B.1.3], pointer-2 DTL: [B.1, B.2, B.3], pointer-1 DTL: [A, B], pointer-2 Level 64 A C B Level 80 B.1.1 B.1 B.2 B.3 B.1.2 B.1.3 Level 96

The Path Continues through B.1 Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 96 A.3.3 Level 104 A.1.2 A.3.4 A.3.1 Level 96 Level 96

Pop B.1, Push Through B.2 DTL: [B.2.2, B.2.1, B.2.3], pointer-2 DTL: [A, B], pointer-2 Level 64 A C B Level 80 B.1 B.2 B.3 B.2.1 B.2.3 B.2.2

Move to End of B.2 DTL: [B.2.2, B.2.1, B.2.3], pointer-2 DTL: [A, B], pointer-2 Level 64 A C B Level 80 B.1 B.2 B.3 B.2.1 B.2.3 B.2.2

The Path Continues through B.2 Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 96 A.3.3 Level 104 A.1.2 A.3.4 A.3.1 Level 96 Level 96

Pop B.2, Push Through B.3 DTL: [B.3.4, B.3.1, B.3.3], pointer-2 DTL: [A, B], pointer-2 Level 64 A C B B.3.2 B.3.1 Level 80 B.3.3 B.1 B.2 B.3 B.3.4 B.3.5 Level 104

Move to End of B.3 DTL: [B.3.4, B.3.1, B.3.3], pointer-2 DTL: [A, B], pointer-2 Level 64 A C B B.3.2 B.3.1 Level 80 B.3.3 B.1 B.2 B.3 B.3.4 B.3.5 Level 104

Pop the Stack Pop B.3 Pop B At the destination Now stack is empty and we are done.

Send back CONNECT message

The Path Is Established Level 64 A C B A.2 Level 80 Level 96 B.1 B.2 B.3 C.1 C.2 A.1 A.3 B.1.1 B.2.1 Level 72 B.1.2 B.2.3 Source A.1.2.x B.2.2 B.3.2 B.1.3 A.2.1 B.3.1 B.3.3 Level 96 Level 96 B.3.4 A.2.2 A.2.3 B.3.5 A.1.1 A.3.2 Level 96 A.3.3 Level 104 A.1.2 A.3.4 Destination B.3.3.y A.3.1 Level 96 Level 96