+ All Categories
Home > Documents > Computer Networks

Computer Networks

Date post: 24-Jan-2016
Category:
Upload: neka
View: 42 times
Download: 0 times
Share this document with a friend
Description:
Computer Networks. Set 10 X.25, ATM and Frame Relay. X.25. 1976 Interface between host and packet switched network Almost universal on packet switched networks and packet switching in ISDN Defines three layers Physical Link Packet. X.25 - Physical. - PowerPoint PPT Presentation
Popular Tags:
101
Computer Networks Set 10 X.25, ATM and Frame Relay
Transcript
Page 1: Computer Networks

Computer Networks

Set 10X.25, ATM and Frame Relay

Page 2: Computer Networks

X.25 1976 Interface between host and packet

switched network Almost universal on packet switched

networks and packet switching in ISDN Defines three layers

Physical Link Packet

Page 3: Computer Networks

X.25 - Physical Interface between attached station and

link to node Data terminal equipment DTE (user

equipment) Data circuit terminating equipment DCE

(node) Uses physical layer specification X.21 Reliable transfer across physical link Sequence of frames

Page 4: Computer Networks

X.25 - Link, Packet Link Access Protocol Balanced (LAPB)

Subset of HDLC Packet: External virtual circuits Logical connections (virtual circuits)

between subscribers

Page 5: Computer Networks

X.25 Use of Virtual Circuits

Page 6: Computer Networks

Virtual Circuit Service Virtual Call

Dynamically established Permanent virtual circuit

Fixed network assigned virtual circuit

Page 7: Computer Networks

Virtual Call

Page 8: Computer Networks

Packet Format

Page 9: Computer Networks

Multiplexing DTE can establish 4095 simultaneous

virtual circuits with other DTEs over a single DTC-DCE link

Packets contain 12 bit virtual circuit number

Page 10: Computer Networks

Virtual Circuit Numbering

Page 11: Computer Networks

Flow and Error Control HDLC (Chapter 7)

Page 12: Computer Networks

Packet Sequences Complete packet sequences Allows longer blocks of data across

network with smaller packet size without loss of block integrity

A packets M bit 1, D bit 0

B packets The rest

Zero or more A followed by B

Page 13: Computer Networks

Reset and Restart Reset

Reinitialize virtual circuit Sequence numbers set to zero Packets in transit lost Up to higher level protocol to recover lost packets Triggered by loss of packet, sequence number

error, congestion, loss of network internal virtual circuit

Restart Equivalent to a clear request on all virtual circuits E.g. temporary loss of network access

Page 14: Computer Networks

ATM: Protocol Architecture Similarities between ATM and packet

switching Transfer of data in discrete chunks Multiple logical connections over single physical

interface In ATM flow on each logical connection is in

fixed sized packets called cells Minimal error and flow control

Reduced overhead Data rates (physical layer) 25.6Mbps to

622.08Mbps

Page 15: Computer Networks

Protocol Architecture (diag)

Page 16: Computer Networks

Reference Model Planes User plane

Provides for user information transfer Control plane

Call and connection control Management plane

Plane management whole system functions

Layer management Resources and parameters in protocol entities

Page 17: Computer Networks

ATM Logical Connections Virtual channel connections (VCC) Analogous to virtual circuit in X.25 Basic unit of switching Between two end users Full duplex Fixed size cells Data, user-network exchange (control)

and network-network exchange (network management and routing)

Virtual path connection (VPC) Bundle of VCC with same end points

Page 18: Computer Networks

ATM Connection Relationships

Page 19: Computer Networks

Advantages of Virtual Paths Simplified network architecture Increased network performance and

reliability Reduced processing Short connection setup time Enhanced network services

Page 20: Computer Networks

Call Establishment Using VPs

Page 21: Computer Networks

Virtual Channel Connection Uses Between end users

End to end user data Control signals VPC provides overall capacity

VCC organization done by users

Between end user and network Control signaling

Between network entities Network traffic management Routing

Page 22: Computer Networks

VP/VC Characteristics Quality of service Switched and semi-permanent channel

connections Call sequence integrity Traffic parameter negotiation and usage

monitoring

VPC only Virtual channel identifier restriction within VPC

Page 23: Computer Networks

Control Signaling - VCC Done on separate connection Semi-permanent VCC Meta-signaling channel

Used as permanent control signal channel User to network signaling virtual channel

For control signaling Used to set up VCCs to carry user data

User to user signaling virtual channel Within pre-established VPC Used by two end users without network

intervention to establish and release user to user VCC

Page 24: Computer Networks

Control Signaling - VPC Semi-permanent Customer controlled Network controlled

Page 25: Computer Networks

