Buffer Overflows of Merging Streams

Alex Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

14 Scopus citations

Abstract

We consider a network merging streams of packets with different quality of service (QoS) levels, where packets are transported from input links to output links via multiple merge stages. Each merge node is equipped with a finite buffer, and since the bandwidth of a link outgoing from a merge node is in general smaller than the sum of incoming bandwidths, overflows may occur. QoS is modeled by assigning a positive value to each packet, and the goal of the system is to maximize the total value of packets transmitted on the output links. We assume that each buffer runs an independent local scheduling policy, and analyze FIFO policies that must deliver packets in the order they were received. We show that a simple local on-line algorithm called Greedy does essentially as well as the combination of locally optimal (off-line) schedules. We introduce a concept we call the weakness of a link, defined as the ratio between the longest time a packet spends in the system before transmitted over the link, and the longest time a packet spends in that link's buffer. We prove that for any tree, the competitive factor of Greedy is at most the maximal link weakness.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsGiuseppe di Battista, Uri Zwick
PublisherSpringer Verlag
Pages349-360
Number of pages12
ISBN (Print)3540200649, 9783540200642
DOIs
StatePublished - 1 Jan 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2832
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Buffer Overflows of Merging Streams'. Together they form a unique fingerprint.

Cite this