Stability and performance of greedy server systems

Consider a queueing system in which arriving customers are placed on a circle and wait for service. A traveling server moves at constant speed on the circle, stopping at the location of the customers until service completion. The server is greedy: always moving in the direction of the nearest customer. Coffman and Gilbert conjectured that this system is stable if the traffic intensity is smaller than 1; however, a proof or counterexample remains unknown. In this review, we present a picture of the current state of this conjecture and suggest new related open problems.

[1]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

[2]  Dirk P. Kroese,et al.  A continuous polling system with general service times , 1991 .

[3]  Jewgeni H. Dshalalow,et al.  Frontiers in Queueing: Models and Applications in Science and Engineering , 1997 .

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

[5]  Eitan Altman,et al.  Queueing in space , 1994, Advances in Applied Probability.

[6]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[7]  Eitan Altman,et al.  Polling on a space with general arrival and service time distribution , 1997, Oper. Res. Lett..

[8]  Philippe Robert,et al.  The evolution of a spatial stochastic network , 2009, 0908.3256.

[9]  Hideaki Takagi,et al.  Queueing analysis of polling models: progress in 1990-1994 , 1998 .

[10]  Edward G. Coffman,et al.  A continuous polling system with constant service times , 1986, IEEE Trans. Inf. Theory.

[11]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

[12]  Edward G. Coffman,et al.  Continuous Polling on Graphs , 1993 .

[13]  Volker Schmidt,et al.  Queueing systems on a circle , 1993, ZOR Methods Model. Oper. Res..

[14]  Dirk P. Kroese.  HEAVY TRAFFIC ANALYSIS FOR CONTINUOUS POLLING MODELS , 1995 .

[15]  Volker Schmidt,et al.  Single-server queues with spatially distributed arrivals , 1994, Queueing Syst. Theory Appl..

[16]  Arie Harel,et al.  Polling, Greedy and Horizon Servers on a Circle , 1995, Oper. Res..

[17]  Serguei Foss,et al.  Stability of polling systems with exhaustive service policies and state-dependent routing , 1996 .

[18]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[19]  Volker Schmidt,et al.  Light-Traffic Analysis for Queues with Spatially Distributed Arrivals , 1996, Math. Oper. Res..

[20]  Hideaki Takagi,et al.  Stochastic Analysis of Computer and Communication Systems , 1990 .

[21]  O. Boxma.  Polling Systems , 2010 .

[22]  Edward G. Coffman,et al.  Polling and greedy servers on a line , 1987, Queueing Syst. Theory Appl..

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

[24]  Lasse Leskelä,et al.  Stability of a spatial polling system with greedy myopic service , 2009, Ann. Oper. Res..

[25]  Iddo Eliazar.  The Snowblower Problem , 2003, Queueing Syst. Theory Appl..

[26]  Iddo Eliazar.  From Polling to Snowplowing , 2005, Queueing Syst. Theory Appl..

[27]  Serguei Foss,et al.  On the Stability of Greedy Polling Systems with General Service Policies , 1998, Probability in the Engineering and Informational Sciences.

[28]  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.