On the greedy walk problem

  • Authors:

  • Charles Bordenave;Sergey Foss;Günter Last

  • Affiliations:

  • Institut de Mathématiques de Toulouse, CNRS & Universitéé de Toulouse, Toulouse, France 31062;School of Mathematics and Computer Sciences, Heriot-Watt University, Edinburgh, Scotland, UK EH14 4AS and Institute of Mathematics, Novosibirsk, Russia;Institut für Stochastik, Karlsruhe Institute of Technology, Karlsruhe, Germany 76128

  • Venue:
  • Queueing Systems: Theory and Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This note introduces a greedy walk on Poisson and Binomial processes, which is a close relative to the well-known greedy server model. Some open problems are presented.