Polling Systems

2 Decomposition properties and pseudo-conservation laws in polling models 17 2. 3 Polling systems with zero and non-zero switch-over times 23 3.

[1]  C. Mack,et al.  THE EFFICIENCY OF N MACHINES UNI-DIRECTIONALLY PATROLLED BY ONE OPERATIVE WHEN WALKING TIME AND REPAIR TIMES ARE CONSTANTS , 1957 .

[2]  William L. Maxwell,et al.  Queuing with Alternating Priorities , 1965 .

[3]  Lajos Takács.  Two Queues Attended by a Single Server , 1968, Oper. Res..

[4]  Joseph B. Kruskal.  Work-scheduling algorithms: A nonprobabilistic queuing study (with possible application to no. 1 ESS) , 1969 .

[5]  Robert B. Cooper,et al.  Queues served in cyclic order , 1969 .

[6]  Robert B. Cooper.  Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

[7]  Martin Eisenberg.  Two Queues with Changeover Times , 1971, Oper. Res..

[8]  Martin Eisenberg,et al.  Queues with Periodic Service and Changeover Time , 1972, Oper. Res..

[9]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[10]  Isaac Meilijson,et al.  On optimal right-of-way policies at a single-server station when insertion of idle times is permitted , 1977 .

[11]  M. Eisenberg.  Two Queues with Alternating Service , 1979 .

[12]  P. J. Kuehn,et al.  Multiqueue systems with nonexhaustive cyclic service , 1979, The Bell System Technical Journal.

[13]  Shaler Stidham,et al.  The Relation between Customer and Time Averages in Queues , 1980, Oper. Res..

[14]  E. Koenigsberg,et al.  The analysis of production systems , 1982 .

[15]  Gordon F. Newell,et al.  An analysis of elevator operation in moderate height buildings—II: Multiple elevators , 1982 .

[16]  Hong Linh Truong,et al.  Mean-delay approximation for cyclic-service queueing systems , 1983, Perform. Evaluation.

[17]  Onno J. Boxma.  Two Symmmetric Queues with Alternating Service and Switching Times , 1984, Performance.

[18]  Kym Watson,et al.  Performance Evaluation of Cyclic Service Strategies - A Survey , 1984, International Symposium on Computer Modeling, Measurement and Evaluation.

[19]  Alon Itai,et al.  A golden ratio control policy for a multiple-access channel , 1984 .

[20]  R. B. Cooper,et al.  Application of decomposition principle in M/G/1 vacation model to two continuum cyclic queueing models — Especially token-ring LANs , 1985, AT&T Technical Journal.

[21]  Jean Walrand,et al.  The c# rule revisited , 1985 .

[22]  Michael J. Ferguson,et al.  Exact Results for Nonsymmetric Token Ring Systems , 1985, IEEE Trans. Commun..

[23]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[24]  Bruce E. Hajek,et al.  Extremal Splittings of Point Processes , 1985, Math. Oper. Res..

[25]  S. W Fuhrmann,et al.  Symmetric queues served in cyclic order , 1985 .

[26]  Julian Keilson,et al.  Oscillating random walk models for GI / G /1 vacation systems with Bernoulli schedules , 1986 .

[27]  Michael J. Ferguson.  Mean waiting time for a token ring with station dependent overheads , 1986 .

[28]  D. Everitt.  A conservation-type law for the token ring with limited service , 1986 .

[29]  Leslie D. Servi.  Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules , 1986, IEEE J. Sel. Areas Commun..

[30]  Onno Boxma,et al.  Pseudo-conservation laws in cyclic-service systems , 1986 .

[31]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[32]  高木 英明,et al.  Analysis of polling systems , 1986 .

[33]  J. W. Cohen.  A Two-Queue Model with Semi-Exhaustive Alternating Service , 1987, Performance.

[34]  Onno J. Boxma,et al.  Waiting-Time Approximations in Multi-Queue Systems with Cyclic Service , 1987, Perform. Evaluation.

