Network calculus: a theory of deterministic queuing systems for the Internet
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2001
|
| Schriftenreihe: | Lecture notes in computer science
2050 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIX, 274 S. graph. Darst. |
| ISBN: | 354042184X |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV013810770 | ||
| 003 | DE-604 | ||
| 005 | 20100222 | ||
| 007 | t| | ||
| 008 | 010703s2001 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 961842563 |2 DE-101 | |
| 020 | |a 354042184X |9 3-540-42184-X | ||
| 035 | |a (OCoLC)248626641 | ||
| 035 | |a (DE-599)BVBBV013810770 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-473 |a DE-29T |a DE-634 |a DE-83 |a DE-188 |a DE-706 |a DE-523 | ||
| 050 | 0 | |a TK5105.875.I57 | |
| 082 | 0 | |a 004.678 | |
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a DAT 614f |2 stub | ||
| 084 | |a MAT 608f |2 stub | ||
| 084 | |a 68M10 |2 msc | ||
| 100 | 1 | |a Le Boudec, Jean-Yves |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Network calculus |b a theory of deterministic queuing systems for the Internet |c Jean-Yves Le Boudec ; Patrick Thiran |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2001 | |
| 300 | |a XIX, 274 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 2050 | |
| 650 | 4 | |a Internet - Datenstrom - Dienstgüte - Scheduling - Warteschlangentheorie - Diodid | |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenstrom |0 (DE-588)4410055-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Internet |0 (DE-588)4308416-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Dienstgüte |0 (DE-588)4496068-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Diodid |0 (DE-588)4650533-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Internet |0 (DE-588)4308416-3 |D s |
| 689 | 0 | 1 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Internet |0 (DE-588)4308416-3 |D s |
| 689 | 1 | 1 | |a Datenstrom |0 (DE-588)4410055-3 |D s |
| 689 | 1 | 2 | |a Dienstgüte |0 (DE-588)4496068-2 |D s |
| 689 | 1 | 3 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 1 | 4 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 1 | 5 | |a Diodid |0 (DE-588)4650533-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Thiran, Patrick |e Verfasser |4 aut | |
| 830 | 0 | |a Lecture notes in computer science |v 2050 |w (DE-604)BV000000607 |9 2050 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009442876&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009442876 | |
Datensatz im Suchindex
| _version_ | 1820874903662886912 |
|---|---|
| adam_text |
CONTENTS
INTRODUCTION
XIII
I
A
FIRST
COURSE
IN
NETWORK
CALCULUS
1
1
NETWORK
CALCULUS
3
1.1
MODELS
FOR
DATA
FLOWS
.
4
1.1.1
CUMULATIVE
FUNCTIONS,
DISCRETE
TIME
VERSUS
CONTINUOUS
TIME
MODELS
.
4
1.1.2
BACKLOG
AND
VIRTUAL
DELAY
.
6
1.1.3
EXAMPLE:
THE
PLAYOUT
BUFFER
.
7
1.2
ARRIVAL
CURVES
.
8
1.2.1
DEFINITION
OF
AN
ARRIVAL
CURVE
.
8
1.2.2
LEAKY
BUCKET
AND
GENERIC
CELL
RATE
ALGORITHM
.
12
1.2.3
SUB-ADDITIVITY
AND
ARRIVAL
CURVES
.
17
1.2.4
MINIMUM
ARRIVAL
CURVE
.
20
1.3
SERVICE
CURVES
.
22
1.3.1
DEFINITION
OF
SERVICE
CURVE
.
22
1.3.2
CLASSICAL
SERVICE
CURVE
EXAMPLES
.
25
1.4
NETWORK
CALCULUS
BASICS
.
28
1.4.1
THREE
BOUNDS
.
28
1.4.2
ARE
THE
BOUNDS
TIGHT
?
.
33
1.4.3
CONCATENATION
.
34
1.4.4
IMPROVEMENT
OF
BACKLOG
BOUNDS
.
36
1.5
GREEDY
SHAPERS
.
37
1.5.1
DEFINITIONS
.
37
1.5.2
INPUT-OUTPUT
CHARACTERIZATION
OF
GREEDY
SHAPERS
.
38
1.5.3
PROPERTIES
OF
GREEDY
SHAPERS
.
40
1.6
MAXIMUM
SERVICE
CURVE,
VARIABLE
AND
FIXED
DELAY
.
42
1.6.1
MAXIMUM
SERVICE
CURVES
.
42
1.6.2
DELAY
FROM
BACKLOG
.
45
1.6.3
VARIABLE
VERSUS
FIXED
DELAY
.
48
1.7
HANDLING
VARIABLE
LENGTH
PACKETS
.
49
VIII
CONTENTS
1.7.1
AN
EXAMPLE
OF
IRREGULARITY
INTRODUCED
BY
VARIABLE
LENGTH
PACKETS
.
49
1.7.2
THE
PACKETIZER
.
50
1.7.3
A
RELATION
BETWEEN
GREEDY
SHAPER
AND
PACKETIZER
.
55
1.7.4
PACKETIZED
GREEDY
SHAPER
.
58
1.8
LOSSLESS
EFFECTIVE
BANDWIDTH
AND
EQUIVALENT
CAPACITY
.
64
1.8.1
EFFECTIVE
BANDWIDTH
OF
A
FLOW
.
64
1.8.2
EQUIVALENT
CAPACITY
.
65
1.8.3
EXAMPLE:
ACCEPTANCE
REGION
FOR
A
FIFO
MULTIPLEXER
.
.
67
1.9
PROOF
OF
THEOREM
1.4.5
.
68
1.10
BIBLIOGRAPHIC
NOTES
.
71
1.11
EXERCISES
.
72
2
APPLICATION
OF
NETWORK
CALCULUS
TO
THE
INTERNET
83
2.1
GPS
AND
GUARANTEED
RATE
SCHEDULERS
.
83
2.1.1
PACKET
SCHEDULING
.
83
2.1.2
GPS
AND
A
PRACTICAL
IMPLEMENTATION
(PGPS)
.
84
2.1.3
GUARANTEED
RATE
SCHEDULERS
.
86
2.2
THE
INTEGRATED
SERVICES
MODEL
OF
THE
IETF
.
89
2.2.1
THE
GUARANTEED
SERVICE
.
89
2.2.2
THE
INTEGRATED
SERVICES
MODEL
FOR
INTERNET
ROUTERS
.
89
2.2.3
RESERVATION
SETUP
WITH
RSVP
.
90
2.2.4
A
FLOW
SETUP
ALGORITHM
.
93
2.2.5
MULTICAST
FLOWS
.
94
2.2.6
FLOW
SETUP
WITH
ATM
.
94
2.3
SCHEDULABILITY
.
94
2.3.1
EDF
SCHEDULERS
.
95
2.3.2
SCED
SCHEDULERS
[65]
.
97
2.3.3
BUFFER
REQUIREMENTS
.
103
2.4
APPLICATION
TO
DIFFERENTIATED
SERVICES
.
104
2.4.1
DIFFERENTIATED
SERVICES
.
104
2.4.2
A
BOUNDING
METHOD
FOR
AGGREGATE
SCHEDULING
.
104
2.4.3
AN
EXPLICIT
DELAY
BOUND
FOR
DIFFERENTIATED
SERVICES
NETWORKS
.
110
2.4.4
BOUNDS
FOR
AGGREGATE
SCHEDULING
WITH
DAMPERS
.
117
2.5
EXERCISES
.
121
II
MATHEMATICAL
BACKGROUND
123
3
BASIC
MIN-PLUS
AND
MAX-PLUS
CALCULUS
125
3.1
MIN-PLUS
CALCULUS
.
125
3.1.1
INFIMUM
AND
MINIMUM
.
125
3.1.2
DIOID
(R
U
{+OO},
A,
+)
.
127
3.1.3
A
CATALOG
OF
WIDE-SENSE
INCREASING
FUNCTIONS
.
128
CONTENTS
,
IX
3.1.4
PSEUDO-INVERSE
OF
WIDE-SENSE
INCREASING
FUNCTIONS
.
129
3.1.5
CONCAVE,
CONVEX
AND
STAR-SHAPED
FUNCTIONS
.
132
3.1.6
MIN-PLUS
CONVOLUTION
.
133
3.1.7 SUB-ADDITIVE
FUNCTIONS
.
140
3.1.8 SUB-ADDITIVE
CLOSURE
.
143
3.1.9
MIN-PLUS
DECONVOLUTION
.
147
3.1.10
REPRESENTATION
OF
MIN-PLUS
DECONVOLUTION
BY
TIME
INVERSION
.
151
3.1.11
VERTICAL
AND
HORIZONTAL
DEVIATIONS
.
154
3.2
MAX-PLUS
CALCULUS
.
155
3.2.1
MAX-PLUS
CONVOLUTION
AND
DECONVOLUTION
.
155
3.2.2
LINEARITY
OF
MIN-PLUS
DECONVOLUTION
IN
MAX-PLUS
ALGEBRA
.
156
3.3
EXERCISES
.
156
4
MIN-PLUS
AND
MAX-PLUS
SYSTEM
THEORY
159
4.1
MIN-PLUS
AND
MAX-PLUS
OPERATORS
.
159
4.1.1
VECTOR
NOTATIONS
.
159
4.1.2
OPERATORS
.
161
4.1.3
A
CATALOG
OF
OPERATORS
.
162
4.1.4
UPPER
AND
LOWER
SEMI-CONTINUOUS
OPERATORS
.
163
4.1.5
ISOTONE
OPERATORS
.
164
4.1.6
LINEAR
OPERATORS
.
165
4.1.7
CAUSAL
OPERATORS
.
169
4.1.8
SHIFT-INVARIANT
OPERATORS
.
170
4.1.9
IDEMPOTENT
OPERATORS
.
171
4.2
CLOSURE
OF
AN
OPERATOR
.
171
4.3
FIXED
POINT
EQUATION
(SPACE
METHOD)
.
175
4.3.1
MAIN
THEOREM
.
175
4.3.2
EXAMPLES
OF
APPLICATION
.
177
4.4
FIXED
POINT
EQUATION
(TIME
METHOD)
.
181
4.5
CONCLUSION
.
182
III
A
SECOND
COURSE
IN
NETWORK
CALCULUS
183
5
OPTIMAL
MULTIMEDIA
SMOOTHING
185
5.1
PROBLEM
SETTING
.
185
5.2
CONSTRAINTS
IMPOSED
BY
LOSSLESS
SMOOTHING
.
187
5.3
MINIMAL
REQUIREMENTS
ON
DELAYS
AND
PLAYBACK
BUFFER
.
188
5.4
OPTIMAL
SMOOTHING
STRATEGIES
.
189
5.4.1
MAXIMAL
SOLUTION
.
189
5.4.2
MINIMAL
SOLUTION
.
189
5.4.3
SET
OF
OPTIMAL
SOLUTIONS
.
190
5.5
OPTIMAL
CONSTANT
RATE
SMOOTHING
.
191
5.6
OPTIMAL
SMOOTHING
VERSUS
GREEDY
SHAPING
.
195
X
CONTENTS
5.7
COMPARISON
WITH
DELAY
EQUALIZATION
.
199
5.8
LOSSLESS
SMOOTHING
OVER
TWO
NETWORKS
.
201
5.8.1
MINIMAL
REQUIREMENTS
ON
THE
DELAYS
AND
BUFFER
SIZES
FOR
TWO
NETWORKS
.
202
5.8.2
OPTIMAL
CONSTANT
RATE
SMOOTHING
OVER
TWO
NETWORKS
.
.
.
204
5.9
BIBLIOGRAPHIC
NOTES
.
206
6
FIFO
SYSTEMS
AND
AGGREGATE
SCHEDULING
207
6.1
INTRODUCTION
.
207
6.2
GENERAL
BOUNDS
FOR
AGGREGATE
SCHEDULING
.
208
6.3
STABILITY
OF
A
NETWORK
WITH
AGGREGATE
SCHEDULING
.
209
6.3.1
THE
OPEN
ISSUE
OF
STABILITY
.
209
6.3.2
THE
RING
IS
STABLE
.
210
6.4
BOUNDS
FOR
A
FIFO
SERVICE
CURVE
ELEMENT
.
214
6.5
BOUNDS
FOR
A
NETWORK
OF
FIFO
CBR
SERVERS
.
218
6.5.1
CLOSED
FORM
BOUNDS
FOR
AN
ATM
NETWORK
WITH
STRONG
SOURCE
RATE
CONDITIONS
.
218
6.5.2
PROOF
OF
THEOREM
6.5.1
.
220
6.6
BIBLIOGRAPHIC
NOTES
.
224
6.7
EXERCISES
.
225
7
ADAPTIVE
AND
PACKET
SCALE
RATE
GUARANTEES
227
7.1
INTRODUCTION
.
227
7.2 ADAPTIVE
GUARANTEE
.
227
7.2.1
LIMITATIONS
OF
THE
SERVICE
CURVE
ABSTRACTION
.
227
7.2.2
DEFINITION
OF
ADAPTIVE
GUARANTEE
.
228
7.2.3
PROPERTIES
OF
ADAPTIVE
GUARANTEES
.
230
7.3
APPLICATION
TO
THE
INTERNET:
PACKET
SCALE
RATE
GUARANTEE
.
234
7.3.1
DEFINITION
OF
PACKET
SCALE
RATE
GUARANTEE
.
234
7.3.2
PRACTICAL
REALIZATION
OF
PACKET
SCALE
RATE
GUARANTEE
.
236
7.3.3
PROOF
OF
THEOREM
7.3.1
.
238
7.4
BIBLIOGRAPHIC
NOTES
.
241
7.5
EXERCISES
.
241
8
TIME
VARYING
SHAPERS
243
8.1
INTRODUCTION
.
243
8.2
TIME
VARYING
SHAPERS
.
243
8.3
TIME
INVARIANT
SHAPER
WITH
INITIAL
CONDITIONS
.
245
8.3.1
SHAPER
WITH
NON-EMPTY
INITIAL
BUFFER
.
245
8.3.2
LEAKY
BUCKET
SHAPERS
WITH
NON-ZERO
INITIAL
BUCKET
LEVEL
.
246
8.4
TIME
VARYING
LEAKY-BUCKET
SHAPER
.
248
8.5
BIBLIOGRAPHIC
NOTES
.
249
CONTENTS
.
XI
9
SYSTEMS
WITH
LOSSES
251
9.1
A
REPRESENTATION
FORMULA
FOR
LOSSES
.
251
9.1.1
LOSSES
IN
A
FINITE
STORAGE
ELEMENT
.
251
9.1.2
LOSSES
IN
A
BOUNDED
DELAY
ELEMENT
.
253
9.2
APPLICATION
1:
BOUND
ON
LOSS
RATE
.
255
9.3
APPLICATION
2:
BOUND
ON
LOSSES
IN
COMPLEX
SYSTEMS
.
256
9.3.1
BOUND
ON
LOSSES
BY
SEGREGATION
BETWEEN
BUFFER
AND
POLICER
256
9.3.2
BOUND
ON
LOSSES
IN
A
VBR
SHAPER
.
259
9.4
SOLUTION
TO
SKOHORKHOD
'
S
REFLECTION
PROBLEM
WITH
TWO
BOUNDARIES
261
9.5
BIBLIOGRAPHIC
NOTES
.
265
BIBLIOGRAPHY
267
INDEX
273 |
| any_adam_object | 1 |
| author | Le Boudec, Jean-Yves Thiran, Patrick |
| author_facet | Le Boudec, Jean-Yves Thiran, Patrick |
| author_role | aut aut |
| author_sort | Le Boudec, Jean-Yves |
| author_variant | b j y l bjy bjyl p t pt |
| building | Verbundindex |
| bvnumber | BV013810770 |
| callnumber-first | T - Technology |
| callnumber-label | TK5105 |
| callnumber-raw | TK5105.875.I57 |
| callnumber-search | TK5105.875.I57 |
| callnumber-sort | TK 45105.875 I57 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| classification_rvk | ST 200 |
| classification_tum | DAT 614f MAT 608f |
| ctrlnum | (OCoLC)248626641 (DE-599)BVBBV013810770 |
| dewey-full | 004.678 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.678 |
| dewey-search | 004.678 |
| dewey-sort | 14.678 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008cb4500</leader><controlfield tag="001">BV013810770</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100222</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">010703s2001 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">961842563</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">354042184X</subfield><subfield code="9">3-540-42184-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248626641</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013810770</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-523</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5105.875.I57</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.678</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 614f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 608f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68M10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Le Boudec, Jean-Yves</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network calculus</subfield><subfield code="b">a theory of deterministic queuing systems for the Internet</subfield><subfield code="c">Jean-Yves Le Boudec ; Patrick Thiran</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 274 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2050</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Internet - Datenstrom - Dienstgüte - Scheduling - Warteschlangentheorie - Diodid</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstrom</subfield><subfield code="0">(DE-588)4410055-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Internet</subfield><subfield code="0">(DE-588)4308416-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dienstgüte</subfield><subfield code="0">(DE-588)4496068-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diodid</subfield><subfield code="0">(DE-588)4650533-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Internet</subfield><subfield code="0">(DE-588)4308416-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Internet</subfield><subfield code="0">(DE-588)4308416-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Datenstrom</subfield><subfield code="0">(DE-588)4410055-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Dienstgüte</subfield><subfield code="0">(DE-588)4496068-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="5"><subfield code="a">Diodid</subfield><subfield code="0">(DE-588)4650533-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thiran, Patrick</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2050</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">2050</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009442876&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009442876</subfield></datafield></record></collection> |
| id | DE-604.BV013810770 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:07:08Z |
| institution | BVB |
| isbn | 354042184X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009442876 |
| oclc_num | 248626641 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-473 DE-BY-UBG DE-29T DE-634 DE-83 DE-188 DE-706 DE-523 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-473 DE-BY-UBG DE-29T DE-634 DE-83 DE-188 DE-706 DE-523 |
| physical | XIX, 274 S. graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Le Boudec, Jean-Yves Verfasser aut Network calculus a theory of deterministic queuing systems for the Internet Jean-Yves Le Boudec ; Patrick Thiran Berlin [u.a.] Springer 2001 XIX, 274 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 2050 Internet - Datenstrom - Dienstgüte - Scheduling - Warteschlangentheorie - Diodid Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Datenstrom (DE-588)4410055-3 gnd rswk-swf Internet (DE-588)4308416-3 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf Dienstgüte (DE-588)4496068-2 gnd rswk-swf Diodid (DE-588)4650533-7 gnd rswk-swf Internet (DE-588)4308416-3 s Warteschlangentheorie (DE-588)4255044-0 s DE-604 Datenstrom (DE-588)4410055-3 s Dienstgüte (DE-588)4496068-2 s Scheduling (DE-588)4179449-7 s Diodid (DE-588)4650533-7 s Thiran, Patrick Verfasser aut Lecture notes in computer science 2050 (DE-604)BV000000607 2050 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009442876&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Le Boudec, Jean-Yves Thiran, Patrick Network calculus a theory of deterministic queuing systems for the Internet Lecture notes in computer science Internet - Datenstrom - Dienstgüte - Scheduling - Warteschlangentheorie - Diodid Warteschlangentheorie (DE-588)4255044-0 gnd Datenstrom (DE-588)4410055-3 gnd Internet (DE-588)4308416-3 gnd Scheduling (DE-588)4179449-7 gnd Dienstgüte (DE-588)4496068-2 gnd Diodid (DE-588)4650533-7 gnd |
| subject_GND | (DE-588)4255044-0 (DE-588)4410055-3 (DE-588)4308416-3 (DE-588)4179449-7 (DE-588)4496068-2 (DE-588)4650533-7 |
| title | Network calculus a theory of deterministic queuing systems for the Internet |
| title_auth | Network calculus a theory of deterministic queuing systems for the Internet |
| title_exact_search | Network calculus a theory of deterministic queuing systems for the Internet |
| title_full | Network calculus a theory of deterministic queuing systems for the Internet Jean-Yves Le Boudec ; Patrick Thiran |
| title_fullStr | Network calculus a theory of deterministic queuing systems for the Internet Jean-Yves Le Boudec ; Patrick Thiran |
| title_full_unstemmed | Network calculus a theory of deterministic queuing systems for the Internet Jean-Yves Le Boudec ; Patrick Thiran |
| title_short | Network calculus |
| title_sort | network calculus a theory of deterministic queuing systems for the internet |
| title_sub | a theory of deterministic queuing systems for the Internet |
| topic | Internet - Datenstrom - Dienstgüte - Scheduling - Warteschlangentheorie - Diodid Warteschlangentheorie (DE-588)4255044-0 gnd Datenstrom (DE-588)4410055-3 gnd Internet (DE-588)4308416-3 gnd Scheduling (DE-588)4179449-7 gnd Dienstgüte (DE-588)4496068-2 gnd Diodid (DE-588)4650533-7 gnd |
| topic_facet | Internet - Datenstrom - Dienstgüte - Scheduling - Warteschlangentheorie - Diodid Warteschlangentheorie Datenstrom Internet Scheduling Dienstgüte Diodid |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009442876&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT leboudecjeanyves networkcalculusatheoryofdeterministicqueuingsystemsfortheinternet AT thiranpatrick networkcalculusatheoryofdeterministicqueuingsystemsfortheinternet |