ATM Cells Fixed size 5 octet header 48 octet information field Small cells reduce queuing delay for high

priority cells Small cells can be switched more

efficiently Easier to implement switching of small

cells in hardware

Page 26: Computer Networks

ATM Cell Format

Page 27: Computer Networks

Header Format Generic flow control

Only at user to network interface Controls flow only at this point

Virtual path identifier Virtual channel identifier Payload type

e.g. user info or network management Cell loss priority Header error control

Page 28: Computer Networks

Generic Flow Control (GFC) Control traffic flow at user to network

interface (UNI) to alleviate short term overload

Two sets of procedures Uncontrolled transmission Controlled transmission

Every connection either subject to flow control or not

Subject to flow control May be one group (A) default May be two groups (A and B)

Flow control is from subscriber to network Controlled by network side

Page 29: Computer Networks

Single Group of Connections (1) Terminal equipment (TE) initializes two

variables TRANSMIT flag to 1 GO_CNTR (credit counter) to 0

If TRANSMIT=1 cells on uncontrolled connection may be sent any time

If TRANSMIT=0 no cells may be sent (on controlled or uncontrolled connections)

If HALT received, TRANSMIT set to 0 and remains until NO_HALT

Page 30: Computer Networks

Single Group of Connections (2) If TRANSMIT=1 and no cell to transmit on

any uncontrolled connection: If GO_CNTR>0, TE may send cell on controlled

connection Cell marked as being on controlled connection GO_CNTR decremented

If GO_CNTR=0, TE may not send on controlled connection

TE sets GO_CNTR to GO_VALUE upon receiving SET signal Null signal has no effect

Page 31: Computer Networks

Use of HALT To limit effective data rate on ATM Should be cyclic To reduce data rate by half, HALT issued

to be in effect 50% of time Done on regular pattern over lifetime of

connection

Page 32: Computer Networks

Two Queue Model Two counters

GO_CNTR_A, GO_VALUE_A,GO_CNTR_B, GO_VALUE_B

Page 33: Computer Networks

Header Error Control 8 bit error control field Calculated on remaining 32 bits of header Allows some error correction

Page 34: Computer Networks

HEC Operation at Receiver

Page 35: Computer Networks

Effect of Error in Cell Header

Page 36: Computer Networks

Impact of Random Bit Errors

Page 37: Computer Networks

Transmission of ATM Cells 622.08Mbps 155.52Mbps 51.84Mbps 25.6Mbps Cell Based physical layer SDH based physical layer

Page 38: Computer Networks

Cell Based Physical Layer No framing imposed Continuous stream of 53 octet cells Cell delineation based on header error

control field

Page 39: Computer Networks

Cell Delineation State Diagram

Page 40: Computer Networks

Impact of Random Bit Errors on Cell Delineation Performance

Page 41: Computer Networks

Acquisition Time v Bit Error Rate

Page 42: Computer Networks

SDH Based Physical Layer Imposes structure on ATM stream e.g. for 155.52Mbps Use STM-1 (STS-3) frame Can carry ATM and STM payloads Specific connections can be circuit

switched using SDH channel SDH multiplexing techniques can combine

several ATM streams

Page 43: Computer Networks

STM-1 Payload for SDH-Based ATM Cell Transmission

Page 44: Computer Networks

ATM Service Categories Real time

Constant bit rate (CBR) Real time variable bit rate (rt-VBR)

Non-real time Non-real time variable bit rate (nrt-VBR) Available bit rate (ABR) Unspecified bit rate (UBR)

Page 45: Computer Networks

Real Time Services Amount of delay Variation of delay (jitter)

Page 46: Computer Networks

CBR Fixed data rate continuously available Tight upper bound on delay Uncompressed audio and video

Video conferencing Interactive audio A/V distribution and retrieval

Page 47: Computer Networks

rt-VBR Time sensitive application

Tightly constrained delay and delay variation rt-VBR applications transmit at a rate that

varies with time e.g. compressed video

Produces varying sized image frames Original (uncompressed) frame rate constant So compressed data rate varies

Can statistically multiplex connections

Page 48: Computer Networks

nrt-VBR May be able to characterize expected

traffic flow Improve QoS in loss and delay End system specifies:

Peak cell rate Sustainable or average rate Measure of how bursty traffic is

e.g. Airline reservations, banking transactions

Page 49: Computer Networks

UBR May be additional capacity over and

above that used by CBR and VBR traffic Not all resources dedicated Bursty nature of VBR

For application that can tolerate some cell loss or variable delays e.g. TCP based traffic

Cells forwarded on FIFO basis Best efforts service

Page 50: Computer Networks

ABR Application specifies peak cell rate (PCR)

and minimum cell rate (MCR) Resources allocated to give at least MCR Spare capacity shared among all ARB

sources e.g. LAN interconnection

Page 51: Computer Networks

ATM Adaptation Layer Support for information transfer protocol

not based on ATM PCM (voice)

Assemble bits into cells Re-assemble into constant flow

IP Map IP packets onto ATM cells Fragment IP packets Use LAPF over ATM to retain all IP

infrastructure

Page 52: Computer Networks

ATM Bit Rate Services

Page 53: Computer Networks

Adaptation Layer Services Handle transmission errors Segmentation and re-assembly Handle lost and misinserted cells Flow control and timing

Page 54: Computer Networks

Supported Application types Circuit emulation VBR voice and video General data service IP over ATM Multiprotocol encapsulation over ATM

(MPOA) IPX, AppleTalk, DECNET)

LAN emulation

Page 55: Computer Networks

AAL Protocols Convergence sublayer (CS)

Support for specific applications AAL user attaches at SAP

Segmentation and re-assembly sublayer (SAR) Packages and unpacks info received from CS into

cells Four types

Type 1 Type 2 Type 3/4 Type 5

Page 56: Computer Networks

AAL Protocols

Page 57: Computer Networks

Segmentation and Reassembly PDU

Page 58: Computer Networks

AAL Type 1 CBR source SAR packs and unpacks bits Block accompanied by sequence number

Page 59: Computer Networks

AAL Type 2 VBR Analog applications

Page 60: Computer Networks

AAL Type 3/4 Connectionless or connected Message mode or stream mode

Page 61: Computer Networks

AAL Type 5 Streamlined transport for connection

oriented higher layer protocols

Page 62: Computer Networks

CPCS PDUs

Page 63: Computer Networks
Page 64: Computer Networks

Example AAL 5 Transmission

Page 65: Computer Networks

Frame Relay Designed to be more efficient than X.25 Developed before ATM Larger installed base than ATM ATM now of more interest on high speed

networks

Page 66: Computer Networks

ATM Traffic Management High speed, small cell size, limited overhead bits

Still evolving Requirements

Majority of traffic not amenable to flow control Feedback slow due to reduced transmission

time compared with propagation delay Wide range of application demands Different traffic patterns Different network services High speed switching and transmission

increases volatility

Page 67: Computer Networks

Latency/Speed Effects ATM 150Mbps ~2.8x10-6 seconds to insert single cell Time to traverse network depends on

propagation delay, switching delay Assume propagation at two-thirds speed of

light If source and destination on opposite sides

of USA, propagation time ~ 48x10-3 seconds Given implicit congestion control, by the

time dropped cell notification has reached source, 7.2x106 bits have been transmitted

So, this is not a good strategy for ATM

Page 68: Computer Networks

Cell Delay Variation For ATM voice/video, data is a stream of

cells Delay across network must be short Rate of delivery must be constant There will always be some variation in

transit Delay cell delivery to application so that

constant bit rate can be maintained to application

Page 69: Computer Networks

Time Re-assembly of CBR Cells

Page 70: Computer Networks

Network Contribution to Cell Delay Variation Packet switched networks

Queuing delays Routing decision time

Frame relay As above but to lesser extent

ATM Less than frame relay ATM protocol designed to minimize processing

overheads at switches ATM switches have very high throughput Only noticeable delay is from congestion Must not accept load that causes congestion

Page 71: Computer Networks

Cell Delay Variation At The UNI Application produces data at fixed rate Processing at three layers of ATM causes

delay Interleaving cells from different connections Operation and maintenance cell interleaving If using synchronous digital hierarchy frames,

these are inserted at physical layer Can not predict these delays

Page 72: Computer Networks

Origins of Cell Delay Variation

Page 73: Computer Networks

Traffic and Congestion Control Framework ATM layer traffic and congestion control

should support QoS classes for all foreseeable network services

Should not rely on AAL protocols that are network specific, nor higher level application specific protocols

Should minimize network and end to end system complexity

Page 74: Computer Networks

Timings Considered Cell insertion time Round trip propagation time Connection duration Long term

Determine whether a given new connection can be accommodated

Agree performance parameters with subscriber

Page 75: Computer Networks

Traffic Management and Congestion Control Techniques Resource management using virtual paths Connection admission control Usage parameter control Selective cell discard Traffic shaping

Page 76: Computer Networks

Resource Management Using Virtual Paths Separate traffic flow according to service

characteristics User to user application User to network application Network to network application

Concern with: Cell loss ratio Cell transfer delay Cell delay variation

Page 77: Computer Networks

Configuration of VCCs and VPCs

Page 78: Computer Networks

Allocating VCCs within VPC All VCCs within VPC should experience

similar network performance Options for allocation:

