Mean delay analysis for a message priority-based polling scheme |
| |
Authors: | Zsehong Tsai Izhak Rubin |
| |
Affiliation: | (1) Electrical Engineering Department, National Taiwan University, Taipei, Taiwan, R.O.C.;(2) Engineering IV, University of California, Rm 58-115, 90024-1594 Los Angeles, CA, USA |
| |
Abstract: | We consider a multi-access communication channel such as a centrally-controlled polling system, a distributed token-based ring, or a bus network. A message priority-based polling procedure is used to control the access to the channel. This procedure requires the server to have no advance information concerning the number of messages resident at a station prior to its visit to the station. Messages arriving at each station belong to one of two priority classes: class-1 (high priority) and class-2 (low priority). Class-1 messages are served under an exhaustive service discipline, while class-2 messages are served under a limited service discipline. Class-1 messages have non-preemptive priority over class-2 messages resident at the same station. Using a fully symmetric system model, an exact expression for the sum of the mean waiting times of class-1 and class-2 messages is first derived. Upper and lower bounds for the mean message waiting times for each individual message class are then obtained.This work was supported by NFS Grant No. NCR-8914690, Pacific-Bell and MICRO Grant No. 90-135 and US West Contract No. D890701. |
| |
Keywords: | Polling priority local area networks access control multiple-access algorithms |
本文献已被 SpringerLink 等数据库收录! |
|