Optimal Bus and Buffer Allocation for a Set of Leaky-Bucket-Controlled Streams

  • E. den Boef
  • J. Korst
  • W. F. J. Verhaegh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3124)


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.


leaky-bucket-traffic characterization resource management in-home digital network smoothing variable-bit-rate streams 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    den Boef, E., Verhaegh, W.F., Korst, J.: Smoothing streams in an in-home digital network: Optimization of bus and buffer usage. Telecommunication Systems 23, 273–295 (2003)CrossRefGoogle Scholar
  2. 2.
    Cruz, R.L.: A calculus for network delay, part I: Network elements in isolation. IEEE Transactions on Information Theory 37, 114–131 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Knightly, E.W., Zhang, H.: D-BIND: An accurate traffic model for providing QoS guarantees to VBR traffic. IEEE/ACM Transactions on Networking 5, 219–231 (1997)CrossRefGoogle Scholar
  4. 4.
    Turner, J.S.: New directions in communications (or which way to the information age?). IEEE Communications Magazine 24, 8–15 (1986)CrossRefGoogle Scholar
  5. 5.
    Cruz, R.L.: A calculus for network delay, part II: Network analysis. IEEE Transactions on Information Theory 37, 132–141 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chang, C.S.: Performance Guarantees in Communication Networks. Springer, Heidelberg (2000)zbMATHGoogle Scholar
  7. 7.
    Dantzig, G., Wolfe, P.: The decomposition algorithm for linear programming. Econometrica 29, 767–778 (1961)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    den Boef, E., Verhaegh, W.F., Korst, J.: Bus and buffer usage in in-home digital networks: Applying the Dantzig-Wolfe decomposition. Journal of Scheduling 7, 119–131 (2004)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • E. den Boef
    • 1
    • 2
  • J. Korst
    • 1
  • W. F. J. Verhaegh
    • 1
  1. 1.Philips Research LaboratoriesEindhovenThe Netherlands
  2. 2.Technische Universiteit EindhovenEindhovenThe Netherlands

Personalised recommendations