ΗΥ537: Έλεγχος Πόρων και Επίδοση σε Ευρυζωνικά Δίκτυα,



Σχετικά έγγραφα
ΗΥ537: Έλεγχος Πόρων και Επίδοση σε Ευρυζωνικά Δίκτυα,

Internet protocol stack Encapsulation Connection oriented VS connectionless services Circuit Switching Packet Switching Store-and-forward switches

Μεταγωγή (Switching)

Εισαγωγή ΙΙ: Βασικοί τύποι δικτύων

ΗΥ537: Έλεγχος Πόρων και Επίδοση σε Ευρυζωνικά Δίκτυα,

ΑΛΓΟΡΙΘΜΙΚΑ ΘΕΜΑΤΑ ΔΙΚΤΥΩΝ ΚΑΙ ΤΗΛΕΜΑΤΙΚΗΣ

Block Ciphers Modes. Ramki Thurimella

Δίκτυα Υψηλών Ταχυτήτων Ενότητα 5: Automated Teller Machine- ΑΤΜ (1)

Υπηρεσίες Μεταφοράς και ιασύνδεσης (Wide Area Networking)

Instruction Execution Times

Asynchronous Transfer Mode - ATM

Δίκτυα Επικοινωνιών ΙΙ: OSPF Configuration

(C) 2010 Pearson Education, Inc. All rights reserved.

ΕΑΠ/ΠΛΗ22/ΑΘΗ.3 4 η ΟΣΣ 15/03/2014 Συμπληρωματικές Διαφάνειες

ΥΨΗΛΕΣ ΑΠΑΙΤΗΣΕΙΣ. Τα B-ISDN δίκτυα παρέχουν ασύγχρονη μετάδοση data και σύγχρονη διακίνηση σε πραγματικό χρόνο.

CMOS Technology for Computer Architects

CYTA Cloud Server Set Up Instructions

Other Test Constructions: Likelihood Ratio & Bayes Tests

EPL324: Tutorials* on Communications and Networks Tutorial 2: Chapter 1 Review Questions

ηµοσίευση ικτυακής Πελατειακής ιεπαφής & Συναφών Πρωτοκόλλων CELL RELAY / ATM

ΔΙΚΤΥΑ (14) Π. Φουληράς

Τηλεπικοινωνιακά Δίκτυα Ευρείας Ζώνης Ενότητα 5: Θέματα Τηλεπικοινωνιακής Κίνησης σε ATM Δίκτυα

Calculating the propagation delay of coaxial cable

ΓΡΑΜΜΙΚΟΣ & ΔΙΚΤΥΑΚΟΣ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΣ

Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1

the total number of electrons passing through the lamp.

Asynchronous Transfer Mode (ATM)

Asynchronous Transfer Mode - ATM

Bayesian statistics. DS GA 1002 Probability and Statistics for Data Science.

ST5224: Advanced Statistical Theory II

Homework 3 Solutions

ΤεχνολογίεςΜεταγωγής Κυκλώµατος & Μεταγωγής Πακέτου (2ου στρώµατος)

Έκδοση: ΓΕΝΙΚΗ ΙΕΥΘΥΝΣΗ ΤΕΧΝΟΛΟΓΙΑΣ & ΛΕΙΤΟΥΡΓΙΩΝ

Παραδείγµατα δικτυακών τεχνολογιών. Ethernet Internet ATM

HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:

Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 7 ο

Second Order RLC Filters

HORIZON QUANTUM. Logging

Υλοποίηση Δικτυακών Υποδομών και Υπηρεσιών: ATM / IP over ATM / LANE / VLAN

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)

The challenges of non-stable predicates

ΔΙΚΤΥΑ ΔΗΜΟΣΙΑΣ ΧΡΗΣΗΣ ΚΑΙ ΔΙΑΣΥΝΔΕΣΗ ΔΙΚΤΥΩΝ Ενότητα #5: Πρωτόκολλο ΑΤΜ

ΕΙΣΑΓΩΓΗ ΣΤΗ ΣΤΑΤΙΣΤΙΚΗ ΑΝΑΛΥΣΗ

