Satisfying a maximum number of pre-routed requests in all-optical rings

Nomikos, C; Pagourtzis, A; Zachos, S

dc.contributor.author	Nomikos, C	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Zachos, S	en
dc.date.accessioned	2014-03-01T01:19:30Z
dc.date.available	2014-03-01T01:19:30Z
dc.date.issued	2003	en
dc.identifier.issn	1389-1286	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15540
dc.subject	All-optical rings	en
dc.subject	Approximation algorithms	en
dc.subject	Maximum path coloring	en
dc.subject	Wavelength assignment	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Algorithms	en
dc.subject.other	Approximation theory	en
dc.subject.other	Problem solving	en
dc.subject.other	Wavelength division multiplexing	en
dc.subject.other	Approximation algorithms	en
dc.subject.other	Routers	en
dc.title	Satisfying a maximum number of pre-routed requests in all-optical rings	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S1389-1286(02)00448-6	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S1389-1286(02)00448-6	en
heal.language	English	en
heal.publicationDate	2003	en
heal.abstract	We address the problem of maximizing the number of satisfied requests in all-optical networks that use wavelength division multiplexing. We consider the case where requests are pre-routed and formulate it as the maximum path coloring problem. We study the problem for rings and present a (2/3)-approximation algorithm. Along the way we develop a fast matching technique for a special class of bipartite graphs. By using this technique we achieve an 0(n + m log L) time complexity for our approximation algorithm, where n is the number of nodes, m is the number of requests and L is the maximum load of requests on a single link. (C) 2002 Elsevier Science B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Networks	en
dc.identifier.doi	10.1016/S1389-1286(02)00448-6	en
dc.identifier.isi	ISI:000182310100005	en
dc.identifier.volume	42	en
dc.identifier.issue	1	en
dc.identifier.spage	55	en
dc.identifier.epage	63	en