Abstract
A communication switching processor is modeled as an M/G/1 queueing system with a processor sharing service discipline. Messages arrive at the processor according to a Poisson stochastic process. The service requirements of a message consist of various communication functions performed at the processor and are organized into a set of tasks. Each task service time is a random variable from a general distribution. Tasks are assigned prescribed priorities. The tasks of a message are served sequentially. The processor serves tasks according to their priority and tasks of the same priority on a FCFS basis. This paper analytically derives the average delay of an arbitrary task in the system. The use of the results in the design of communication processors is illustrated.
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.
