About this Item
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. 400 gr. Seller Inventory # 9780817632274LEA50064
Bibliographic Details
Title: THE MATHEMATICS OF INTERNET CONGESTION ...
Publisher: Birkhaeuser
Publication Date: 2004
Binding: Dura
Illustrator: No Aplica
Condition: New
Dust Jacket Condition: Nuevo
Edition: 0.
Book Type: Libro
About this title
* Recommended by T.Basar, SC series ed.
* This text addresses a new, active area of research and fills a gap in the literature.
* Bridges mathematics, engineering, and computer science; considers stochastic and optimization aspects of congestion control in Internet data transfers.
* Useful as a supplementary text & reference for grad students with some background in control theory; also suitable for researchers.
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.
"About this title" may belong to another edition of this title.
Store Description
Payment Methods
accepted by seller
PayPal