{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T15:44:21Z","timestamp":1747669461395},"reference-count":49,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4915,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0304-3975(98)00018-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:32:04Z","timestamp":1027582324000},"page":"165-189","source":"Crossref","is-referenced-by-count":43,"title":["Efficient collective communication in optical networks"],"prefix":"10.1016","volume":"233","author":[{"given":"Jean-Claude","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Perennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00018-8_BIB1","unstructured":"A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, Efficient routing and scheduling algorithms for optical networks, in: Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA\u201994), 1994, pp. 412\u2013423."},{"issue":"5","key":"10.1016\/S0304-3975(98)00018-8_BIB2","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1109\/90.251912","article-title":"Topologies for wavelength-routing for All-Optical networks","volume":"1","author":"Ajmone Marsan","year":"1993","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB3","unstructured":"Y. Aumann, Y. Rabani, Improved bounds for all optical routing, in: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA\u201995), 1995, pp. 567\u2013576."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB4","doi-asserted-by":"crossref","unstructured":"R.A. Barry, P.A. Humblet, Bounds on the number of wavelengths needed in WDM networks, in: LEOS \u201992 Summer Topical Mtg. Digest, 1992, pp. 21\u201322.","DOI":"10.1109\/LEOSST.1992.697413"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB5","unstructured":"R.A. Barry, P.A. Humblet, On the number of wavelengths and switches in all-Optical Networks, IEEE Trans. Comm. Part I (1994) pp. 523\u2013591."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB6","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/90.413220","article-title":"routing in linear lightwave networks","volume":"3","author":"Bala","year":"1995","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB7","unstructured":"B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro, Graph problems arising from wavelength-routing in All-Optical Networks, 2nd Workshop on Optics and Computer Science (WOCS), Geneve, Switzerland, April 1997."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB8","unstructured":"C. Berge, Graphs, North-Holland, Amsterdam."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01788663","article-title":"Large fault-tolerant interconnection networks","volume":"5","author":"Bermond","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB10","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","year":"1989"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB11","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/49.57804","article-title":"Acousto-optic tunable filters in narrowband WDM networks","volume":"8","author":"Cheng","year":"1990","journal-title":"IEEE J. Selected Areas Comm."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB12","doi-asserted-by":"crossref","unstructured":"N.K. Cheung et al., IEEE JSAC: Special Issue on Dense WDM Networks 8 (1990).","DOI":"10.1109\/49.57828"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB13","doi-asserted-by":"crossref","unstructured":"I. Chlamtac, A. Ganz, G. Karmi, Purely optical network for terabit communication, Proc. IEEE Infocom \u201989, 1989, pp. 887\u2013896.","DOI":"10.1109\/INFCOM.1989.101539"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB14","series-title":"Erbium-Doped Fiber Amplifiers \u2013 Principles and Applications","author":"Desurvire","year":"1994"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/1037042","article-title":"Software libraries for linear algebra computation on high performances computers","volume":"37","author":"Dongarra","year":"1995","journal-title":"SIAM Rev."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB16","unstructured":"T. Erlebach, K. Jansen, Scheduling of virtual connections in fast networks, Proc. 4th Workshop on Parallel Systems and Algorithms PASA \u201996, 1996, pp. 13\u201332."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","article-title":"Minimum-time line broadcast networks","volume":"10","author":"Farley","year":"1980","journal-title":"NETWORKS"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB18","doi-asserted-by":"crossref","unstructured":"R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, P. Mysliwietz, Optimal algorithms for dissemination of information in generalised communication modes, in: Proc. Parallel Architectures and Languages Europe (PARLE \u201992), Lecture Notes in Computer Science, vol. 605, Springer, Berlin, 1992, pp. 115\u2013130.","DOI":"10.1007\/3-540-55599-4_84"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB19","unstructured":"G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, D. Walker, Solving Problems on Concurrent Processors, vol. I, Prentice Hall, Englewood Cliffs, NJ, 1988."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB20","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraignaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB21","series-title":"Fiber-Optic Communication Networks","author":"Green","year":"1992"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB22","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1109\/49.510902","article-title":"Optical networking update","volume":"14","author":"Green","year":"1996","journal-title":"IEEE J. Selected Areas in Comm."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB23","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"NETWORKS"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB24","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(89)90022-X","article-title":"On forwarding indices of networks","volume":"23","author":"Heydemann","year":"1989","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/S0304-3975(98)00018-8_BIB25","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1109\/71.342134","article-title":"Optimal broadcast in all-port wormhole-routed hypercubes","volume":"6","author":"Ho","year":"1995","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB26","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, R. Peine, Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping), in: Ding-Zhu Du, D. Frank Hsu (Eds.), Combinatorial Network Theory, Kluwer Academic Publishers, Desdrecht, 1995, pp. 125\u2013212.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB27","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, W. Unger, H. Wagener, Optimal algorithms for broadcast and gossip in the edge-disjoint path modes, in: Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT\u201994), Lecture Notes in Computer Science, vol. 824, Springer, Berlin, 1994, pp. 219\u2013230.","DOI":"10.1007\/3-540-58218-5_20"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB28","doi-asserted-by":"crossref","unstructured":"K. Kaklamanis, G. Persiano, Efficient wavelength routing in directed fiber trees, in: Diaz and Serna (Eds.) Proc. Ann. European Symp. on Algorithms, Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 460\u2013470.","DOI":"10.1007\/3-540-61680-2_75"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB29","doi-asserted-by":"crossref","unstructured":"R. Klasing, The relationship between gossiping in vertex-disjoint paths mode and bisection width, proc. 19th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS\u201994), Lecture Notes in Computer Science, vol. 841, Springer, Berlin, 841, 1994, pp. 473\u2013483.","DOI":"10.1007\/3-540-58338-6_94"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB30","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","article-title":"Gossiping in minimal time","volume":"21","author":"Krumme","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB31","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in: Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science (FOCS\u201988), 1988, pp. 422\u2013431.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB32","doi-asserted-by":"crossref","unstructured":"K. Liu, R. Ramaswami, Analysis of optical bus networks using doped-fiber amplifiers, Proc. IEEE\/LEOS Topical Meeting on Optical Multi-Access Networks, July 1990.","DOI":"10.1109\/OMAN.1990.205429"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB33","series-title":"Combinatorial Problem and Exercises","author":"Lov\u00e1sz","year":"1993"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","article-title":"Minimale n-fach Kantenzusammenhangende Graphen","volume":"191","author":"Mader","year":"1971","journal-title":"Math. Ann."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB35","series-title":"Optical Computer Architectures","author":"McAulay","year":"1991"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB36","doi-asserted-by":"crossref","unstructured":"M. Mihail, K. Kaklamanis, S. Rao, Efficient access to optical bandwidth, in: Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science (FOCS\u201995), 1995, pp. 548\u2013557.","DOI":"10.1109\/SFCS.1995.492585"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB37","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/65.139139","article-title":"WDM-based local lightwave networks, Part I: single-hop systems","volume":"6","author":"Mukherjee","year":"1992","journal-title":"IEEE Networks"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB38","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/65.145161","article-title":"WDM-based local lightwave networks, Part II: multihop systems","volume":"6","author":"Mukherjee","year":"1992","journal-title":"IEEE Networks"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB39","unstructured":"R.K. Pankaj, Architectures for linear lightwave networks, Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1992."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB40","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","article-title":"Fault tolerant broadcasting and gossiping in communication networks","volume":"28","author":"Pelc","year":"1996","journal-title":"NETWORKS"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB41","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1109\/JSAC.1983.1145958","article-title":"Review of fundamentals of optical fiber systems","volume":"3","author":"Personick","year":"1983","journal-title":"IEEE J. Selected Areas Comm."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB42","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/90.251896","article-title":"A linear lightwave Bene\u0161 network","volume":"1","author":"Pieris","year":"1993","journal-title":"IEEE\/ACM Trans. Network"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB43","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal, Efficient routing in All-Optical Networks, in: Proc. 26th Ann. ACM Symp. on Theory of Computing (STOC\u201994)), 1994, pp. 133\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB44","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/35.186364","article-title":"Multi-wavelength lightwave networks for computer communication","volume":"31","author":"Ramaswami","year":"1993","journal-title":"IEEE Comm. Mag."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB45","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/90.469957","article-title":"Routing and wavelength assignement in all-optical networks","volume":"3","author":"Ramaswami","year":"1995","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB46","doi-asserted-by":"crossref","unstructured":"R. Ramaswami, K. Sivarajan, Design of logical topologies for wavelength-routed optical networks, IEEE JSAC\/JLT Special Issue on Optical Networks, June 1996.","DOI":"10.1109\/49.510907"},{"key":"10.1016\/S0304-3975(98)00018-8_BIB47","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0166-218X(93)E0118-I","article-title":"Expanding and forwarding","volume":"58","author":"Sol\u00e9","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB48","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/2.191977","article-title":"Distributed computing with high-speed optical networks","volume":"26","author":"Vetter","year":"1993","journal-title":"IEEE Comput."},{"key":"10.1016\/S0304-3975(98)00018-8_BIB49","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0220027","article-title":"The communication complexity of atomic commitment and gossiping","volume":"20","author":"Wolfson","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000188?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:42:25Z","timestamp":1578447745000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":49,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0304397598000188"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00018-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}