Abstract
We introduce two scheduling problems, the flexible bandwidth allocation problem (FBAP) and the flexible storage allocation problem (FSAP). In both problems, we have an available resource, and a set of requests, each consists of a minimum and a maximum resource requirement, for the duration of its execution, as well as a profit accrued per allocated unit of the resource. In FBAP the goal is to assign the available resource to a feasible subset of requests, such that the total profit is maximized, while in FSAP we also require that each satisfied request is given a contiguous portion of the resource. Our problems generalize the classic bandwidth allocation problem (BAP) and storage allocation problem (SAP) and are therefore NP-Hard.
Our main results are a 3-approximation algorithm for FBAP and a (3 + ε)-approximation algorithm for FSAP, for any fixed ε > 0 . These algorithms make non-standard use of the local ratio technique. Furthermore, we present a (2 + ε)-approximation algorithm for \(\textsc{SAP}\), for any fixed ε > 0 , thus improving the best known ratio of \(\frac{2e-1}{e-1} + \epsilon\). Our study is motivated also by critical resource allocation problems arising in all-optical networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ali Norouzi, A.Z., Ustundag, B.B.: An integrated survey in optical networks: Concepts, components and problems. IJCSNS International Journal of Computer Science and Network Security 11(1), 10–26 (2011)
Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics 12(3), 289–297 (1999)
Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J.S., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 735–744 (2000)
Bar-Yehuda, R.: One for the price of two: A unified approach for approximating covering problems. Algorithmica 27(2), 131–144 (2000)
Bar-Yehuda, R., Beder, M., Cohen, Y., Rawitz, D.: Resource allocation in bounded degree trees. Algorithmica 54(1), 89–106 (2009)
Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree and packing integer programs. ACM Transaction on Algorithms 3(3) (2007)
Chen, B., Hassin, R., Tzur, M.: Allocation of bandwidth and storage. IIE Transactions 34(5), 501–507 (2002)
Chrobak, M., Woeginger, G.J., Makino, K., Xu, H.: Caching is hard - even in the fault model. Algorithmica 63(4), 781–794 (2012)
Gerstel, O.: Flexible use of spectrum and photonic grooming. In: Photonics in Switching, OSA (Optical Society of America)Technical Digest (2010)
Gerstel, O.: Realistic approaches to scaling the ip network using optics. In: Optical Fiber Communication Conference and Exposition (OFC/NFOEC), 2011 and the National Fiber Optic Engineers Conference, pp. 1–3 (2011)
Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)
Jinno, M., Takara, H., Kozicki, B., Tsukishima, Y., Sone, Y., Matsuoka, S.: Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies. IEEE Communications Magazine 47(11), 66–73 (2009)
Katz, D., Schieber, B., Shachnai, H.: The flexible storage allocation problem (submitted, 2014)
Leonardi, S., Marchetti-Spaccamela, A., Vitaletti, A.: Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 409–420. Springer, Heidelberg (2000)
Ramaswami, R., Sivarajan, K., Sasaki, G.: Optical Networks: A Practical Perspective, 3rd edn. Morgan Kaufmann Publishers Inc., San Francisco (2009)
Shachnai, H., Voloshin, A., Zaks, S.: Flexible bandwidth assignment with application to optical networks, http://www.cs.technion.ac.il/~hadas/PUB/flex.pdf
Shachnai, H., Voloshin, A., Zaks, S.: Optimizing bandwidth allocation in flex-grid optical networks with application to scheduling. In: 28th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Phoenix, USA (May 2014)
Shalom, M., Wong, P.W.H., Zaks, S.: Profit maximization in flex-grid all-optical networks. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 249–260. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg 2014
About this paper
Cite this paper
Shachnai, H., Voloshin, A., Zaks, S. (2014). Flexible Bandwidth Assignment with Application to Optical Networks. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44465-8_52
Download citation
DOI: https://doi.org/10.1007/978-3-662-44465-8_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44464-1
Online ISBN: 978-3-662-44465-8
eBook Packages: Computer ScienceComputer Science (R0)