The Mathematics of Internet Congestion Control

Pirmais vāks
Springer Science & Business Media, 2004 - 164 lappuses

Congestion control algorithms were implemented for the Internet nearly two decades ago, but mathematical models of congestion control in such a large-scale are relatively new. This text presents models for the development of new protocols that can help make Internet data transfers virtually loss- and delay-free. Introduced are tools from optimization, control theory, and stochastic processes integral to the study of congestion control algorithms.

Features and topics include:

* A presentation of Kelly's convex program formulation of resource allocation on the Internet;

* A solution to the resource allocation problem which can be implemented in a decentralized manner, both in the form of congestion control algorithms by end users and as congestion indication mechanisms by the routers of the network;

* A discussion of simple stochastic models for random phenomena on the Internet, such as very short flows and arrivals and departures of file transfer requests.

Intended for graduate students and researchers in systems theory and computer science, the text assumes basic knowledge of first-year, graduate-level control theory, optimization, and stochastic processes, but the key prerequisites are summarized in an appendix for quick reference. The work's wide range of applications to the study of both new and existing protocols and control algorithms make the book of interest to researchers and students concerned with many aspects of large-scale information flow on the Internet.

No grāmatas satura

Lietotāju komentāri - Rakstīt atsauksmi

Ierastajās vietās neesam atraduši nevienu atsauksmi.

Saturs

II
1
III
7
IV
8
V
13
VI
17
VII
23
IX
27
X
29
XXXVI
90
XXXVII
92
XXXVIII
94
XXXIX
96
XL
101
XLI
103
XLII
104
XLIII
108

XI
32
XII
33
XIII
34
XIV
35
XV
36
XVI
37
XVII
43
XVIII
46
XIX
49
XX
50
XXI
59
XXII
61
XXIII
63
XXIV
65
XXVI
67
XXVIII
69
XXIX
72
XXX
75
XXXI
76
XXXII
79
XXXIII
80
XXXIV
83
XXXV
87
XLIV
109
XLVI
117
XLVII
118
XLVIII
123
XLIX
126
L
127
LI
129
LII
131
LIII
133
LV
137
LVI
139
LVIII
140
LIX
142
LX
144
LXI
146
LXII
147
LXIII
149
LXIV
150
LXV
153
LXVII
155
LXVIII
161
Autortiesības

Citi izdevumi - Skatīt visu

Bieži izmantoti vārdi un frāzes

Populāri fragmenti

157. lappuse - R. Pan, B. Prabhakar, and K. Psounis, "CHOKe - A Stateless Active Queue Management Scheme For Approximating Fair Bandwidth Allocation", Proceedings of 1NFOCOMW, Mar.
157. lappuse - F. Paganini, J. Doyle, and S. Low, Scalable laws for stable network congestion control.
157. lappuse - Z. Wang and F. Paganini, Global stability with time.delay in network congestion control, Proceedings of the IEEE Conference on Decision and Control, 2002.
158. lappuse - JT Wen and M. Arcak, A unifying passivity framework for network flow control, Proceedings of IEEE Infocom, April 2003.
157. lappuse - J. Mo and J. Walrand, Fair end-to-end window.based congestion control, IEEE/ ACM Transactions on Networking 8 (2000), no.
157. lappuse - F. Paganini, A global stability result in network flow control, Systems and Control Letters 46 (2002), no.
157. lappuse - I. Norros, A Storage Model with Self-Similar Input, Queueing Systems, 16 (1994) 387-396.

Bibliogrāfiskā informācija