Normal view MARC view ISBD view

Queueing Theory with Applications to Packet Telecommunication [electronic resource] / by John N. Daigle.

By: Daigle, John N [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Boston, MA : Springer US, 2005Description: XXIV, 316 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780387228594.Subject(s): Engineering | Statistics | Telecommunication | Engineering | Communications Engineering, Networks | Statistics for Engineering, Physics, Computer Science, Chemistry & GeosciencesDDC classification: 621.382 Online resources: Click here to access online
Contents:
Terminology and Examples -- Review of Random Processes -- Elementary Continuous-Time Markov Chain-Based Queueing Models -- Advanced Continuous-Time Markov Chain-Based Queueing Models -- The Basic M/G/1 Queueing System -- The M/G/1 Queueing System with Priority -- Vector Markov Chain Analysis: The M/G/1 and G/M/1 Paradigms -- Closing Remarks.
In: Springer eBooksSummary: Queueing Theory with Applications to Packet Telecommunication is an efficient introduction to fundamental concepts and principles underlying the behavior of queueing systems and its application to the design of packet-oriented electrical communication systems. In addition to techniques and approaches found in earlier works, the author presents a thoroughly modern computational approach based on Schur decomposition. This approach facilitates solution of broad classes of problems wherein a number of practical modeling issues may be explored. Key features of communication systems, such as correlation in packet arrival processes at IP switches and variability in service rates due to fading wireless links are introduced. Numerous exercises embedded within the text and problems at the end of certain chapters that integrate lessons learned across multiple sections are also included. In all cases, including systems having priority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored. In several cases multiple approaches to computing distributions are presented. Queueing Theory with Applications to Packet Telecommunication is intended both for self study and for use as a primary text in graduate courses in queueing theory in electrical engineering, computer science, operations research, and mathematics. Professionals will also find this work invaluable because the author discusses applications such as statistical multiplexing, IP switch design, and wireless communication systems. In addition, numerous modeling issues, such as the suitability of Erlang-k and Pade approximations are addressed.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Terminology and Examples -- Review of Random Processes -- Elementary Continuous-Time Markov Chain-Based Queueing Models -- Advanced Continuous-Time Markov Chain-Based Queueing Models -- The Basic M/G/1 Queueing System -- The M/G/1 Queueing System with Priority -- Vector Markov Chain Analysis: The M/G/1 and G/M/1 Paradigms -- Closing Remarks.

Queueing Theory with Applications to Packet Telecommunication is an efficient introduction to fundamental concepts and principles underlying the behavior of queueing systems and its application to the design of packet-oriented electrical communication systems. In addition to techniques and approaches found in earlier works, the author presents a thoroughly modern computational approach based on Schur decomposition. This approach facilitates solution of broad classes of problems wherein a number of practical modeling issues may be explored. Key features of communication systems, such as correlation in packet arrival processes at IP switches and variability in service rates due to fading wireless links are introduced. Numerous exercises embedded within the text and problems at the end of certain chapters that integrate lessons learned across multiple sections are also included. In all cases, including systems having priority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored. In several cases multiple approaches to computing distributions are presented. Queueing Theory with Applications to Packet Telecommunication is intended both for self study and for use as a primary text in graduate courses in queueing theory in electrical engineering, computer science, operations research, and mathematics. Professionals will also find this work invaluable because the author discusses applications such as statistical multiplexing, IP switch design, and wireless communication systems. In addition, numerous modeling issues, such as the suitability of Erlang-k and Pade approximations are addressed.

There are no comments for this item.

Log in to your account to post a comment.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha