Delay bounds for packetizing time-varying fluid policies with speedup and lookahead in single server systems

Raymond Yim, Michael Rosenblum, Vahid Tarokh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider an online, processor sharing system with a single server in a packet-switched network where the processor multiplexes packets from multiple input ports onto the same output link. Under a fluid model, in which incoming data is treated as infinitely divisible, the multiplexer allocates its output capacity to serve fractions of packets from all input ports simultaneously (which we call a fluid policy). However, due to the packet nature of the network traffic, a multiplexer scheduler must approximate this fluid policy by a schedule in which only whole packets are sent (which we call a packetized policy). We assume that at each time instant, the aggregate service rate demanded by a fluid policy is no greater than the output link capacity. Then, for a single server with N input ports, and a scheduler using speedup s of at least 2 and a lookahead window of L ≥ 0 time steps, we prove bounds on worst-case maximum additional delay D. In particular, we show that (⌈Ne-s⌉ - L - 2)+ ≤ D ≤ min {(⌈Ne1-s⌉ - L)+, ⌈Ne -s⌉}. In the case when no lookahead is used (L = 0), a tighter bound can be obtained: (⌈Ne-s⌉ - 2)+ ≤ D ≤ ⌈Ne-s⌉.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
EditorsK. Makki, E. Knightly
Pages2590-2601
Number of pages12
DOIs
StatePublished - Oct 7 2005
Externally publishedYes
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

Publication series

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

Other

OtherIEEE INFOCOM 2005
CountryUnited States
CityMiami, FL
Period3/13/053/17/05

Keywords

  • Packet Networks
  • Packetizing Algorithm.
  • Switching and Scheduling
  • Time-Varying Fluid Policy

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Delay bounds for packetizing time-varying fluid policies with speedup and lookahead in single server systems'. Together they form a unique fingerprint.

  • Cite this

    Yim, R., Rosenblum, M., & Tarokh, V. (2005). Delay bounds for packetizing time-varying fluid policies with speedup and lookahead in single server systems. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 2590-2601). (Proceedings - IEEE INFOCOM; Vol. 4). https://doi.org/10.1109/INFCOM.2005.1498543