Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

A method for location discovery in a data network includes receiving, at a first device, connection information from a neighboring network device and determining a physical location of the first device based on the connection information. The method can include receiving, at the first device, the physical location transmitted from the neighboring network device. The method can further include associating a level of trust with the physical location based on the neighboring network device. The first device be one of a variety of devices, such as a router, a switch, a network entry device, a firewall device, or a gateway.

Location discovery in a data network

A system that associates physical locations with network-linked devices in a network to which such devices are connected. This system employs a variety of techniques for establishing device location. The system configuration can vary and can include any type of data network, including LANs, MANs, Wide Area Networks (WANs), Personal Area Networks (PANs), and Home Networks. The system provides location information for particular devices to the network devices and management, and may be used in any of a variety of ways to improve configuration accuracy, control, and security. The location information may also be used to control or secure a device itself.

Locating devices in a data network

Models for the topology or dynamics of various networks abound, but until now, there has been no single universal framework for complex networks that can separate factors contributing to the topology and dynamics of networks across biological and social systems.

/pdf/universality-in-network-dynamics-32gkn5w2dj.pdf

Universality in network dynamics

A polling system is one that contains a number of queues served in cyclic order. It is employed in computer-terminal communication systems and implemented in such standard data link protocols as BSC, SDLC, and HDLC, and its analysis is now finding a new application in local-area computer networks.This monograph analyzes polling systems to evaluate such basic performance measures as the average queue length and waiting time. Following a taxonomy of models with reference to previous work, it considers one-message buffer systems and infinite buffer systems with exhaustive, gated, and limited service disciplines. Examples to which the analysis of polling systems is applied are drawn from the field of computer communication networks. Contents: Introduction. One-Message Buffer Systems. Exhaustive Service, Discrete-Time Systems. Exhaustive Service, Continuous-Time Systems. Gated Service Systems. Limited Service Systems. Systems with Zero Reply Intervals. Sample Applications. Future Research Topics. Summary of Important Results.Hideaki Takagi is with IBM Japan Science Institute in Tokyo. "Analysis of Polling Systems" is included in the Computer Systems Series, Research Reports and Notes, edited by Herb Schwetman.

Analysis of polling systems

Preface. Retrieving Files from the Wiley FTP and Internet Sites. 1. Performance Evaluation in Telecommunications. 2. Probability and Random Processes Review. 3. Application of Birth and Death Processes to Queueing Theory. 4. Networks of Queues: Product Form Solution. 5. Markov Chains: Application to Multiplexing and Access. 6. The M/G/1 Queue: Imbedded Markov Chains. 7. Fluid Flow Analysis. 8. The Matrix Geometric Techniques. 9. Monte Carlo Simulation. Index.

Modeling and Analysis of Telecommunications Networks

The performance of a multicast switch, a space division switch in which a packet at an input port is routed to a subset of the output ports, is discussed. The delay under the assumption of input port buffering is determined. The system is modeled as an independent set of M/G/1 queues. A key assumption in the analysis is that output port contention is settled by random selection among the contending input ports. In order to justify this as well as the other assumptions, a Monte-Carlo simulation of the system is devised. Numerical results from the analysis and simulation of the system are presented. >

Performance analysis of a multicast switch

Research: Admission-control techniques with application to broadband networks

Two forms of fast circuit switching are modeled and studied through mathematical analysis and Monte Carlo simulation. The two examples described use the switching technique in an optical-fiber-based local area network with a star topology. The technique is compatible with time-division multiplexing techniques that are used for a range of traffic classes. Further, the technique trades transmission capacity for processing power, which is the critical limitation of the system. By means of a certain independence assumption, the first form of fast circuit switching is modeled as an M/G/1 queue. The results of the analysis show excellent agreement with simulation. The general result is that there is good system throughput, despite simplicity of processing. The second form, in which rather than first-come first-served the discipline is to search for a message whose destination queue is free, is studied by means of simulation alone. The results indicate an improved performance with a modest increase in processing power. >

Traffic analysis of a local area network with a star topology

The implementation and performance of multicast packet switching in a broadband network environment are discussed. In terms of scheduling the transmission of the copies of the packet onto output ports, two basic service disciplines have been defined: (1) one-shot scheduling where all the copies are transmitted in the same time slot; and (2) call splitting with transmission over several time slots. As subcategories of call splitting strict-sense call splitting specifies that each packet can send at most one copy to the destination per time slot and wide-sense call splitting does not carry this restriction. A novel scheme called revision scheduling is proposed to mitigate the head of line blocking effect by sequentially combining the one-shot scheduling and the call splitting disciplines. Schematic structures are introduced for each category of scheduling, in the form of combinational logic circuits which are designed to resolve the output contentions corresponding to call scheduling disciplines, by incorporating a cyclic priority access policy. To compare the performances of various techniques, simulation studies were performed. >

https://ieeexplore.ieee.org/iel2/642/6695/00268157.pdf

Jeremiah F. Hayes

Papers

Modeling and Analysis of Telecommunications Networks

Performance analysis of a multicast switch

Research: Admission-control techniques with application to broadband networks

Traffic analysis of a local area network with a star topology

Call scheduling in multicasting packet switching