Stream Sessions:

Deterministic Network Analysis

Hongwei Zhang
http://www.cs.wayne.edu/~hzhang

Acknowledgement: this lecture is partially based on the slides of Dr. D. Manjunath

Outline

Events and processes: universal concepts

Deterministic traffic models and network calculus

Scheduling

Application to a packet voice example

Connection setup: RSVP approach

Outline

Events and processes: universal concepts

Deterministic traffic models and network calculus

Scheduling

Application to a packet voice example

Connection setup: RSVP approach

Introduction

Introduction (contd.)

Model and notation

time

Assume output
queueing

Model and notation (contd.)

Also called nonidling scheduler

Model and notation (contd.)

Model and notation (contd.)

A packet arrival at t is included in the

cumulative arrivals counted by A(t)

Some simple analysis

For work-conserving/nonidling schedulers

Some simple analysis (contd.)

Finite buffer: a first look

Finite buffer: conservation law

See Exercise 4.1 (page 126 of R0)

Outline

Events and processes: universal concepts

Deterministic traffic models and network calculus

Scheduling

Application to a packet voice example

Connection setup: RSVP approach

Network calculus

A view of network calculus: Work with sample paths of a random process.



Networks see a sample path of a random process, e.g., X(t, )

Network calculus is a sample path analysis in which the sample path satisfies
certain properties.

It can be assumed that these properties are satisfied by all sample paths. Thus
network calculus or the deterministic analysis is a worst-case analysis.

An example objective is to obtain X(t) from A(t) and C of a work conserving

scheduler


We are also interested in other processes such as D(t) and other performance
parameters such as worst-case latency

Reichs equation

Reichs equation (contd.)

Reichs equation (contd.)

Reichs equation (contd.)

Combine equations (-1) and (0), we get Reichs Equatoin

The supremum is achieved when s = v, i.e., the last time

before t when buffer was empty

An equation for the departure process D(t)

Interpretation of Reichs Equation

A(t )
A(t )

A(s)
X(t)

X(t )
D(t )

this line has slope C,

and value A(s) + C.(t s) at t

bs

time

time

Alternative/direct derivation of D(t) equation

Direct derivation of D(t) (contd.)

A convolution operation

Convolution operation (contd.)

Remarks

Remarks (contd.)

Illustration
A(t )

slope r

B(t )

slope C

s
t

t
B (t )

B()+A(t-)
(B * A)(t)

slope r

slope C

Compare * with standard convolution

An example

Properties of *

Service curves

Example network elements: packetizer

Example elements: constant rate server

Network elements: coder + packetizer

Network elements in tandem

Latency rate servers in tandem

Delay in a service element

A

t1 t2

time

Stream traffic, QoS, envelop, regulator

Envelopes and regulators

Regulator example: leaky bucket

LB full
buffer nonempty
departure process
LB nonempty
Token arrival
process

amount of tokens in LB
buffer becomes empty

amount of data in the buffer

LB becomes empty
time

E(t) = 0 for t < 0

Sequence of regulators

An example

Network performance and design

With envelop E(t)

Otherwise, Cmin is not

the minimum capacity
(see book R0)

Theory applied in practice: an example

Outline

Events and processes: universal concepts

Deterministic traffic models and network calculus

Scheduling

Application to a packet voice example

Connection setup: RSVP approach

Scheduling

Generalized processor sharing (GPS)

Virtual time in GPS

Arrival, service, departure processes in GPS

( j)
k

= the departure instant of the kth arriving packet into queue j

Implementing a GPS scheduler

the departure instant will be the service

initiation instant for the next packet in
the same queue as the departing packet

Packetized GPS

Example of PGPS

Properties of PGPS

PGPS and WFQ

Envelope of a peak-rate-controlled process shaped by a (, ) regulator; also

shown is the lower service curve given to the source at WFQ server with min.
rate c, total link rate C, and max. packet length Lmax

Outline

Events and processes: universal concepts

Deterministic traffic models and network calculus

Scheduling

Application to a packet voice example

Connection setup: RSVP approach

Application to a packet voice example

, upper bound on delay:

May also use

worst-case X

Outline

Events and processes: universal concepts

Deterministic traffic models and network calculus

Scheduling

Application to a packet voice example

Connection setup: RSVP approach

RSVP and IntServ

Packet
network

Traffic source
with shaper

Router
Router
Router
Router

Receiver

(, , R)
max packet
length L

K 1

LAN
c

k 1

k = `

WAN - LAN router

How to compute c in RSVP?

Summary

Events and processes: universal concepts

Deterministic traffic models and network calculus

Scheduling

Application to a packet voice example

Connection setup: RSVP approach

Additional reading

Yuming Jiang, A Basic Stochastic Network Calculus,

ACM SIGCOMM06


Maximum-(virtual)-backlog-centric (m.b.c) stochastic arrival

curve and stochastic service curve

Homework #3

Chapter 4 of R0


Exercise 4.1 (page 126)

Problems 4.3, 4.6

Distribution of points: total = 100



30 points for Exercise 4.1 and Problem 4.3 each

40 points for Problem 4.6