Mul$media

 Networking  

#10  QoS  
Semester  Ganjil  2012  
PTIIK  Universitas  Brawijaya  
 Schedule  of  Class  Mee$ng  
1.  Introduc$on     8.  Overlay  Mul$cast  
2.  Applica$ons  of  MN   9.  CDN:  Solu$ons  
3.  Requirements  of  MN   10. CDN:  Case  Studies  
4.  Coding  and   11. QoS  on  the  Internet:  
Compression   Constraints  
5.  RTP   12. QoS  on  the  Internet:  
6.  IP  Mul$cast   Solu5ons  
7.  IP  Mul$cast  (cont’d)     13. Discussion  
14. Summary  
Multmedia  Networking   2  
 Today’s  Outline  
•  Network  support  for  mul$media  
–  General  QoS  
–  Differen$ated  QoS  
–  Per-­‐Connec$on  Flow  QoS  

Multmedia  Networking   3  
 Network  support  for  mul$media  

Approach   Granularity   Guarantee   Mechanism   Complex?   Deployed?  

all  traffic   applica$on-­‐layer  

Making  best-­‐
treated   none,  or  so`   support  (CDNs  &   minimal   everywhere  
effort  service  
equally   overlays)  
packet  marking,  
Differen$ated   per  class  of  
none,  or  so`   policing,   medium   some  
service   traffic  
scheduling  
packet  marking,  
Per-­‐ per  source-­‐ so`  or  hard,  
policing,  
connec$on   des$na$on   once  is   high   licle  
scheduling;  call  
QoS   flow   admiced  
admission  

Multmedia  Networking   4  
 Dimensioning best effort networks
•  approach:  deploy  enough  link  capacity  so  that  
conges$on  doesn’t  occur,  mul$media  traffic  flows  
without  delay  or  loss  
–  low  complexity  of  network  mechanisms  (use  current  
“best  effort”  network)  
–  high  bandwidth  costs  
•  challenges:  
–  network  dimensioning:  how  much  bandwidth  is  
“enough?”  
–  es3ma3ng  network  traffic  demand:  needed  to  
determine  how  much  bandwidth  is  “enough”  (for  that  
much  traffic)  
Multmedia  Networking   5  
 Providing  mul$ple  classes  of  service  
•  thus  far:  making  the  best  of  best  effort  service  
–  one-­‐size  fits  all  service  model  
•  alterna$ve:  mul$ple  classes  of  service  
–  par$$on  traffic  into  classes  
–  network  treats  different  classes  of  traffic  differently  
(analogy:  VIP  service  versus  regular  service)  
  granularity:  differen$al   0111

service  among  mul$ple  

classes,  not  among  
individual  connec$ons  
  history:  ToS  bits  
Multmedia  Networking   6  
 Mul$ple  classes  of  service:  scenario  

H3
H1
R1 R2

H4
H2 R1 output 1.5 Mbps link
interface
queue

Multmedia  Networking   7  
 Scenario  1:  mixed  HTTP  and  VoIP  
•  example:    1Mbps  VoIP,  HTTP  share  1.5  Mbps  link.  
–  HTTP  bursts  can  congest  router,  cause  audio  loss  
–  want  to  give  priority  to  audio  over  HTTP  
R1
R2

Principle  1  
packet marking needed for router to distinguish
between different classes; and new router policy to
treat packets accordingly
Multmedia  Networking   8  
 Principles  for  QOS  guarantees  (more)  
•  what  if  applica$ons  misbehave  (VoIP  sends  higher  
than  declared  rate)  
–  policing:  force  source  adherence  to  bandwidth  alloca$ons  
•  marking,  policing  at  network  edge  
1 Mbps
phone
R1 R2

1.5 Mbps link

packet marking and policing

Principle  2  
provide  protec$on  (isola$on)  for  one  class  from  others  
Multmedia  Networking   9  
 Principles  for  QOS  guarantees  (more)  
•  alloca$ng  fixed  (non-­‐sharable)  bandwidth  to  
flow:  inefficient  use  of  bandwidth  if  flows  
doesn’t  use  its  alloca$on  
1 Mbps 1 Mbps logical link
phone R1
R2

1.5 Mbps link

0.5 Mbps logical link

Principle  3  
while  providing  isola$on,  it  is  desirable  to  use    
resources  as  efficiently  as  possible  
Multmedia  Networking   10  
Scheduling  and  policing  mechanisms  
•  scheduling:  choose  next  packet  to  send  on  link  
•  FIFO  (first  in  first  out)  scheduling:  send  in  order  of  
arrival  to  queue  
–  real-­‐world  example?  
–  discard  policy:  if  packet  arrives  to  full  queue:  who  to  
discard?  
•  tail  drop:  drop  arriving  packet  
•  priority:  drop/remove  on  priority  basis  
•  random:  drop/remove  randomly  

packet packet
arrivals queue link departures
(waiting area) (server)

Multmedia  Networking   11  
 Scheduling  policies:  priority  
priority  scheduling:  
high priority queue
(waiting area)
send  highest   arrivals departures
priority  queued  
packet     classify link
•  mul$ple  classes,   low priority queue
(server)

with  different   (waiting area)

priori$es   2
1 3 4 5
–  class  may  depend   arrivals

on  marking  or  other   packet

header  info,  e.g.  IP   in
service
1 3 2 4 5
source/dest,  port  
numbers,  etc.   departures
1 3 2 4 5
–  real  world  example?    
Multmedia  Networking   12  
 Scheduling  policies:  s$ll  more  
Round  Robin  (RR)  scheduling:  
•  mul$ple  classes  
•  cyclically  scan  class  queues,  sending  one  
complete  packet  from  each  class  (if  available)  
•  real  world  example?  
2
1 3 4 5
arrivals

packet
in 1 3 2 4 5
service

departures
1 3 3 4 5

Multmedia  Networking   13  
 Scheduling  policies:  s$ll  more  
Weighted  Fair  Queuing  (WFQ):    
•  generalized  Round  Robin  
•  each  class  gets  weighted  amount  of  service  in  
each  cycle  
•  real-­‐world  example?  

Multmedia  Networking   14  
 Policing  mechanisms  
goal:  limit  traffic  to  not  exceed  declared  parameters  
Three  common-­‐used  criteria:    
•  (long  term)  average  rate:  how  many  pkts  can  be  
sent  per  unit  $me  (in  the  long  run)  
–  crucial  ques$on:  what  is  the  interval  length:  100  
packets  per  sec  or  6000  packets  per  min  have  same  
average!  
•  peak  rate:  e.g.,  6000  pkts  per  min  (ppm)  avg.;  
1500  ppm  peak  rate  
•  (max.)  burst  size:  max  number  of  pkts  sent  
consecu$vely  (with  no  intervening  idle)  

Multmedia  Networking   15  
 Policing  mechanisms:  implementa$on  
token  bucket:  limit  input  to  specified  burst  size  and  
average  rate    
 
 
 
 
 
•  bucket  can  hold  b  tokens  
•  tokens  generated  at  rate  r  token/sec  unless  bucket  full  
•  over  interval  of  length  t:  number  of  packets  admiHed  
less  than  or  equal  to    (r  t  +  b)  
Multmedia  Networking   16  
 Policing  and  QoS  guarantees  
•  token  bucket,  WFQ  combine  to  provide  
guaranteed  upper  bound  on  delay,  i.e.,  QoS  
guarantee!  
arriving token rate, r
traffic

bucket size, b
per-flow
rate, R
WFQ

arriving
D = b/R
max
traffic

Multmedia  Networking   17  
 Differen$ated  services  
•  want  “qualita$ve”  service  classes  
–  “behaves  like  a  wire”  
–  rela$ve  service  dis$nc$on:  Pla$num,  Gold,  Silver  
•  scalability:  simple  func$ons  in  network  core,  
rela$vely  complex  func$ons  at  edge  routers  (or  
hosts)  
–  signaling,  maintaining  per-­‐flow  router  state    difficult  
with  large  number  of  flows    
•  don’t  define  define  service  classes,  provide  
func$onal  components  to  build  service  classes  
Multmedia  Networking   18  
 DiffServ  architecture  
edge router:
  per-flow traffic management
  marks packets as in-profile and
out-profile

core router:
  per class traffic management
  buffering and scheduling based on
marking at edge
  preference given to in-profile
packets over out-of-profile packets
Multmedia  Networking   19  
 DiffServ  architecture
marking  
r
edge router:
  per-flow traffic management b
  marks packets as in-profile and
out-profile

core router:
  per class traffic management
  buffering and scheduling based on
marking at edge
  preference given to in-profile
packets over out-of-profile packets
Multmedia  Networking   20  
 DiffServ  architecture  
edge router:
scheduling
  per-flow traffic management
marks packets as in-profile and
..
 
out-profile
.

core router:
  per class traffic management
  buffering and scheduling based on
marking at edge
  preference given to in-profile
packets over out-of-profile packets
Multmedia  Networking   21  
Edge-­‐router  packet  marking    
  profile:  pre-­‐nego$ated  rate  r,  bucket  size  b  
  packet  marking  at  edge  based  on  per-­‐flow  profile  

rate r

user packets

possible  use  of  marking:  

  class-­‐based  marking:  packets  of  different  classes  marked  
differently  
  intra-­‐class  marking:  conforming  por$on  of  flow  marked  
differently  than  non-­‐conforming  one  
Multmedia  Networking   22  
 Diffserv  packet  marking:  details  
•  packet  is  marked  in  the  Type  of  Service  (TOS)  
in  IPv4,  and  Traffic  Class  in  IPv6  
•  6  bits  used  for  Differen$ated  Service  Code  
Point  (DSCP)  
–  determine  PHB  that  the  packet  will  receive  
–  2  bits  currently  unused  
DSCP unused

Multmedia  Networking   23  
 Classifica$on,  condi$oning  
may  be  desirable  to  limit  traffic  injec$on  rate  
of  some  class:  
•  user  declares  traffic  profile  (e.g.,  rate,  burst  
size)  
•  traffic  metered,  shaped  if  non-­‐conforming    

Multmedia  Networking   24  
 Forwarding  Per-­‐hop  Behavior  (PHB)  
•  PHB  result  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  
$me  intervals  of  a  specified  length  
–  class  A  packets  leave  first  before  packets  from  
class  B  

Multmedia  Networking   25  
 Forwarding  PHB  
PHBs  proposed:  
•  expedited  forwarding:  pkt  departure  rate  of  a  
class  equals  or  exceeds  specified  rate    
–  logical  link  with  a  minimum  guaranteed  rate  
•  assured  forwarding:  4  classes  of  traffic  
–  each  guaranteed  minimum  amount  of  bandwidth  
–  each  with  three  drop  preference  par$$ons  

Multmedia  Networking   26  
Per-­‐connec$on  QOS  guarantees    
•  basic  fact  of  life:  can  not  support  traffic  
demands  beyond  link  capacity  
1 Mbps
phone R1
R2

1 Mbps 1.5 Mbps link

phone

Principle  4  
call  admission:  flow  declares  its  needs,  network  may    
block  call  (e.g.,  busy  signal)  if  it  cannot  meet  needs  
Multmedia  Networking   27  
QoS  guarantee  scenario  
•  resource  reserva3on  
–  call  setup,  signaling  (RSVP)  
–  traffic,  QoS  declara$on  
–  per-­‐element  admission  control  

Multmedia  Networking   28  
 QoS  guarantee  scenario  
•  resource  reserva3on  
–  call  setup,  signaling  (RSVP)  
–  traffic,  QoS  declara$on  
–  per-­‐element  admission  control  

  QoS-sensitive scheduling
(e.g., WFQ)

Multmedia  Networking   29  
 QoS  guarantee  scenario  
•  resource  reserva3on  
–  call  setup,  signaling  (RSVP)  
–  traffic,  QoS  declara$on  
–  per-­‐element  admission  control  

request/
reply

  QoS-sensitive scheduling
(e.g., WFQ)

Multmedia  Networking   30