Abstract
An exposition is undertaken to analytically derive validate the Shannonian Maximum Entropy BTM for the underlying stable queue. Most importantly, the analytic derivation of the upper and lower bounds 0f the absolute difference between Shannonian Cumulative service time distribution functions (CDFs) with and without balking. Typical numerical experiments are provided. Additionally, some applications of M/G/1 queue theory to AR are given. Some challenging open problems are addressed combined with closing remarks and future research directions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Balkan Journal of Electrical and Computer Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
