On a non-cooperative model for wavelength assignment in multifiber optical networks

Bampas, E; Pagourtzis, A; Pierrakos, G; Potika, K

dc.contributor.author	Bampas, E	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Pierrakos, G	en
dc.contributor.author	Potika, K	en
dc.date.accessioned	2014-03-01T02:45:40Z
dc.date.available	2014-03-01T02:45:40Z
dc.date.issued	2008	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32327
dc.subject	Multifiber optical networks	en
dc.subject	Non-cooperative games	en
dc.subject	Path multicoloring	en
dc.subject	Price of anarchy	en
dc.subject	Selfish wavelength assignment	en
dc.subject.other	Control theory	en
dc.subject.other	Costs	en
dc.subject.other	Game theory	en
dc.subject.other	Graph theory	en
dc.subject.other	Optical communication	en
dc.subject.other	Optical materials	en
dc.subject.other	Trees (mathematics)	en
dc.subject.other	Wavelength	en
dc.subject.other	Multifiber optical networks	en
dc.subject.other	Non-cooperative games	en
dc.subject.other	Path multicoloring	en
dc.subject.other	Price of anarchy	en
dc.subject.other	Selfish wavelength assignment	en
dc.subject.other	Fiber optic networks	en
dc.title	On a non-cooperative model for wavelength assignment in multifiber optical networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-92182-0_17	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-92182-0_17	en
heal.publicationDate	2008	en
heal.abstract	We study path multicoloring games that describe situations in which selfish entities possess communication requests in a multifiber all-optical network. Each player is charged according to the maximum fiber multiplicity that her color (wavelength) choice incurs and the social cost is the maximum player cost. We investigate the price of anarchy of such games and provide two different upper bounds for general graphs-namely the number of wavelengths and the minimum length of a path of maximum disutility, over all worst-case Nash Equilibria-as well as matching lower bounds which hold even for trees; as a corollary we obtain that the price of anarchy in stars is exactly 2. We also prove constant bounds for the price of anarchy in chains and rings in which the number of wavelengths is relatively small compared to the load of the network; in the opposite case we show that the price of anarchy is unbounded. © 2008 Springer Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-540-92182-0_17	en
dc.identifier.volume	5369 LNCS	en
dc.identifier.spage	159	en
dc.identifier.epage	170	en