Aggregate peak demand Statistical multiplexing

Page 79: Computer Networks

Connection Admission Control First line of defence User specifies traffic characteristics for

new connection (VCC or VPC) by selecting a QoS

Network accepts connection only if it can meet the demand

Traffic contract Peak cell rate Cell delay variation Sustainable cell rate Burst tolerance

Page 80: Computer Networks

Usage Parameter Control Monitor connection to ensure traffic

cinforms to contract Protection of network resources from

overload by one connection Done on VCC and VPC Peak cell rate and cell delay variation Sustainable cell rate and burst tolerance Discard cells that do not conform to traffic

contract Called traffic policing

Page 81: Computer Networks

Traffic Shaping Smooth out traffic flow and reduce cell

clumping Token bucket

Page 82: Computer Networks

ATM-ABR Traffic Management Some applications (Web, file transfer) do not

have well defined traffic characteristics Best efforts

Allow these applications to share unused capacity If congestion builds, cells are dropped

Closed loop control ABR connections share available capacity Share varies between minimum cell rate (MCR)

and peak cell rate (PCR) ARB flow limited to available capacity by

feedback Buffers absorb excess traffic during feedback delay

Low cell loss

Page 83: Computer Networks

Feedback Mechanisms Transmission rate characteristics:

Allowed cell rate Minimum cell rate Peak cell rate Initial cell rate

Start with ACR=ICR Adjust ACR based on feedback from network

Resource management cells Congestion indication bit No increase bit Explicit cell rate field

Page 84: Computer Networks

Variations in Allowed Cell Rate

Page 85: Computer Networks

Cell Flow

Page 86: Computer Networks

Rate Control Feedback EFCI (Explicit forward congestion

indication) marking Relative rate marking Explicit rate marking

Page 87: Computer Networks

Frame Relay Congestion Control Minimize discards Miantain agreed QoS Minimize probability of one end user monoply Simple to implement

Little overhead on network or user Create minimal additional traffic Distribute resources fairly Limit spread of congestion Operate effectively regardless of traffic flow Minimum impact on other systems Minimize variance in QoS

Page 88: Computer Networks

Techniques Discard strategy Congestion avoidance Explicit signaling Congestion recovery Implicit signaling mechanism

Page 89: Computer Networks

Traffic Rate Management Must discard frames to cope with

congestion Arbitrarily, no regard for source No reward for restraint so end systems

transmit as fast as possible Committed information rate (CIR)

Data in excess of this liable to discard Not guaranteed Aggregate CIR should not exceed physical data rate

Committed burst size Excess burst size

Page 90: Computer Networks

Operation of CIR

Page 91: Computer Networks

Relationship Among Congestion Parameters

Page 92: Computer Networks

Explicit Signaling Network alerts end systems of growing

congestion Backward explicit congestion notification Forward explicit congestion notification Frame handler monitors its queues May notify some or all logical connections User response

Reduce rate

Page 93: Computer Networks

Frame Relay Background - X.25 Call control packets, in band signaling Multiplexing of virtual circuits at layer 3 Layer 2 and 3 include flow and error

control Considerable overhead Not appropriate for modern digital

systems with high reliability

Page 94: Computer Networks

Frame Relay - Differences Call control carried in separate logical

connection Multiplexing and switching at layer 2

Eliminates one layer of processing No hop by hop error or flow control End to end flow and error control (if used)

are done by higher layer Single user data frame sent from source

to destination and ACK (from higher layer) sent back

Page 95: Computer Networks

Advantages and Disadvantages Lost link by link error and flow control

Increased reliability makes this less of a problem

Streamlined communications process Lower delay Higher throughput

ITU-T recommend frame relay above 2Mbps

Page 96: Computer Networks

Protocol Architecture

Page 97: Computer Networks

Control Plane Between subscriber and network Separate logical channel used

Similar to common channel signaling for circuit switching services

Data link layer LAPD (Q.921) Reliable data link control Error and flow control Between user (TE) and network (NT) Used for exchange of Q.933 control signal

messages

Page 98: Computer Networks

User Plane End to end functionality Transfer of info between ends LAPF (Link Access Procedure for Frame

Mode Bearer Services) Q.922 Frame delimiting, alignment and transparency Frame mux and demux using addressing field Ensure frame is integral number of octets

(zero bit insertion/extraction) Ensure frame is neither too long nor short Detection of transmission errors Congestion control functions

Page 99: Computer Networks

LAPF Core Formats

Page 100: Computer Networks

User Data Transfer One frame type

User data No control frame

No inband signaling No sequence numbers

No flow nor error control

Page 101: Computer Networks

Required Reading Stallings Chapter 11 ATM Forum Web site Frame Relay forum


Recommended