Download or read book Scheduling and Congestion Control for Wireless and Processing Networks written by Libin Jiang and published by Springer Nature. This book was released on 2022-06-01 with total page 144 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this book, we consider the problem of achieving the maximum throughput and utility in a class of networks with resource-sharing constraints. This is a classical problem of great importance. In the context of wireless networks, we first propose a fully distributed scheduling algorithm that achieves the maximum throughput. Inspired by CSMA (Carrier Sense Multiple Access), which is widely deployed in today's wireless networks, our algorithm is simple, asynchronous, and easy to implement. Second, using a novel maximal-entropy technique, we combine the CSMA scheduling algorithm with congestion control to approach the maximum utility. Also, we further show that CSMA scheduling is a modular MAC-layer algorithm that can work with other protocols in the transport layer and network layer. Third, for wireless networks where packet collisions are unavoidable, we establish a general analytical model and extend the above algorithms to that case. Stochastic Processing Networks (SPNs) model manufacturing, communication, and service systems. In manufacturing networks, for example, tasks require parts and resources to produce other parts. SPNs are more general than queueing networks and pose novel challenges to throughput-optimum scheduling. We proposes a "deficit maximum weight" (DMW) algorithm to achieve throughput optimality and maximize the net utility of the production in SPNs. Table of Contents: Introduction / Overview / Scheduling in Wireless Networks / Utility Maximization in Wireless Networks / Distributed CSMA Scheduling with Collisions / Stochastic Processing networks

Download or read book Scheduling and Congestion Control for Wireless Internet written by Xin Wang and published by Springer Science & Business Media. This book was released on 2013-07-30 with total page 60 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Download or read book Analytical Methods for Network Congestion Control written by Steven Low and published by Springer Nature. This book was released on 2022-05-31 with total page 193 pages. Available in PDF, EPUB and Kindle. Book excerpt: The congestion control mechanism has been responsible for maintaining stability as the Internet scaled up by many orders of magnitude in size, speed, traffic volume, coverage, and complexity over the last three decades. In this book, we develop a coherent theory of congestion control from the ground up to help understand and design these algorithms. We model network traffic as fluids that flow from sources to destinations and model congestion control algorithms as feedback dynamical systems. We show that the model is well defined. We characterize its equilibrium points and prove their stability. We will use several real protocols for illustration but the emphasis will be on various mathematical techniques for algorithm analysis. Specifically we are interested in four questions: 1. How are congestion control algorithms modelled? 2. Are the models well defined? 3. How are the equilibrium points of a congestion control model characterized? 4. How are the stability of these equilibrium points analyzed? For each topic, we first present analytical tools, from convex optimization, to control and dynamical systems, Lyapunov and Nyquist stability theorems, and to projection and contraction theorems. We then apply these basic tools to congestion control algorithms and rigorously prove their equilibrium and stability properties. A notable feature of this book is the careful treatment of projected dynamics that introduces discontinuity in our differential equations. Even though our development is carried out in the context of congestion control, the set of system theoretic tools employed and the process of understanding a physical system, building mathematical models, and analyzing these models for insights have a much wider applicability than to congestion control.

Download or read book Green Communications and Networking written by F. Richard Yu and published by CRC Press. This book was released on 2016-04-19 with total page 402 pages. Available in PDF, EPUB and Kindle. Book excerpt: Green Communications and Networking introduces novel solutions that can bring about significant reductions in energy consumption in the information and communication technology (ICT) industry-as well as other industries, including electric power. Containing the contributions of leading experts in the field, it examines the latest research advances

Download or read book Learning for Decision and Control in Stochastic Networks written by Longbo Huang and published by Springer Nature. This book was released on 2023-07-21 with total page 80 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book introduces the Learning-Augmented Network Optimization (LANO) paradigm, which interconnects network optimization with the emerging AI theory and algorithms and has been receiving a growing attention in network research. The authors present the topic based on a general stochastic network optimization model, and review several important theoretical tools that are widely adopted in network research, including convex optimization, the drift method, and mean-field analysis. The book then covers several popular learning-based methods, i.e., learning-augmented drift, multi-armed bandit and reinforcement learning, along with applications in networks where the techniques have been successfully applied. The authors also provide a discussion on potential future directions and challenges.

Download or read book Academic Press Library in Mobile and Wireless Communications written by Katie Wilson and published by Academic Press. This book was released on 2016-08-04 with total page 750 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book, edited and authored by world leading experts, gives a review of the principles, methods and techniques of important and emerging research topics and technologies in wireless communications and transmission techniques. The reader will: Quickly grasp a new area of research Understand the underlying principles of a topic and its application Ascertain how a topic relates to other areas and learn of the research issues yet to be resolved Reviews important and emerging topics of research in wireless technology in a quick tutorial format Presents core principles in wireless transmission theory Provides reference content on core principles, technologies, algorithms, and applications Includes comprehensive references to journal articles and other literature on which to build further, more specific and detailed knowledge

