Quality of Service

14
1 Quality of Service Outline Realtime Applications Integrated Services Differentiated Services

description

Quality of Service. Outline Realtime Applications Integrated Services Differentiated Services. Sampler,. Microphone. A D. Buffer,. D A. converter. Speaker. Realtime Applications. Require “deliver on time” assurances must come from inside the network - PowerPoint PPT Presentation

Transcript of Quality of Service

Page 1: Quality of Service

1

Quality of Service

OutlineRealtime Applications

Integrated Services

Differentiated Services

Page 2: Quality of Service

2

Realtime Applications

• Require “deliver on time” assurances– must come from inside the network

• Example application (audio)– sample voice once every 125us

– each sample has a playback time

– packets experience variable delay in network

– add constant factor to playback time: playback point

Microphone

Speaker

Sampler,A Dconverter

Buffer,D A

Page 3: Quality of Service

3

Playback BufferS

eque

nce

num

ber

Packetgeneration

Networkdelay

Buffer

Playback

Time

Packetarrival

Page 4: Quality of Service

4

Example Distribution of Delays

1

2

3 90% 97% 98% 99%

150 20010050

Delay (milliseconds)

Page 5: Quality of Service

5

TaxonomyApplications

Elastic

Intolerant

Real time

Tolerant

Nonadaptive Adaptive

Delay adaptiveRate adaptive

Page 6: Quality of Service

6

Integrated Services

• Service Classes– guaranteed

– controlled-load

• Mechanisms– signalling protocol

– admission control

– policing

– packet scheduling

Page 7: Quality of Service

7

Flowspec

• Rspec: describes service requested from network– controlled-load: none– guaranteed: delay target

• Tspec: describes flow’s traffic characteristics– average bandwidth + burstiness: token bucket filter– token rate r– bucket depth B– must have a token to send a byte– must have n tokens to send n bytes– start with no tokens– accumulate tokens at rate of r per second– can accumulate no more than B tokens

Page 8: Quality of Service

8

Flowspec (cont)

• Two flows with equal average rates but different token bucket descriptions

Page 9: Quality of Service

9

Per-Router Mechanisms

• Admission Control– decide if a new flow can be supported– answer depends on service class– not the same as policing

• Packet Processing– classification: associate each packet with the

appropriate reservation– scheduling: manage queues so each packet receives the

requested service

Page 10: Quality of Service

10

Reservation Protocol• Called signaling in ATM• Proposed Internet standard: RSVP• Consistent with robustness of today’s connectionless model• Uses soft state (refresh periodically)• Designed to support multicast• Receiver-oriented• Two messages: PATH and RESV• Source transmits PATH messages every 30 seconds• Destination responds with RESV message• Merge requirements in case of multicast• Can specify number of speakers

Page 11: Quality of Service

11

RSVP ExampleSender 1

Sender 2

PATH

PATH

RESV(merged)

RESV

RESV

Receiver B

Receiver A

R

R

R

R

R

Page 12: Quality of Service

12

RSVP versus ATM (Q.2931)• RSVP

– receiver generates reservation– soft state (refresh/timeout)– separate from route establishment– QoS can change dynamically– receiver heterogeneity

• ATM– sender generates connection request– hard state (explicit delete)– concurrent with route establishment– QoS is static for life of connection– uniform QoS to all receivers

Page 13: Quality of Service

13

Differentiated Services• Problem with IntServ: scalability• Idea: segregate packets into a small number of classes

– e.g., premium vs best-effort

• Packets marked according to class at edge of network• Core routers implement some per-hop-behavior (PHB)• Example: Expedited Forwarding (EF)

– rate-limit EF packets at the edges– PHB implemented with class-based priority queues or WFQ

Page 14: Quality of Service

14

DiffServ (cont)

• Assured Forwarding (AF)– customers sign service

agreements with ISPs

– edge routers mark packets as being “in” or “out” of profile

– core routers run RIO: RED with in/out

P(drop)

1.0

MaxP

Minin MaxinMaxoutMinout

AvgLen