Skip to main content

An Approximation Result for a Bandwidth Allocation Problem

  • Conference paper
Operations Research Proceedings 1997

Part of the book series: Operations Research Proceedings ((ORP,volume 1997))

Abstract

Recent advances in communication technologies have made it possible the integration of heterogeneous traffics of different bandwidths in a single broadband network, achieving the flexibility and the economic advantage of sharing a network. In such a situation, if no traffic access control is exerted, the network resources, such as network bandwidth, will be occupied unfairly resulting in a low throughput usage of the network. Thus, it is needed a traffic control strategy that allocates the network bandwidth fairly to achieve maximum throughput [6]. We consider a radio network where the transmitters request consecutive frequency slots (bandwidth) to transmit their messages of different traffic classes, such as voice, data, video. The problem is to allocating bandwidths to transmitters in order to minimize the overall network bandwidth requirement, and it is called Bandwidth Allocation (BA) problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 153.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.R.S. Blair, “The efficiency of AC graphs”, Disc. Appl. Math. 44, 119–138 (1993).

    Article  Google Scholar 

  2. P. Dell’Olmo, M. G. Speranza and Zs. Tuza, “Comparability graph augmentation for some multiprocessor scheduling problems”, Disc. Applied Math. 72, 71–84 (1997).

    Article  Google Scholar 

  3. T. Gallai, “Transitive orienterbare Graphen”, Acta Math. Sci. Hung. 18, 25–66 (1967).

    Article  Google Scholar 

  4. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.

    Google Scholar 

  5. C. Lekkerkerker and J. Boland, “Representation of a finite graph by a set of intervals on the real line”, Fund. Math. 51, 45–64 (1962).

    Google Scholar 

  6. J. Turner, “Design of an integrated services packet network”, IEEE Select. Areas Commun. SAC-4, 1373–1380 (1986).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Confessore, G., Dell’Olmo, P., Giordani, S. (1998). An Approximation Result for a Bandwidth Allocation Problem. In: Operations Research Proceedings 1997. Operations Research Proceedings, vol 1997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58891-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58891-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64240-4

  • Online ISBN: 978-3-642-58891-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics