Page 1
Chapter 2.6: Wide Area Networks
• Bridge larger distances than a LAN, usage e.g. within the city range or on a campus.
• Only one or two cables, no switching elements. Thus a simple network design is achieved. • All computers are attached to a broadcast
medium.
• Distinction between LAN and MAN: The utilization of a clock pulse, geographical distance.
MAN
Examples:
• Distributed Queue Dual Bus (DQDB) • Gigabit Ethernet
Metropolitan Area Networks
Page 2
Chapter 2.6: Wide Area Networks
Distributed Queue Dual Bus (DQDB)
Basic principle:
• Twounidirectional busses (simple cables) are attached to all computers:
….
1 2 3 N
• Each bus is responsible for the communication into one direction
• Each bus has a head-end, which controls all transmission activities: a constant flow of slots of size 53 byte is produced each 125µs.
• Utilizable data field of each slot: 48 byte
• Two substantial protocol bits: Busy for marking a slot as occupied, Request for the registration of a slot inquiry
• Expansion to 100 km permissible
• Data rates up to 150 MBit/s (optical fiber; with coaxial cables only 44 MBit/s) Head-end
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 3
Chapter 2.6: Wide Area Networks
DQDB - Transmission principle
• During a transmission the sending station must know whether the receiver is on the left or the right side.
• Before starting a transmission in one direction, a slot has to be reserved. This is made by sending a reservation request in the opposite direction.
• Simulation of a FIFO queue in order to consider stations in the order of their communication requests:
– Each station manages two counters: RC (Request Counter) and CD (Countdown Counter)
– RC counts the number of transmission wishes of downward located stations, which arrived before the own transmission wish.
– CD serves as auxiliary counter. If a station wants to send, it generates an inquiry setting a special Request bit in a slot in opposite direction. The current value of RC is copied into CD (the station may occupy only the RC+1stcell).
– RC is set to 0 and counts the number of further coming communication wishes. With each free slot passing in communication direction, CD is counted down by one. If CD = 0, the station may send. If it has now a new communication wish, it must again wait for RC slots.
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 4
Chapter 2.6: Wide Area Networks
RC = 0 CD = 0 RC = 0 CD = 0 RC = 0 CD = 0 RC = 0 CD = 0 RC = 0 CD = 0 A B C D E RC = 0 CD = 0 RC = 0 CD = 0 RC = 1 CD = 0 RC = 1 CD = 0 RC = 1 CD = 0 A B C D E RC = 0 CD = 0 RC = 0 CD = 0 RC = 1 CD = 0 RC = 0 CD = 1 RC = 2 CD = 0 A B C D E Req
Communication direction in question
1. System is in the initial state. All counters are set to zero.
2. D wants to initiate a communication. In the counter direction, a Req is dispatched. The stations on the way increase RC by 1. 3. B also wants to use the
bus. A increases RC by 1, B copies RC into CD.
Req
Page 5
Chapter 2.6: Wide Area Networks
RC = 0 CD = 0 RC = 0 CD = 0 RC = 0 CD = 0 RC = 0 CD = 0 RC = 1 CD = 0 A B C D E RC = 0 CD = 0 RC = 0 CD = 0 RC = 0 CD = 0 RC = 0 CD = 0 RC = 0 CD = 0 A B C D E
4. The head-end of the communication bus produces slots. Each station counts down RC by one with each passing cell, stations with CD > 0 count down
CD. Station D wants to
send and has CD = 0, by this it has sending permission.
DATA
DATA
5. With the next slot, station B has a CD = 0 and may send.
DQDB - Example
Page 6
Chapter 2.6: Wide Area Networks
Access Control Virtual Channel Identifier Payload Type Data Bit 8 20 2 2 8 384 (48 byte) Header Check Sequence Segment Priority Access Control
• Control of the access to the busses
• Differentiates between normal and permanently reserved slots
Virtual Channel Identifier
• Contains the channel number of the corresponding connection
Payload type
• Differentiates between user data (00) and control data
Segment Priority
• Not defined yet (and thus never defined any more...)
Header Check Sequence
• Checksum which can correct single bit errors and detect multiple bit errors (header only, data are not checked)
DQDB - Slot format
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Busy Slot Type PSR
Bit 1 1 1 2 3
Request for future
use
Access Control
Coordination of bus access:
• Busy indicates whether the slot is occupied
• Slot Type differentiates between normally to reserve and firmly reserved slot • Previous Slot Cleared (PSR): contents of the preceding slot may be deleted.
This allows Slot Reuse: if e.g. station A sends to station B, a slot would be blocked along the whole bus. Thus the receiver can set this bit to indicate that the following stations can re-use the slot.
• Request is used for reservations regarding the counter direction
DQDB never became generally accepted, since short time later ATM was introduced.
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Wide Area Networks
WAN
Examples: • Frame Relay
• Asynchronous Transfer Mode, ATM • Synchronous Digital Hierarchy, SDH • Bridging of any distance
• Usually for covering of a country or a continent • Topology normally is irregular due to orientation to
current needs. Therefore not the shared access to a medium is the core idea, but the thought “how to achieve the fast and reliable transmission of as much data as possible over a long distance”.
• Usually quite complex interconnections of sub-networks which are owned by different operators • No broadcast, but
point-to-point connections • Range: several 1000 km
Page 9
Chapter 2.6: Wide Area Networks
Transmission Technologies for WANs
Point-to-Point Links
• Provision of a single WAN connection from a customer to a remote network • Example: telephone lines. Usually communication resources are leased from
the provider.
• Accounting bases on the leased capacity and the distance to the receiver.
Circuit Switching
• A connection is established when required, communication resources are reserved exclusively. After the communication process, the resources are released.
• Example: Integrated Services Digital Network, ISDN Packet Switching
• “Enhancement” of the “Circuit Switching” and the Point-to-Point links. • Shared usage of the resources of one provider by several users, i.e. one
physical connection is used by several virtual resources. • Shared usage reduces costs
Page 10
Chapter 2.6: Wide Area Networks
Packet Switching
Packet Switching today is the most common communication technology in WANs. The provider of communication resources provides virtual connections (virtual circuits, circuit switching) between remote stations/networks, the data are transferred in the form of packets.
Examples: Frame Relay, ATM, OSI X.25 Two types of Virtual Circuits:
• Switched Virtual Circuits (SVCs)
Useful for senders with sporadic transmission wishes. A virtual connection is established, data are being transferred, after the transmission the connection is terminated and the ressources are being released.
• Permanent Virtual Circuits (PVCs)
Useful for senders which need to transfer data permanently. The connection is established permanently, there exists only the phase of the data transfer.
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 11
Chapter 2.6: Wide Area Networks
Frame Relay
• Based on Packet Switching, i.e. the transmission of data packets
• Originally designed for the use between ISDN devices, usage has spread further • The packets can have variable length
• Statistic Multiplexing (i.e. “mixing” of different data streams) for controlling the network access. This enables a flexible, efficient use of the bandwidth available. • A first standardization took place 1984 by the CCITT. However, it did not supply a
complete specification.
• Therefore in 1990 Northern Telecom, StrataCom, Cisco, and DEC formed a consortium that build up upon the incomplete specification and developed some extensions to Frame Relay which should make a usage in the complex Internet environment possible. These extensions were called Local Management Interface
(LMI). Due to their success, ANSI and CCITT standardized own LMI variants.
• Frame Relay finally became internationally standardized by the ITU-T, in the USA by ANSI.
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 12
Chapter 2.6: Wide Area Networks
Structure of Frame Relay
Purpose: simple, connection-oriented technology for economic transmission of data
with acceptable speed
• Data transmission rates of 56 KBit/s up to 45 MBit/s can be leased
• Mostly used for permanent virtual connections for which no signaling for the connection establishment is necessary
Two general device categories can be differentiated:
• Data Terminal Equipment (DTE): typically in the possession of the end user, for example PC, router, bridges,…
• Data Circuit-Terminating Equipment (DCE): in the possession of a provider. DCEs realize the transmission process. Usually they are implemented as packet switches.
DCE DTE
DTE
Page 13
Chapter 2.6: Wide Area Networks
Communication within Frame Relay
Frame Relay offers connection-oriented communication on the LLC layer:
• Between two DTEs a virtual connection is established. It is identified by a unique connection identifier (Data-Link Connection Identifier, DLCI). Note: DLCIs only refer to one hop, not to the entire connection; in addition they are only unique in a LAN, not globally:
• The virtual connection offers a bi-directional communication path.
• Several virtual connections can be multiplexed to a single physical connection (reduction of equipment and network complexity).
• Frame Relay offers the possibility to use both SVCs and PVCs. • Small protocol overhead, high data transmission rates
DTE DTE DLCI DLCI 12 62 89 22 36 62 45 27
Page 14
Chapter 2.6: Wide Area Networks
Flow Control within Frame Relay
• Frame Relay does not possess an own flow control mechanism for controlling the traffic of each virtual connection.
• Frame Relay is used typically on reliable network media, therefore flow control can be left over to higher layers.
• Instead : Notification mechanism (Congestion Notification) to report bottle-necks to higher protocol layers, if a control mechanism on a higher layer is implemented.
There are two mechanisms for the Congestion Notification: • Forward-Explicit Congestion Notification (FECN)
initiated, when a DTE sends frames into the network
In case of overload, the DCEs in the network set a special FECN bit to 1 If the frame arrives at the receiver with set FECN bit, it recognizes that an
overload on the virtual connection is present • Backward-Explicit Congestion Notification (BECN)
Similarly to FECN, but the BECN bit is set in frames which are transmitted in the opposite direction from frames with set FECN bit
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
ATM for the Integration of Data and
Telecommunication
Data communication::
Primary goal: Data transfer
• Connectionless
• Flexible dispatching of resources • No performance guarantees • Efficient use of resources • Variable end-to-end delay Telecommunication::
Primary goal: Telephony
• Connection-oriented
• Firm dispatching of resources • Performance guarantees • Unused resources are lost • Small end-to-end delay
bandwidth allocation
t Time Division Multiplexing
bandwidth allocation
t Statistical Multiplexing
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Characteristics of ATM
ITU-T standard (resp. ATM forum) for cell transmission Integration of data, speech, and video transmissions Combines advantages of:
- Circuit Switching (granted capacity and constant delay) - Packet Switching (flexible and efficient transmission) Cell-based Multiplexing and Switching technology
Connection-oriented communication: virtual connections are established
Guarantee of quality criteria for the desired connection (bandwidth, delay,…). For doing so, resources are being reserved in the switches.
no flow control and error handling
Supports PVCs, SVCs and connection-less transmission Data rates: 34, 155 or 622 (optical fiber) MBit/s
Page 17
Chapter 2.6: Wide Area Networks
ATM Cells
Cell header Payload
Cell multiplexing on an ATM connection:
1 2 2 3 3 2 2 3 3 1
• No packet switching, but
cell switching: like time
division multiplexing, but without reserved time slots • Firm cell size: 53 byte
5 byte 48 byte
empty cell
• Asynchronous time multiplexing of several virtual connections
• Continuous cell stream • Unused cells are sent empty
• Within overload situations, cells are discarded
Page 18
Chapter 2.6: Wide Area Networks
Cell Size: Transmission of Speech
Coding audio: Pulse-code modulation (PCM)• Transformation of analogous into digital signals
• regular scanning of the analogous signal
• Scanning theorem (Nyquist): Scanning rate≥2 * cutoff frequency of the original signal Cutoff frequency of a telephone: 3.4 kHz
⇒scanning rate of 8000 Hz • Each value is quantized with 8
bits (i.e. a little bit rounded). • A speech data stream therefore
has a data rate of 8 bits * 8000 s-1= 64 kBit/s + 4 + 3 + 2 + 1 - 1 - 2 - 3 - 4 Quant iz at ion ran g e Interval number Binary code 111 110 101 100 000 001 010 011 Time Scanning Intervals T
produced pulse code Origin signal
Reconstructed signal
Scanning error
1 0 0 1 0 1 1 1 1 1 1 1 1 0 0 0 1 0 0 1 1 0 0 1
Example (simplification: Quantization with 3 bits)
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 19
Chapter 2.6: Wide Area Networks
Cell Size within ATM
Problem:
Delay of the cell stream for speech is 6 ms: 48 samples with 8 bits each
= 48 byte
= Payload for an ATM cell
⇒ Larger cells would cause too large delays during speech transmission
⇒ Smaller cells produce too much overhead for “normal” data (relationship Header/Payload) i.e. 48 byte is a compromise.
t=125µs
TD= 6 ms Continuous data stream with scanning rate 1/125µs 48+5 64+5 32+4 header packetisation 100% 50% 5ms 10ms 0 20 40 60 80 delay overhead
cell size [bytes]
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 20
Chapter 2.6: Wide Area Networks
ATM Network
ATM network ATM switch ATM Endpoints Workstation LAN switch RouterTwo types of components: • ATM Switch
Dispatching of cells through the network by switches. The cell headers of incoming cells are read and an update of the information is made. Afterwards, the cells are switched to the destination.
• ATM Endpoint
Contains an ATM network interface adapter to connect different networks with the ATM network.
Page 21
Chapter 2.6: Wide Area Networks
Structure of ATM cells
GFC - Generic Flow Control
Only with UNI, for local control of the transmission of data into the network. Typically unused. With NNI
these bits are used to increase the VPI field.
PTI - Payload Type Identifier
Describes content of the data part, e.g. user data or different control data
CLP - Cell Loss Priority
If the bit is 1, the cell can be discarded within overload situations.
HEC - Header Error Control
CRC for the first 4 bytes; single bit errors can be corrected. Two header formats:
• Communication between switches and endpoints: User-Network Interface (UNI) • Communication between two switches: Network-Network Interface (NNI)
VCI VCI Bit Bit Bit 888 777 666 555 444 333 222 111 Byte 1
Byte 1 VPIVPI
Byte 2
Byte 2 VPIVPI Byte 3
Byte 3
Byte 4
Byte 4 PTIPTI CLPCLP
Byte 5
Byte 5 HECHEC
GFC/VPI
Page 22
Chapter 2.6: Wide Area Networks
Connection Establishment in ATM
Establish connection to 23.0074.4792.783c.7782.7845.0092.428c.c00c.1102.01 ATM address 23.0074.4792.783c. 7782.7845.0092.42 8c.c00c.1102.01 EC EC EC EC OK OK OK OK
• The sender sends a connection establishment request to its ATM switch, containing ATM address of the receiver and demands about the quality of the transmission.
• The ATM switch decides on the route, establishes a virtual connection (assigning a connection identifier) to the next ATM switch and forwards (using cells) the request to this next switch.
• When the request reaches the receiver, it sends back the established path and acknowledgement.
• After establishment, ATM addresses are no longer needed, only virtual connection identifiers are used.
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
ATM Switching
Before the start of the communication a virtual connection has to established. The switches are responsible for the forwarding of arriving cells on the correct outgoing lines. For this purpose a switch has a switching table.
... 1 2 n ... 1 2 n Switching Tabelle Eingang 1 2 n Ausgang n n 2 ... ... Header a d e ... Neuer Header a c b ... Alter Switch Eingangsleitungen Ausgangsleitungen
The header information, which are used in the switching table, are VPI(Virtual
Path Identifier) and VCI(Virtual Channel Identifier).
If a connection is being established via ATM, VPI and VCI are assigned to the sender. Each switch on the route fills in to where it should forward cells with this information.
Incoming lines Outgoing lines
Switching Table In Old Out Header New Header
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Path and Channel Concept of ATM
VCI 1 VCI 2 VCI 3 VCI 4 VCI 5 VCI 6 VCI 5 VCI 6 VCI 3 VCI 4 VCI 1 VCI 2 VPI 1 VPI 6 VP Switch VPI 2 VPI 3 VPI 4 VPI 5
Virtual Path Switching
VC Switch VCI 1 VCI 2 VCI 2 VCI 4 VPI 1 VPI 2 VPI 3
Virtual Channel Switching
VCI 4 VCI 3
VP-SWITCH VP/VC-SWITCH
There are 2 types of switches in the ATM network:
Physical connections “contain”Virtual Paths(VPs, a group of connections) VPs “contain”Virtual Channels(VCs, logical channels)
VPI and VCI only have local significance and can be changed by the switches. Distinction between VPI and VCI introduces a hierarchy on the path identifiers.
Page 25
Chapter 2.6: Wide Area Networks
Layers within ATM
Higher Layers ATM Adaptation Layer ATM Layer Physical Layer ATM Layer Physical Layer ATM Layer Physical Layer ATM Layer Physical Layer Higher Layers ATM Adaptation Layer Station Switch Switch Station Physical Layer
• Transfers ATM cells over the medium
• Generates checksum (sender) and verifies it (receiver); discarding of cells
ATM Layer
• Generate header (sender) and extract contents (receiver), except checksum • Responsible for connection identifiers (Virtual Path and Virtual Channel Identifier)
ATM Adaptation Layer (AAL)
• Adapts different requirements of higher layer applications to the ATM Layer • Segments larger messages and reassembles them on the side of the receiver
Page 26
Chapter 2.6: Wide Area Networks
Service Classes of ATM
Criterion Service Class
A B C D
Data rate Negotiated maximum cell rate Maximum and average Cell rate Dynamic rate adjustment to free resources “Take what you can get” Synchronization
(source - destination) Yes No
Bit rate constant variable
Connection
Mode Connection-oriented Connectionless
• Moving pictures • Telephony • Video conferences • Data communication • File transfer • Mail Applications:
Adaptation Layer (AAL): AAL 3 AAL 4
AAL 5
AAL 1 AAL 2
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 27
Chapter 2.6: Wide Area Networks
AAL 1: CBR - Constant Bit Rate, deterministic service • Characterized by guaranteed fixed bit rate • Parameter: Peak Cell Rate (PCR)
AAL 2: VBR - Variable Bit Rate (real time/non real time), statistical service
• Characterized by guaranteed average bit rate. Thus also suited for bursty traffic.
• Parameter: Peak Cell Rate (PCR), Sustainable Cell Rate (SCR), Maximum Burst Size
AAL 3: ABR - Available Bit Rate, load-sensitive service • Characterized by guaranteed minimum bit rate and
load-sensitive, additional bit rate (adaptive adjustment) • Parameter: Peak Cell Rate, Minimum Cell Rate AAL 4: UBR - Unspecified Bit Rate, Best Effort service • Characterized by no guaranteed bit rate
• Parameter: Peak Cell Rate
Time Load PCR Time Load PCR SCR Time Load ABR/ UBR Other connec-tions
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 28
Chapter 2.6: Wide Area Networks
Traffic Management
Connection Admission Control (CAC)
• Reservation of resources during the connection establishment (signaling) • Comparison between connection parameters and available resources • Traffic contract between users and ATM network
Connection Admission Control (CAC)
• Reservation of resources during the connection establishment (signaling) • Comparison between connection parameters and available resources • Traffic contract between users and ATM network
Usage Parameter Control/Network Parameter Control
• Test on conformity of the cell stream in accordance with the parameters of the traffic contract at the user-network interface (UNI) or network-network interface (NNI) • Generic Cell Rate Algorithm/Leaky Bucket Algorithm
Usage Parameter Control/Network Parameter Control
• Test on conformity of the cell stream in accordance with the parameters of the traffic contract at the user-network interface (UNI) or network-network interface (NNI) • Generic Cell Rate Algorithm/Leaky Bucket Algorithm
Switch Congestion Control(primary for UBR)
• Selective discarding of cells for the maintenance of performance guarantees in the case of overload
Switch Congestion Control(primary for UBR)
• Selective discarding of cells for the maintenance of performance guarantees in the case of overload
Flow Control for ABR
• Feedback of the network status by resource management cells to the ABR source, for the adjustment of transmission rate and fair dispatching of the capacity
Flow Control for ABR
• Feedback of the network status by resource management cells to the ABR source, for the adjustment of transmission rate and fair dispatching of the capacity
Page 29
Chapter 2.6: Wide Area Networks
Integration of ATM into Existing Networks
What does ATM provide?• ATM offers an interface to higher layers (similar to TCP in the Internet protocols). • ATM additionally offers QoS guarantees (Quality of Service).
ATM had problems during its introduction:
• Very few applications which build directly upon ATM. • In the interworking of networks, TCP/IP was standard. • Without TCP/IP binding, ATM could not be sold! Therefore different solutions for ATM were suggested, e.g. • IP over ATM (IETF)
• LAN emulation (LANE, ATM forum)
Page 30
Chapter 2.6: Wide Area Networks
Ethernet and ATM
ATM::
Primary goal: Integration, QoS
QoS guarantees Separation of data streams by logical separation Prioritization of real-time flows Connection Admission Control protects active connectionsHigh cost
Scalable capacity
QoS guarantees Separation of data streams by logical separation Prioritization of real-time flows Connection Admission Controlprotects active connections High cost
Scalable capacity Fast/Gigabit Ethernet::
Primary goal: Capacity No QoS guarantees
Separation of traffic streams by physical separation (router, switch, links)
No prioritization of data streams
No protection against competitive traffic
Low cost Very high capacityNo QoS guarantees
Separation of traffic streams by physical separation (router, switch, links)
No prioritization of data streams No protection against competitive
traffic
Low cost Very high capacityLehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Future of ATM
ATM within LAN:
• Too high cost of the hardware
• Too strong competition by established techniques like Fast Ethernet etc. ATM within WAN:
• often implemented between company locations
• Telecommunication providers prefer SDH as transport resp. core networks (better performance for telecommunications, world standard) • ATM cells can be packed into SDH containers at transition points
(encapsulation) resp. unpacked at the receiving network. Does ATM have still a future?
• probably: No!
• ATM was replaced to a large extent by SDH.
• Newest research proceeds even from a direct use of the fiber by higher protocols.
• ATM is only offered to users as a service, in order to be able to further use existing devices and mechanisms.
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Synchronous Digital Hierarchy (SDH)
All modern networks in the public area are using the SDH technology
Example: the German B-WIN (ATM) was replaced by the G-WIN (Gigabit-Wissenschaftsnetz) Also used within the MAN range
(Replaced by Gigabit Ethernet?) Analogous technology in the USA:
Synchronous Optical Network (SONET)
Stuttgart Leipzig Berlin Frankfurt Karlsruhe Garching Kiel Braunschweig Dresden Aachen Regensburg Kaiserslautern Augsburg Bielefeld Hannover Erlangen Heidelberg Ilmenau Würzburg Magdeburg Marburg Göttingen Oldenburg Essen St.Augustin Rostock Global Upstream GEANT Hamburg
Core Node
10 Gbit/s 2,4 Gbit/s 2,4 Gbit 622 Mbit/sPage 33
Chapter 2.6: Wide Area Networks
SDH Structure
• SDH realizes higher data rates than ATM (at the moment up to about 40 GBit/s) • Flexible capacity utilization and high reliability
• Structure: arbitrary topology, meshed networks with a switching hierarchy (exemplarily 3 levels): 2,5 GBit/s 155 MBit/s 155 MBit/s 2 MBit/s S y nchr ono us D igit a l Hi erarch y (SDH) Local networks
Regional switching centers Supraregional switching
34 MBit/s SDH Cross Connect
Add/Drop Multiplexer
Page 34
Chapter 2.6: Wide Area Networks
Multiplexing within SDH
2 MBit/s,34 MBit/s,…
155 MBit/s 622 MBit/s 2.5 GBit/s 10 GBit/s
+ control information for signaling
155 MBit/s 622 MBit/s 34 MBit/s 622 MBit/s 2 MBit/s 2 MBit/s SDH Cross Connect Switching center Switching center
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 35
Chapter 2.6: Wide Area Networks
Characteristics of SDH
• World-wide standardized bit rates on the hierarchy levels • Synchronized, centrally clocked network
• Multiplexing of data streams is made byte by byte, simple multiplex pattern • Suitability for speech transmission:
since on each hierarchy level four data streams are mixed byte by byte and a hierarchy level has four times the data rate of the lower level, everyone of these mixed data streams has the same data rate as on the lower level. Thus the data experience a constant delay.
• Direct access to signals by cross connects without repeated demultiplexing • Short delays in inserting and extracting signals
• Additional control bytes for network management, service and quality control,…
• Substantial characteristic: Container for the transport of information
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 36
Chapter 2.6: Wide Area Networks
SDH Transport Module (Frame)
Synchronous Transport Module (STM-N, N=1,4,16, 64)
Payload 9 x N columns (bytes) 261 x N columns (bytes) Regenerator Section
Overhead (RSOH)
Administrative Unit Pointers
Multiplex Section Overhead (MSOH) 9 lines 1 3 4 5 9 Administrative Unit Pointers
• permit the direct access to components of the Payload Section Overhead
• RSOH: Contains information concerning the route between two repeaters or a repeater and a multiplexer
• MSOH: Contains information concerning the route between two multiplexers without consideration of the repeaters in between.
Payload
• Contains the utilizable data as well as further control data STM-1 structure:
• 9 lines with 270 bytes each.
• Basis data rate of 155
Page 37
Chapter 2.6: Wide Area Networks
Creation of a STM
• Utilizable data are packed into a container.
• A distinction of the containers is made by size: C-1 to C-4
• Payload data are adapted if necessary by padding to the container size
• As additional information to the utilizable data, for a connection further bytes are added for controlling the data flow of a container over several multiplexers:
Path Overhead (POH)
• Control of single sections of the transmission path • Change over to alternative routes in case of an error • Monitoring and recording of the transmission quality • Realization of communication channels for maintenance • By adding the POH bytes, a container becomes a Virtual container
Page 38
Chapter 2.6: Wide Area Networks
Creation of a STM
• If several containers are transferred in a STM payload, these are multiplexed byte by byte in Tributary Unit Groups.
• By adding an Administrative Unit Pointer, the Tributary Unit Group becomes an Administrative Unit (AU).
• Then the SOH bytes are supplemented, the SDH frame is complete. RSOH and MSOH contain for example bits for
Frame synchronization Error detection (parity bit)
STM-1 identificators in larger transportation modules Control of alternative paths
Service channels
… and some bits for future use.
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
SDH Hierarchy
STM-1 STM-4 STM-16
155 MBit/s 622 MBit/s 2.5 GBit/s
4 x STM-4 4 x STM-1
4 x STM-1
Basis transportation module for 155 MBit/s, e.g. contains:
• a continuous ATM cell stream (C-4 container),
• a transportation group (TUG-3) for three 34 MBit/s PCM systems, or
• a transportation group (TUG-3) for three containers, which again contain TUGs 9 4x9=36 261 4x261=1044 4x36=144 4x1044=4176 Assembled from Assembled from Assembled from
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
SDH Hierarchy
• Higher hierarchy levels assembling STM-1 modules
• Higher data rates are assembled by multiplexing the contained signals byte by byte
• Each byte has a data rate suitable by 64 KBit/s, for the transmission of speech data (telephony)
• Except STM-1, only transmission over optical fiber is specified
9 columns
261 byte
4 * 261 byte 4 * 9 columns
Page 41
Chapter 2.6: Wide Area Networks
Types of SDH Containers
H4
VC-4 Path Overhead (POH) C-4 VC-4 Payload 2 3 TUG-3 1 VC-3 or Container, C-n (n=1 to 4)
• Defined unit for payload capacity (e.g. C-4 for ATM or IP, C-12 for ISDN or 2 MBit/s)
• Transfers all SDH bit rates • Capacity can be made available
for transport from broadband signals not yet specified
Virtual Container, VC-n (n=1 to 4)
• Consists of container and POH • Lower VC (n=1,2): single C-n plus basis
Virtual Container Path Overhead (POH) • Higher VC (n=3,4): single C-n, union
of TUG-2s/TU-3s, plus basis Virtual Container POH C-n Container n
VC-n Virtual Container n TU-n Tributary Unit n TUG-n Tributary Unit Group n
Tributary Unit, n (n=1 to 3)
• Contains VC-n and Tributary Unit Pointer
Page 42
Chapter 2.6: Wide Area Networks
Types of SDH Containers
VC-3 1 2 3 4 5 6 7 1 2 3 TUG-2 VC-12 TUG-12 C-12 VC-2 or TU-3 C-3Administrative Unit n (AU-n)
• Adaptation between higher order path layer and multiplex unit • Consists of payload and
Administrative Unit Pointers C-n Container n VC-n Virtual Container n TU-n Tributary Unit n TUG-n Tributary Unit Group n AU-n Administrative Unit n STM-N Synchronous
Transport Module N
Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 43
Chapter 2.6: Wide Area Networks
SDH Multiplex Structure
STM-N AUG AU-4 VC-4 C-4 TUG-3 TU-3 AU-3 VC-3 VC-3 C-3 TUG-2 TU-2 VC-2 C-2 TU-12 VC-12 C-12 TU-11 VC-11 C-11 x N x 3 x 7 x 7 x 3 x 3 x 4 139 264 kBit/s 44 736 kBit/s 34 368 kBit/s 6312 kBit/s 2048 kBit/s 1544 kBit/s Pointer Processing Multiplexing C-n Container n VC-n Virtual container n TU-N Tributary Unit n TUG-n Tributary Unit Group n AU-n Administrative Unit n AUG Administrative Unit Group STM-N Synchronous Transport Module NLehrstuhl für Informatik 4
Kommunikation und verteilte Systeme
Page 44
Chapter 2.6: Wide Area Networks
SDH Multiplexing
Container-1 Container-1 VC-1 POH VC-1 VC-1 VC-1 (4) TUG-2 VC-3 VC-3 VC-3 AUG TU-1 TU-1 PTR VC-1 (1) TUG-2 (2) PTR (1) PTR TUG-2 VC-3 POH AU-3 PTR AU-3 PTR AU-3 PTR AUG SOH VC-3 AU-3 AUG STM-N Logical association Physical association PTR Pointer VC-1 (3) VC-1 (2) (3) PTR (4) PTRPage 45
Chapter 2.6: Wide Area Networks
What can SDH achieve?
601,344 622,08 STM-4 OC-12 STS-12 451,008 466,56 (STM-3) OC-9 STS-9 902,016 933,12 (STM-6) OC-18 STS-18 150,336 155,51 STM-1 OC-3 STS-3 50,112 51,84 STM-0 OC-1 STS-1 1804,032 1866,24 (STM-12) OC-36 STS-36 2405,376 2488,32 STM-16 OC-48 STS-48 4810,752 4976,64 STM-32 OC-96 STS-96 1202,688 1244,16 (STM-8) OC-24 STS-24 9621,504 9953,28 STM-64 OC-192 STS-192 38486,016 39813,12 STM-256 OC-758 STS-768 Netto Brutto Optical Optical Electrical
Data rate (MBit/s) SDH
SONET
