ETSF05/ETSF10 Internet Protocols Performance & QoS Congestion Control
Quality of Service (QoS) Maintaining a functioning network Meeting applications demands User s demands = QoE (Quality of Experience) Dealing with flow characteristics ETSF05/ETSF10 - Internet Protocols Jitter = Packet Delay Variations 3
Traffic metering and recording dmission control QoS routing Resource reservation Policy Control Plane Traffic restoration Service level agreement Data Plane Queue management Traffic shaping Congestion avoidance Traffic policing Packet marking Traffic classification Queueing & scheduling Management Plane ETSF05/ETSF10 - Internet Protocols 4 Figure 22.1 rchitectural Framework for QoS Support
Data Plane Includes those mechanisms that operate directly on flows of data Queue management algorithms Tail drop vs RED (Random Early Detection) Queueing and scheduling Congestion avoidance Packet marking Traffic classification Traffic policing Traffic shaping ETSF05/ETSF10 - Internet Protocols 5
Control Plane Concerned with creating and managing the pathways through which user data flows dmission control QoS routing Resource reservation ETSF05/ETSF10 - Internet Protocols 6
Management Plane Contains mechanisms that affect both control plane and data plane mechanisms Service level agreement (SL) Traffic metering and recording Traffic restoration Policy ETSF05/ETSF10 - Internet Protocols 7
Network performance Data rate (andwidth) its per second Throughput Efficiency, always less than capacity (<1) lternatively: available data rate Latency (Delay) Transmission, propagation, processing, queueing One way or RTT (Round Trip time) PDV = Packet Delay Variation (Jitter) Real-time applications! ETSF05/ETSF10 - Internet Protocols 8
Other parameters it Error Rate L1 parameter that heavily impacts on L3 Frame/Packet Loss on higher layers Inter Packet Gap variations Jitter Could be non-zero already at sender Ratio of packets out of order Impact on delay in TCP ETSF05/ETSF10 - Internet Protocols 9
Packet loss Due to it error in packet Routers discard erronous packet Link or Physical Layer? Queue overflow Discard packets Node problems In real-time multimedia late packets consideredlost Packet loss ratio (%) Note TCP s sensitivity to packet loss ETSF05/ETSF10 - Internet Protocols 10
Circuit Switching Datagram Packet Switching Virtual Circuit Packet Switching Dedicated transmission path No dedicated path No dedicated path Continuous transmission of data Transmission of packets Transmission of packets Fast enough for interactive Fast enough for interactive Fast enough for interactive Messages are not stored The path is established for entire conversation Call setup delay; negligible transmission delay usy signal if called party busy Overload may block call setup; no delay for established calls Electromechanical or computerized switching nodes User responsible for message loss protection Usually no speed or code conversion Packets may be stored until delivered Route established for each packet Packet transmission delay Sender may be notified if packet not delivered Overload increases packet delay Small switching nodes Network may be responsible for individual packets Speed and code conversion Packets stored until delivered Route established for entire conversation Call setup delay; packet transmission delay Sender notified of connection denial Overload may block call setup; increases packet delay Small switching nodes Network may be responsible for packet sequences Speed and code conversion Fixed bandwidth Dynamic use of bandwidth Dynamic use of bandwidth No overhead bits after call setup Overhead bits in each packet Overhead bits in each packet Table 9.1 Comparison of Communication Switching Techniques (Table can be found on page 315 in textbook) ETSF05/ETSF10 - Internet Protocols 11
(a) Circuit switching (b) Virtual circuit packet switching (c) Datagram packet switching Call request signal propagation delay processing delay Call request packet User data Call accept signal cknowledgement signal Pkt1 Pkt2 Pkt3 Pkt1 Pkt2 Pkt3 Pkt1 Pkt2 Call accept packet Pkt1 Pkt2 Pkt3 Pkt1 Pkt2 Pkt3 Pkt1 Pkt2 Pkt3 Pkt3 cknowledgement 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 ETSF05/ETSF10 - Internet Protocols 12
Virtual Circuits vs. Datagram Virtual circuits Network can provide sequencing and error control Packets are forwarded more quickly Less reliable (compare Circuit Switching) Datagram (est Effort) No call setup phase Individual packet handling More flexible More reliable ETSF05/ETSF10 - Internet Protocols 13
IP Performance Metrics (IPPM wg) Chartered by IETF to develop standard metrics that relate to the quality, performance, and reliability of Internet data delivery Measurement techniques ctive: Transmit packets over network for measurement purposes Passive: Use existing traffic for measurements ETSF05/ETSF10 - Internet Protocols 14
Table 22.3 IP Performance Metrics Metric Name Singleton Definition Statistical Definitions One-Way Delay Round-Trip Delay One-Way Loss One-Way Loss Pattern Packet Delay Variation Src= IP address of a host Dst = IP address of a host Delay = dt, where Src transmits first bit of packet at T and Dst received last bit of packet at T + dt Delay = dt, where Src transmits first bit of packet at T and Src received last bit of packet immediately returned by Dst at T + dt Packet loss = 0 (signifying successful transmission and reception of packet); = 1 (signifying packet loss) Loss distance: Pattern showing the distance between successive packet losses in terms of the sequence of packets Loss period: Pattern showing the number of bursty losses (losses involving consecutive packets) Packet delay variation (pdv) for a pair of packets with a stream of packets = difference between the one-way-delay of the selected packets Percentile, median, minimum, inverse percentile Percentile, median, minimum, inverse percentile verage Number or rate of loss distances below a defined threshold, number of loss periods, pattern of period lengths, pattern of inter-loss period lengths. Percentile, inverse percentile, jitter, peak-topeak pdv (a) ETSF05/ETSF10 Sampled metrics - Internet Protocols 15
Table 22.3 IP Performance Metrics Metric Name General Definition Metrics Connectivity ulk Transfer Capacity bility to deliver a packet over a transport connection. Long-term average data rate (bps) over a single congestion-aware transport connection. One-way instantaneous connectivity, Two-way instantaneous connectivity, one-way interval connectivity, two-way interval connectivity, two-way temporal connectivity TC = (data sent)/(elapsed time) (b) Other metrics ETSF05/ETSF10 - Internet Protocols 16
MP 1 I 1 P(i) P(j) P(k) I 2 MP 2 I 1 P(i) P(j) P(k) I 2 dt i dt j dt k I 1, I 2 = times that mark that beginning and ending of the interval in which the packet stream from which the singleton measurement is taken occurs. MP 1, MP 2 = source and destination measurement points P(i) = ith measured packet in a stream of packets dt i = one-way delay for P(i) Time synch! PDV i =dt i -dt i-1 lt. STD(dT) Figure 22.12 Model for Defining Packet Delay Variation ETSF05/ETSF10 - Internet Protocols 17
andwidth-delay product How much data fills the link One Way Delay Two Way Delay = Round Trip Time (RTT) Time for data + time for CK ETSF05/ETSF10 - Internet Protocols 18
andwidth-delay product bandwidth: 5 bps, delay: 5s bandwidth x delay = 25 bits ETSF05/ETSF10 - Internet Protocols 19
andwidth-delay product Important for congestion avoidance Don t overfill the link Important for efficiency Keep the link filled at all times For max efficiency Data chunks > 2 * bandwidth * delay ETSF05/ETSF10 - Internet Protocols 20
andwidth-delay product Importantfor tuning (TCP) Long Fat Network (LFN, elephant ) DP >> 10 5 bits Very long (high delay) links: -> andwidth = DP/delay ut it takes long time before CK arrives ETSF05/ETSF10 - Internet Protocols 21
Performance vs RQ Method Stop-&-Wait Go-ack-N Selective-Repeate Utilisation = f(window size) ETSF05/ETSF10 - Internet Protocols 22
t 0 T R t 0 T R t 0 + a T R t 0 + 1 T Frame R t 0 + 1 T R t 0 + a T R t 0 + 1 + a T R t 0 + 1 + a T R CK t 0 + 1 + 2a T R t 0 + 1 + 2a T R (a) a < 1 (b) a > 1 Figure 16.8 Stop-and-Wait Link Utilization (transmission time = 1; propagation time = a) ETSF05/ETSF10 - Internet Protocols 23
t = 0 Sliding Windows 1 Frame 1 Frame 1 based a a + 1 Frame a Frame (a + 1) Frame (a 1) Frame 1 Frame a Frame 3 a = propagation time a + 1 a + 1) a) Frame (a+3) Frame (a (a) W a + 1 W = window size t = 0 1 a a + 1 W Frame 1 Frame a Frame (a + 1) Frame W Frame (a 1) Frame 1 Frame a Frame 3 Frame (W 1) Frame (W-a Frame (W a+1) Compare with andwitdh-delay Product a + 1 Frame W Frame (a (b) W a + 1 Figure 16.9 Timing of Sliding-Window ETSF05/ETSF10 Protocol - Internet Protocols 24
t = 0 1 Frame 1 Frame 1 a Frame a Frame (a 1) Frame 1 a + 1 Frame (a + 1) Frame a Frame 3 a + 1 a + 1) a) Frame (a+3) Frame (a (a) W a + 1 t = 0 Frame 1 2015-12-07 1 ETSF05/ETSF10 - Internet Protocols 25
a + 1 Frame (a + 1) Frame a Frame 3 a + 1 a + 1) a) Frame (a+3) Frame (a (a) W a + 1 t = 0 1 Frame 1 a Frame a Frame (a 1) Frame 1 a + 1 Frame (a + 1) Frame a Frame 3 W Frame W Frame (W 1) Frame (W-a Frame (W a+1) a + 1 Frame W Frame (a (b) W a + 1 2015-12-07 ETSF05/ETSF10 - Internet Protocols 26
1.0 0.8 W = 127 0.6 Utilization 0.4 W = 1 W = 7 0.2 W=1 Stop-&-Wait 0.0 0.1 1 10 100 1000 a Figure 16.10 Sliding-Window Utilization as a function of a ETSF05/ETSF10 - Internet Protocols 27
1.0 0.8 W =127 Go-back-N Utilization 0.6 0.4 W =7 Go-back-N 0.2 Stop-and-wait 0.0 0.1 1 10 100 1000 a Figure 16.11 RQ Utilization as a Function of a (P = 10 3 ) ETSF05/ETSF10 - Internet Protocols P = Propability of frame error 28
(a) 1-packet message (b) 2-packet message (c) 5-packet message (d) 10-packet message Packet Size vs Transmission Data Header Data 1 1 2 1 1 2 3 1 2 1 Time Data 2 Data 1 3 4 2 3 1 2 4 5 6 3 4 5 2 3 4 Data Data 2 Data 1 5 4 5 3 4 7 8 9 6 7 8 5 6 7 5 10 9 10 8 9 Data 2 X a b Y 10 X a b Y X a b Y Data X a b Y ETSF05/ETSF10 Figure - Internet 9.13 Protocols Effect of Packet Size on Transmission Time 29
Delay and throughput: Finite buffers Normalized Throughput No congestion Moderate congestion Severe congestion No congestion Load control verage delay for all packets Delay verage delay for packets that are delivered ETSF05/ETSF10 - Internet Protocols 32 Figure 20.4 The Effects of Congestion Load
Congestion Control in Packet-Switching Networks Send control packet to some or all source nodes Requires additional traffic during congestion Rely on routing information May react too quickly End to end probe packets dds to overhead dd congestion information to packets in transit Either backwards or forwards ETSF05/ETSF10 - Internet Protocols 34
Explicit Congestion Signaling ackward Congestion avoidance notification in opposite direction to packet required Forward Congestion avoidance notification in same direction as packet required ETSF05/ETSF10 - Internet Protocols 36
Congestion control voiding and eliminating congestion Open-loop = proactive, preventcongestion Closed-loop = reactive, control congestion ETSF05/ETSF10 - Internet Protocols 37
Closed-loop congestion control (1) ackpressure ETSF05/ETSF10 - Internet Protocols 38
Closed-loop congestion control (2) Choke packet ETSF05/ETSF10 - Internet Protocols 40
Implicit Congestion Signaling With network congestion: Transmission delay increases Packets may be discarded (Packet loss) Source can detect congestion and reduce flow Responsibility of end systems Effective on connectionless (datagram) networks lso used in connection-oriented networks ETSF05/ETSF10 - Internet Protocols 42
Explicit Signaling Categories inary bit set in a packet indicates congestion Credit based Indicates how many packets source may send Common for end-to-end flow control Rate based Supply explicit data rate limit Nodes along path may request rate reduction ETSF05/ETSF10 - Internet Protocols 43
How to improve QoS? dmission control Resource reservation Scheduling Traffic shaping Routing? ETSF05/ETSF10 - Internet Protocols 44
Where to improve QoS? dmission control DIFFSERV: Service classes INTSERV: Reservation architectures Resource reservation RSVP (Resource Resevation Protocol) Scheduling Traffic shaping NYWHERE YOU FIND QUEUES! ETSF05/ETSF10 - Internet Protocols 45
Scheduling: FIFO queuing ETSF05/ETSF10 - Internet Protocols 47
Scheduling: Priority queuing ETSF05/ETSF10 - Internet Protocols 48
Scheduling: Weighted fair queuing ETSF05/ETSF10 - Internet Protocols 49
Traffic Shaping/Traffic Policing Two important tools in network management: Traffic shaping Concerned with traffic leaving the switch Reduces packet clumping Produces an output packet stream that is less burst and with a more regular flow of packets Traffic policing Concerned with traffic entering the switch Packets that don t conform may be treated in one of the following ways: Give the packet lower priority compared to packets in other output queues Label the packet as nonconforming by setting the appropriate bits in a header Discard the packet ETSF05/ETSF10 - Internet Protocols 50
Traffic Management Fairness Provide equal treatment of various flows Quality of service Different treatment for different flows Reservations Traffic contract between user and network Excess traffic discarded or handled on a best-effort basis ETSF05/ETSF10 - Internet Protocols 51
Support from routing protocols? Yes! Optimal path Single metric Multiple metrics? Multiple Equal Cost Paths Load sharing Load balancing QoS routing Cross-layer approaches OSPF extensions (RFC2676) Well, sort of! pplies to all traffic No differentiation between flow types What about inter-domain? No control over network resources More sophisticated mechanisms needed Multiprotocol Label Switching (MPLS) Resource Reservation ETSF05/ETSF10 - Internet Protocols 52
Layer 3 congestion avoidance Congestion = data load > network capacity rrival rate > processingrate Processing rate > departure rate simple method Random early discard (RED) UDP? PP TCP IP ETSF05/ETSF10 - Internet Protocols 53
Traffic descriptors ETSF05/ETSF10 - Internet Protocols 54
Traffic profiles ETSF05/ETSF10 - Internet Protocols 55
Traffic shaping: Two approaches Leaky bucket Input flow Token bucket Input flow Output flow Output flow ETSF05/ETSF10 - Internet Protocols 56
Traffic shaping: Leaky bucket See also Figure 20.7 ETSF05/ETSF10 - Internet Protocols 57
Traffic shaping: Token bucket See also Figure 20.6 ETSF05/ETSF10 - Internet Protocols 60
Token ucket Widely used traffic management tool dvantages: Many traffic sources can be defined easily and accurately Provides a concise description of the load to be imposed by a flow, enabling the service to determine easily the resource requirement Provides the input parameters to a policing function ETSF05/ETSF10 - Internet Protocols 61
onus: QoE, Quality of Experience The user s subjective perception of the presentation of the content Mean Opinion Score (MOS) Research for to find objective measures Full reference No reference Hybrid What QoS give what QoE?? ETSF05/ETSF10 - Internet Protocols 62
https://goo.gl/forms/ircuycjcztu8uo152 ETSF05/ETSF10 - Internet Protocols 63