This rigourous and self-contained book describes mathematical and, in particular, stochastic methods to assess the performance of networked systems. It consists of three parts. The first part is a review on probability theory. Part two covers the classical theory of stochastic processes (Poisson, renewal, Markov and queuing theory), which are considered to be the basic building blocks for performance evaluation studies. Part three focuses on the relatively new field of the physics of networks. This part deals with the recently obtained insights that many very different large complex networks - such as the Internet, World Wide Web, proteins, utility infrastructures, social networks - evolve and behave according to more general common scaling laws. This understanding is useful when assessing the end-to-end quality of communications services, for example, in Internet telephony, real-time video and interacting games. Containing problems and solutions, this book is ideal for graduate students taking courses in performance analysis.
This textbook provides an introduction to common methods of performance modeling and analysis of communication systems. These methods form the basis of traffic engineering, teletraffic theory, and analytical system dimensioning. The fundamentals of probability theory, stochastic processes, Markov processes, and embedded Markov chains are presented. Basic queueing models are described with applications in communication networks. Advanced methods are presented that have been frequently used in recent practice, especially discrete-time analysis algorithms, or which go beyond classical performance measures such as Quality of Experience or energy efficiency. Recent examples of modern communication networks include Software Defined Networking and the Internet of Things. Throughout the book, illustrative examples are used to provide practical experience in performance modeling and analysis. Target group: The book is aimed at students and scientists in computer science and technical computer science, operations research, electrical engineering and economics.
Algorithm 396 A.4.6 General Execution Policies 398 A.5 Transient Analysis of DSPNs 401 A.5.1 Solution Algorithm for Periodic DSPNs 401 A.5.2 Solution Algorithm for Non-periodic DSPNs 403 List of Abbreviations 407 Glossary of Notation 411 References 419 Index 433.
This volume contains the complete set of tutorial papers presented at the 16th IFIP (International Federation for Information Processing) Working Group 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation, and a number of tutorial papers presented at the 1993 ACM (Association for Computing Machinery) Special Interest Group METRICS Conference on Measurement and Modeling of Computer Systems. The principal goal of the volume is to present an overview of recent results in the field of modeling and performance evaluation of computer and communication systems. The wide diversity of applications and methodologies included in the tutorials attests to the breadth and richness of current research in the area of performance modeling. The tutorials may serve to introduce a reader to an unfamiliar research area, to unify material already known, or simply to illustrate the diversity of research in the field. The extensive bibliographies guide readers to additional sources for further reading.
The included CD-ROM contains PowerPoint based animated presentations designed to reinforce certain examples within the book ... [it] also contains pdf files with full color versions of selected figures from the book.
Advances in wireless communications and networking technology have taken us towards a pervasively connected world in which a vast array of wireless devices, from mobile phones to environmental sensors, seamlessly communicate with each other. In many of these systems the freshness of the transmitted information is of high importance. Characterization of time-critical information can be achieved through the so-called real-time status updates that are messages, encapsulated in packets, carrying the timestamp of their generation. Status updates track time-varying content that needs to be transmitted from the generation point to a remote destination in a network. To quantify the freshness of information in networked systems, a novel metric, different from delay or latency, termed as “age of information” (AoI) has been introduced. In this thesis, we focus on characterizing and controlling age under various communication system setups. The first part of the thesis considers multiple access communication systems and comprises two papers. The first paper, investigates AoI in relation with throughput in a shared access setup with heterogeneous traffic. More specifically, we consider a shared access system consisting of a primary link and a network of secondary nodes, with multipacket reception (MPR) capabilities. To study the joint throughput-timeliness performance, we formulate two optimization problems considering both objectives and provide guidelines for the design of such a multiple access system satisfying both timeliness and throughput requirements. In the second paper, we study the AoI performance in various multiple access schemes, including scheduling and random access. We present an analysis of the AoI with and without packet management at the transmission queue of the source nodes, considering that packet management is the capability to replace unserved packets in the queue whenever newer ones arrive. We incorporate the effect of channel fading and network path diversity in such a system and provide simulation results that illustrate the impact of network operating parameters on the performance of the considered access protocols. The second part of the thesis considers the characterization of AoI and other freshness performance metrics in a point-to-point communication link, again comprising two papers. In the third paper of this thesis, we expand the concept of information ageing by introducing the cost of update delay (CoUD) metric to characterize the cost of having stale information at the destination. Furthermore, we introduce the value of information of update (VoIU) metric that captures the degree of importance of the update received at the destination. We employ queue-theoretic concepts and provide a theoretical analysis and insights into the prospects of cost and value. Finally, in the last paper, we study the properties of a sample path of the AoI process, and we obtain a general formula of its stationary distribution. We relate this result to a discrete time queueing system and provide a general expression of the generating function of AoI in relation with the system time, and the peak age of information (PAoI). To illustrate the applicability of the results, we analyze the AoI in single-server queues with different disciplines and assumptions. We build upon these results to provide a methodology for analyzing general non-linear age functions for this type of systems.
With the rapidly increasing penetration of laptop computers and mobile phones, which are primarily used by mobile users to access Internet s- vices like e-mail and World Wide Web (WWW) access, support of Internet services in a mobile environment is an emerging requirement. Wireless n- works have been used for communication among fully distributed users in a multimedia environment that has the needs to provide real-time bursty traffic (such as voice or video) and data traffic with excellent reliability and service quality. To satisfy the huge wireless multimedia service demand and improve the system performance, efficient channel access methods and analytical methods must be provided. In this way very accurate models, that faithfully reproduce the stochastic behavior of multimedia wireless communication and computer networks, can be constructed. Most of these system models are discrete-time queueing systems. Queueing networks and Markov chains are commonly used for the p- formance and reliability evaluation of computer, communication, and m- ufacturing systems. Although there are quite a few books on the individual topics of queueing networks and Markov chains, we have found none that covers the topics of discrete-time and continuous-time multichannel mul- traffic queueing networks. On the other hand, the design and development of multichannel mul- hop network systems and interconnected network systems or integrated n- works of multimedia traffic require not only such average performance m- sures as the throughput or packet delay but also higher moments of traffic departures and transmission delay.
One of the first books in this area, this text focuses on important aspects of the system operation, analysis and performance evaluation of selected chaos-based digital communications systems – a hot topic in communications and signal processing.
This book is written for computer engineers and scientists active in the development of software and hardware systems. It supplies the understanding and tools needed to effectively evaluate the performance of individual computer and communication systems. It covers the theoretical foundations of the field as
