Abstract
In this paper, we investigate mean sojourn times in multiclass queues with feedback and their application to packet scheduling in communication networks.We first analyze the feedback queues with J groups of customers and a single server. The server selects a group (station) in a priority order and admits its customers into the service facility according to one of the following rules: 1-limited, gated, or exhaustive. Since there are multiple classes of customers in each group, they are served in either the (local) priority order or the first-come-first-served order. We derive the mean sojourn times for all service stages of customers circulating the system.Then we consider their application to a packet scheduling problem in communication networks where a mission-critical traffic is given some preferential treatment over the other normal traffic. Packets belonging to the normal traffic are allocated the resource capacity in proportion to their assigned weights in a round-robin manner, which we call the discriminatory round robin (DRR). We construct some composite scheduling algorithms and compare their performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.