Buy Queueing Theory for Telecommunications by Attahiru Sule Alfa
close menu
Bookswagon
search
My Account
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System
Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System

Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System


     0     
5
4
3
2
1



Available


X
About the Book

Queueing theory applications can be discovered in many walks of life including; transportation, manufacturing, telecommunications, computer systems and more. However, the most prevalent applications of queueing theory are in the telecommunications field. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System focuses on discrete time modeling and illustrates that most queueing systems encountered in real life can be set up as a Markov chain. This feature is very unique because the models are set in such a way that matrix-analytic methods are used to analyze them. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System is the most relevant book available on queueing models designed for applications to telecommunications. This book presents clear concise theories behind how to model and analyze key single node queues in discrete time using special tools that were presented in the second chapter. The text also delves into the types of single node queues that are very frequently encountered in telecommunication systems modeling, and provides simple methods for analyzing them. Where appropriate, alternative analysis methods are also presented. This book is for advanced-level students and researchers concentrating on engineering, computer science and mathematics as a secondary text or reference book. Professionals who work in the related industries of telecommunications, industrial engineering and communications engineering will find this book useful as well.

Table of Contents:
1.0 Introduction.- 1.1 Description and examples of queueing systems.- 1.2 Applications of queueing models to real life problems.- 1.3 Historical development of queueing theory.- 2.0 Discrete time Markov chains (DTMC).- 2.1 DTMC.- 2.2. Focus on Quasi-birth-and-death processes ( a special class of infinite DTMC).- 3.0 Concept of a queueing system and characterization.- 3.1 Performance measures.- 3.2 Describing a queueing system and how it is characterized.- 3.3 The key parameters that define a queueing system.- 3.4 Performance measures of interest.- 3.5 Arrival and service processes.- 4. 0 Single Node Queues.- 4.1 Simple single server queue.- 4.2 Multi-server queues.- 4.3 Queues with feedback.- 4.4 Priority queues.- 4.5 Vacation queues.- 4.6 Queues with server breakdowns and repairs.- 4.7 Retrial queues.- 4.8 Queues with impatient customers.- 4.9 Queues with multiple customer types.- 5.0 Aspects of Single Node Queues.- 5.1 Tail behavior of single node queues.- 5.2 Mean-value analysis of queues.- 5.3 Transient analysis of queues.- 5.4 Queues with time-varying parameters.- 6. 0 Tools for analyzing queueing systems.- 6.1 MATLAB.- Index.

About the Author :

Attahiru S. Alfa is a professor and NSERC Industrial Research of Teletraffic in the Department of Electrical and Computer Engineering at the University of Manitoba. He obtained his BEng from Ahmadu Bello University, Nigeria, MSc from the University of Manitoba, Canada, and PhD from the University of New South Wales, Australia. One of his main teaching and research interests is in the area of discrete time queues with applications to telecommunication systems as well as manufacturing and transportation systems. Over the years he has made a number of significant contributions in the area of matrix-analytic methods

.

Review :
From the reviews: "The book is an excellent guide to queueing models actually applied in telecommunication, gives a good introduction to single node queues with discrete time most frequently encountered there and provides simple methods for analyzing them. It can be recommended for students, researchers and engineers dealing with actual problems in queueing theory, especially with applications in telecommunications." (Laszlo Lakatos, Zentralblatt MATH, Vol. 1211, 2011)


Best Sellers


Product Details
  • ISBN-13: 9781489987440
  • Publisher: Springer-Verlag New York Inc.
  • Publisher Imprint: Springer-Verlag New York Inc.
  • Height: 235 mm
  • No of Pages: 238
  • Returnable: N
  • Width: 155 mm
  • ISBN-10: 1489987444
  • Publisher Date: 19 Oct 2014
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Sub Title: Discrete Time Modelling of a Single Node System


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System
Springer-Verlag New York Inc. -
Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    Hello, User