Article ID Journal Published Year Pages File Type
6871972 Discrete Applied Mathematics 2016 14 Pages PDF
Abstract
This problem is closely related to that of minimizing the cost of line terminals in star topology optical network. We consider lightpaths arriving in an on-line fashion on a given star network. Our result implies a tight 10/9-competitive algorithm for finding a wavelength assignment minimizing the cost of line terminals in such a network.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On-line maximum matching in complete multi-partite graphs with an application to optical networks
Authors
, , ,