The Mathematics of Internet Congestion Control
Home > Computing and Information Technology > Digital Lifestyle and online world: consumer and user guides > Internet guides and online services > The Mathematics of Internet Congestion Control: (Systems & Control: Foundations & Applications)
The Mathematics of Internet Congestion Control: (Systems & Control: Foundations & Applications)

The Mathematics of Internet Congestion Control: (Systems & Control: Foundations & Applications)


     0     
5
4
3
2
1



Available


X
About the Book

Congestion control algorithms were implemented for the Internet nearly two decades ago, but mathematical models of congestion control in such a large-scale network 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. 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.

Table of Contents:
1 Introduction.- 2 Resource Allocation.- 2.1 Resource allocation as an optimization problem.- 2.2 A general class of utility functions.- 2.3 Appendix: Convex optimization.- 3 Congestion Control: A decentralized solution.- 3.1 Primal algorithm.- 3.2 Dual algorithm.- 3.3 Exact penalty functions.- 3.4 Primal-dual approach.- 3.5 Other variations in the primal approach.- 3.6 REM: A one-bit marking scheme.- 3.7 Multipath routing.- 3.8 Multirate multicast congestion control.- 3.9 A pricing interpretation of proportional fairness.- 3.10 Appendix: Lyapunov stability.- 4 Relationship to Current Internet Protocols.- 4.1 Window flow control.- 4.2 Jacobson’s adaptive window flow control algorithm.- 4.3 TCP-Vegas.- 4.4 Random Early Detection (RED).- 4.5 Explicit Congestion Notification (ECN).- 4.6 High-throughput TCP.- 5 Linear Analysis with Delay: The single link case.- 5.1 Single TCP-Reno source with droptail.- 5.2 Multiple TCP sources with identical RTTs.- 5.3 TCP-Reno and RED.- 5.4 Proportionally-fair controller.- 5.5 High-throughput TCP.- 5.6 Dual algorithm.- 5.7 Primal-dual algorithm.- 5.8 Appendix: The Nyquist criterion.- 6 Linear Analysis with Delay: The network case.- 6.1 Primal controllers.- 6.2 Dual algorithm.- 6.3 Primal-dual algorithm.- 6.4 Appendix: Multivariable Nyquist criterion.- 7 Global Stability for a Single Link and a Single Flow.- 7.1 Proportionally-fair controller over a single link.- 8 Stochastic Models and their Deterministic Limits.- 8.1 Deterministic limit for proportionally-fair controllers.- 8.2 Individual source dynamics.- 8.3 Price feedback.- 8.4 Queue-length-based marking.- 8.5 TCP-type congestion controllers.- 8.6 Appendix: The weak law of large numbers.- 9 Connection-level Models.- 9.1 Stability of weighted proportionally-fair controllers.- 9.2Priority resource allocation.- 10 Real-time Sources and Distributed Admission Control.- 10.1 Resource sharing between elastic and inelastic users.- 10.2 Probing and distributed admission control.- 10.3 A simple model for queueing at the link buffer.- 10.4 Appendix: Diffusion approximation.- 11 Conclusions.- References.

Review :
"This first book on the mathematics of congestion control [is] very useful for both students and researchers, but also for system engineers developing new Internet protocols. This is an elementary book for graduate students that uses a rich pallet of mathematical tools: convex optimization and control theory (Lyapunov stability and Nyquist criteria and stochastic processes). The tools are summarized well in appendices which makes the book self-contained and easy to read. The book is very well written and will undoubtedly remain a major reference on the topic for years to come." --Mathematical Reviews "This well-written book presents an overview of the mathematics behind internet congestion control. Focusing on the well-established TCP protocol, it starts with a gentle introduction on TCP and the packet/acknowledgement structure of the internet, before proceeding to congestion and the principles of congestion control!. Overall, this book presents in an easy-to-understand way the principles of internet congestion control with a focus on the mathematical concepts behind them. The book concludes with a useful index and a rich source of bibliographical references." --Zentralblatt Math "The investigation of fairness, efficiency, and dynamics of TCP led to the development of a new fast-growing research domain of mathematical models for congestion control. The Mathematics of Internet Congestion Control by R. Srikant provides a valuable comprehensive introduction to this new exciting research area. !Using mathematical models, Srikant successfully explains the principal ideas behind Internet congestion control. The publication of the book is very timely. Currently, there are no other books on mathematical models for congestion control. !All material in the book is accessible to graduate or even undergraduate students of mathematical and electrical engineering disciplines. Many chapters are supplied with appendices which review the necessary background material and make the book self-contained. In conclusion, this book can be equally recommended for beginners as well as for expert researchers working in the domain of congestion control. For beginners, the book will be a good starting point from which to explore a vast and rapidly growing body of literature on the subject of Internet congestion control. For expert researchers, the book will definitely help to place congestion control in perspective and will point to new avenues in this exciting research domain." --SIAM Book Reviews


Best Sellers


Product Details
  • ISBN-13: 9780817632274
  • Publisher: Birkhauser Boston Inc
  • Publisher Imprint: Birkhauser Boston Inc
  • Height: 235 mm
  • No of Pages: 164
  • Returnable: N
  • Width: 155 mm
  • ISBN-10: 0817632271
  • Publisher Date: 12 Dec 2003
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Series Title: Systems & Control: Foundations & Applications


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
The Mathematics of Internet Congestion Control: (Systems & Control: Foundations & Applications)
Birkhauser Boston Inc -
The Mathematics of Internet Congestion Control: (Systems & Control: Foundations & Applications)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

The Mathematics of Internet Congestion Control: (Systems & Control: Foundations & Applications)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!