ίκτυα Επικοινωνιών Εαρινό εξάμηνο ΑΤΜ

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS

University of Macedonia Master in Information Systems. Networking Technologies professors: A. Economides A. Pobortsis AGREEMENT AND ACCOUNTING

1. Εισαγωγή. Περιγραφή Μαθήματος. Ιστορική Αναδρομή. Ορισμοί Ηλεκτρονικού Εμπορίου

Statistical Inference I Locally most powerful tests

EE512: Error Control Coding

100VG-AnyLAN (802.12)

ΚΥΠΡΙΑΚΟΣ ΣΥΝΔΕΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY 21 ος ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ Δεύτερος Γύρος - 30 Μαρτίου 2011

5.4 The Poisson Distribution.

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 11/3/2006

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +

EPL 603 TOPICS IN SOFTWARE ENGINEERING. Lab 5: Component Adaptation Environment (COPE)

The Simply Typed Lambda Calculus

[1] P Q. Fig. 3.1

Τηλεπικοινωνιακά Ψηφιακά Δίκτυα Ενότητα 8: Τεχνολογία Ethernet και τηλεφωνία ΙΡ

6.003: Signals and Systems. Modulation

Υλοποίηση Δικτυακών Υποδομών και Υπηρεσιών: OSPF Cost

LS series ALUMINUM ELECTROLYTIC CAPACITORS CAT.8100D. Specifications. Drawing. Type numbering system ( Example : 200V 390µF)

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 24/3/2007

Math 6 SL Probability Distributions Practice Test Mark Scheme

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007

Elements of Information Theory

Δίκτυα Δακτυλίου. Token Ring - Polling

Στρατηγικές Ασφάλειας

ΠΑΝΕΠΙΣΤΗΜΙΟ ΠΑΤΡΩΝ ΤΜΗΜΑ ΗΛΕΚΤΡΟΛΟΓΩΝ ΜΗΧΑΝΙΚΩΝ ΚΑΙ ΤΕΧΝΟΛΟΓΙΑΣ ΥΠΟΛΟΓΙΣΤΩΝ ΤΟΜΕΑΣ ΣΥΣΤΗΜΑΤΩΝ ΗΛΕΚΤΡΙΚΗΣ ΕΝΕΡΓΕΙΑΣ

Wide Area Networks - WAN μέρος Α

2 Composition. Invertible Mappings

Επίπεδο Μεταφοράς. (ανεβαίνουμε προς τα πάνω) Εργαστήριο Δικτύων Υπολογιστών Τμήμα Μηχανικών Η/Υ και Πληροφορικής

Lecture 34 Bootstrap confidence intervals

Προσομοίωση BP με το Bizagi Modeler

