This textbook presents the mathematical theory and techniques necessary for analyzing and modeling high-performance global networks, such as the Internet. The three main building blocks of high-performance networks are links, switching equipment connecting the links together and software employed at the end nodes and intermediate switches. This book provides the basic techniques for modeling and analyzing these last two components. Topics covered include, but are not limited to: Markov chains and queuing analysis, traffic modeling, interconnection networks and switch architectures and buffering strategies.

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.

This book covers performance analysis of computer networks, and begins by providing the necessary background in probability theory, random variables, and stochastic processes. Queuing theory and simulation are introduced as the major tools analysts have access to. It presents performance analysis on local, metropolitan, and wide area networks, as well as on wireless networks. It concludes with a brief introduction to self-similarity. Designed for a one-semester course for senior-year undergraduates and graduate engineering students, it may also serve as a fingertip reference for engineers developing communication networks, managers involved in systems planning, and researchers and instructors of computer communication networks.

Capacity assignment in networks; Capacity assignment in distributed network; Centralized networks: time delay-cost trade offs; Elements of queueing theory; Concentration and buffering in store-and-forward networks; Concentration: finite buffers, dynamic buffering, block storage; Centralized network design: multipoint connections; Network design algorithms; Routing and flow control; Polling in networks; Random access techniques; Line control procedures.

‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models. From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks. In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.

This book enables networking professionals who design, evaluate, build, and operate computer networks to prepare a complete network design through two processes, network analysis where network requirements are gathered from end-users and traffic flows are determined, and network design where those traffic flows are used to choose networking technologies, networking components, and the services that the network should provide.