A cost-efficient scheduling algorithm for traffic grooming

DOI10.1007/978-3-642-38756-2_25MaRDI QIDQ5405936zbMATH OpenOpenAlexFDO

Authors Xianrong Liu, Wenhong Tian, Minxian Xu, Qin Xiong

Publication date 3 April 2014

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38756-2_25

zbMATH Keywords

fiber lengths minimization problemlongest link interval first (LLF)minimizing total fiber lengthtraffic grooming

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Algorithms and Computation
• Approximating the traffic grooming problem
• Approximation algorithms for grooming in optical network design
• A traffic-grooming algorithm for wavelength-routed optical networks
• Structural Information and Communication Complexity

Cited in

(3)

• Traffic-light scheduling on the grid
• Traffic Grooming: Combinatorial Results and Practical Resolutions
• Algorithms and Computation

This page was built for publication: A cost-efficient scheduling algorithm for traffic grooming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405936)