Optimal bus and buffer allocation for a set of leaky-bucket-controlled streams

E. Boef, den, J.H.M. Korst, W.F.J. Verhaegh

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

1 Citation (Scopus)

Abstract

In an in-home digital network (IHDN) it may be expected that several variable-bit-rate streams (audio, video) run simultaneously over a shared communication device, e.g. a bus. The data supply and demand of most of these streams will not be exactly known in advance, but only a coarse traffic characterization will be available. In this paper we assume that data streams are characterized by a concave function f, which gives a bound on the amount of data supplied for each length of a time window. We show how allocations of the bandwidth of a single bus and of buffers connected to the bus can be obtained for all streams, such that for each stream a feasible transmission strategy exists. For this, we show that a feasible solution for a data supply that exactly follows the function f is sufficient. This problem can then be solved by repeatedly solving single-stream problems for which we present efficient methods.
Original languageEnglish
Title of host publicationTelecommunications and Networking - ICT 2004 (Proceedings 11th International Conference on Telecommunications, Fortaleza, Brazil, August 1-6, 2004)
EditorsJ.N. De Souza, P. Dini, P. Lorenz
Place of PublicationBerlin
PublisherSpringer
Pages1337-1346
ISBN (Print)3-540-22571-4
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
Volume3124
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Optimal bus and buffer allocation for a set of leaky-bucket-controlled streams'. Together they form a unique fingerprint.

Cite this