Queueing Systems with Structured Markov Chains
In the previous chapters we studied queueing systems with different interarrival and service time distributions. Chapter 7 is devoted to the analysis of queueing systems with exponential interarrival and service time distributions. The number of customers
- PDF / 5,315,719 Bytes
- 388 Pages / 439.36 x 666.15 pts Page_size
- 20 Downloads / 222 Views
L´aszl´o Lakatos • L´aszl´o Szeidl • Mikl´os Telek
Introduction to Queueing Systems with Telecommunication Applications
123
L´aszl´o Lakatos E¨otv¨os Lor´and University Budapest, Hungary Mikl´os Telek Budapest University of Technology and Economics Budapest, Hungary
L´aszl´o Szeidl ´ Obuda University Budapest, Hungary Sz´echenyi Istv´an University Gy˝or, Hungary
ISBN 978-1-4614-5316-1 ISBN 978-1-4614-5317-8 (eBook) DOI 10.1007/978-1-4614-5317-8 Springer New York Heidelberg Dordrecht London Library of Congress Control Number: 2012951675 Mathematics Subject Classification (2010): 60K25, 68M20, 90B22 © Springer Science+Business Media, LLC 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Preface
The development of queueing theory dates back more than a century. Originally the concept was examined for the purpose of maximizing performance of telephone operation centers; however, it was realized soon enough that issues in that field that were solvable using mathematical models might arise in other areas of everyday life as well. Mathematical models, which serve to describe certain phenomena, quite often correspond with each other, regardless of the specific field for which they were originally developed, be that telephone operation centers, planning and mana
Data Loading...
