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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J.R.S. Blair, “The efficiency of AC graphs”, Disc. Appl. Math. 44, 119–138 (1993).
P. Dell’Olmo, M. G. Speranza and Zs. Tuza, “Comparability graph augmentation for some multiprocessor scheduling problems”, Disc. Applied Math. 72, 71–84 (1997).
T. Gallai, “Transitive orienterbare Graphen”, Acta Math. Sci. Hung. 18, 25–66 (1967).
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
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).
J. Turner, “Design of an integrated services packet network”, IEEE Select. Areas Commun. SAC-4, 1373–1380 (1986).
Author information
Authors and Affiliations
Rights 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