Home > Mathematics and Science Textbooks > Mathematics > Queueing Theory 2: Advanced Trends
14%
Queueing Theory 2: Advanced Trends

Queueing Theory 2: Advanced Trends

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

The aim of this book is to reflect the current cutting-edge thinking and established practices in the investigation of queueing systems and networks. This second volume includes eight chapters written by experts wellknown in their areas. The book conducts a stability analysis of certain types of multiserver regenerative queueing systems; a transient evaluation of Markovian queueing systems, focusing on closed-form distributions and numerical techniques; analysis of queueing models in service sectors using analytical and simulation approaches; plus an investigation of probability distributions in queueing models and their use in economics, industry, demography and environmental studies. This book also considers techniques for the control of information in queueing systems and their impact on strategic customer behavior, social welfare and the revenue of monopolists. In addition, applications of maximum entropy methods of inference for the analysis of a stable M/G/1 queue with heavy tails, and inventory models with positive service time - including perishable items and stock supplied using various algorithmic control policies ((s; S); (r;Q), etc.).

Table of Contents:
Preface xi Chapter 1. Stability Analysis of Queueing Systems based on Synchronization of the Input and Majorizing Output Flows 1 Larisa AFANASEVA 1.1. Introduction 1 1.2. Model description 4 1.3. Auxiliary service process 6 1.4. Instability result for the case ρ ≥ 1 9 1.5. Stochastic boundedness for the case ρ < 1 10 1.6. Queueing system with unreliable servers and preemptive resume service discipline 11 1.7. Discrete-time queueing system with interruptions and preemptive repeat different service discipline 15 1.8. Queueing system with a preemptive priority discipline 18 1.9. Queueing system with simultaneous service of a customer by a random number of servers 20 1.10. Applications to transport systems analysis 23 1.11. Conclusion 28 1.12. Acknowledgment 29 1.13. References 29 Chapter 2. Queueing Models in Services – Analytical and Simulation Approach 33 Srinivas R. CHAKRAVARTHY 2.1. Introduction 33 2.2. Phase-type distributions and the batch Markovian arrival process 34 2.2.1. Phase-type distributions 35 2.2.2. Some useful results related to continuous PH distributions 36 2.2.3. The batch Markovian arrival process 40 2.3. Generation of MAP processes for numerical purposes 42 2.4. Analysis of selected queueing models of BMAP/G/c type 44 2.4.1. MAP/PH/1 queueing model 44 2.4.2. The system performance measures 48 2.4.3. Illustrative numerical examples for MAP/PH/1 49 2.4.4. MAP/M/c queueing model 55 2.4.5. The system performance measures 57 2.4.6. Illustrative numerical examples for MAP/M/c 57 2.5. Simulated models of BMAP/G/c type queues 58 2.5.1. Simulated model validation using MAP/M/c type queues 59 2.5.2. Simulated model validation using MAP/PH/1 type queues 59 2.5.3. Selected simulated models of BMAP/G/c type queues 59 2.6. Analysis of selected queueing models of BMAP/G/c type with a vacation 66 2.6.1. MAP/PH/1 queueing model with a vacation 66 2.6.2. The system performance measures 69 2.6.3. Illustrative numerical examples for MAP/PH/1 with a vacation 69 2.6.4. Validation of the simulated model for vacation type queues 74 2.6.5. Selected simulated models of BMAP/G/c type queues with a vacation 75 2.7. Acknowledgment 78 2.8. References 78 Chapter 3. Distributions and Random Processes Related to Queueing and Reliability Models 81 Boyan DIMITROV 3.1. Some useful notations, relationships and interpretations 81 3.2. Unreliable service model and reliability maintenance 85 3.3. Characterizations of exponential and geometric distributions via properties of service times 88 3.3.1. Instant repairs: characterization of geometric distribution 89 3.3.2. Instant repairs: characterizations of the exponential distribution 94 3.3.3. Various simplifying conditions 101 3.3.4. Unreliable service, repair times included 111 3.4. Probability distributions almost having lack of memory property 115 3.4.1. Service time on an unreliable server: instantaneous repairs 116 3.4.2. Properties of ALM distributions, and equivalent presentations 119 3.4.3. Periodicity in natural phenomena 126 3.5. Random processes with a periodic nature 126 3.5.1. Counting processes 127 3.5.2. Characterization of an NPP 128 3.5.3. Applications in risk modeling 131 3.6. Conclusions 132 3.7. References 133 Chapter 4. The Impact of Information Structure on Strategic Behavior in Queueing Systems 137 Antonis ECONOMOU 4.1. Introduction 138 4.2. Game-theoretical framework in queueing 139 4.3. The unobservable model 142 4.4. The observable model 146 4.5. Comparison of the unobservable and the observable models 151 4.6. Partially observable models 153 4.7. Heterogeneously observable models 158 4.8. Observable-with-delay models 162 4.9. Conclusions and literature review for further study 167 4.10. Acknowledgments 167 4.11. References 168 Chapter 5. Non-extensive Maximum Entropy Formalisms and Inductive Inference of a Stable M/G/1 Queue with Heavy Tails 171 Demetres D. KOUVATSOS and Ismail A. MAGEED 5.1. Introduction 172 5.2. General systems and inductive ME formalisms 175 5.2.1. “Classical” Shannon’s EME formalism with short-range interactions 175 5.2.2. Rényi’s and Tsallis’s NME formalisms with long-range interactions 176 5.3. NME formalisms and EME consistency axioms 177 5.4. A stable M/G/1 queue with long-range interactions 179 5.4.1. Background: Shannon’s EME state probability of a stable M/G/1 queue 179 5.4.2. Tsallis’ and Rényi’s NME state probabilities of a stable M/G/1 queue 180 5.4.3. Exact Rényi’s and Tsallis’ NME state probabilities with distinct GEq-type service time distributions 183 5.5. Numerical experiments and interpretations 188 5.6. Conclusions 195 5.7. Acknowledgments 196 5.8. Appendix: Rényi’s NME formalisms versus EME consistency axioms 196 5.8.1. Uniqueness 196 5.8.2. Invariance 197 5.8.3. System independence 197 5.8.4. Subset independence 198 5.9. References 199 Chapter 6. Inventory with Positive Service Time: a Survey 201 Achyutha KRISHNAMOORTHY, Dhanya SHAJIN and Viswanath C. NARAYANAN 6.1. Introduction 201 6.2. Queueing inventory models 203 6.2.1. Single-commodity queueing-inventory systems 206 6.2.2. Production inventory systems 215 6.2.3. Multicommodity queueing-inventory system 217 6.2.4. Retrial queues with inventory 219 6.2.5. Queues requiring additional items for service 222 6.2.6. Queueing-inventory: some work in progress and suggestions for future studies 225 6.3. Acknowledgment 227 6.4. References 227 Chapter 7. A Stability Analysis Method of Regenerative Queueing Systems 239 Evsey MOROZOV and Bart STEYAERT 7.1. Introduction 239 7.2. Preliminaries 241 7.3. The single-server system 244 7.4. The zero-delayed multiserver system 248 7.5. The delayed multiserver system: finiteness of the first regeneration period 252 7.6. Instability 256 7.6.1. Some comments on the method 260 7.7. Related research 262 7.8. Acknowledgments 266 7.9. References 266 Chapter 8. Transient Analysis of Markovian Queueing Systems: a Survey with Focus on Closed-forms and Uniformization 269 Gerardo RUBINO 8.1. Introduction 270 8.2. Basics on Markovian queues 272 8.2.1. Markov models 272 8.2.2. Uniformization 273 8.3. First examples 275 8.3.1. The Ehrenfest model in continuous-time 275 8.3.2. The M/M/∞ model 276 8.3.3. A queue with no server and catastrophes 277 8.3.4. The fundamental M/M/1 model 278 8.3.5. M/M/1 with bounded waiting room: the M/M/1/H model 282 8.3.6. Comments 284 8.4. An uniformization-based path for the M/M/1 with matrix generating functions 284 8.4.1. General case 286 8.4.2. Mean number of customers at time t in the M/M/1 287 8.5. An uniformization-based path using duality 290 8.5.1. Duality 290 8.5.2. The path toward the transient state distributions using duality 293 8.5.3. Application to the M/M/1 queueing system 294 8.5.4. Application to the M/M/1/H queueing system 295 8.5.5. Application to an M/M/1/H model with catastrophes 297 8.6. Other transient results 299 8.6.1. Busy period of the M/M/1 299 8.6.2. Max backlog of the M/M/1 over a finite time interval 299 8.6.3. M/E/1 300 8.7. Conclusions 302 8.8. References 302 List of Authors 307 Index 309


Best Sellers


Product Details
  • ISBN-13: 9781789450040
  • Publisher: ISTE Ltd
  • Publisher Imprint: ISTE Ltd
  • Height: 10 mm
  • No of Pages: 336
  • Spine Width: 10 mm
  • Weight: 680 gr
  • ISBN-10: 1789450047
  • Publisher Date: 01 Apr 2021
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Sub Title: Advanced Trends
  • Width: 10 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Queueing Theory 2: Advanced Trends
ISTE Ltd -
Queueing Theory 2: Advanced Trends
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 2: Advanced Trends

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

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA