A task-oriented priority queue for telephone switch design .II. with modified FCFS and forking

Abstract

When developing a telephone switch, it is useful to know how long it will take to process the various tasks associated with call processing. The model developed in this paper gives expected sojourn times for those tasks. It is a priority queueing model with a modified first-come first-served (FCFS) service discipline, which mimics the treatment of tasks in actual system software. The model is an M/G/1 queueing model with preemption (preemptive resume). It consists of multiple queues, one for each distinct priority, where each task has been preassigned a constant priority. Within each priority queue, the tasks are further grouped by type. An arriving task will join the back of the group of tasks of its type, regardless of where this group is positioned in the queue. Upon completion of a task, multiple subsequent tasks can be given ready-for-service status, and enter the priority queues. This is referred to its forking. Call processing involves many ordered sets of tasks (jobs), some of which will contain forks. The model produces results that compare favorably with those obtained by simulation.