Scribd
Upload
49 views

Attachment

This document discusses quality of service (QoS) in computer networks. It covers several topics related to QoS including definitions of QoS, QoS guarantees, traffic specifications, scheduling algorithms, call admission protocols, flow characteristics, QoS classes, motivation for QoS, Internet and ATM service classes, the call admission problem, integrated services, differentiated services, and QoS in switched networks like Frame Relay and ATM. Diagrams are provided illustrating concepts like scheduling queues, traffic shaping with leaky buckets, and resource reservation with RSVP.

Uploaded by

نهلة الأعرج
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
49 views

Attachment

This document discusses quality of service (QoS) in computer networks. It covers several topics related to QoS including definitions of QoS, QoS guarantees, traffic specifications, scheduling algorithms, call admission protocols, flow characteristics, QoS classes, motivation for QoS, Internet and ATM service classes, the call admission problem, integrated services, differentiated services, and QoS in switched networks like Frame Relay and ATM. Diagrams are provided illustrating concepts like scheduling queues, traffic shaping with leaky buckets, and resource reservation with RSVP.

Uploaded by

نهلة الأعرج
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 39

Quality of Service

13.1
QoS Guarantees

 introduction
 call admission
 traffic specification
 link-level scheduling
 call setup protocol

24.2
QUALITY OF SERVICE

Quality of service (QoS) is an internetworking issue


that has been discussed more than defined. We can
informally define quality of service as something a
flow seeks to attain.

Topics discussed in this section:


Flow Characteristics
Flow Classes

13.3
QoS Definitions

 Qos is a set of technologies that enables


network administrators to manage the
effects of congestion on application traffic
by using network resources optimally
 or, allocate different resourses for
different data flows

24.4
QoS classes

 Best-effort - No gurantees at all


 Soft QoS - differentiated guarantess
 Hard QoS - full guarantees

24.5
Motivation

Certain applications require minimum level of


network performance:
 Internet telephone, teleconferencing:
delays > 500ms impair human
interaction
 session guaranteed QoS or is blocked
(denied admission to network)
 starting to look like telephone net!

24.6
Fundamental mismatch between QoS and packet
switching
 packet switching: statistically share resources

in hope that sessions' peak demands don't


coincide
 100% certain guarantees require accounting for worst
case behavior (no matter how unlikely)
 admitting/denying session on worst case
demands equivalent to circuit switching!

24.7
Internet service classes

Current service model: "best-effort"


 send packet and hope performance is OK

Next generation Internet service classes:


guaranteed service: "provides firm (mathematically provable) bounds
on end-to-end datagram queuing delays. This service makes it possible
to provide a service that guarantees both delay and bandwidth."
controlled load: "a QoS closely approximating the QoS that same flow
would receive from an unloaded network element, but uses capacity
(admission) control to assure that this service is received even when
the network element is overloaded."
best effort: current service model

24.8
ATM service classes
ATM service classes:
CBR: constant bit rate, guaranteed bandwidth, constant end-end
delay
ABR: guaranteed minimum cell rate (bandwidth), more possible if
available (congestion control via RM cells)
UBR: unspecified bit rate, no congestion control

Comparing Internet and ATM service classes:


 how are guaranteed service and CBR alike/different?
 how are controlled load and ABR alike/different?

24.9
The call admission problem

Network must decide whether to "admit" offered


call (session)
Current networks: all calls accepted,
performance degrades as more calls carried
Question: can requested QoS be met while
honoring previously made QoS commitments to
already accepted calls?

24.10
Flow characteristics

13.11
TECHNIQUES TO IMPROVE QoS

we tried to define QoS in terms of its characteristics.


In this section, we discuss some techniques that can be
used to improve the quality of service. We briefly
discuss four common methods: scheduling, traffic
shaping, admission control, and resource reservation.

Topics discussed in this section:


Scheduling
Traffic Shaping
Resource Reservation
Admission Control

13.12
FIFO queue

13.13
Priority queuing

13.14
Weighted fair queuing

9.15
Leaky bucket

9.16
Leaky bucket implementation

