QoS
(Graduate level)
Lecture 6: Quality of Service
Introduction
Ali Mohammad Zareh Bidoki
1
Next paper for review
v "Analysis and Simulation of a Fair Queueing
Algorithm, Internetworking: Research and
Experience"
2
QOS: What is it & Why would we
want it?
v Many applications are sensitive to the
effects of delay, jitter and packet loss.
v The existing Internet architecture
provides a best effort service.
v All traffic is treated equally (FIFO
queuing). Currently there is no mechanism
for distinguishing between delay sensitive
and best effort traffic.
v IPv4 TOS is not widely implemented.
3
Network QoS definition
v The capability to control traffic-handling
mechanisms in the network such that the
network meets the service needs of
certain applications and users subject to
network policies
v Network QoS provides mechanisms to
control the allocation of resources among
applications and users (final goal in
ARPANET)
4
Application Requirements
v Bandwidth : The rate that application’
traffic must be carried by the network
v Latency : the delay that an application can
tolerate in delivering a packet
v Jitter
v Loss
5
Traffic Handling
6
Flows, Conversations and Traffic
Aggregates
v A Flow is a subset of all packets passing
through a network device that has uniform
QoS requirements
v Conversation: all traffic flowing in a single
direction from specific instance of a
specific application on one host to a
specific host (unicast) or multiple host
(multicast)
v A flow can include a single or multiple
conversation (called traffic aggregation).
7
Packet classification
8
Traffic Handling Mechanisms
v 802 user priority
v Differentiated Services (DiffServ)
v Integrated Services (IntServ)
v ATM, ISSLOW
9
802 user priority
v Based on IEEE 802 technology used in
Ethernet, token ring and FDDI
v An eight bit priority values in Layer 2 header of 802
v Strict priority value
10
Differentiated Services (DiffServ)
v It is a Layer 3 traffic handling (class of
service mechanisms)
v DiffServ defines a field called DiffServ
codepoint (DSCP) I Layer 3 header of IP
packets (type of service field)
v Routers uses DSCP to classify and apply a
specific scheduling (called per-hop
behaviors or PHP)
11
SLA in DiffServ
v Service parameters are characterized at
edges of the DiffServ network in form of
service level agreement (SLA).
12
Admission Control
v It is a process by which certain traffic is
admitted to a network or to a particular
service level within a network while other
traffic is refused admission or rejected
13
Overall concept in DiffServ
14
Integrated Services (IntServ)
v It original focus was on services that
enable the integration of voice, video and
data on the Internet
v Due to focus on Multimedia traffic, it is
expected to provide very quantifiable and
measurable service characteristics
v RSVP protocol (per conversation signaling)
v This contrasts with the aggregate services
and the underlying aggregate traffic
handling (802 user-priority & DiffServ)
15
ATM (Asynchronous Transfer
Mode)
v ATM traffic is separated into flows which
are referred to as virtual circuits (VC)
v Each VS supports one of”
v Constant bit rate (CBR)
v Variable bit rate (VBR)
v Unknown bit rate (UBR)
16
Push versus Signaled Mechanisms
17
RSVP (end-to-end QoS in Layer 3)
v Two significant RSVP messages:
v PATH is sent by transmitting applications toward receivers
v RESV is sent by receivers
v RSVP messages carray the following information:
v How the network can identify traffic on a conversation
(classification information, IP & port of source nad destination)
v The service type required from the network for the
conversation’ traffic
v Quantitative parameters describing the traffic on the
conversation (data rate.., token-bucket model)
18
Explicit Admission control using
RSVP
19
Quality/ Efficiency product
v Efficiency refers to the amount of
network capacity (in terms of bandwidth)
required to provide a certain quality of
service
v Q*E=C
v We are going to raise C
20
Quality/ Efficiency product
21
Different Signaling & Traffic
handling
22
Improving QE by Combining push
provisioning & Aggregate Traffic
handling
23
24
Improving QE by Admission Control
25
Signaling Issues
v Signaling costs
v Topology awareness
26
