* 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.

* 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.

Internet Congestion Control provides a description of some of the most important topics in the area of congestion control in computer networks, with special emphasis on the analytical modeling of congestion control algorithms. The field of congestion control has seen many notable advances in recent years and the purpose of this book, which is targeted towards the advanced and intermediate reader, is to inform about the most important developments in this area. The book should enable the reader to gain a good understanding of the application of congestion control theory to a number of application domains such as Data Center Networks, Video Streaming, High Speed Links and Broadband Wireless Networks. When seen through the lens of analytical modeling, there are a number of common threads that run through the design and analysis of congestion control protocols in all these different areas, which are emphasized in this book. The book also cuts a path through the profusion of algorithms in the literature, and puts the topic on a systematic and logical footing. Internet Congestion Control provides practicing network engineers and researchers with a comprehensive and accessible coverage of analytical models of congestion control algorithms, and gives readers everything needed to understand the latest developments and research in this area. - Examines and synthesizes the most important developments in internet congestion control from the last 20 years. - Provides detailed description on the congestion control protocols used in four key areas; broadband wireless networks, high speed networks with large latencies, video transmission networks, and data center networks. - Offers accessible coverage of advanced topics such as Optimization and Control Theory as applied to congestion control systems.

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, they cover a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed. In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, they cover a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed. In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

"Nowadays, network connectivity and the Internet have been an indispensable part of our daily lives via various services/applications supporting all of the industry areas ranged from trade and business, administration to entertainment, transportation, education, and healthcare. Typically, the concepts and introductions of terms, such as the Internet of Things (IoT), cloud or edge/fog computing, and content-oriented network services, have been investigated as emerging topics toward the realization of the Internet of Everything (IoX) in the future. Toward this end, developing an efficient congestion control mechanism is regarded as a key to an efficient and robust network design since the network availability and stability can directly affect the network performance, in terms of interoperability and robustness, especially in the case of an explosive increase in the network traffic volume. In particular, when a network link becomes corrupted or overload, congestion may occur due to packet drops. As a result, the overall network performance, including network throughput, latency, and response time will be degraded. The book is not intended to provide a comprehensive description of various congestion control techniques. Rather, with the assumptions that the readers have some general knowledge of networking fundamentals, the main goal of this book is to bring together distinguished perspectives of congestion control in different network platforms and technologies, ranged from TCP/IP, MPTCP (Multipath TCP) in heterogeneous networks, wireless networks to information-centric networks as future networks, and even supercomputing. The book then aims to give a new insight into this challenging and important topic of congestion control to overcome network performance degradation when congestion occurs from both theory/principles and practical viewpoints. Hence, we hope that this book provides a broader picture of the Congestion control concept in the context of communication networks toward efficient network design"--

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, these cover only a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed. In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

This is the first comprehensive book on the AIMD algorithm, the most widely used method for allocating a limited resource among competing agents without centralized control. The authors offer a new approach that is based on positive switched linear systems. It is used to develop most of the main results found in the book, and fundamental results on stochastic switched nonnegative and consensus systems are derived to obtain these results. The original and best known application of the algorithm is in the context of congestion control and resource allocation on the Internet, and readers will find details of several variants of the algorithm in order of increasing complexity, including deterministic, random, linear, and nonlinear versions. In each case, stability and convergence results are derived based on unifying principles. Basic and fundamental properties of the algorithm are described, examples are used to illustrate the richness of the resulting dynamical systems, and applications are provided to show how the algorithm can be used in the context of smart cities, intelligent transportation systems, and the smart grid.

Congestion Control in Data Transmission Networks details the modeling and control of data traffic in communication networks. It shows how various networking phenomena can be represented in a consistent mathematical framework suitable for rigorous formal analysis. The monograph differentiates between fluid-flow continuous-time traffic models, discrete-time processes with constant sampling rates, and sampled-data systems with variable discretization periods. The authors address a number of difficult real-life problems, such as: optimal control of flows with disparate, time-varying delay; the existence of source and channel nonlinearities; the balancing of quality of service and fairness requirements; and the incorporation of variable rate allocation policies. Appropriate control mechanisms which can handle congestion and guarantee high throughput in various traffic scenarios (with different networking phenomena being considered) are proposed. Systematic design procedures using sound control-theoretic foundations are adopted. Since robustness issues are of major concern in providing efficient data-flow regulation in today’s networks, sliding-mode control is selected as the principal technique to be applied in creating the control solutions. The controller derivation is given extensive analytical treatment and is supported with numerous realistic simulations. A comparison with existing solutions is also provided. The concepts applied are discussed in a number of illustrative examples, and supported by many figures, tables, and graphs walking the reader through the ideas and introducing their relevance in real networks. Academic researchers and graduate students working in computer networks and telecommunications and in control (especially time-delay systems and discrete-time optimal and sliding-mode control) will find this text a valuable assistance in ensuring smooth data-flow within communications networks.

This brief proposes that the keys to internet cross-layer optimization are the development of non-standard implicit primal-dual solvers for underlying optimization problems, and design of jointly optimal network protocols as decomposition of such solvers. Relying on this novel design-space oriented approach, the author develops joint TCP congestion control and wireless-link scheduling schemes for wireless applications over Internet with centralized and distributed (multi-hop) wireless links. Different from the existing solutions, the proposed schemes can be asynchronously implemented without message passing among network nodes; thus they are readily deployed with current infrastructure. Moreover, global convergence/stability of the proposed schemes to optimal equilibrium is established using the Lyapunov method in the network fluid model. Simulation results are provided to evaluate the proposed schemes in practical networks.