This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are included. This bookintroduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. Itpresents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. __Applied Discrete-Time Queues__ targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are included. Front Matter....Pages i-xxi Introduction....Pages 1-22 Arrival and Service Processes....Pages 23-55 Discrete-Time Markov Chains....Pages 57-90 Numerical Computations with Discrete-Time Markov Chains....Pages 91-138 Basic Single Node Queueing Models with Infinite Buffers....Pages 139-207 Basic Single Node Queueing Models with Finite Buffers....Pages 209-226 Multiserver Single Node Queueing Models....Pages 227-260 Single Node Queueing Models with Server Vacations....Pages 261-282 Single Node Queueing Models with Priorities....Pages 283-306 Special Single Node Queueing Models....Pages 307-322 Queues with Time Varying Parameters....Pages 323-337 Tandem Queues and Queueing Networks....Pages 339-365 Optimization and Control of Discrete-Time Queues....Pages 367-377 Back Matter....Pages 379-383
