Maximizing the number of connections in multifiber WDM chain, ring and star networks

Potika, K

dc.contributor.author	Potika, K	en
dc.date.accessioned	2014-03-01T02:43:24Z
dc.date.available	2014-03-01T02:43:24Z
dc.date.issued	2005	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31389
dc.subject	Polynomial Time Algorithm	en
dc.subject	Satisfiability	en
dc.subject	Wavelength Assignment	en
dc.subject	Wdm Network	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Algorithms	en
dc.subject.other	Optical fibers	en
dc.subject.other	Polynomials	en
dc.subject.other	Telecommunication links	en
dc.subject.other	Topology	en
dc.subject.other	Wavelength division multiplexing	en
dc.subject.other	Multifiber WDM networks	en
dc.subject.other	Polynomial time algorithms	en
dc.subject.other	Ring networks	en
dc.subject.other	Star networks	en
dc.subject.other	Telecommunication networks	en
dc.title	Maximizing the number of connections in multifiber WDM chain, ring and star networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11422778_139	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11422778_139	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	We study a wavelength assignment maximization problem in multifiber WDM networks. Given a network G, a set of requests, the number of fibers per link and the number of wavelengths, we want to maximize the number of requests that can be satisfied simultaneously. We propose polynomial time algorithms, that are either optimal or have a guaranteed worst case performance in basic topologies, such as chain, ring and star networks. © IFIP International Federation for Information Processing 2005.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/11422778_139	en
dc.identifier.isi	ISI:000230113900139	en
dc.identifier.volume	3462	en
dc.identifier.spage	1465	en
dc.identifier.epage	1470	en