Assalamu `alaikum wr. wb.

Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in

Thin Film Chip Resistors


Metal thin film chip resistor networks

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006

SCOPE OF ACCREDITATION TO ISO 17025:2005

ΜΗΧΑΝΙΣΜΟΙ ΠΟΙΟΤΗΤΑΣ ΥΠΗΡΕΣΙΑΣ ΣΕ ΔΙΚΤΥΑ

Επίπεδο δικτύου IP διευθυνσιοδότηση

ΤεχνολογίεςΜεταγωγής Κυκλώµατος & Μεταγωγής Πακέτου (2ου στρώµατος)

Approximation of distance between locations on earth given by latitude and longitude


ΠΑΝΕΠΙΣΤΗΜΙΟ ΠΕΙΡΑΙΑ ΤΜΗΜΑ ΝΑΥΤΙΛΙΑΚΩΝ ΣΠΟΥΔΩΝ ΠΡΟΓΡΑΜΜΑ ΜΕΤΑΠΤΥΧΙΑΚΩΝ ΣΠΟΥΔΩΝ ΣΤΗΝ ΝΑΥΤΙΛΙΑ

Physical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.

NMBTC.COM /

ΗΜΥ 360: Δίκτυα Υπολογιστών. Εισαγωγή

Δίκτυα Επικοινωνιών ΙΙ: ATM

ιαδικτυακές Εφαρµογές

Section 8.3 Trigonometric Equations

DESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.

Υπολογιστές και ίκτυα Η/Υ.

ίκτυα Επικοινωνιών ΑΤΜ

Μειέηε θαη αλάιπζε επίδνζεο πξσηνθόιισλ δξνκνιόγεζεο ζε θηλεηά ad hoc δίθηπα κε βάζε ελεξγεηαθά θξηηήξηα ΓΗΠΛΩΜΑΣΗΚΖ ΔΡΓΑΗΑ

Surface Mount Aluminum Electrolytic Capacitors

Smaller. 6.3 to 100 After 1 minute's application of rated voltage at 20 C, leakage current is. not more than 0.03CV or 4 (µa), whichever is greater.

Πρόβλημα 1: Αναζήτηση Ελάχιστης/Μέγιστης Τιμής

Aluminum Electrolytic Capacitors

Transcript:

ΗΥ537: Έλεγχος Πόρων και Επίδοση σε Ευρυζωνικά Δίκτυα Βασίλειος Σύρης Τμήμα Επιστήμης Υπολογιστών Πανεπιστήμιο Κρήτης Εαρινό εξάμηνο 2008 ATM Technology ATM Service Categories Frame Relay

A Taxonomy of Communication Networks Communication networks can be classified based on the way in which the nodes exchange information: Communication Network Switched Communication Network Broadcast Communication Network Circuit-Switched Communication Network Packet-Switched Communication Network Datagram Network Virtual Circuit Network Network technology - 3 Key Features of ATM Asynchronous: non-periodic transfer of information between ports in switches STM (Synchronous Transfer Mode): frame... ATM:... Short fixed size cells header (VPI/VCI) data 5 bytes 48 bytes Network technology - 4

Key Features of ATM (cont.) Connection oriented: Virtual Channel (VC) connection is setup prior to information transfer... Labels vs. addresses: labels have local significance scalability 7 2 3 7 Network technology - 5 Switching in Packet Networks Datagram (e.g. Internet): packet header contains full address information Address has global significance Destination address: 147.52.16.2 Virtual circuit (e.g. ATM, Frame Relay): packet header contains virtual circuit identifier Address has local significance VC: 16 Network technology - 6

Cell Switching Input Port VPI/VCI Output Port VPI/VCI 1 25 2 34 1 30 1 49 Internal Routing Table Cell ATM switch 25 30 30 25 25 49 Payload Header (VPI/VCI) input port 1 output port1 34 input port 2 output port 2 Network technology - 7 Virtual Channel Connection Virtual Channel Connection 17 7 Virtual Channel Link 49 30 Two types of Virtual Channels: Switched Virtual Channels (SVC): connection setup with signalling Permanent Virtual Channels (PVC): connection setup with management Network technology - 8

Routing and Call Admission Control (CAC) CAC destination source CAC CAC CAC CAC X Routing: find path from source to destination that fulfils user requirements (bandwidth, QoS) Call Admission Control (CAC): performed at every switch, determines whether there are enough resources to accept a call Network technology - 9 Virtual Channels and Virtual Paths Cell label: First 8 (12) bits: Virtual Path Identifier Last 16 bits: Virtual Circuit Identifier Virtual Path: group of VCs treated similarly VC VC VP VP TRANSMISSION PATH VP VP VC VC Network technology - 10

ATM Cell Header Format byte GFC/VPI VPI 1 VPI VCI 2 VCI 3 VCI PTI CLP 4 HEC 5 GFC: only in UNI CLP=1 => cell has low priority PTI: identifies user cell/data cell, congestion control GFC = Generic Flow Control VPI = Virtual Path Identifier VCI = Virtual Channel Identifier PTI = Payload Type Identifier CLP = Cell Loss Priority HEC = Header Error Control Network technology - 11 VP Switching input port 1 VC 1 VC 7 VC 3 VP 2 VP 10 VC 3 VC 2 output port 1 VP 9 VP 9 input port 2 VC 2 VP 4 VP 5 VC 1 VC 7 output port 2 Input Port VPI Output Port VPI 1 2 2 5 1 9 1 10 2 4 1 9 2/1 5/1 2/7 5/7 9/3 10/3 4/2 9/2 Network technology - 12

VP and VP/VC Switching in a Network VPI/VCI 26 / 43 56 / 29 33 / 57 63 / 127 47 / 52 39 / 41 45 / 38 source destination 26/43 VP switch or cross-connect VP/VC switch VPI/VCI 26 / 43 56 / 29 33 / 29 63 / 29 47 / 52 39 / 52 45 / 52 source destination VPI: 56 VPI: 63 VPI: 47 VPI: 45 Network technology - 13 B-ISDN Interface Terminology ATM station ATM switch User-Network Interface (UNI) Network-Node Interface (NNI) Network technology - 14

B-ISDN Interface Terminology (cont.) Private ATM Public ATM Public ATM Private UNI Public UNI Private NNI NNI B-ICI (B-ISDN Inter-exchange Carrier Interface) : Private ATM switch : Public ATM switch Network technology - 15 ATM Layer Service Categories ATM UNI ATM Network Offered at ATM UNI (User-Network Interface) Network technology - 16

ATM Forum Service Categories Real-Time : Non-Real-Time: Service Category Constant Bit Rate (CBR) Real-Time Variable Bit Rate (rt-vbr) Non-Real-Time Variable Bit Rate (nrt-vbr) Available Bit Rate (ABR) Unspecified Bit Rate (UBR) Typical Application Circuit emulation, videoconferencing, Compressed video/audio Critical data LAN interconnection, File transfer, message transfer Network technology - 17 ATM Forum Real-Time Service Categories Constant Bit Rate (CBR): real-time applications requiring a static amount of bandwidth Quality of Service (QoS) in terms of delay, delay variation, cell loss Real-Time Variable Bit Rate (rt-vbr): real time applications with bursty traffic Quality of Service (QoS) in terms of delay, delay variation, cell loss Network technology - 18

ATM Forum Non-Real-Time Service Categories Non-Real-Time Variable Bit Rate (nrt-vbr): non-real-time applications with bursty traffic cell loss bound but no delay bounds Available Bit Rate (ABR): elastic applications which can adapt their traffic rate closed loop flow control supported Unspecified Bit Rate (UBR): non-real-time applications, no service guarantees Network technology - 19 Bandwidth Usage Bandwidth unallocated Link Bandwidth Bandwidth allocated but not used Bandwidth allocated and used ABR + UBR traffic Link Bandwidth CBR + VBR traffic time Network technology - 20

Traffic Contract Negotiation Traffic Contract: Traffic parameters: peak rate, sustainable cell rate, burst size, minimum cell rate QoS parameters: cell delay, cell delay variation, cell loss ratio Conformance definition: Generic Cell Rate Algorithm (GCRA) ATM UNI ATM Network Network technology - 21 Traffic Parameters Traffic parameters describe inherent characteristics of a traffic source Peak Cell Rate (PCR): Maximum instantaneous rate Sustained Cell Rate (SCR): Average cell rate measured over some long interval Maximum Burst Size (MBS): Maximum burst size (# of cells) that can be sent at the peak rate Network technology - 22

Traffic parameters (cont.) cell Peak Cell Rate (PCR):... 1/PCR time Peak Cell Rate (PCR), Sustainable Cell Rate (SCR), Maximum Burst Size (MBS): Ti (minimum burst interarrival time)=mbs/scr... 1/PCR time Tb (maximum burst duration at PCR)=(MBS-1)/PCR Network technology - 23 ATM Quality of Service (QoS) Parameters ATM QoS parameters characterise performance of an ATM layer connection Max Cell Transfer Delay (CTD): Delay experienced by a cell between network entrance and exit points peak-to-peak Cell Delay Variation (CDV): max - min cell transfer delay Cell Loss Ratio (CLR): Percentage of cells that are lost Minimum Cell Rate (MCR): Minimum cell rate user is allowed to always send The above are user negotiable Also, a number of additional, non-negotiable QoS parameters have been defined Network technology - 24

ATM QoS parameters (cont.) probability density area CLR fixed delay (min) peak-to-peak CDV max CTD cell transfer delay Network technology - 25 Conformance Definition Conformance definition defines conformity at an interface with respect to traffic contract according to one or more instances of GCRA GCRA: Generic Cell Rate Algorithm Above applies to CBR, VBR, and UBR ABR is a special case (includes feedback) Network technology - 26

Service Category Attributes and Guarantees Service Category CBR rt-vbr nrt-vbr ABR UBR Traffic Description PCR PCR,SCR, MBS PCR,SCR, MBS PCR,MCR+ behavior (PCR) Guarantees Min Loss (CLR) NO Delay/ Variance NO NO NO Bandwidth NO Feedback Control NO NO NO NO Network technology - 27 Traffic Control in ATM Connection Acceptance Control (CAC) Routing Usage Parameter Control (UPC) or Source Policing Shaping Priorities, scheduling Feedback control Other (e.g. pricing) Network technology - 28

Usage Parameter Control (UPC) or Source Policing Traffic Contract ATM UNI UPC ATM Network UPC actions: CLP bit Cell passing: 0 UPC 0 Cell tagging: 0 UPC 1 Cell discarding: 0 UPC Network technology - 29 UPC and Traffic Shaping Traffic Contract ATM UNI UPC ATM Network Shaping Traffic shaping at source prevents loss due to policing nonconforming cells MBS MBS No shaping time With shaping time MBS: maximum burst size Network technology - 30

UPC (or Source Policing) Functions Algorithm implemented at UNI for ensuring that user traffic adheres to traffic contract. Generic Cell Rate Algorithm (GCRA): Leaky bucket type algorithm Open loop algorithm Network technology - 31 Generic Cell Rate Algorithm GCRA(T, τ) t: cell arrival time tat: theoretical arrival time if (t<tat- τ) cell nonconforming else cell conforming tat=max(t,tat)+t Virtual Scheduling Algorithm cell nonconforming cell conforming 0 T tat τ T tat Network technology - 32

GCRA examples GCRA(10,2) Cell arrival times: 0 10 18 28 42 50 t 0 10 18 28 42 50 tat-τ 0-2 10-2 20-2 30-2 40-2 52-2 result C C C C C C tat after 10 20 30 40 52 62 if (t<tat- τ) cell nonconforming else cell conforming tat=max(t,tat)+t 0 10 20 30 40 50 Cell arrival times: 0 10 15 25 35 t 0 10 15 25 35 tat-τ 0-2 10-2 20-2 20-2 35-2 result C C NC C C tat after 10 20 20 35 45 Network technology - 33 Leaky Bucket Algorithm Bucket size=1+τ/t Leak rate=1/t cells/s Bucket contents increased by 1 for each conforming cell actual cell virtual cell conforming or nonconforming 1+τ/T cells 1/T cells/s B: bucket contents If B+1> 1+τ/T cell nonconforming else cell conforming B=B+1 Network technology - 34

Equivalence of virtual scheduling algor. (T,τ) & Leaky Bucket (r,b)=(1/t,1+ τ/τ) Virtual scheduling algorithm Leaky Bucket GCRA(T, τ) t: cell arrival time tat: theoretical arrival time if (t<tat- τ) cell nonconforming else cell conforming tat=max(t,tat)+t actual cell conforming or nonconforming actual cell virtual cell 1+τ/T cells 1/T cells/s 1/T cells/s 1+τ/T cells 1/cells Network technology - 35 Traffic Contract for CBR For each CBR connection: PCR (Peak Cell Rate) CDVT (Cell Delay Variation Tolerance): takes care of slotted nature of ATM, physical overhead, ATM layer function overhead Connection must conform to GCRA(R/PCR,CDVT), where R is ATM layer rate PCR=15 Mbps, CDVT=2, ATM Layer Rate=150 Mbps => GCRA(10,2) Private UNI Customer Premises Network (CPN) Public UNI Public ATM network UPC Network technology - 36

Traffic Contract for VBR For each VBR connection: PCR, CDVT SCR, MBS, CDVT BT=(MBS-1)(R/SCR-R/PCR), where R: ATM Layer Rate Connection must conform to GCRA(R/PCR,CDVT) AND GCRA(R/SCR, BT+CDVT) Network technology - 37 Leaky buckets for SCR and PCR policing PCR cells/s arriving cell 1+CDVT x PCR cells SCR cells/s virtual cell 1+(BT+CDVT) x SCR cells Network technology - 38

Multiplexing leaky bucket streams Q C Assume leaky bucket (r,b) and access rate h Maximum time t user can transmit at rate h b ht rt + b t = h r Maximum backlog Q if N users (r,b) multiplexed on link with capacity C b Q = Nht Ct = ( Nh C) h r Delay constraint D Must also have b b D ( Nh C ) DC N h C h r b h r D Nr C + ( ) = b a max h, Na C b + ( h r) D r Network technology - 39 Comparison of Packet Services Packet type Connection type Speed OSI layer X.25 variable connection < 64 Kbps 3 oriented Frame Relay variable connection - 1.5/2 Mbps 2/3 oriented SMDS fixed connectionless - 34/45 Mbps 1/2 (53 byte cell) ATM fixed (53 byte cell) connection oriented - 10 Gbps, higher? 1/2 SMDS: Switched Multi-Megabit Data Service Network technology - 40

Frame Relay vs. X.25 Designed to eliminate much of the overhead in X.25 Call control signaling on separate logical connection from user data Multiplexing/switching of logical connections at layer 2 (not layer 3) No hop-by-hop flow control and error control Throughput an order of magnitude higher than X.25 Network technology - 41 Frame Relay networks Leased lines: multiple connections => multiple lines Frame relay: single physical connection, but multiple logical connections Router Router Router Router Router Leased Lines Router Router Frame Relay Router : physical connection Features: : virtual circuit X.25 simplified - No flow/error control Variable packets Virtual Circuits: Data Link Connection Identifiers (DLCI) Single bit congestion indication Network technology - 42

Frame Relay DLCI switching Network technology - 43 Frame Relay/ATM Network Interworking FR/ATM Network Interworking Scenario 1 IWF: Interworking Function Frame Relay Network Network IWF ATM Network Network IWF Frame Relay Network Frame Relay UNI Frame Relay NNI Frame Relay UNI Upper Layers Q.922 Core Physical Upper Layers FR-SSCS FR-SSCS Q.922 CPCS CPCS Q.922 Q.922 Core SAR SAR Core Core ATM ATM... Physical Physical Physical... Physical Physical... Physical Network technology - 44

Frame Relay frame Network technology - 45 Frame Relay header Network technology - 46

Frame Relay Traffic Parameters Committed Information Rate (CIR) Committed Burst Size (Bc) Measurement interval T=Bc/CIR Excess Burst Size (Be) Excess Information Rate (EIR): EIR=Be/T If bits in interval T between Bc and Bc+Be => Mark Discard Eligible (DE) bit in frame over Bc+Be => Discard frame Network technology - 47 Frame Relay conformance checking Bits Bc + Be Drop AR = access rate AR Rate DE = 1 Bc DE = 0 CIR T0 CIR = Bc/Tc T0 + Tc t Load in interval 1: DE = 0 2: DE = 0 3: DE = 1 4: Drop Guaranteed Excess Network technology - 48

Frame Relay/ATM Traffic Parameter Conversion Different methods using 2 or 3 GCRAs Method 1: 3 GCRAs to characterize peak (= frame relay access line rate) CIR, Bc CIR+EIR, Bc+Be Method 2: 2 GCRAs to characterize first GCRA: peak (= frame relay access line rate) second GCRA: CIR, Bc or first GCRA: CIR+EIR, Bc+Be second GCRA: CIR, Bc Need to take into account the cell overhead (tax) Network technology - 49 Frame Relay congestion control Congestion notification Two bits in the frame are used BECN(Backward Explicit Congestion Notification) FECN(Forward Explicit Congestion Notification) Frame Relay itself does not implement rate control This is left for higher layers Frame discard: using DE (Discard Eligible) bit Network technology - 50

Frame Relay BECN Network technology - 51 Frame Relay FECN Network technology - 52

Four cases of congestion control Network technology - 53 Available Bit Rate (ABR) Services Intended for elastic sources (i.e., sources which can increase/decrease their traffic rate) For each ABR connection: PCR (Peak Cell Rate) MCR (Minimum Cell Rate) No specific QoS parameters CLR (Cell Loss Ratio) is expected to be low for compliant sources fair share of available bandwidth Rate-based closed loop flow control binary feedback (Explicit Forward Congestion Indication - EFCI) rate-based (Explicit Rate - ER), Resource Management cell Network technology - 54

ABR Flow Control a) EFCI marking mode source data cell CI bit set destination RM cell b) Relative Rate marking mode source destination CI bit set RM cell c) Explicit Rate marking mode source RM cell destination ER set RM cell Network technology - 55 Switch Operation with ABR Flow Control Each switch computes Explicit Rate (ER) e.g., ER=C/N, where C is link capacity and N number of ABR connections Sets minimum of value in ER field (in RM cell) and computed ER source RM cell destination ER RM cell ER=min(ER_cell, ER_computed) Network technology - 56

ABR Flow Control: Source Behavior Same algorithm for any network (internal) modes If no congestion can increase sending rate (additive) If congestion decrease sending rate (multiplicative) At all times, sending rate <= Explicit Rate (ER) Actually a bit more complicated (NI: No Increase, ACR: Allowed Cell Rate) If CI=1 Reduce ACR by amount proportional to current ACR but not less than CR Else if NI=0 Increase ACR by amount proportional to PCR but not more than PCR If ACR>ER set ACR=max{ER,MCR} Network technology - 57 Variations of ACR (Allowed Cell Rate) Network technology - 58

ABR versus TCP ABR feedback controls rate of transmission Rate control TCP feedback controls window size Window control ABR feedback explicit from switches or destination TCP feedback implicit (losses) ECN (Explicit Congestion Notification) ATM switch must perform: Congestion control: Monitor queue length Fair capacity allocation: Throttle back connections using more than fair share Active Queue Management schemes similar to above RED (Random Early Detection) Network technology - 59 GFR: Guaranteed Frame Rate Provides guaranteed minimum capacity, in terms of frame rate User may use any additional available capacity No guarantee of frame delivery Requires network to recognize frames All cells of frame have same CLP bit When congestion occurs, drop all cells of a frame Simple as UBR from end system view End system does no policing or traffic shaping May transmit at line rate of ATM adaptor Modest requirements on ATM network Higher layer (e.g. TCP) react to congestion signal (dropped frames) Network technology - 60

GFR contract GFR contract: PCR MCR MBS MFS (Maximum Frame Size) CDVT ABR contract: PCR MCR Network technology - 61 GFR and other service categories Network technology - 62

Mechanisms for supporting rate guarantees Tagging and policing Buffer management Scheduling Network technology - 63 GFR conformance testing UPC function UPC monitors VC for traffic conformance Tag or discard non-conforming cells Frame conforms if all cells in frame conform Rate of cells within contract: GCRA(1/PCR,CDVT) All cells have same CLP Within maximum frame size (MFS) Network technology - 64

QoS eligibility test Test for contract conformance Discard or tag non-conforming cells Exceeding upper bound: GCRA(1/PCR,CDVT) Determine frames eligible for QoS guarantee Below lower bound for traffic: GCRA(1/MCR,BT+CDVT) Where BT MFS/MCR Frames are one of: Nonconforming: cells tagged or discarded Conforming & ineligible: best effort delivery Conforming & eligible: guaranteed delivery Network technology - 65