[35]  Ernest Koenigsberg,et al.  The Efficiency of Two Groups of N Machines Served by a Single Robot , 1987 .

[36]  Edward G. Coffman,et al.  Two Queues with Alternating Service Periods , 1987, Performance.

[37]  Onno Boxma,et al.  Two queues with alternating service and switching times , 1987 .

[38]  Izhak Rubin,et al.  Polling with a General-Service Order Table , 1987, IEEE Trans. Commun..

[39]  Onno J. Boxma,et al.  Waiting-Time Approximations for Cyclic-Service Systems with Switchover Times , 1987, Perform. Evaluation.

[40]  Micha Hofri,et al.  Packet delay under the golden ratio weighted TDM policy in a multiple-access channel , 1987, IEEE Trans. Inf. Theory.

[41]  Steve W. Fuhrmann,et al.  Analysis of Cyclic Service Systems with Limited Service: Bounds and Approximations , 1988, Perform. Evaluation.

[42]  Onno J. Boxma,et al.  Waiting times in discrete-time cyclic-service systems , 1988, IEEE Trans. Commun..

[43]  Mandyam M. Srinivasan.  An Approximation for Mean Waiting Times in Cyclic Server Systems with Nonexhaustive Service , 1988, Perform. Evaluation.

[44]  Brian D. Bunday,et al.  The efficiency of M groups of N machines served by a travelling robot: comparison of two models , 1988 .

[45]  Leonard Kleinrock,et al.  The Analysis of Random Polling Systems , 1988, Oper. Res..

[46]  W. P. Groenendijk.  WAITING-TIME APPROXIMATIONS FOR CYCLIC-SERVICE SYSTEMS WITH MIXED SERVICE STRATEGIES , 1988 .

[47]  Onno J. Boxma,et al.  Waiting Times in Polling Systems with Markovian Server Routing , 1989, MMB.

[48]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

[49]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[50]  D. Sarkar,et al.  Expected waiting time for nonsymmetric cyclic queueing systems—exact results and applications , 1989 .

[51]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[52]  Hanoch Levy,et al.  Optimization of Polling Systems , 1990, International Symposium on Computer Modeling, Measurement and Evaluation.

[53]  Onno J. Boxma,et al.  A pseudoconservation law for service systems with a polling table , 1990, IEEE Trans. Commun..

[54]  Moshe Sidi,et al.  Dominance relations in polling systems , 1990, Queueing Syst. Theory Appl..

[55]  Jacques Resing.  Asymptotic results in feedback systems , 1990 .

[56]  J. W. Cohen,et al.  QUEUEING, PERFORMANCE AND CONTROL IN ATM , 1991 .

[57]  Hanoch Levy,et al.  Efficient visit frequencies for polling tables: minimization of waiting cost , 1991, Queueing Syst. Theory Appl..

[58]  Leonard Kleinrock,et al.  Polling Systems with Zero Switch-Over Periods: A General Method for Analyzing the Expected Delay , 1991, Perform. Evaluation.

[59]  Willard I. Zangwill,et al.  Variance Effects in Cyclic Production Systems , 1991 .

[60]  Onno Boxma.  Analysis and optimization of polling systems , 1991 .

[61]  Yavuz A. Bozer,et al.  Tandem Configurations for Automated Guided Vehicle Systems and the Analysis of Single Vehicle Loops , 1991 .

[62]  Hideaki Takagi,et al.  Application of Polling Models to Computer Networks , 1991, Comput. Networks ISDN Syst..

[63]  Yair Arian,et al.  Algorithms for generalized round robin routing , 1992, Oper. Res. Lett..

[64]  Yoshitaka Takahashi,et al.  A note on the pseudo-conservation law for a multi-queue with local priority , 1992, Queueing Syst. Theory Appl..

[65]  Steve W. Fuhrmann,et al.  A decomposition result for a class of polling models , 1992, Queueing Syst. Theory Appl..

[66]  Donald F. Towsley,et al.  On optimal polling policies , 1992, Queueing Syst. Theory Appl..