9.17
Note

A leaky bucket algorithm shapes bursty


traffic into fixed-rate traffic by averaging
the data rate. It may drop the packets if
the bucket is full.

9.18
Note

The token bucket allows bursty traffic at


a regulated maximum rate.

9.19
INTEGRATED SERVICES

Two models have been designed to provide quality of


service in the Internet: Integrated Services and
Differentiated Services. We discuss the first model
here.

Topics discussed in this section:


Signaling
Flow Specification
Admission
Service Classes
RSVP
Problems with Integrated Services
9.20
Note

Integrated Services is a flow-based QoS


model designed for IP.

9.21
Resv messages

9.22
Reserving Resources

 call setup protocol needed to perform


call admission, reserve resources at
each router on end-end path

24.23
Reservation merging

9.24
DIFFERENTIATED SERVICES

Differentiated Services (DS or Diffserv) was


introduced by the IETF (Internet Engineering Task
Force) to handle the shortcomings of Integrated
Services.

Topics discussed in this section:


DS Field

9.25
Note

Differentiated Services is a class-based


QoS model designed for IP.

9.26
QoS IN SWITCHED NETWORKS

Let us now discuss QoS as used in two switched


networks: Frame Relay and ATM. These two networks
are virtual-circuit networks that need a signaling
protocol such as RSVP.

Topics discussed in this section:


QoS in Frame Relay
QoS in ATM

9.27
Figure 24.28 Relationship between traffic control attributes

9.28
Figure 24.29 User rate in relation to Bc and Bc + Be

9.29
Figure 24.30 Service classes

9.30
Figure 24.31 Relationship of service classes to the total capacity of the network

9.31
QoS on The Internet

 IP designed to provide best-effort, fair delivery service


 All packets treated equally
 As traffic grows, congestion occurs, all packet delivery slowed
 Packets dropped at random to ease congestion
 Only networking scheme designed to support both
traditional TCP and UDP and real-time traffic is ATM
 Means constructing second infrastructure for real-time traffic or
replacing existing IP-based configuration with ATM
 Two types of traffic
 Elastic traffic can adjust, over wide ranges, to changes in delay
and throughput
 Supported on TCP/IP
 Handle congestion by reducing rate data presented to network

9.32
Application Delay Sensitivity and Criticality

24.33
Required Data Rates for Various Information Types

24.34
Performance Metrics
 Throughput, or capacity
 Data rate in bits per second (bps)
 Affected by multiplexing
 Effective capacity reduced by protocol overhead
 Header bits: TCP and IPv4 at least 40 bytes
 Control overhead: e.g. acknowledgements
 Delay
 Average time for block of data to go from system to system
 Round-trip delay
 Getting data from one system to another plus delay acknowledgement
 Transmission delay: Time for transmitter to send all bits of packet
 Propagation delay: Time for one bit to transit from source to destination
 Processing delay: Time required to process packet at source prior to
sending, at any intermediate router or switch, and at destination prior
to delivering to application
 Queuing delay: Time spend waiting in queues

24.35
Outline

 Real-time challenges  Traffic management


 Real-time protocols architectures
 RTP, RTCP, RTSP  IntServ, Diffserv, RSVP
 QoS  VoIP
 Definitions  H.323, SIP
 Goals

24.36
RTP- Real-time transport
protocols
 Ip-based protocol providing
 time-reconstruction
 loss detection
 security
 content identification
 Designed primarily for multicast of real-
time data (also unicast, simplex, duplex)

24.37
How does RTP works
 Timestamping - most important information for real-time
applications.
 The sender timestamp according to the instant the

first octet in the packet was sampled.


 The receiver uses timestamp to reconstruct the

original timing
 Also used for synchronize different streams; audio an

video in MPEG. ( Application level responsible for the


actual synchronization)

24.38
What is Streaming?

 Streaming breaks data into packets; real-


time data through the transmission,
decompressing just like a water stream.
 A client can play the first packet, decompress
the second, while receiving the third.
 The user can start enjoying the multimedia
without waiting to the end of the transmission

24.39

You might also like