Bus and Buffer Usage in In-Home Digital Networks: Applying the Dantzig–Wolfe Decomposition

Authors:
Edgar Den Boef;Wim F. J. Verhaegh;Jan Korst
Affiliations:
Philips Research Laboratories, Prof Holstlaan 4, 5656 AA Eindhoven, The Netherlands/ Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands/ E-mail: denboef@n ...;Philips Research Laboratories, Prof Holstlaan 4, 5656 AA Eindhoven, The Netherlands;Philips Research Laboratories, Prof Holstlaan 4, 5656 AA Eindhoven, The Netherlands
Venue:
Journal of Scheduling
Year:
2004

Citing 6
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Supporting stored video: reducing rate variability and end-to-end resource requirements through optimal smoothing

IEEE/ACM Transactions on Networking (TON)
Smoothing variable-bit-rate video in an Internetwork

IEEE/ACM Transactions on Networking (TON)
Fast techniques for the optimal smoothing of stored video

Multimedia Systems - Special issue on video content based retrieval
System management and automatic reconfiguration algorithms for in-home digital networks

MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 2)
Performance evaluation of smoothing algorithms for transmittingprerecorded variable-bit-rate video

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an in-home digital network several data streams (audio, video) may run simultaneously over a shared communication device, e.g. a bus. The burstiness of a data stream can be reduced by buffering data at the sending and receiving side, thereby allowing a lower bus share allocation for the stream. In this paper we present an algorithm that determines how much of the bus capacity and buffer space should be allocated to each stream, in order to have a feasible transmission schedule for each stream. Furthermore, the algorithm determines a transmission schedule for each stream, indicating how much data is transmitted over time. We model the problem as a linear program and apply a Dantzig–Wolfe decomposition such that the multiple-stream problem can be solved by repeatedly solving single-stream problems. For these single-stream problems we briefly describe efficient algorithms to solve them.