Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
7Activity

Table Of Contents

A FIRST COURSE IN NETWORK CALCULUS
NETWORK CALCULUS
1.1 MODELS FOR DATA FLOWS
1.1.1 CUMULATIVE FUNCTIONS, DISCRETE TIME VERSUS CONTINUOUS TIME MOD- ELS
1.1.2 BACKLOG AND VIRTUAL DELAY
1.1.3 EXAMPLE: THE PLAYOUT BUFFER
1.2 ARRIVAL CURVES
1.2.1 DEFINITION OF AN ARRIVAL CURVE
1.2.2 LEAKY BUCKET AND GENERIC CELL RATE ALGORITHM
1.2.3 SUB-ADDITIVITY AND ARRIVAL CURVES
1.2.4 MINIMUM ARRIVAL CURVE
1.3 SERVICE CURVES
1.3.1 DEFINITION OF SERVICE CURVE
1.3.2 CLASSICAL SERVICE CURVE EXAMPLES
1.4 NETWORK CALCULUS BASICS
1.4.1 THREE BOUNDS
1.4.2 ARE THE BOUNDS TIGHT ?
1.4.3 CONCATENATION
1.4.4 IMPROVEMENT OF BACKLOG BOUNDS
1.5 GREEDY SHAPERS
1.5.2 INPUT-OUTPUT CHARACTERIZATION OF GREEDY SHAPERS
1.5.3 PROPERTIES OF GREEDY SHAPERS
1.6 MAXIMUM SERVICE CURVE, VARIABLE AND FIXED DELAY
1.6.1 MAXIMUM SERVICE CURVES
1.7.1 AN EXAMPLE OF IRREGULARITY INTRODUCED BY VARIABLE LENGTH PACKETS
1.7.2 THE PACKETIZER
1.7.3 A RELATION BETWEEN GREEDY SHAPER AND PACKETIZER
1.7.4 PACKETIZED GREEDY SHAPER
1.8. EFFECTIVE BANDWIDTH AND EQUIVALENT CAPACITY 53
1.8 LOSSLESS EFFECTIVE BANDWIDTH AND EQUIVALENT CAPACITY
1.8.1 EFFECTIVE BANDWIDTH OF A FLOW
1.8.2 EQUIVALENT CAPACITY
1.8.3 EXAMPLE: ACCEPTANCE REGION FOR A FIFO MULTIPLEXER
1.9 PROOF OF THEOREM 1.4.5
1.10 BIBLIOGRAPHIC NOTES
1.11 EXERCISES
2.1 GPS AND GUARANTEED RATE NODES
2.1.1 PACKET SCHEDULING
2.1.2 GPS AND A PRACTICAL IMPLEMENTATION (PGPS)
2.1.3 GUARANTEED RATE (GR) NODES AND THE MAX-PLUS APPROACH
2.1.4 CONCATENATION OF GR NODES
2.1.5 PROOFS
2.2. THE INTEGRATED SERVICES MODEL OF THE IETF 75
2.2 THE INTEGRATED SERVICES MODEL OF THE IETF
2.2.1 THE GUARANTEED SERVICE
2.2.2 THE INTEGRATED SERVICES MODEL FOR INTERNET ROUTERS
2.2.3 RESERVATION SETUP WITH RSVP
2.2.4 A FLOW SETUP ALGORITHM
2.2.5 MULTICAST FLOWS
2.2.6 FLOW SETUP WITH ATM
2.3 SCHEDULABILITY
2.3.1 EDF SCHEDULERS
2.3.2 SCED SCHEDULERS [73]
2.3.3 BUFFER REQUIREMENTS
2.4 APPLICATION TO DIFFERENTIATED SERVICES
2.4.1 DIFFERENTIATED SERVICES
2.4.2 AN EXPLICIT DELAY BOUND FOR EF
2.4.3 BOUNDS FOR AGGREGATE SCHEDULING WITH DAMPERS
2.4.4 STATIC EARLIEST TIME FIRST (SETF)
2.5 BIBLIOGRAPHIC NOTES
2.6 EXERCISES
MATHEMATICAL BACKGROUND
BASIC MIN-PLUS AND MAX-PLUS CALCULUS
3.1 MIN-PLUS CALCULUS
3.1.2 DIOID (R∪{+∞},∧, +)
3.1.3 A CATALOG OF WIDE-SENSE INCREASING FUNCTIONS
3.1.4 PSEUDO-INVERSE OF WIDE-SENSE INCREASING FUNCTIONS
3.1.5 CONCAVE, CONVEX AND STAR-SHAPED FUNCTIONS
3.1.6 MIN-PLUS CONVOLUTION
3.1.7 SUB-ADDITIVE FUNCTIONS
3.1.8 SUB-ADDITIVE CLOSURE
3.1.9 MIN-PLUS DECONVOLUTION
3.1.10 REPRESENTATION OF MIN-PLUS DECONVOLUTION BY TIME INVERSION
3.3 EXERCISES
MIN-PLUS AND MAX-PLUS SYSTEM THEORY
4.1 MIN-PLUS AND MAX-PLUS OPERATORS
4.1.1 VECTOR NOTATIONS
4.1.2 OPERATORS
4.1.3 A CATALOG OF OPERATORS
4.1.4 UPPER AND LOWER SEMI-CONTINUOUS OPERATORS
4.1.5 ISOTONE OPERATORS
4.1.6 LINEAR OPERATORS
4.1.7 CAUSAL OPERATORS
4.1.8 SHIFT-INVARIANT OPERATORS
4.1.9 IDEMPOTENT OPERATORS
4.2 CLOSURE OF AN OPERATOR
4.3 FIXED POINT EQUATION (SPACE METHOD)
4.3.1 MAIN THEOREM
4.3.2 EXAMPLES OF APPLICATION
A SECOND COURSE IN NETWORK CALCULUS
OPTIMAL MULTIMEDIA SMOOTHING
5.1 PROBLEM SETTING
5.2 CONSTRAINTS IMPOSED BY LOSSLESS SMOOTHING
5.3. MINIMAL REQUIREMENTS ON DELAYS AND PLAYBACK BUFFER 157
5.3 MINIMAL REQUIREMENTS ON DELAYS AND PLAYBACK BUFFER
5.4 OPTIMAL SMOOTHING STRATEGIES
5.4.1 MAXIMAL SOLUTION
5.4.2 MINIMAL SOLUTION
5.5. OPTIMAL CONSTANT RATE SMOOTHING 159
5.4.3 SET OF OPTIMAL SOLUTIONS
5.5 OPTIMAL CONSTANT RATE SMOOTHING
5.6. OPTIMAL SMOOTHING VERSUS GREEDY SHAPING 163
5.6 OPTIMAL SMOOTHING VERSUS GREEDY SHAPING
5.7. COMPARISON WITH DELAY EQUALIZATION 165
5.7 COMPARISON WITH DELAY EQUALIZATION
5.8 LOSSLESS SMOOTHING OVER TWO NETWORKS
5.8.1 MINIMAL REQUIREMENTS ON THE DELAYS AND BUFFER SIZES FOR TWO NET- WORKS
5.8.2 OPTIMAL CONSTANT RATE SMOOTHING OVER TWO NETWORKS
5.9 BIBLIOGRAPHIC NOTES
AGGREGATE SCHEDULING
6.1 INTRODUCTION
6.2 TRANSFORMATION OF ARRIVAL CURVE THROUGH AGGREGATE SCHEDUL-
6.2.1 AGGREGATE MULTIPLEXING IN A STRICT SERVICE CURVE ELEMENT
6.2.2 AGGREGATE MULTIPLEXING IN A FIFO SERVICE CURVE ELEMENT
6.3. STABILITY AND BOUNDS FOR A NETWORK WITH AGGREGATE SCHEDULING 181
6.2.3 AGGREGATE MULTIPLEXING IN A GR NODE
6.3 STABILITY AND BOUNDS FOR A NETWORK WITH AGGREGATE SCHEDUL-
6.3.1 THE ISSUE OF STABILITY
6.3.2 THE TIME STOPPING METHOD
6.4. STABILITY RESULTS AND EXPLICIT BOUNDS 185
6.4 STABILITY RESULTS AND EXPLICIT BOUNDS
6.4.1 THE RING IS STABLE
6.5 BIBLIOGRAPHIC NOTES
6.6 EXERCISES
ADAPTIVE AND PACKET SCALE RATE GUARANTEES
7.1 INTRODUCTION
7.2 LIMITATIONS OF THE SERVICE CURVE AND GR NODE ABSTRAC- TIONS
7.3 PACKET SCALE RATE GUARANTEE
7.3.1 DEFINITION OF PACKET SCALE RATE GUARANTEE
7.3.2 PRACTICAL REALIZATION OF PACKET SCALE RATE GUARANTEE
7.3.3 DELAY FROM BACKLOG
7.4 ADAPTIVE GUARANTEE
7.4.1 DEFINITION OF ADAPTIVE GUARANTEE
7.4.2 PROPERTIES OF ADAPTIVE GUARANTEES
7.4.3 PSRG AND ADAPTIVE SERVICE CURVE
7.5 CONCATENATION OF PSRG NODES
7.5.1 CONCATENATION OF FIFO PSRG NODES
7.5.2 CONCATENATION OF NON FIFO PSRG NODES
7.6 COMPARISON OF GR AND PSRG
7.7 PROOFS
7.7.1 PROOF OF LEMMA 7.3.1
7.7.2 PROOF OF THEOREM 7.3.2
7.7.3 PROOF OF THEOREM 7.3.3
7.7.4 PROOF OF THEOREM 7.3.4
7.7.5 PROOF OF THEOREM 7.4.2
7.7.6 PROOF OF THEOREM 7.4.3
7.7.7 PROOF OF THEOREM 7.4.4
7.7.8 PROOF OF THEOREM 7.4.5
7.7.9 PROOF OF THEOREM 7.5.3
7.7.10 PROOF OF PROPOSITION 7.5.2
7.8 BIBLIOGRAPHIC NOTES
7.9 EXERCISES
TIME VARYING SHAPERS
8.1 INTRODUCTION
8.2 TIME VARYING SHAPERS
8.3. TIME INVARIANT SHAPER WITH INITIAL CONDITIONS 227
8.3 TIME INVARIANT SHAPER WITH NON-ZERO INITIAL CONDITIONS
8.3.1 SHAPER WITH NON-EMPTY INITIAL BUFFER
8.3.2 LEAKY BUCKET SHAPERS WITH NON-ZERO INITIAL BUCKET LEVEL
8.4. TIME VARYING LEAKY-BUCKET SHAPER 229
8.4 TIME VARYING LEAKY-BUCKET SHAPER
8.5 BIBLIOGRAPHIC NOTES
SYSTEMS WITH LOSSES
9.1 A REPRESENTATION FORMULA FOR LOSSES
9.1.1 LOSSES IN A FINITE STORAGE ELEMENT
9.1.2 LOSSES IN A BOUNDED DELAY ELEMENT
9.2 APPLICATION 1: BOUND ON LOSS RATE
9.3. APPLICATION 2: BOUND ON LOSSES IN COMPLEX SYSTEMS 235
9.3 APPLICATION 2: BOUND ON LOSSES IN COMPLEX SYSTEMS
9.3.1 BOUND ON LOSSES BY SEGREGATION BETWEEN BUFFER AND POLICER
0 of .
Results for:
No results containing your search query
P. 1
Network Calculus a Theory of Deter Minis Tic Queuing Systems for the Internet.9783540421849.25728

Network Calculus a Theory of Deter Minis Tic Queuing Systems for the Internet.9783540421849.25728

Ratings: (0)|Views: 145 |Likes:
Published by PRavi KIran

More info:

Published by: PRavi KIran on Apr 19, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/11/2014

pdf

text

original

You're Reading a Free Preview
Pages 6 to 51 are not shown in this preview.
You're Reading a Free Preview
Pages 57 to 58 are not shown in this preview.
You're Reading a Free Preview
Pages 64 to 141 are not shown in this preview.
You're Reading a Free Preview
Pages 147 to 164 are not shown in this preview.
You're Reading a Free Preview
Pages 170 to 265 are not shown in this preview.

Activity (7)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
peterangka liked this
paraschiv54 liked this
_tomcat liked this
uks liked this
partho143 liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->