Home > Technology & Engineering > Electronics & communications engineering > Communications engineering / telecommunications > Tutorial on Queuing and Trunking with Applications to Communications
38%
Tutorial on Queuing and Trunking with Applications to Communications

Tutorial on Queuing and Trunking with Applications to Communications

          
5
4
3
2
1

Available


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 motivation for developing this synthesis lecture was to provide a tutorial on queuing and trunking, with extensions to networks of queues, suitable for supplementing courses in communications, stochastic processes, and networking. An essential component of this lecture is MATLAB-based demonstrations and exercises, which can be easily modified to enable the student to observe and evaluate the impact of changing parameters, arrival and departure statistics, queuing disciplines, the number of servers, and other important aspects of the underlying system model. Much of the work in this lecture is based on Poisson statistics, since Poisson models are useful due to the fact that Poisson models are analytically tractable and provide a useful approximation for many applications. We recognize that the validity of Poisson statistics is questionable for a number of networking applications and therefore we briefly discuss self-similar models and the Hurst parameter, long-term dependent models, the Pareto distribution, and other related topics. Appropriate references are given for continued study on these topics. The initial chapters of this book consider individual queues in isolation. The systems studied consist of an arrival process, a single queue with a particular queuing discipline, and one or more servers. While this allows us to study the basic concepts of queuing and trunking, modern data networks consist of many queues that interact in complex ways. While many of these interactions defy analysis, the final chapter introduces a model of a network of queues in which, after being served in one queue, customers may join another queue. The key result for this model is known as Jackson's Theorem. Finally, we state the BCMP Theorem, which can be viewed as a further extension of Jackson's Theorem and present Kleinrock's formula, which can be viewed as the network version of Little's Theorem. Table of Contents: Introduction / Poisson, Erlang, and Pareto Distributions / A Brief Introduction to Queueing Theory / Blocking and Delay / Networks of Queues
About the Author: William H. Tranter is the Bradley Professor of Communications, Virginia Polytechnic Institute and State University. He received the Ph.D. degree in Electrical Engineering from the University of Alabama in 1970. He then joined the faculty of the University of Missouri-Rolla. Professor Tranter served as Assistant (1980-84) and Associate (1984-85) Dean of Engineering for Graduate Affairs and Research. In 1985 he was appointed Schlumberger Professor of Electrical Engineering and he continued to serve in that position until his early retirement from the University of Missouri in 1997. In 1997 he joined the Electrical and Computer Engineering faculty of Virginia Tech as the Bradley Professor of Communications. In 1995, Professor Tranter served as an Erskine Fellow at Canterbury University (Christchurch, New Zealand) where he conducted research and developed a course on Computer-Aided Design and Analysis of Communications Systems. Professor Tranter's current area of interest is computer-aided design and performance evaluation of communication systems and simulation techniques with applications to wireless cellular systems. His research efforts have been supported by the NSF, ONR, DARPA, Schlumberger Foundation, NASA, McDonnell-Douglas, Boeing, GE Aerospace, LG Corporation, Raytheon and Batelle Memorial Laboratories. He also has interest in developing computer-based design and analysis tools for research and educational use and was supported by NSF to develop a three-course sequence in wireless communications complete with simulation-based demonstrations and laboratories utilizing MATLAB. Professor Tranter has been very active in professional activities. He served as chair of a number of technical committees within the IEEE Communications Society. From 1988 to 1998 he served as Editor-in-Chief of the IEEE Journal on Selected Areas in Communications. From 1997-1999 he served the Communications Society as Director of Journals and in 1999 was elected to the Board of Governors. Professor Tranter also served on the IEEE Awards Board and as chair of the Alexander Graham Bell Award Committee. In 2001 Professor Tranter was elected Vice-President, Technical Activities of the IEEE Communications Society. Professor Tranter received an IEEE Centennial Medal in 1984, a Millennium Medal in 2000, the Donald McLellan Meritorious Service Award from the IEEE Communications Society in 2000, and the Publications Exemplary Service Award in 2001. He was elected a Fellow of the IEEE in 1985. Most recently, Professor Tranter served a three-year term at the National Science Foundation as Program Director for the areas of communications, networking, information theory, and coding. Allen B. Mackenzie is an Associate Professor in the Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University. He received his bachelor's degree in Electrical Engineering and Mathematics from Vanderbilt University in 1999. In 2003 he earned his Ph.D. in electrical engineering at Cornell University and joined the faculty of the Bradley Department of Electrical and Computer Engineering at Virginia Tech, where he is now an associate professor. During the 2012-2013 academic year, he is an E.T.S. Walton Visiting Professor at Trinity College Dublin. Prof. MacKenzie's research focuses on wireless communications systems and networks. Hiscurrent research interests include cognitive radio and cognitive network algorithms, architectures, and protocols and the analysis of such systems and networks using game theory. His past and current research sponsors include the National Science Foundation, the Defense Advanced Research Projects Agency, the National Institute of Justice, and the U.S. Army. Prof. MacKenzie is an associate editor of the IEEE Transactions on Communications and the IEEE Transactions on Mobile Computing. He also serves on the technical program committee of several international conferences in the areas of communications and networking, and is a regular reviewer for journals in these areas. Prof. MacKenzie is a senior member of the IEEE and a member of the ASEE and the ACM. In 2006, he received the Dean's Award for Outstanding New Assistant Professor in the College of Engineering at Virginia Tech. He is the author of more than 50 refereed conference and journal papers and the co-author of the book Game Theory for Wireless Engineers.


Best Sellers



Product Details
  • ISBN-13: 9783031005510
  • Publisher: Springer International Publishing AG
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Weight: 204 gr
  • ISBN-10: 3031005511
  • Publisher Date: 10 Dec 2012
  • Height: 235 mm
  • No of Pages: 92
  • Spine Width: 6 mm
  • Width: 191 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
Tutorial on Queuing and Trunking with Applications to Communications
Springer International Publishing AG -
Tutorial on Queuing and Trunking with Applications to Communications
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.

Tutorial on Queuing and Trunking with Applications to Communications

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!