On-line maximum matching in complete multi-partite graphs with an application to optical networks

Finding a maximum matching in a graph is a classical problem. The on-line versions of the problem in which the vertices and/or edges of the graph are given one at a time and an algorithm has to calculate a matching incrementally have been studied for more than two decades. Many variants of the problem are considered in the literature. The pioneering work (Karp, 1990) considers a bipartite graph where the vertices of one part are revealed one at a time together with their incident edges. In this work we consider maximal d -colorable graphs which are exactly the complete d -partite graphs. The vertices arrive one at a time together with their incident edges, or equivalently with their corresponding colors in some given d -coloring of the graph. We present an optimal 2 / 3 -competitive deterministic algorithm for this on-line problem.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.

[1]  David E. R. Sitton,et al.  MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS , 1996 .

[2]  Bala Kalyanasundaram,et al.  On-line weighted matching , 1991, SODA '91.

[3]  Peng-Jun Wan,et al.  Traffic partition in WDM/SONET rings to minimize SONET ADMs , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[4]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[5]  Yossi Azar,et al.  Management of Multi-Queue Switches in QoS Networks , 2003, STOC '03.

[6]  Claire Mathieu,et al.  On-line bipartite matching made simple , 2008, SIGA.

[7]  Prudence W. H. Wong,et al.  Optimal on-line colorings for minimizing the number of ADMs in optical networks , 2010, J. Discrete Algorithms.

[8]  Shmuel Zaks,et al.  A 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings , 2004, First International Conference on Broadband Networks.

[9]  Leah Epstein,et al.  Minimization of SONET ADMs in ring networks revisited , 2009, Computing.

[10]  Yossi Azar,et al.  The competitiveness of on-line assignments , 1992, SODA '92.

[11]  Shmuel Zaks,et al.  A 10/7 + $ \epsilon$ Approximation for Minimizing the Number of ADMs in SONET Rings , 2007, IEEE/ACM Transactions on Networking.

[12]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[13]  Prudence W. H. Wong,et al.  On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology , 2009, SIROCCO.

[14]  Jun Gu,et al.  Minimizing ADMs on WDM directed fiber trees , 2003, Journal of Computer Science and Technology.

[15]  Bala Kalyanasundaram,et al.  Online Weighted Matching , 1993, J. Algorithms.

[16]  Aranyak Mehta,et al.  Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.

[17]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[18]  Peng-Jun Wan,et al.  Minimizing electronic line terminals for automatic ring protection in general WDM optical networks , 2002, IEEE J. Sel. Areas Commun..

[19]  Yossi Azar,et al.  Optimal Node Routing , 2006, STACS.

[20]  Shmuel Zaks,et al.  Lightpath arrangement in survivable rings to minimize the switching cost , 2002, IEEE J. Sel. Areas Commun..