Abstract
Concentrating rooted tree networks of discrete-time single server queues, all with unit service time, are considered. Such networks occur as subnetworks connecting remote access terminals to a node in a data communications network. It is shown that the network of queues may be replaced by a single queue, with prescribed input, which has the same output as the queue at the root of the tree. The result is applied, in particular, to the case of several queues in tandem, and it is shown how this problem may be reduced to that of just two queues in tandem. The latter problem was analyzed earlier by the author.
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.