Download or read book Scheduling and Congestion Control for Wireless and Processing Networks written by Libin Jiang and published by Morgan & Claypool Publishers. This book was released on 2010-10-10 with total page 156 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this book, we consider the problem of achieving the maximum throughput and utility in a class of networks with resource-sharing constraints. This is a classical problem of great importance. In the context of wireless networks, we first propose a fully distributed scheduling algorithm that achieves the maximum throughput. Inspired by CSMA (Carrier Sense Multiple Access), which is widely deployed in today's wireless networks, our algorithm is simple, asynchronous, and easy to implement. Second, using a novel maximal-entropy technique, we combine the CSMA scheduling algorithm with congestion control to approach the maximum utility. Also, we further show that CSMA scheduling is a modular MAC-layer algorithm that can work with other protocols in the transport layer and network layer. Third, for wireless networks where packet collisions are unavoidable, we establish a general analytical model and extend the above algorithms to that case. Stochastic Processing Networks (SPNs) model manufacturing, communication, and service systems. In manufacturing networks, for example, tasks require parts and resources to produce other parts. SPNs are more general than queueing networks and pose novel challenges to throughput-optimum scheduling. We proposes a "deficit maximum weight" (DMW) algorithm to achieve throughput optimality and maximize the net utility of the production in SPNs. Table of Contents: Introduction / Overview / Scheduling in Wireless Networks / Utility Maximization in Wireless Networks / Distributed CSMA Scheduling with Collisions / Stochastic Processing networks

Download or read book Stochastic Network Optimization with Application to Communication and Queueing Systems written by Michael Neely and published by Springer Nature. This book was released on 2022-05-31 with total page 199 pages. Available in PDF, EPUB and Kindle. Book excerpt: This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are provided to illustrate the cost of approaching optimality. This theory is also applicable to problems in operations research and economics, where energy-efficient and profit-maximizing decisions must be made without knowing the future. Topics in the text include the following: - Queue stability theory - Backpressure, max-weight, and virtual queue methods - Primal-dual methods for non-convex stochastic utility maximization - Universal scheduling theory for arbitrary sample paths - Approximate and randomized scheduling theory - Optimization of renewal systems and Markov decision systems Detailed examples and numerous problem set questions are provided to reinforce the main concepts. Table of Contents: Introduction / Introduction to Queues / Dynamic Scheduling Example / Optimizing Time Averages / Optimizing Functions of Time Averages / Approximate Scheduling / Optimization of Renewal Systems / Conclusions

Download or read book Sharing Network Resources written by Abhey Parekh and published by Springer Nature. This book was released on 2022-06-01 with total page 132 pages. Available in PDF, EPUB and Kindle. Book excerpt: Resource Allocation lies at the heart of network control. In the early days of the Internet the scarcest resource was bandwidth, but as the network has evolved to become an essential utility in the lives of billions, the nature of the resource allocation problem has changed. This book attempts to describe the facets of resource allocation that are most relevant to modern networks. It is targeted at graduate students and researchers who have an introductory background in networking and who desire to internalize core concepts before designing new protocols and applications. We start from the fundamental question: what problem does network resource allocation solve? This leads us, in Chapter 1, to examine what it means to satisfy a set of user applications that have different requirements of the network, and to problems in Social Choice Theory. We find that while capturing these preferences in terms of utility is clean and rigorous, there are significant limitations to this choice. Chapter 2 focuses on sharing divisible resources such as links and spectrum. Both of these resources are somewhat atypical -- a link is most accurately modeled as a queue in our context, but this leads to the analytical intractability of queueing theory, and spectrum allocation methods involve dealing with interference, a poorly understood phenomenon. Chapters 3 and 4 are introductions to two allocation workhorses: auctions and matching. In these chapters we allow the users to game the system (i.e., to be strategic), but don't allow them to collude. In Chapter 5, we relax this restriction and focus on collaboration. Finally, in Chapter 6, we discuss the theoretical yet fundamental issue of stability. Here, our contribution is mostly on making a mathematically abstruse subdiscipline more accessible without losing too much generality.

