Scribd
Upload
43 views

Đa Phương Tiện Nâng Cao (Advanced Multimedia) : Qos Architectures Supporting Multimedia

This document discusses quality of service (QoS) architectures for supporting multimedia, including DiffServ and RSVP. It begins by defining QoS and listing examples of multimedia QoS parameters. It then covers QoS classes and the principles of QoS guarantees, including packet marking, protection, efficient usage, and call admission control. It describes traffic scheduling and policing mechanisms like priority queuing and weighted fair queuing. Finally, it summarizes integrated services with resource reservation and differentiated services which focuses on edge functions, core functions using per-hop behavior, and issues with multiple autonomous systems.

Uploaded by

Duc Duong
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
43 views

Đa Phương Tiện Nâng Cao (Advanced Multimedia) : Qos Architectures Supporting Multimedia

This document discusses quality of service (QoS) architectures for supporting multimedia, including DiffServ and RSVP. It begins by defining QoS and listing examples of multimedia QoS parameters. It then covers QoS classes and the principles of QoS guarantees, including packet marking, protection, efficient usage, and call admission control. It describes traffic scheduling and policing mechanisms like priority queuing and weighted fair queuing. Finally, it summarizes integrated services with resource reservation and differentiated services which focuses on edge functions, core functions using per-hop behavior, and issues with multiple autonomous systems.

Uploaded by

Duc Duong
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 34

a phng tin nng cao

(Advanced Multimedia)
Part III: QoS Architectures
Supporting Multimedia
Lecturer: Dr. Phat Nguyen Huu
Phone: 0916525426
Email: [email protected]
Address: School of Electronics and Telecommunications,
Hanoi University of Science and Technology

Agenda
QoS provision and control
DiffServ
RSVP

Quality of Service

Quality of service measures the kind of service provided


by the system
On systems that can offer flexible services, QoS
allows us to compare the service received
MM systems consist of set of services
Examples of Multimedia QoS parameters:
QoS for Audio service:
Sample rate 8000 samples/second
Sample resolution 8 bits per sample

QoS for network service:


Throughput 100 Mbps
Connection setup time 50 ms

Layered Model for QoS

Application QoS Parameters

System QoS Parameters

Network QoS Parameters

QoS Classes
Guaranteed Service Class
QoS guarantees are provided based on
deterministic and statistical QoS parameters

Predictive Service Class


QoS parameter values are estimated and based
on the past behavior of the service

Best Effort Service Class


There are no guarantees or only partial
guarantees are provided

Traffic Scheduling & Policing: Int-Serv, Diff-Serv, RSVP

IETF groups are working on proposals to improve QoS


control in IP networks, i.e., going beyond best effort to
provide some assurance for QOS
Work in Progress includes RSVP, Differentiated Services,
and Integrated Services
Simple model for sharing and congestion studies

Principles for QOS Guarantees

Consider a phone application at 1Mbps and an FTP application sharing a


1.5 Mbps link.
Bursts of FTP can congest the router and cause audio packets to be
dropped want to give priority to audio over FTP !!
PRINCIPLE 1: Marking of packets is needed for router to distinguish
between different classes; and new router policy to treat packets
accordingly

Principles for QOS Guarantees (2)

Applications misbehave (audio sends packets at a rate higher than


1Mbps assumed above);
PRINCIPLE 2: provide protection (isolation) for one class from other
classes
Require Policing Mechanisms to ensure sources adhere to bandwidth
requirements; Marking and Policing need to be done at the edges:

Principles for QOS Guarantees (3)

Alternative to Marking and Policing: allocate a set portion of


bandwidth to each application flow; can lead to inefficient use
of bandwidth if one of the flows does not use its allocation
PRINCIPLE 3: While providing isolation, it is desirable to use
resources as efficiently as possible

Principles for QOS Guarantees (4)

Cannot support traffic beyond link capacity


PRINCIPLE 4: Need a Call Admission Process;
application flow declares its needs, network
may block call if it cannot satisfy the needs

Summary

Scheduling And Policing Mechanisms


Scheduling: choosing the next packet for transmission on
a link can be done following a number of policies;
FIFO: in order of arrival to the queue; packets that arrive
to a full buffer are either discarded, or a discard policy is
used to determine which packet to discard among the
arrival and those already queued

Scheduling Policies

Priority Queuing: classes have different priorities;


