2010
DOI: 10.1007/978-3-642-11476-2_22
View full text
|
|
Share
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks

Abstract: Abstract. One of the basic problems in optical networks is assigning wavelengths to (namely, coloring of) a given set of lightpaths so as to minimize the number of ADM switches. In this paper we present a connection between maximum matching in complete multipartite graphs and ADM minimization in star networks. A tight 2/3 competitive ratio for finding a maximum matching implies a tight 10/9 competitive ratio for finding a coloring that minimizes the number of ADMs.