{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:24:23Z","timestamp":1648675463181},"reference-count":2,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2000,12]]},"abstract":"<jats:p> We address the problem of allocating optical bandwidth to a set of communication requests in a tree-shaped all-optical network that utilizes Wavelength Division Multiplexing (WDM) technology. WDM technology establishes communication between pairs of nodes of the network by establishing tranceiver\u2013receiver paths and assigning wavelengths to each path so that no two paths going through the same link use the same wavelength. Optical bandwidth is the number of distinct wavelengths. The important engineering problem to be solved is to establish communication between pairs of nodes so that the total number of wavelengths used is minimized. <\/jats:p><jats:p> In this paper, we focus on a special case of the problem considering patterns of requests that are symmetric, i.e. for any transmitter\u2013receiver pair of nodes (v<jats:sub>1<\/jats:sub>, v<jats:sub>2<\/jats:sub>) there also exists its symmetric (v<jats:sub>2<\/jats:sub>, v<jats:sub>1<\/jats:sub>). Our motivation lies in the fact that many services that are expected to be supported by high performance optical networks in the future, require bidirectional reservation of bandwidth. We prove that the problem of optimizing the number of wavelengths used is NP-hard even when the underlying network is a binary tree. We also present two interesting lower bounds. <\/jats:p>","DOI":"10.1142\/s0129626400000299","type":"journal-article","created":{"date-parts":[[2003,4,22]],"date-time":"2003-04-22T07:43:44Z","timestamp":1050997424000},"page":"305-313","source":"Crossref","is-referenced-by-count":2,"title":["SYMMETRIC COMMUNICATION IN ALL-OPTICAL TREE NETWORKS"],"prefix":"10.1142","volume":"10","author":[{"given":"IOANNIS","family":"CARAGIANNIS","sequence":"first","affiliation":[{"name":"Computer Technology Institute and Dept. of Computer Engineering and Informatics, Univ. of Patros, 26500 Rio, Greece"}]},{"given":"CHRISTOS","family":"KAKLAMANIS","sequence":"additional","affiliation":[{"name":"Computer Technology Institute and Dept. of Computer Engineering and Informatics, Univ. of Patros, 26500 Rio, Greece"}]},{"given":"PINO","family":"PERSIANO","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica ed Applicazioni, Universit\u00e0 di Salerno, 84081 Baronissi, Italy"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00029-8"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1137\/0601025"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626400000299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T14:45:40Z","timestamp":1565102740000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626400000299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":2,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,12]]}},"alternative-id":["10.1142\/S0129626400000299"],"URL":"https:\/\/doi.org\/10.1142\/s0129626400000299","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}