Abstract
This paper presents a method for approximating mean message delays in a polling system where each message consists of a random number (batch) of packets. Each station can send at most one packet per visit by the server (token), and thus multiple visits by the server are typically necessary to transmit a single message. The number of packets per message is assumed to follow a general distribution. By applying a pseudo-conservation law, we are able to obtain an explicit, simple approximation for the average message (not packet) delay. The approximation is tested against simulation results and found to be quite accurate. For the case of a completely symmetrical system with geometrically distributed batch-sizes, the result becomes exact.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
