Abstract
In this paper, we consider a fundamental traffic grooming problem in optical line-system: the number of total links with lengths and the max number of wavelengths (capacity) of each fiber are given, also a set of demands (jobs) and their routes are fixed so that the load of each link is known, the problem is to construct a set of fiber intervals so that the total fiber length is minimized (called Fiber Lengths Minimization problem or FLM for abbreviation). It is known that FLM problem is NP-complete in general. In this paper, we propose a 2-approximation algorithm, Longest Link interval First (LLF), which is better than existing best known bound.
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.
Similar content being viewed by others
References
Andrews, M., Zhang, L.: Bounds on fiber minimization in optical networks with fixed fiber capacity. In: Proceedings of IEEE INFOCOM 2005, Miami, FL (March 2005)
Andrews, M., Zhang, L.: Complexity of wavelength assignment in optical network optimization. IEEE/ACM Transactions on Networking 17(2), 646–657 (2009)
Brucker, P.: Scheduling Algorithms, 5th edn. Springer, Heidelberg (2007)
Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem with respect to adms and oadms. In: 14th International European Conference on Parallel and Distributed Computing (EuroPar), Las Palmas de Gran Canaria, Spain, August 26-29 (2008)
Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing Regenerator Cost in Traffic Groomings. Technical Report (July 2011)
Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks. Theoretical Computer Science 411(40-42), 3553–3562 (2010)
Kani, J., Shimazu, S., Yoshimoto, N., Hadama, H.: Energy-Efficient Optical Access Network Technologies. In: The Proceedings of OFC 2011 (2011)
Kilper, D.: Energy-Efficient Networks. In: The Proceedings of OFC 2011 (2011)
Pachnicke, S., Paschendaand, T., Krummrich, P.M.: Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks. In: The Proceedings of OFC-NFOEC 2008 (2008)
Shalom, M., Voloshin, A., Wong, P.W.H., Yung, F.C.C., Zaks, S.: Online Optimization of Busy Time on Parallel Machines. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 448–460. Springer, Heidelberg (2012)
Tian, W.: A Dynamic Modeling And Dimensioning Approach For Optical Networks. In: 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006, October 1-5 (2006)
Tian, W.H.: Modeling approaches and provisioning algorithms for dynamic bandwidth adjustment in multi-media networks. In: 2009 HONET, International Symposium on High Capacity Optical Networks and Enabling Technologies (2009)
Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830-831 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, X., Tian, W., Xu, M., **ong, Q. (2013). A Cost-Efficient Scheduling Algorithm for Traffic Grooming. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)