​This book proposes representations of multicast rate regions in wireless networks based on the mathematical concept of submodular functions, e.g., the submodular cut model and the polymatroid broadcast model. These models subsume and generalize the graph and hypergraph models. The submodular structure facilitates a dual decomposition approach to network utility maximization problems, which exploits the greedy algorithm for linear programming on submodular polyhedra. This approach yields computationally efficient characterizations of inner and outer bounds on the multicast capacity regions for various classes of wireless networks.

This book offers means to handle interference as a central problem of operating wireless networks. It investigates centralized and decentralized methods to avoid and handle interference as well as approaches that resolve interference constructively. The latter type of approach tries to solve the joint detection and estimation problem of several data streams that share a common medium. In fact, an exciting insight into the operation of networks is that it may be beneficial, in terms of an overall throughput, to actively create and manage interference. Thus, when handled properly, "mixing" of data in networks becomes a useful tool of operation rather than the nuisance as which it has been treated traditionally. With the development of mobile, robust, ubiquitous, reliable and instantaneous communication being a driving and enabling factor of an information centric economy, the understanding, mitigation and exploitation of interference in networks must be seen as a centrally important task.

This book provides a tutorial on quantum communication networks. The authors discuss current paradigm shifts in communication networks that are needed to add computing and storage to the simple transport ideas of prevailing networks. They show how these ‘softwarized’ solutions break new grounds to reduce latency and increase resilience. The authors discuss how even though these solutions have inherent problems due to introduced computing latency and energy consumption, the problems can be solved by hybrid classical-quantum communication networks. The book brings together quantum networking, quantum information theory, quantum computing, and quantum simulation.

Provides a tutorial on the basics of network coding theory. Divided into two parts, this book presents a unified framework for understanding the basic notions and fundamental results in network coding. It is aimed at students, researchers and practitioners working in networking research.

Modern day cellular mobile networks use Massive MIMO technology to extend range and service multiple devices within a cell. This has brought tremendous improvements in the high peak data rates that can be handled. Nevertheless, one of the characteristics of this technology is large variations in the quality of service dependent on where the end user is located in any given cell. This becomes increasingly problematic when we are creating a society where wireless access is supposed to be ubiquitous. When payments, navigation, entertainment, and control of autonomous vehicles are all relying on wireless connectivity the primary goal for future mobile networks should not be to increase the peak rates, but the rates that can be guaranteed to the vast majority of the locations in the geographical coverage area. The cellular network architecture was not designed for high-rate data services but for low-rate voice services, thus it is time to look beyond the cellular paradigm and make a clean-slate network design that can reach the performance requirements of the future. This monograph considers the cell-free network architecture that is designed to reach the aforementioned goal of uniformly high data rates everywhere. The authors introduce the concept of a cell-free network before laying out the foundations of what is required to design and build such a network. They cover the foundations of channel estimation, signal processing, pilot assignment, dynamic cooperation cluster formation, power optimization, fronthaul signaling, and spectral efficiency evaluation in uplink and downlink under different degrees of cooperation among the access points and arbitrary linear combining and precoding. This monograph provides the reader with all the fundamental information required to design and build the next generation mobile networks without being hindered by the inherent restrictions of modern cellular-based technology.

This open access book was prepared as a Final Publication of the COST Action IC1304 “Autonomous Control for a Reliable Internet of Services (ACROSS)”. The book contains 14 chapters and constitutes a show-case of the main outcome of the Action in line with its scientific goals. It will serve as a valuable reference for undergraduate and post-graduate students, educators, faculty members, researchers, engineers, and research strategists working in this field. The explosive growth of the Internet has fundamentally changed the global society. The emergence of concepts like SOA, SaaS, PaaS, IaaS, NaaS, and Cloud Computing in general has catalyzed the migration from the information-oriented Internet into an Internet of Services (IoS). This has opened up virtually unbounded possibilities for the creation of new and innovative services that facilitate business processes and improve the quality of life. However, this also calls for new approaches to ensuring the quality and reliability of these services. The objective of this book is, by applying a systematic approach, to assess the state-of-the-art and consolidate the main research results achieved in this area.