[67]  Jan Adriaan Weststrate.  Analysis and optimization of polling models , 1992 .

[68]  Wojciech Szpankowski,et al.  Stability of token passing rings , 1992, Queueing Syst. Theory Appl..

[69]  Hanoch Levy,et al.  Cyclic reservation schemes for efficient operation of multiple-queue single-server systems , 1992, Ann. Oper. Res..

[70]  Shivendra S. Panwar,et al.  Golden ratio scheduling for flow control with low buffer requirements , 1992, IEEE Trans. Commun..

[71]  Eitan Altman,et al.  Polling systems with synchronization constraints , 1992, Ann. Oper. Res..

[72]  Gideon Weiss,et al.  Dynamic priority rules when polling with multiple parallel servers , 1992, Oper. Res. Lett..

[73]  Hanoch Levy,et al.  Efficient analysis of polling systems , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[74]  Duan-Shin Lee,et al.  A reservation based cyclic server queue with limited service , 1992, SIGMETRICS '92/PERFORMANCE '92.

[75]  Zhen Liu,et al.  Stability, monotonicity and invariant quantities in general polling systems , 1992, Queueing Syst. Theory Appl..

[76]  Kow C. Chang,et al.  Mean Waiting Time Approximations in Cyclic-Service Systems with Exhaustive Limited Service Policy , 1992, Perform. Evaluation.

[77]  Duan-Shin Lee,et al.  An approximate analysis of a cyclic server queue with limited service and reservations , 1992, Queueing Syst. Theory Appl..

[78]  Hanoch Levy,et al.  Efficient Visit Orders for Polling Systems , 1993, Perform. Evaluation.

[79]  D. Bertsimas,et al.  Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.

[80]  Jacques Resing,et al.  Polling systems and multitype branching processes , 1993, Queueing Syst. Theory Appl..

[81]  Christine Fricker,et al.  Monotonicity and stability of periodic polling models , 1994, Queueing Syst. Theory Appl..

[82]  R. Schassberger,et al.  Ergodicity of a polling network , 1994 .

[83]  Hanoch Levy,et al.  Pseudo-cyclic policies for multi-queue single server systems , 1994, Ann. Oper. Res..

[84]  Sem C. Borst,et al.  Optimization of fixed time polling schemes , 1994, Telecommun. Syst..

[85]  Martin Eisenberg,et al.  The polling system with a stopping server , 1994, Queueing Syst. Theory Appl..

[86]  Sem C. Borst,et al.  The use of service limits for efficient operation of multistation single-medium communication systems , 1995, TNET.

[87]  Robert D. van der Mei,et al.  Optimization of Polling Systems with Bernoulli Schedules , 1995, Perform. Evaluation.

[88]  R. Schaβberger.  Stability of Polling Networks with State-Dependent Server Routing , 1995 .

[89]  Mandyam M. Srinivasan,et al.  A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive , 1996, Oper. Res..

[90]  Ger Koole,et al.  Asigning a Single Server to Inhomogeneous Queues with Switching Costs , 1997, Theor. Comput. Sci..

[91]  Sem C. Borst,et al.  Polling Models With and Without Switchover Times , 1997, Oper. Res..

[92]  Lawrence M. Wein,et al.  Dynamic Scheduling of a Two-Class Queue with Setups , 2011, Oper. Res..

[93]  Eitan Altman,et al.  Balanced sequences and optimal routing , 2000, JACM.

[94]  Lawrence M. Wein,et al.  Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem , 2015, Oper. Res..

[95]  Bruno Gaujal,et al.  ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS , 2007, Probability in the Engineering and Informational Sciences.

[96]  Mikko Alava,et al.  Branching Processes , 2009, Encyclopedia of Complexity and Systems Science.

[97]  Mean Waiting Time for a Token Ring with Nodal Dependent Overheads , 2011 .

[98]  L Fournier,et al.  EXPECTED WAITING TIMES IN CYCLIC SERVICE SYSTEMS UNDER PRIORITY , .