Escolar Documentos
Profissional Documentos
Cultura Documentos
02:02:44 pm
29/09/2004 ATM - Routing - 1
Objectives
02:02:44 pm
29/09/2004 ATM - Routing - 2
In this module...
02:02:44 pm
29/09/2004 ATM - Routing - 3
Static Routing with IISP
● IISP
● PNNI
02:02:44 pm
29/09/2004 ATM - Routing - 4
Static Routing with IISP
02:02:44 pm
29/09/2004 ATM - Routing - 5
Static Routing with IISP
● Signaling requests are routed between switches using configured
address prefix tables within each switch.
● These tables are configured with the address prefixes that are
the destination ATM address against the prefix table and notes the
port with the longest prefix match.
● It then forwards the signaling request across that port using UNI
procedures.
02:02:44 pm
29/09/2004 ATM - Routing - 6
Static Routing with IISP
02:02:44 pm
29/09/2004 ATM - Routing - 7
Static Routing with IISP
02:02:44 pm
29/09/2004 ATM - Routing - 8
IISP - Advantages
02:02:44 pm
29/09/2004 ATM - Routing - 9
IISP - Limitations
Potential limitations of IISP are:
• Statically configured routes - you must manually configure each route
through the network.
• Not very scalable, due to manual configuration of address tables
• Hop-by-hop route computation - IISP uses hop-by-hop routing, where
each ATM switch that receives the connection setup message selects the
next outgoing interface to which to forward the setup message. This
selection is based on the mapping of destination addresses (in a routing
table) to outgoing interfaces.
• Limited QoS support - Statically configured routes do not permit the
flexibility in route selection that is required to meet QoS requirements.
QoS can be supported only on a single link basis.
• No crankback - The ability to crank back and recompute a route when
congestion or failure occurs is not inherent in IISP. However, redundant
or alternate paths can be configured.
02:02:44 pm
29/09/2004 ATM - Routing - 10
PNNI
02:02:44 pm
29/09/2004 ATM - Routing - 11
PNNI Signaling Features
02:02:44 pm
29/09/2004 ATM - Routing - 12
PNNI Routing Features
02:02:44 pm
29/09/2004 ATM - Routing - 13
PNNI Routing Features
• Topology state routing protocol - PNNI determines the state and
resource status of the network topology that is distributed using the
flooding mechanism.
• Automatic configuration and topology discovery - Using the
switch default ATM address, hierarchy configuration, and ILMI
address autoconfiguration, PNNI automatically determines the
addresses and links in the ATM network.
• Dynamic routing - PNNI is dynamic because it learns the network
topology and reachability information and automatically adapts to
network changes by advertising topology state information.
• Source routing - In a PNNI routing domain, the source ATM switch
computes hierarchically complete routes for connection setups. This
route information is included in the call setup signaling message.
Source routing provides the capability to support QoS requirements
and is guaranteed to be loop free.
02:02:44 pm
29/09/2004 ATM - Routing - 14
PNNI Routing Features
02:02:44 pm
29/09/2004 ATM - Routing - 15
PNNI Routing Features
• Defaults to flat network topology - For a flat network topology,
single-level PNNI offers the advantage of simple plug-and-play
network configuration. The ATM switch router is autoconfigured for
single-level PNNI.
• Support for hierarchical PNNI networks - For large or growing
networks, hierarchical PNNI uses a number of mechanisms that enable
multilevel, flexible routing hierarchies. The ability to treat a group of
switches as a single logical group node (LGN) significantly improves
scalability.
02:02:44 pm
29/09/2004 ATM - Routing - 16
PNNI Protocol Mechanisms
02:02:44 pm
29/09/2004 ATM - Routing - 17
PNNI Protocol Mechanisms
Database Synchronization
When the Hello protocol has declared a link to be functional, the
adjacent switches exchange a summary of their database contents.
The aim of this process is to compare one node’s view of the topology
with a neighboring node’s view.
By exchanging the differences, they can synchronize their databases
and both will have the same topological information.
02:02:44 pm
29/09/2004 ATM - Routing - 18
PNNI Protocol Mechanisms
PTSP Exchanges
Once database synchronization has occurred, further topology changes
must be distributed throughout the network.
PNNI does this by exchanging PNNI Topology State Packets (PTSPs),
which contain one or more PNNI Topology State Elements (PTSEs).
PTSPs are disseminated using a flooding mechanism
02:02:44 pm
29/09/2004 ATM - Routing - 19
PNNI Protocol Mechanisms
PTSP Exchanges
Once database synchronization has occurred, further topology changes
must be distributed throughout the network.
PNNI does this by exchanging PNNI Topology State Packets (PTSPs),
which contain one or more PNNI Topology State Elements (PTSEs).
PTSPs are disseminated using a flooding mechanism and ensure that
the network is updated when significant changes occur.
In addition to reachability, link-status, and node-status information,
PTSPs also carry resource information necessary for the Generic
Connection Admission Control (GCAC) algorithm to calculate paths
based on QoS requirements. This information is packaged in a format
called Resource Availability Information Group (RAIG).
The RAIG contains information such as what service categories are
supported, what is the available cell rate for each category, and so on.
02:02:44 pm
29/09/2004 ATM - Routing - 20
PNNI Protocol Mechanisms
Reachability Information
PNNI can summarize address reachability information by aggregating
multiple ATM addresses into a single prefix.
This is required to support a hierarchical organization of the topology
and allows PNNI to scale for very large networks.
Reachability information is the first step in routing a PNNI request for
a connection. The connection is directed to a node that advertises a
prefix that matches the leading portion of the destination address.
The connection always uses the longest matching advertisement.
Reachable addresses are advertised with one of two parameters:
• Internally reachable ATM addresses—this parameter describes
internally reachable destinations, which are “known to PNNI to be
local.”
• Externally reachable ATM addresses—this parameter describes the
reachability of a set of ATM destinations. The implication of using an
exterior advertisement is that information about reachability came
from elsewhere, such as an IISP link to another network.
02:02:44 pm
29/09/2004 ATM - Routing - 21
PNNI Protocol Mechanisms
Metrics and Attributes for Links and Nodes
To support QoS routing, the status of links and nodes is advertised using
metrics and attributes.
Attributes are treated differently. If one attribute value violates the QoS
constraint of the call request, that topological element (node or link) is
eliminated from the path selection.
02:02:44 pm
29/09/2004 ATM - Routing - 22
PNNI Protocol Mechanisms
Metrics and Attributes for Links and Nodes
The metrics that are advertised and used in path computation are as follows:
• Administrative weight—the primary metric used by PNNI to compute paths.
This the sum of the weights of all links and nodes along the path. Default value
assigned is 5040, can be manually configured to nondefault values and affects
the way PNNI selects paths in a private ATM network.
• Maximum cell transfer delay (MCTD)—the sum of the fixed-delay component
across the link or node and the cell delay variation (CDV). MCTD is a required
topology metric for the CBR and VBR-RT service categories; it is an optional
metric for VBR-NRT.
• Cell delay variation (CDV)—the maximum, peak-to-peak cell delay variation
across a link or node for a specific service category. This metric represents the
worst case for a path.
02:02:44 pm
29/09/2004 ATM - Routing - 23
PNNI Protocol Mechanisms
Metrics and Attributes for Links and Nodes
The attributes that are advertised for links and nodes are as follows:
• Available cell rate (AvCR)—the amount of equivalent bandwidth currently
available on the link. AvCR is a dynamic attribute that varies according to the
calls traversing the link and the resulting residual link capacity available for
additional calls. AvCR is required to arbitrate whether a given link or node is
suitable to carry a given call. On ATM switch this arbitration is done by the
GCAC mechanism.
• Cell loss ratio (CLR)—ratio of number of lost cells to the total number of cells
transmitted on a link or node.
• Maximum cell rate (MaxCR)—the amount of bandwidth assigned to a specific
traffic class on a link. In the PNNI protocol the MaxCR attribute is considered
optional.
02:02:44 pm
29/09/2004 ATM - Routing - 24
PNNI Protocol Mechanisms
Metrics and Attributes for Links and Nodes
02:02:44 pm
29/09/2004 ATM - Routing - 25
PNNI Protocol Mechanisms
Connection Admission Control
The final decision regarding whether a call can proceed over a given link
is made at the node’s own Connection Admission Control (CAC), a
function that evaluates only the local resources and determines whether it
has sufficient bandwidth to meet the call’s QoS requirements.
The CAC algorithm, which varies in its particulars from vendor to
vendor, first calculates available resources by subtracting the resources
currently in use from the total resources.
It then compares the requirements of the call’s setup request to the
remaining resources and makes a determination.
02:02:44 pm
29/09/2004 ATM - Routing - 26
PNNI Protocol Mechanisms
Generic Connection Admission Control (GCAC)
Because the source node in a source-routed network must determine the
entire path of the call, it must have a view of the reachability and resource
information for the entire network.
CAC alone cannot provide this, as CAC is a local function. Also, CAC
implementations vary from vendor to vendor and might not provide
comparable information in all cases.
To solve these problems, PNNI provides for GCAC, a more general
algorithm for calculating routing resources. GCAC gets its resource
information from the RAIGs distributed during PTSP flooding.
The ATM switch supports two flavors of GCAC.
The first, simple GCAC, requires advertisement of only AvCR.
The second, complex GCAC, uses two additional parameters that can
optionally be advertised, cell rate margin (CRM) and variance factor.
02:02:44 pm
29/09/2004 ATM - Routing - 27
PNNI Routing
02:02:44 pm
29/09/2004 ATM - Routing - 28
PNNI Routing
02:02:45 pm
29/09/2004 ATM - Routing - 29
PNNI Crankback
PNNI employs a crankback mechanism to reroute a call that fails CAC at any
point in the path specified by the DTL.
Crankback improves the call setup success rate, which can be limited by the
lack of a complete view of the network topology, due to summarization of
information.
Crankback also provides immediate alternate rerouting without the delay
inherent in waiting for topological updates that can take time to propagate
through the network.
For crankback, a message is returned to the node that generated the DTL, which
includes crankback information about the cause and location of the problem.
If the call is retried, PNNI prevents the failing node or link from being
considered when it generates an alternate path. This process might occur several
times before a successful path is found, or a determination is made that there is
no suitable path.
02:02:45 pm
29/09/2004 ATM - Routing - 30
PNNI Crankback
02:02:45 pm
29/09/2004 ATM - Routing - 31
Single-level PNNI
02:02:45 pm
29/09/2004 ATM - Routing - 32
Single-level PNNI
02:02:45 pm
29/09/2004 ATM - Routing - 34
Components of PNNI hierarchy
• Lowest-level nodes—A logical node in the lowest level of a PNNI
hierarchy. A logical node exists on a switch or switching system.
• Peer group—A group of interconnected logical nodes at the same
hierarchy level. Lowest level nodes and LGNs can reside within the
same peer group as long as they are at the same hierarchy level.
Each node exchanges information with other members of the group,
and all members maintain an identical view of the group.
• Peer group leader (PGL)—For hierarchical networks, one logical
node within the peer group is elected to be the PGL. Upon
becoming a PGL, the PGL creates a parent LGN to represent the
peer group as a single logical node at the next level. The PGL
summarizes information from the entire peer group and passes the
information to the parent LGN.
• Logical group node (LGN)—A logical node that represents its
lower level peer group in the next higher level peer group.
Information summarized by the lower level PGL is advertised at the
higher level by the LGN.
02:02:45 pm
29/09/2004 ATM - Routing - 35
Components of PNNI hierarchy
Each node in a given peer group shares complete and identical information about the peer
group’s topology.
As the flat network is migrated to a hierarchical network, aggregation of topological and
reachability information reduces exponentially the number of nodes, links, and reachable
address prefixes visible from any one ATM switch in the network.
02:02:45 pm
29/09/2004 ATM - Routing - 36
Components of PNNI hierarchy
02:02:45 pm
29/09/2004 ATM - Routing - 37
Topology Aggregation
02:02:45 pm
29/09/2004 ATM - Routing - 38
Advantages of PNNI Hierarchy
02:02:45 pm
29/09/2004 ATM - Routing - 39
Limitations of PNNI Hierarchy
02:02:46 pm
29/09/2004 ATM - Routing - 40
That's all, folks!!
...till we meet again...
02:02:46 pm
29/09/2004 ATM - Routing - 41