Abstract
This paper considers anM/G/1/Kqueueing system with push-out scheme which is one of the loss priority controls at a multiplexer in communication networks. The loss probability for the model with push-out scheme has been analyzed, but the waiting times are not available for the model. Using a set of recursive equations, this paper derives the Laplace-Stieltjes transforms (LSTs) of the waiting time and the push-out time of low-priority messages. These results are then utilized to derive the loss probability of each traffic type and the mean waiting time of high-priority messages. Finally, some numerical examples are provided.
Highlights
Many protocols and architectures to support a wide variety of communication services with different quality of service(QoS) requirements have been proposed and implemented so far
This paper considers an M/G/1/K queueing system with push-out scheme which is one of the loss priority controls at a multiplexer in communication networks
The QoS is mainly measured by two parameters: delay and loss probability [1, 2]
Summary
Many protocols and architectures to support a wide variety of communication services with different quality of service(QoS) requirements have been proposed and implemented so far In this communication environment, various types of traffic sources are statistically multiplexed to utilize the network resources efficiently. In. In the above literatures, only the loss probabilities for a push-out scheme with two classes of messages are relatively well studied. This paper considers an M/G/1/K priority queue with two classes of messages, where the system is controlled by a push-out scheme. We find the LST’s of the waiting time and the push-out time of a low-priority message by using simple recursive equations These results are utilized to derive the loss probabilities for both classes.
Sign-in/Register to view highlights & summary 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.
