(Resource Allocation and

Quality of Service)


(Deterministic)
(Integrated
vs. Differentiated services model).

(scheduling)


(bandwidth)
(buffer)
(packet storage)
(Routing tables)

(CPU processing speed of switches and
routers)

:



;


(Email)

,

(file transfer)



()
(www)






(remote login)



Audio on demand




Video on demand




Audio + Video on Demand

k)
ba
c
y


(pla

 Audio + Video on Demand

Videoconferencing




videoconferencing

, ;


.
(constant bit rate)
..,
(variable bit rate)
.., video

(available bit rate)


.., (compressed documents)

.


(reliability)
(packet loss)
(delay)

(jitter)

(Bandwidth)
(fairness)

.
(throughput)









Tx 2 Tx 3 Tx 4
,

Tx 1 Rx 1

Rx 2 Rx 3 Rx 4


.









.


(open loop)

.

(closed loop)


, , throughout,
, .


.

.

.
, .


(hosts)


(reservation) .

.

TCP;


(buffering and scheduling)










(admission control)

.


.
,
, .
..,
;

.

(datagram)

(0 u 1) , f={0, 1}
unew = auold + ( 1 - a ) f
umax

.
bit
choke packets
,

.
Choke packets to source
Hop-by-hop choke packets
 Choke Packets

Choke
packet

; RTT
Hop-by-hop Choke Packets

Choke
packet

.



,
12,

.

;


.
:

(pricing)
Random Early Detection (RED)

,
,

Qave = wQave + ( 1 - w ) q
MaxP
MinThreshold
MaxThreshold
Qave


 (Traffic
Shaping)
,

!
(burstiness)

.

.

1Mbps

1Mbps
1Mbps

0 2 4 6 8 10
Leaky Bucket Algorithm

,
.
, .
Token Bucket Algorithm

.
,
.

r


b

t,

b + rt
 Token Bucket Algorithm

10Mbps. token
bucket algorithm byte

r = 1Mbps
: b= 1Mb
,
token bucket
.

1Mb 1
Mbps

10Mbps
t= = = 1.11sec
( 10 - 1) Mbps 9
1Mbps

t

(Quality of Service (QoS) Provisioning)

(deterministic or
stochastic guarantees)

(Integrated Services)
(Differentiated Services)

(packet queueing and
scheduling)


N
p
1Mbps, q=1-p .
;

N Mbps
, k

N k N!
Pr ( k ) = p ( 1 - p ) pk ( 1 - p )
N -k N -k
=
k ( N - k )!k !
(utilization) C Mbps
1 N 1 N N! Np
U = k Pr ( k ) = k pk ( 1 - p )
N -k
=
C k =0 C k = 0 ( N - k ) !k ! C
:
N
Pr( F ) = Pr ( k )
k = C +1


N=100 p=0.1, q=0.9

N=100 Mbp

C U Pr[F]
100 0.1 0
80 0.125 2 10-62
60 0.17 210-35
40 0.25 510-16
20 0.5 810-4
10 1 0.42

(Worst Case Design)

,

..,



,
, !
.
(utilization)
.
 (Resource
Reservation)

,

.

.

(admission control).
: , (CPU)

;
.

throughput
 (Resource
Reservation)

1/ =1 sec .

=900,000 (Poisson)
;


(idle)


1 1
T= = 10 m Sec
m 1- l / m


!

(Service Level Agreement)

:



. Token bucket rate r Bytes/sec

Token bucket size b Bytes
(traffic)
Peak data rate Bytes/sec
.
Minimum packet size Bytes

Maximum packet Bytes
Leaky bucket algorithm size
Token bucket algorithm

(Service Level Agreement)

,

, .





.
 (Integrated
Services)

.
(Resource
reSerVation protocol RSVP)

(receiver based).
PATH
RESV.


( 30 )
PATH RESV.
 RSVP

O Sender 1
PATH PATH

R
Sender 2
R
PATH

RESV RESV
(merged)
R
RESV

. R Receiver A

RESV
R
RESV

Receiver B
(Reverse
Path Algorithm)

(Differentiated Services)

(scalability
problem)
Differentiated Services:

.
,
,
.



(scalability)

( )

(Differentiated Services)

Expedited Forwarding (EF)

.
Assured Forwarding (AF)
4 AF

.
12 AF.
Best Effort
,


.


FIFO (First In First Out)

Round-Robin
Fair Queueing
Weighted Fair Queueing
FIFO Queue

.
FIFO
,
: ;

.
Round-Robin

.
Flow 1
,


Flow 2
Round-robin
service

Flow 3
,

Flow 4
.
:

!
Fair Queueing

byte (round-
robin)


.
, i
Ai, Si
,
Fi,
Fi = max { Fi -1 , Ai } + Si
,

bytes
Fair Queueing

byte
3 3 1 ,
1
5, 11.
2
5 2,
10,

3 5 3
FQ .
Weighted Fair Queueing

Fair Queueing
.


, Weighted Fair
Queueing
Weighted Fair Queueing
bytes.
,
.


.