"Contains all the material needed by an engineer who wishes to master the theoretical foundations of performance evaluation and to then value the performance of a real computer or communication system" -- Back cover.

Providing performance guarantees is one of the most important issues for future telecommunication networks. This book describes theoretical developments in performance guarantees for telecommunication networks from the last decade. Written for the benefit of graduate students and scientists interested in telecommunications-network performance this book consists of two parts. The first introduces the recently-developed filtering theory for providing deterministic (hard) guarantees, such as bounded delay and queue length. The filtering theory is developed under the min-plus algebra, where one replaces the usual addition with the min operator and the usual multiplication with the addition operator. As in the classical linear system theory, the filtering theory treats an arrival process (or a departure process ) as a signal and a network element as a system. Network elements, including traffic regulators and servers, can be modelled as linear filters under the min-plus algebra, and they can be joined by concatenation, "filter bank summation", and feedback to form a composite network element. The problem of providing deterministic guarantees is equivalent to finding the impulse response of composite network elements. This section contains material on: - (s, r)-calculus - Filtering theory for deterministic traffic regulation, service guarantees and networks with variable-length packets - Traffic specification - Networks with multiple inputs and outputs - Constrained traffic regulation The second part of the book addresses stochastic (soft) guarantees, focusing mainly on tail distributions of queue lengths and packet loss probabilities and contains material on: - (s(q), r(q))-calculus and q-envelope rates - The large deviation principle - The theory of effective bandwidth The mathematical theory for stochastic guarantees is the theory of effective bandwidth. Based on the large deviation principle, the theory of effective bandwidth provides approximations for the bandwidths required to meet stochastic guarantees for both short-range dependent inputs and long-range dependent inputs.

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.

Retaining the first edition's technology-centred perspective, this book gives readers a sound understanding of packed-switched, circuit-switched and ATM networks, and techniques for controlling them.

Analysis of Computer and Communication Networks provides the basic techniques for modeling and analyzing two of the fundamental components of high performance networks: switching equipment, and software employed at the end nodes and intermediate switches. The book also reviews the design options used to build efficient switching equipment. Topics covered include Markov chains and queuing analysis, traffic modeling, interconnection networks, and switch architectures and buffering strategies. This book covers the mathematical theory and techniques necessary for analyzing telecommunication systems. Queuing and Markov chain analyses are provided for many protocols currently in use. The book then discusses in detail applications of Markov chains and queuing analysis to model more than 15 communications protocols and hardware components.

Computer-Mediated Communication Systems: Status and Evaluation synthesizes current knowledge about computerized conferencing systems, electronic mail, and office information-communication systems. It should be of interest both to students and researchers studying this new form of electronic communication and to organizations that are planning the installation of electronic mail or other computer-mediated communication systems and that need to be aware of the information gleaned from the studies presented here. The book is organized into four main sections, focusing on the following issues: (1) What are the important considerations in designing software or choosing a system from the many available options and capabilities? (2) What factors determine whether such systems are likely to be accepted or rejected? (3) What are the likely impacts of such systems upon the individuals, groups, and organizations which use them? It is not the economic costs and benefits, but the social problems and ""payoffs"" in the form of enhanced performance and organizational efficiency that should be the main considerations in deciding whether or not to use a computer-mediated communication system. (4) Given the conditional nature of many of the possible impacts, no system should be implemented without formal evaluation and feedback from users to guide the implementation. The major kinds of evaluational strategies that have been successfully employed are described in this book.

Intended for a first course in performance evaluation, this is a self-contained treatment covering all aspects of queuing theory. It starts by introducing readers to the terminology and usefulness of queueing theory and continues by considering Markovian queues in equilibrium, Littles law, reversibility, transient analysis, and computation, plus the M/G/1 queuing system. It then moves on to cover networks of queues, and concludes with techniques for numerical solutions, a discussion of the PANACEA technique, discrete time queueing systems and simulation, and stochastic Petri networks. The whole is backed by case studies of distributed queueing networks arising in industrial applications. This third edition includes a new chapter on self-similar traffic, many new problems, and solutions for many exercises.

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.

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.

With the growing need for effective communication networks in telecommunications and distributed computer systems, system designers need to be aware of the developments of sophisticated models for evaluating system performance. This book is ideally designed for performance engineers and system designers with the main focus of the text on queueing network models.