Chapter 9:
WAN Technology ad Protocols
CS420/520 Axel Krings Page 1 Sequence 9
Switching Networks • Switching nodes - provide a switching facility that move data between nodes • Stations – devices attached to the network • Nodes – switching devices that provide communication • Communications network – collection of nodes • Switched communication network – data entering the network from a station are routed to the destination by being switched from node to node
CS420/520 Axel Krings Page 2 Sequence 9
1 Switching Networks • Long distance transmission is typically done over a network of switched nodes • Nodes not concerned with content of data • End devices are stations —Computer, terminal, phone, etc. • A collection of nodes and connections is a communications network • Data is routed by being switched from node to node
CS420/520 Axel Krings Page 3 Sequence 9
Nodes • Nodes may connect to other nodes only, or to stations and other nodes • Node to node links usually multiplexed • Network is usually partially connected —Some redundant connections are desirable for reliability • Two different switching technologies —Circuit switching —Packet switching
CS420/520 Axel Krings Page 4 Sequence 9
2 Simple Switched Network
CS420/520 Axel Krings Page 5 Sequence 9
Circuit Switching • Dedicated communication path between two stations • Three phases —Establish —Transfer —Disconnect • Must have switching capacity and channel capacity to establish connection • Must have intelligence to work out routing
CS420/520 Axel Krings Page 6 Sequence 9
3 Public Circuit Switched Network
CS420/520 Axel Krings Page 7 Sequence 9
a
b End office
c Trunk Intermediate exchange Trunk
End office d
Figure 9.3 Circuit Establishment
CS420/520 Axel Krings Page 8 Sequence 9
4 Circuit-Switching Technology
• Driven by applications that handle voice traffic —Key requirement is no transmission delay and no variation in delay • Efficient for analog transmission of voice signals • Inefficient for digital transmission • Transparent —Once a circuit is established it appears as a direct connection; no special logic is needed
CS420/520 Axel Krings Page 9 Sequence 9
Telecom Components • Subscriber — Devices attached to network • Subscriber line — Local Loop — Subscriber loop — Connection to network — Few km up to few tens of km • Exchange — Switching centers — End office - supports subscribers • Trunks — Branches between exchanges — Multiplexed
CS420/520 Axel Krings Page 10 Sequence 9
5 Circuit Establishment
CS420/520 Axel Krings Page 11 Sequence 9
Circuit Switch Elements
CS420/520 Axel Krings Page 12 Sequence 9
6 Circuit-Switching Concepts
CS420/520 Axel Krings Page 13 Sequence 9
Blocking or Non-blocking • Blocking —A network is unable to connect stations because all paths are in use —A blocking network allows this —Used on voice systems • Short duration calls • Non-blocking —Permits all stations to connect (in pairs) at once —Used for some data connections
CS420/520 Axel Krings Page 14 Sequence 9
7 Space Division Switching • Developed for analog environment • Separate physical paths • Crossbar switch —Number of cross-points grows in n2 —Loss of cross-point prevents connection —Inefficient use of cross-points • All stations connected, only a few cross-points in use —Non-blocking
CS420/520 Axel Krings Page 15 Sequence 9
Space Division Switch
CS420/520 Axel Krings Page 16 Sequence 9
8 Multistage Switch • Reduced number of cross-points • More than one path through network —Increased reliability • More complex control • May be blocking
CS420/520 Axel Krings Page 17 Sequence 9
Three Stage Space Division Switch
CS420/520 Axel Krings Page 18 Sequence 9
9 Interconnection Networks
• Omega Network
CS420/520 Axel Krings Page 19 Sequence 9
Interconnection Networks
• Butterflies — isomorphic to Omega (a composition of shuffle-exchange networks with programmable switches) and SW-Banyan switch — closely related to hypercube and shuffle-exchange network — number of nodes N = (k + 1)2k • this means k + 1 rows (or ranks) consisting of n = 2k nodes each — Let node(i,j) refer to the j-th node in the i-th row, where i is in [0,k] — Then node(i,j) in row i>0 is connected to two nodes in row i-1 • node(i-1,j) and node(i-1,m) where m is the integer found by inverting the i-th most significant bit in the binary representation of j. — Note that if node(i,j) is connected to node(i-1,m), then node(i,m) is connected to node(i-1,j). — Benes network is consisting of two butterflies back to back
CS420/520 Axel Krings Page 20 Sequence 9
10 Interconnection Networks
• Butterflies
row 0
row 1
row 2
row 3
CS420/520 Axel Krings Page 21 Sequence 9
Interconnection Networks
—Delta Switch Matrix • non-blocking/blocking • self routing
Hal96 fig.10.9
CS420/520 Axel Krings Page 22 Sequence 9
11 Interconnection Networks
Two extremes
Hal96 fig.10.8
CS420/520 Axel Krings Page 23 Sequence 9
Time Division Switching Ø Modern digital systems use intelligent control of space & time division elements Ø Use digital time division techniques to set up and maintain virtual circuits Ø Partition low speed bit stream into pieces that share higher speed stream Ø Individual pieces manipulated by control logic to flow from input to output
CS420/520 Axel Krings Page 24 Sequence 9
12 1 a b b a 1 I J I J I I TSI J J N N
(a) TSI Operation
Data in Data out
Write address
I a Read J b address
Data store J I
Read address I J Time slot counter Address store
(b) TSI Mechanism Figure 9.7 Time-Slot Interchange
CS420/520 Axel Krings Page 25 Sequence 9
SEL
SEL
SEL SEL
TSI
TSI
Figure 9.8 A Time-Multiplexed Switch
CS420/520 Axel Krings Page 26 Sequence 9
13 Traditional Circuit Switching
CS420/520 Axel Krings Page 27 Sequence 9
Softswitch
CS420/520 Axel Krings Page 28 Sequence 9
14 Circuit Switching • Circuit switching designed for voice —Resources dedicated to a particular call —Much of the time a data connection is idle —Data rate is fixed • Both ends must operate at the same rate
CS420/520 Axel Krings Page 29 Sequence 9
Packet Switching: • Packet switching was designed for data • Data transmitted in small packets —Typically 1000 octets —Longer messages split into series of packets —Each packet contains a portion of user data plus some control info • Control info —Routing (addressing) info • Packets are received, stored briefly (buffered) and past on to the next node —Store and forward
CS420/520 Axel Krings Page 30 Sequence 9
15 Use of Packets
CS420/520 Axel Krings Page 31 Sequence 9
Advantages • Line efficiency — Single node to node link can be shared by many packets over time — Packets queued and transmitted as fast as possible • Data rate conversion — Each station connects to the local node at its own speed — Nodes buffer data if required to equalize rates • Packets are accepted even when network is busy — Delivery may slow down • Priorities can be used
CS420/520 Axel Krings Page 32 Sequence 9
16 Switching Techniques
• Station breaks long message into packets • Packets sent one at a time to the network • Packets can be handled in two ways:
Datagram Virtual circuit
• Each packet is treated • A preplanned route is independently with no established before any reference to previous packets are sent packets
CS420/520 Axel Krings Page 33 Sequence 9
Datagram • Each packet treated independently • Packets can take any practical route • Packets may arrive out of order • Packets may go missing • Up to receiver to re-order packets and recover from missing packets
CS420/520 Axel Krings Page 34 Sequence 9
17 Datagram Diagram
CS420/520 Axel Krings Page 35 Sequence 9
Virtual Circuit • Preplanned route established before any packets sent • Call request and call accept packets establish connection (handshake) • Each packet contains a virtual circuit identifier instead of destination address • No routing decisions required for each packet • Clear request to drop circuit • Not a dedicated path
CS420/520 Axel Krings Page 36 Sequence 9
18 Virtual Circuit Diagram
CS420/520 Axel Krings Page 37 Sequence 9
Virtual Circuits vs. Datagram • Virtual circuits —Network can provide sequencing and error control —Packets are forwarded more quickly • No routing decisions to make —Less reliable • Loss of a node looses all circuits through that node • Datagram —No call setup phase • Better if few packets —More flexible • Routing can be used to avoid congested parts of the network
CS420/520 Axel Krings Page 38 Sequence 9
19 Packet Size
CS420/520 Axel Krings Page 39 Sequence 9
Circuit vs Packet Switching • Performance —Propagation delay —Transmission time —Node delay
CS420/520 Axel Krings Page 40 Sequence 9
20 Mainframe
C Personal Server computer
D
Personal B computer
Personal computer Packet-Switching E Network Personal computer A Solid line = physical link Dashed line = virtual circuit F
Figure 9.14 The Use of Virtual Circuits CS420/520 Axel Krings Page 41 Sequence 9
(a) Circuit switching (b) Virtual circuit packet switching (c) Datagram packet switching
propagation processing Call delay delay Call request request signal packet Pkt1 Call Call accept accept Pkt2 signal packet Pkt1 Pkt3 Pkt2 Pkt1 Pkt3 Pkt2 User Pkt1 data Pkt3 Pkt2 Pkt1 Acknowledge- ment signal Pkt3 Pkt2 Pkt1 Pkt3 Pkt2
Pkt3 Acknowledge- ment packet
link link link
Nodes: 1 2 3 4 1 2 3 4 1 2 3 4
Figure 9.15 Event Timing for Circuit Switching and Packet Switching CS420/520 Axel Krings Page 42 Sequence 9
21 Circuit Switching Datagram Packet Switching Virtual Circuit Packet Switching Dedicated transmission path No dedicated path No dedicated path Table Continuous transmission of Transmission of packets Transmission of packets 9.1 data Fast enough for interactive Fast enough for interactive Fast enough for interactive Messages are not stored Packets may be stored until Packets stored until delivered delivered The path is established for Route established for each Route established for entire Comparison entire conversation packet conversation of Communication Call setup delay; negligible Packet transmission delay Call setup delay; packet transmission delay transmission delay Switching Techniques Busy signal if called party Sender may be notified if Sender notified of connection busy packet not delivered denial Overload may block call Overload increases packet Overload may block call setup; no delay for established delay setup; increases packet delay calls Electromechanical or Small switching nodes Small switching nodes computerized switching nodes User responsible for message Network may be responsible Network may be responsible loss protection for individual packets for packet sequences Usually no speed or code Speed and code conversion Speed and code conversion conversion (Table can be found Fixed bandwidth Dynamic use of bandwidth Dynamic use of bandwidth on page 291 in No overhead bits after call Overhead bits in each packet Overhead bits in each packet textbook) setupCS420/520 Axel Krings Page 43 Sequence 9
Asynchronous Transfer Mode (ATM)
• A switching and multiplexing technology that employs small, fixed-length packets called cells • A fixed-size packet ensures function could be carried out efficiently, with little delay variation • Small cell size supports delay-intolerant interactive voice service with a small packetization delay • Designed to provide the performance of a circuit- switching network and the flexibility and efficiency of a packet-switching network • Standardization effort was to provide a powerful set of tools for supporting a rich QoS capability and a powerful traffic management capability
CS420/520 Axel Krings Page 44 Sequence 9
22 ATM • Commonly used by telecommunications providers to implement wide area networks • Used by many DSL implementations • Used as a backbone network technology in numerous IP networks • Multiprotocol Label Switching (MPLS) has reduced the role for ATM
CS420/520 Axel Krings Page 45 Sequence 9
Protocol Architecture (diag)
CS420/520 Axel Krings Page 46 Sequence 9
23 Virtual Channel Connection (VCC)
• Logical connection in ATM • Analogous to a virtual circuit • Basic unit of switching in an ATM network • Set up between two end users through the network, and a variable-rate, full duplex flow of fixed-size cells is exchanged over the connection • Also used for user-network exchange and network-network exchange
CS420/520 Axel Krings Page 47 Sequence 9
Virtual Path Physical Transmission Path Virtual Channels
Figure 9.16 ATM Connection Relationships
CS420/520 Axel Krings Page 48 Sequence 9
24 Virtual Path Advantages
CS420/520 Axel Krings Page 49 Sequence 9
Virtual Channel Characteristics • ITU-T Recommendation I.150 lists the following characteristics of VCCs:
Quality of service (QoS) •Specified by parameters such as cell loss ratio and cell delay variation
Switched and semipermanent VCCs •A switched VCC is an on-demand connection which requires a call control signaling for setup and tearing down •A semipermanent VCC is one that is of long duration and is set up by configuration or network management action
Cell sequence integrity •The sequence of transmitted cells within a VCC is preserved
Traffic parameter negotiation and usage monitoring •Traffic parameters can be negotiated between a user and the network for each VCC •The network monitors the input of cells to ensure that the negotiated parameters are not violated
CS420/520 Axel Krings Page 50 Sequence 9
25 ITU-T Recommendation I.150 lists the following characteristics of VPCs:
Quality of service (QoS)
Specified by parameters such as cell loss ratio and cell delay variation Characteristics Path Virtual Switched and semipermanent VPCs A switched VPC is an on-demand connection which A semipermanent VPC is one that is of long duration requires a call control signaling for setup and tearing and is set up by configuration or network management down action
Cell sequence integrity
The sequence of transmitted cells within a VPC is preserved
Traffic parameter negotiation and usage monitoring
Traffic parameters can be negotiated between a user The network monitors the input of cells to ensure that and the network for each VPC the negotiated parameters are not violated
Virtual channel identifier restriction within a VPC
One or more virtual channel identifiers, or numbers, may not be available to the user of the VPC but may be CS420/520 Axel Krings reserved for networkPage use 51 Sequence 9
Control Signaling
VCCs VPCs
• Semipermanent VCCs may be used • Can be established on a for user-to-user exchange semipermanent basis by prior — No control signaling is required agreement • If there is no preestablished call — No control signaling is required control signaling channel, then one must be set up • VPC establishment/release may — Meta-signaling channel be customer controlled • The meta-signaling channel can be — The customer uses a signaling used to set up a VCC between the VCC to request the VPC from the user and the network for call control network signaling • VPC establishment/release may — User-to-network signaling virtual be network controlled channel — The network establishes a VPC for • The meta-signaling channel can also its own convenience be used to set up a user-to-user — The path may be network-to- signaling virtual channel network, user-to-network, or user- — Such a channel must be set up within a to-user preestablished VPC
CS420/520 Axel Krings Page 52 Sequence 9
26 8 7 6 5 4 3 2 1 8 7 6 5 4 3 2 1 Virtual path identifier Generic flow control Virtual path identifier Virtual path identifier
Virtual channel identifier 5-octet Virtual channel identifier header Payload type CLP Payload type CLP
Header error control Header error control
53-octet cell Information field Information field (48 octets) (48 octets)
(a) User-Network Interface (b) Network-Network Interface
Figure 9.17 ATM Cell Format
CS420/520 Axel Krings Page 53 Sequence 9
Table 9.2
Payload Type (PT) Field Coding PT Coding Interpretation 0 0 0 User data cell, congestion not experienced, SDU-type = 0 0 0 1 User data cell, congestion not experienced, SDU-type = 1 0 1 0 User data cell, congestion experienced, SDU-type = 0 0 1 1 User data cell, congestion experienced, SDU-type = 1 1 0 0 OAM segment associated cell 1 0 1 OAM end-to-end associated cell 1 1 0 Resource management cell 1 1 1 Reserved for future function
SDU = Service Data Unit OAM = Operations, Administration, and Maintenance
CS420/520 Axel Krings Page 54 Sequence 9
27 Summary • Switched • Packet-switching communications principles networks —Switching technique • Circuit-switching —Packet size networks —External network • Circuit-switching interface concepts —Comparison of circuit switching and packet —Space division switching switching —Time-division switching • Asynchronous transfer • Softswitch architecture mode —ATM logical connections —ATM cells
CS420/520 Axel Krings Page 55 Sequence 9
28