TY - JOUR
T1 - Descendant Set
T2 - An Efficient Approach for the Analysis of Polling Systems
AU - Konheim, Alan G.
AU - Levy, Hanoch
AU - Srinivasan, Mandyam M.
N1 - Funding Information:
Paper approved by Hideaki Takagi, the Editor for Queueing and Networking Performance of the IEEE Communications Society. Manuscript re- ceived February 5, 1992; revised June 9, 1992. The work of A.G. Konheim and H. Levy was panially supported by the American-Israeli Binational Sci- ence Foundation grant 88-00055. Conference Information: A partial and preliminruy result of this work has been reported in A.G. Konheim and H. Levy, “Efficient Analysis of Polling Systems”, INFOCOM’ 92.
PY - 1994
Y1 - 1994
N2 - Polling systems have been used to model a large variety of applications and much research has been devoted to the derivation of efficient algorithms for computing the delay measures in these systems. Recent research efforts in this area, which have focused on the optimization of these systems, have raised the need for very efficient such algorithms. This work develops the descendant set approach as a general efficient algorithm for deriving all moments of customer delay (in particular, mean delay) in these systems. The method is applied to a very large variety of model variations, including: 1) The exhaustive and gated service policies, 2) Fractional service policies, 3) The cyclic visit order, 4) Arbitrary periodic visit orders (polling tables), and 5) Customer routing. For most of these variations the method significantly outperforms the algorithms commonly used today.
AB - Polling systems have been used to model a large variety of applications and much research has been devoted to the derivation of efficient algorithms for computing the delay measures in these systems. Recent research efforts in this area, which have focused on the optimization of these systems, have raised the need for very efficient such algorithms. This work develops the descendant set approach as a general efficient algorithm for deriving all moments of customer delay (in particular, mean delay) in these systems. The method is applied to a very large variety of model variations, including: 1) The exhaustive and gated service policies, 2) Fractional service policies, 3) The cyclic visit order, 4) Arbitrary periodic visit orders (polling tables), and 5) Customer routing. For most of these variations the method significantly outperforms the algorithms commonly used today.
UR - http://www.scopus.com/inward/record.url?scp=0028370336&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.1994.580233
DO - 10.1109/TCOMM.1994.580233
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0028370336
SN - 0090-6778
VL - 42
SP - 1245
EP - 1253
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 234
ER -