Download or read book Internet Congestion Control written by Subir Varma and published by Morgan Kaufmann. This book was released on 2015-08-18 with total page 286 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Download or read book Communication Networks written by Jean Walrand and published by Springer Nature. This book was released on 2022-05-31 with total page 220 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book results from many years of teaching an upper division course on communication networks in the EECS department at the University of California, Berkeley. It is motivated by the perceived need for an easily accessible textbook that puts emphasis on the core concepts behind current and next generation networks. After an overview of how today's Internet works and a discussion of the main principles behind its architecture, we discuss the key ideas behind Ethernet, WiFi networks, routing, internetworking, and TCP. To make the book as self-contained as possible, brief discussions of probability and Markov chain concepts are included in the appendices. This is followed by a brief discussion of mathematical models that provide insight into the operations of network protocols. Next, the main ideas behind the new generation of wireless networks based on LTE, and the notion of QoS are presented. A concise discussion of the physical layer technologies underlying various networks is also included. Finally, a sampling of topics is presented that may have significant influence on the future evolution of networks, including overlay networks like content delivery and peer-to-peer networks, sensor networks, distributed algorithms, Byzantine agreement, source compression, SDN and NFV, and Internet of Things.

Download or read book Network Connectivity written by Chen Chen and published by Morgan & Claypool Publishers. This book was released on 2022-01-26 with total page 165 pages. Available in PDF, EPUB and Kindle. Book excerpt: Networks naturally appear in many high-impact domains, ranging from social network analysis to disease dissemination studies to infrastructure system design. Within network studies, network connectivity plays an important role in a myriad of applications. The diversity of application areas has spurred numerous connectivity measures, each designed for some specific tasks. Depending on the complexity of connectivity measures, the computational cost of calculating the connectivity score can vary significantly. Moreover, the complexity of the connectivity would predominantly affect the hardness of connectivity optimization, which is a fundamental problem for network connectivity studies. This book presents a thorough study in network connectivity, including its concepts, computation, and optimization. Specifically, a unified connectivity measure model will be introduced to unveil the commonality among existing connectivity measures. For the connectivity computation aspect, the authors introduce the connectivity tracking problems and present several effective connectivity inference frameworks under different network settings. Taking the connectivity optimization perspective, the book analyzes the problem theoretically and introduces an approximation framework to effectively optimize the network connectivity.Lastly, the book discusses the new research frontiers and directions to explore for network connectivity studies. This book is an accessible introduction to the study of connectivity in complex networks. It is essential reading for advanced undergraduates, Ph.D. students, as well as researchers and practitioners who are interested in graph mining, data mining, and machine learning.

Download or read book Diffusion Source Localization in Large Networks written by Lei Ying and published by Springer Nature. This book was released on 2022-05-31 with total page 79 pages. Available in PDF, EPUB and Kindle. Book excerpt: Diffusion processes in large networks have been used to model many real-world phenomena, including how rumors spread on the Internet, epidemics among human beings, emotional contagion through social networks, and even gene regulatory processes. Fundamental estimation principles and efficient algorithms for locating diffusion sources can answer a wide range of important questions, such as identifying the source of a widely spread rumor on online social networks. This book provides an overview of recent progress on source localization in large networks, focusing on theoretical principles and fundamental limits. The book covers both discrete-time diffusion models and continuous-time diffusion models. For discrete-time diffusion models, the book focuses on the Jordan infection center; for continuous-time diffusion models, it focuses on the rumor center. Most theoretical results on source localization are based on these two types of estimators or their variants. This book also includes algorithms that leverage partial-time information for source localization and a brief discussion of interesting unresolved problems in this area.

Download or read book Modeling and Optimization in Software Defined Networks written by Konstantinos Poularakis and published by Springer Nature. This book was released on 2022-06-01 with total page 160 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides a quick reference and insights into modeling and optimization of software-defined networks (SDNs). It covers various algorithms and approaches that have been developed for optimizations related to the control plane, the considerable research related to data plane optimization, and topics that have significant potential for research and advances to the state-of-the-art in SDN. Over the past ten years, network programmability has transitioned from research concepts to more mainstream technology through the advent of technologies amenable to programmability such as service chaining, virtual network functions, and programmability of the data plane. However, the rapid development in SDN technologies has been the key driver behind its evolution. The logically centralized abstraction of network states enabled by SDN facilitates programmability and use of sophisticated optimization and control algorithms for enhancing network performance, policy management, and security.Furthermore, the centralized aggregation of network telemetry facilitates use of data-driven machine learning-based methods. To fully unleash the power of this new SDN paradigm, though, various architectural design, deployment, and operations questions need to be addressed. Associated with these are various modeling, resource allocation, and optimization opportunities.The book covers these opportunities and associated challenges, which represent a ``call to arms'' for the SDN community to develop new modeling and optimization methods that will complement or improve on the current norms.