Graduate students and researchers in applied mathematics, optimization, engineering, computer science, and management science will find this book a useful reference which provides an introduction to applications and fundamental theories in nonlinear combinatorial optimization. Nonlinear combinatorial optimization is a new research area within combinatorial optimization and includes numerous applications to technological developments, such as wireless communication, cloud computing, data science, and social networks. Theoretical developments including discrete Newton methods, primal-dual methods with convex relaxation, submodular optimization, discrete DC program, along with several applications are discussed and explored in this book through articles by leading experts.

Traditionally engineers devised communication services without reference to how they should be priced. In today's environment pricing is a very complex subject and in practice depends on many parameters of the actual market - including amount of traffic, architecture of the network, technology, and cost. The challenge is to provide a generic service model which accurately captures aspects such as quality and performance, and can be used to derive optimal pricing strategies. Recent technology advances, combined with the deregulation of the telecommunication market and the proliferation of the internet, have created a highly competitive environment for communication service prividers. Pricing is no longer as simple as picking an appropriate model for a particular contract. There is a real need for a book that explains the provision of new services, the relation between pricing and resource allocation in networks; and the emergence of the internet and how to price it. Pricing Communication Networks provides a framework of mathematical models for pricing these multidimensional contracts, and includes background in network services and contracts, network techonology, basic economics, and pricing strategy. It can be used by economists to fill in the gaps in their knowledge of network services and technology, and for engineers and operational researchers to gain the background in economics required to price communication services effectively. * Provides a broad overview of network services and contracts * Includes a primer on modern network technology and the economic concepts relevant to pricing and competition * Includes discussion of mathematical models of traffic flow to help describe network capability and derive pricing strategies * Includes coverage of specialist topics, such as regulation, multicasting, and auctions * Illustrated throughout by detailed real examples * Suitable for anyone with an understanding of basic calculus and probability Primarily aimed at graduate students, researchers and practitioners from electrical engineering, computer science, economics and operations research Pricing Communication Networks will also appeal to telecomms engineers working in industry.

Following the pattern of the Internet growth in popularity, started in the early 1990s, the current unprecedented expansion of wireless technology promises to have an even greater effect on how people communicate and interact, with considerable socio-economic impact all over the world. The driving force behind this growth is the remarkable progress in component miniaturization, integration, and also devel- ments in waveforms, coding, and communication protocols. Besides established infrastructurebased wireless networks (cellular, WLAN, sat- lite) ad-hoc wireless networks emerge as a new platform for distributed applications and for personal communication in scenarios where deploying infrastructure is not feasible. In ad-hoc wireless networks, each node is capable of forwarding packets on behalf of other nodes, so that multi-hop paths provide end-to-end connectivity. The increased flexibility and mobility of ad-hoc wireless networks are favored for appli- tions in law enforcement, homeland defense and military. In a world where wireless networks become increasingly interoperable with each other and with the high-speed wired Internet, personal communication systems will transform into universal terminals with instant access to variate content and able of handle demanding tasks, such as multimedia and real-time video. With users roaming between networks, and with wide variation in wireless link quality even in a single domain, the communications terminal must continue to provide a level of Quality of Service that is acceptable to the user and conforms to a contracted Service Level Agreement.

The sixth volume of Rudolf Ahlswede's lectures on Information Theory is focused on Identification Theory. In contrast to Shannon's classical coding scheme for the transmission of a message over a noisy channel, in the theory of identification the decoder is not really interested in what the received message is, but only in deciding whether a message, which is of special interest to him, has been sent or not. There are also algorithmic problems where it is not necessary to calculate the solution, but only to check whether a certain given answer is correct. Depending on the problem, this answer might be much easier to give than finding the solution. ``Easier'' in this context means using fewer resources like channel usage, computing time or storage space. Ahlswede and Dueck's main result was that, in contrast to transmission problems, where the possible code sizes grow exponentially fast with block length, the size of identification codes will grow doubly exponentially fast. The theory of identification has now developed into a sophisticated mathematical discipline with many branches and facets, forming part of the Post Shannon theory in which Ahlswede was one of the leading experts. New discoveries in this theory are motivated both by concrete engineering problems and by explorations of the inherent properties of the mathematical structures. Rudolf Ahlswede wrote: It seems that the whole body of present day Information Theory will undergo serious revisions and some dramatic expansions. In this book we will open several directions of future research and start the mathematical description of communication models in great generality. For some specific problems we provide solutions or ideas for their solutions. The lectures presented in this work, which consists of 10 volumes, are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs. The book also contains an afterword by Gunter Dueck.