from Part II - Approximations of the Single Queue
Published online by Cambridge University Press: 01 October 2021
We present the ingenious scheme devised by Loynes to show that G/G/1 with stationary arrival and service processes is stable when the traffic intensity rho < 1, and transient if rho > 1. Under the stronger assumption that interarrivals and services are i.i.d., we explore the connection of the GI/GI/1 queue with the general random walk and obtain an insightful upper bound on waiting time.
To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.