Download or read book Poisson Line Cox Process written by Harpreet S. Dhillon and published by Springer Nature. This book was released on 2022-06-01 with total page 131 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides a comprehensive treatment of the Poisson line Cox process (PLCP) and its applications to vehicular networks. The PLCP is constructed by placing points on each line of a Poisson line process (PLP) as per an independent Poisson point process (PPP). For vehicular applications, one can imagine the layout of the road network as a PLP and the vehicles on the roads as the points of the PLCP. First, a brief historical account of the evolution of the theory of PLP is provided to familiarize readers with the seminal contributions in this area. In order to provide a self-contained treatment of this topic, the construction and key fundamental properties of both PLP and PLCP are discussed in detail. The rest of the book is devoted to the applications of these models to a variety of wireless networks, including vehicular communication networks and localization networks. Specifically, modeling the locations of vehicular nodes and roadside units (RSUs) using PLCP, the signal-to-interference-plus-noise ratio (SINR)-based coverage analysis is presented for both ad hoc and cellular network models. For a similar setting, the load on the cellular macro base stations (MBSs) and RSUs in a vehicular network is also characterized analytically. For the localization networks, PLP is used to model blockages, which is shown to facilitate the characterization of asymptotic blind spot probability in a localization application. Finally, the path distance characteristics for a special case of PLCP are analyzed, which can be leveraged to answer critical questions in the areas of transportation networks and urban planning. The book is concluded with concrete suggestions on future directions of research. Based largely on the original research of the authors, this is the first book that specifically focuses on the self-contained mathematical treatment of the PLCP. The ideal audience of this book is graduate students as well as researchers in academia and industry who are familiar with probability theory, have some exposure to point processes, and are interested in the field of stochastic geometry and vehicular networks. Given the diverse backgrounds of the potential readers, the focus has been on providing an accessible and pedagogical treatment of this topic by consciously avoiding the measure theoretic details without compromising mathematical rigor.

Download or read book A Primer on Physical Layer Network Coding written by Soung Liew and published by Springer Nature. This book was released on 2022-05-31 with total page 202 pages. Available in PDF, EPUB and Kindle. Book excerpt: The concept of physical-layer network coding (PNC) was proposed in 2006 for application in wireless networks. Since then it has developed into a subfield of communications and networking with a wide following. This book is a primer on PNC. It is the outcome of a set of lecture notes for a course for beginning graduate students at The Chinese University of Hong Kong. The target audience is expected to have some prior background knowledge in communication theory and wireless communications, but not working knowledge at the research level. Indeed, a goal of this book/course is to allow the reader to gain a deeper appreciation of the various nuances of wireless communications and networking by focusing on problems arising from the study of PNC. Specifically, we introduce the tools and techniques needed to solve problems in PNC, and many of these tools and techniques are drawn from the more general disciplines of signal processing, communications, and networking: PNC is used as a pivot to learn about the fundamentals of signal processing techniques and wireless communications in general. We feel that such a problem-centric approach will give the reader a more in-depth understanding of these disciplines and allow him/her to see first-hand how the techniques of these disciplines can be applied to solve real research problems. As a primer, this book does not cover many advanced materials related to PNC. PNC is an active research field and many new results will no doubt be forthcoming in the near future. We believe that this book will provide a good contextual framework for the interpretation of these advanced results should the reader decide to probe further into the field of PNC.

Download or read book BATS Codes written by Shenghao Yang and published by Springer Nature. This book was released on 2022-06-01 with total page 208 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book discusses an efficient random linear network coding scheme, called BATched Sparse code, or BATS code, which is proposed for communication through multi-hop networks with packet loss. Multi-hop wireless networks have applications in the Internet of Things (IoT), space, and under-water network communications, where the packet loss rate per network link is high, and feedbacks have long delays and are unreliable. Traditional schemes like retransmission and fountain codes are not sufficient to resolve the packet loss so that the existing communication solutions for multi-hop wireless networks have either long delay or low throughput when the network length is longer than a few hops. These issues can be resolved by employing network coding in the network, but the high computational and storage costs of such schemes prohibit their implementation in many devices, in particular, IoT devices that typically have low computational power and very limited storage. A BATS code consists of an outer code and an inner code. As a matrix generalization of a fountain code, the outer code generates a potentially unlimited number of batches, each of which consists of a certain number (called the batch size) of coded packets. The inner code comprises (random) linear network coding at the intermediate network nodes, which is applied on packets belonging to the same batch. When the batch size is 1, the outer code reduces to an LT code (or Raptor code if precode is applied), and network coding of the batches reduces to packet forwarding. BATS codes preserve the salient features of fountain codes, in particular, their rateless property and low encoding/decoding complexity. BATS codes also achieve the throughput gain of random linear network coding. This book focuses on the fundamental features and performance analysis of BATS codes, and includes some guidelines and examples on how to design a network protocol using BATS codes.