Polling system optimization through dynamic routing policies

Offer Fabian, Hanoch Levy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Polling systems have been used as a central model for modeling various communications networks, like the token ring network, some high speed local-area networks and others. In this paper we focus on pseudo cyclic algorithms which can prioritize the various stations by dynamically changing their service order but maintain fairness by visiting each station exactly once in a cycle. We study the waiting time performance of systems operated under cycle-time guided algorithms in semi-dynamic polling models. In fully symmetric systems we bound by stochastic dominance the waiting times of all pseudo-cyclic policies. This dominance is quantified by the analysis of a fluid approximation model and simulations of the general polling model.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
PublisherPubl by IEEE
Pages194-200
Number of pages7
ISBN (Print)0818635800
StatePublished - 1993
EventProceedings of the 12th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM '93 - San Francisco, CA, USA
Duration: 30 Mar 19931 Apr 1993

Publication series

NameProceedings - IEEE INFOCOM
Volume1
ISSN (Print)0743-166X

Conference

ConferenceProceedings of the 12th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM '93
CitySan Francisco, CA, USA
Period30/03/931/04/93

Fingerprint

Dive into the research topics of 'Polling system optimization through dynamic routing policies'. Together they form a unique fingerprint.

Cite this