class may depend on explicit marking or other header
info, eg IP source or destination, TCP Port numbers,
etc.
Transmit a packet from the highest priority class with
a non-empty queue
Preemptive and non-preemptive versions

Scheduling Policies (2)


Round Robin: scan class queues serving one from each class
that has a non-empty queue

Scheduling Policies (3)

Weighted Fair Queuing: is a generalized


Round Robin in which an attempt is made to
provide a class with a differentiated amount
of service over a given period of time

Policing Mechanisms
Three criteria:
(Long term) Average Rate (100 packets per sec
or 6000 packets per min??), crucial aspect is the
interval length
Peak Rate: e.g., 6000 p p minute Avg and 1500
p p sec Peak
(Max.) Burst Size: Max. number of packets sent
consecutively, ie over a short period of time

Policing Mechanisms
Token Bucket mechanism, provides a means
for limiting input to specified Burst Size and
Average Rate.

Policing Mechanisms (2)


Bucket can hold b tokens;
token are generated at a rate
of r token/sec unless bucket
is full of tokens.
Over an interval of length t,
the number of packets that
are admitted is less than or
equal to (r t + b).
Token bucket and WFQ can
be combined to provide
upper
bound on delay.

Integrated Services

An architecture for providing QOS guarantees in IP


networks for individual application sessions
Relies on resource reservation, and routers need to:
Maintain state info (Virtual Circuit) maintaining records of
allocated resources and..
Respond to new Call setup requests on that basis

Call Admission
Session must first declare its QoS requirement
and characterize the traffic it will send
through the network
R-spec: defines the QoS being requested
T-spec: defines the traffic characteristics
A signaling protocol is needed to carry the Rspec and T-spec to the routers where
reservation is required RSVP is a leading
candidate for such signaling protocol

Call
Admission
Call Admission: routers will admit calls based on their Rspec and T-spec and base on the current resource
allocated at the routers to other calls.

Integrated Services: Classes


Guaranteed QOS: this class is provided with firm
bounds on queuing delay at a router; envisioned
for hard real-time applications that are highly
sensitive to end-to-end delay expectation and
variance
Controlled Load: this class is provided a QOS
closely approximating that provided by an
unloaded router; envisioned for todays IP
network real-time applications which perform
well in an unloaded network

Differentiated Services
Intended to address the following difficulties with Intserv
and RSVP:
Scalability: maintaining states by routers in high speed
networks is difficult sue to the very large number of flows
Flexible Service Models: Intserv has only two classes.
More qualitative service classes, relative service
distinction (Platinum, Gold, Silver, ) are wanted.
Simpler signaling: (than RSVP) many applications and
users may only want to specify a more qualitative notion
of service

Differentiated Services
Approach:
Only simple functions in the core, and relatively
complex functions at edge routers (or hosts)
Do not define service classes, instead provides
functional components with which service classes
can be built

Edge Functions

At DS-capable host or first DS-capable router


Classification: edge node marks packets according to classification
rules to be specified (manually by admin, or by some TBD protocol)
Traffic Conditioning: edge node may delay and then forward or
may discard

Core Functions
Forwarding: according to Per-Hop-Behavior
or PHB specified for the particular packet
class; PHB is strictly based on class marking
(no other header fields can be used to
influence PHB)
BIG ADVANTAGE:
No state info to be maintained by routers!

Classification and Conditioning


Packet is marked in the Type of Service (TOS) in
IPv4, and Traffic Class in IPv6
6 bits used for Differentiated Service Code Point
(DSCP) and determine PHB that the packet will
receive
2 bits are currently unused

Classification and Conditioning

It may be desirable to limit traffic injection


rate of some class; user declares traffic profile
(eg, rate and burst size); traffic is metered and
shaped if non-conforming

Forwarding (PHB)

PHB results in a different observable


(measurable) forwarding performance behavior
PHB does not specify what mechanisms to use
to ensure required PHB performance behavior
Examples:
Class A gets x% of outgoing link bandwidth over time
intervals of a specified length
Class A packets leave first before packets from class B

Forwarding (PHB)

PHBs under consideration:

Expedited Forwarding (EF): departure rate of


packets from a class equals or exceeds a specified
rate (logical link with a minimum guaranteed
rate)
Assured Forwarding (AF): 4 classes, each
guaranteed a minimum amount of bandwidth
and buffering; each with three drop preference
partitions

Differentiated Services Issues

Virtual Leased lines and Olympic services


are being discussed
Impact of crossing multiple ASs and routers
that are not DS-capable

You might also like