{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:22:43Z","timestamp":1759332163715,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614401"},{"type":"electronic","value":"9783540685807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61440-0_160","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:39:07Z","timestamp":1330292347000},"page":"574-585","source":"Crossref","is-referenced-by-count":28,"title":["Efficient collective communication in optical networks"],"prefix":"10.1007","author":[{"given":"J. -C.","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Perennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"48_CR1","unstructured":"A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, \u201cEfficient Routing and Scheduling Algorithms for Optical Networks\u201d, in: SODA'94, (1994), 412\u2013423."},{"key":"48_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"N. Alon and V. D. Milman, \u201c\u03bb1, Isoperimetric Inequalities for Graphs, and Superconcentrators\u201d, J. Combinatorial Theory, Series B, vol. 38, (1985), 73\u201388.","journal-title":"J. Combinatorial Theory, Series B"},{"key":"48_CR3","unstructured":"Y. Aumann and Y. Rabani, \u201cImproved Bounds for All Optical Routing\u201d, in: SODA'95, (1995), 567\u2013576."},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"R. A. Barry and P. A. Humblet, \u201cBounds on the Number of Wavelengths Needed in WDM Networks\u201d, in: LEOS '92 Summer Topical Mtg. Digest, (1992), 21\u201322.","DOI":"10.1109\/LEOSST.1992.697413"},{"key":"48_CR5","unstructured":"R. A. Barry and P. A. Humblet, \u201cOn the Number of Wavelengths and Switches in All-Optical Networks\u201d, to appear in: IEEE Trans, on Communications."},{"key":"48_CR6","unstructured":"C. Berge, Graphs, North-Holland."},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF01788663","volume":"5","author":"J.-C. Bermond","year":"1989","unstructured":"J.-C. Bermond, N. Homobono, and C. Peyrat, \u201cLarge Fault-Tolerant Interconnection Networks\u201d, Graphs and Combinatorics, vol. 5, (1989), 107\u2013123.","journal-title":"Graphs and Combinatorics"},{"key":"48_CR8","unstructured":"J.-C. Bermond, L. Gargano, S. Perennes, A.A. Rescigno, and U. Vaccaro, \u201cEfficient Collective Communication in Optical Networks\u201d, manuscript available from the authors."},{"key":"48_CR9","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D. P. Bertsekas","year":"1989","unstructured":"D. P. Bertsekas, and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989."},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1109\/49.57804","volume":"8","author":"K. W. Cheng","year":"1990","unstructured":"K. W. Cheng, \u201cAcousto-optic Tunable Filters in Narrowband WDM Networks\u201d, IEEE J. Selected Areas in Comm., vol. 8, (1990), 1015\u20131025.","journal-title":"IEEE J. Selected Areas in Comm."},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"N.K. Cheung et al., IEEE JSAC: Special Issue on Dense WDM Networks, vol. 8 (1990).","DOI":"10.1109\/49.57828"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/1037042","volume":"37","author":"J. J. Dongarra","year":"1995","unstructured":"J. J. Dongarra and D. W. Walker, \u201cSoftware Libraries for Linear Algebra Computation on High Performances Computers\u201d, SIAM Review, vol. 37, (1995), 151\u2013180.","journal-title":"SIAM Review"},{"key":"48_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","volume":"10","author":"A.M. Farley","year":"1980","unstructured":"A.M. Farley, \u201cMinimum-Time Line Broadcast Networks\u201d, NETWORKS, vol. 10 (1980), 59\u201370.","journal-title":"NETWORKS"},{"key":"48_CR14","unstructured":"R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, P. Mysliwietz, \u201cOptimal Algorithms for Dissemination of Information in Generalised Communication Modes\u201d, in: PARLE '92, Springer LNCS 605, (1992) 115\u2013130."},{"key":"48_CR15","volume-title":"Solving Problems on Concurrent Processors, Volume I","author":"G. Fox","year":"1988","unstructured":"G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, Volume I, Prentice Hall, Englewood Cliffs, NJ, 1988."},{"key":"48_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraignaud","year":"1994","unstructured":"P. Fraignaud, E. Lazard, \u201cMethods and Problems of Communication in Usual Networks\u201d, Discrete Applied Math., 53 (1994), 79\u2013134.","journal-title":"Discrete Applied Math."},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"L. Gargano and A. A. Rescigno, \u201cCommunication Complexity of Fault-Tolerant Information Diffusion\u201d, Proceeding of SPDP '93, Dallas, TX, 564\u2013571, 1993","DOI":"10.1109\/SPDP.1993.395484"},{"key":"48_CR18","unstructured":"P. E. Green, Fiber-Optic Communication Networks, Prentice-Hall, 1992."},{"key":"48_CR19","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895480193245923","volume":"8","author":"G. Kortsarz","year":"1995","unstructured":"G. Kortsarz and D. Peleg, \u201cApproximation Algorithms for Minimum Time Broadcast\u201d, SIAM J. Discrete Math., vol. 8, (1995), 401\u2013427.","journal-title":"SIAM J. Discrete Math."},{"key":"48_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. M. Hedetniemi","year":"1988","unstructured":"S. M. Hedetniemi, S. T. Hedetniemi, and A. Liestman, \u201cA Survey of Gossiping and Broadcasting in Communication Networks\u201d, NETWORKS, 18 (1988), 129\u2013134.","journal-title":"NETWORKS"},{"key":"48_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0166-218X(89)90022-X","volume":"23","author":"M.C. Heydemann","year":"1989","unstructured":"M.C. Heydemann, J. C. Meyer, and D. Sotteau, \u201cOn Forwarding Indices of Networks\u201d, Discrete Applied Mathematics, vol. 23, (1989), 103\u2013123.","journal-title":"Discrete Applied Mathematics"},{"key":"48_CR22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/net.3230240204","volume":"24","author":"M.-C. Heydemann","year":"1994","unstructured":"M.-C. Heydemann, J.-C. Meyer, J. Opatrny, and D. Sotteau, \u201cForwarding indices of consistent routings and their complexity\u201d, NETWORKS, vol. 24, (1994), 75\u201382.","journal-title":"NETWORKS"},{"issue":"No.2","key":"48_CR23","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1109\/71.342134","volume":"6","author":"C.-T. Ho","year":"1995","unstructured":"C.-T. Ho and M.-Y. Kao, \u201cOptimal Broadcast in All-Port Wormhole-Routed Hypercubes\u201d, IEEE Trans. Par. and Distr. Sys., vol. 6, No. 2, (1995), 200\u2013204.","journal-title":"IEEE Trans. Par. and Distr. Sys."},{"key":"48_CR24","first-page":"219","volume":"824","author":"J. Hromkovic","year":"1994","unstructured":"J. Hromkovic, R. Klasing, W. Unger, H. Wagener, \u201cOptimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes\u201d, in: Proc. of SWAT '94, Springer LNCS 824, (1994), pp. 219\u2013230.","journal-title":"Springer LNCS"},{"key":"48_CR25","doi-asserted-by":"crossref","unstructured":"J. Hromkovic, R. Klasing, B. Monien, and R. Peine, \u201cDissemination of Information in Interconnection Networks (Broadcasting and Gossiping)\u201d, to appear in: F. Hsu, D.-Z. Du (Eds.) Combinatorial Network Theory, Science Press & AMS.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"F. T. Leighton and S. Rao, \u201cAn Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms\u201d, in: Proceedings of FOCS '88, (1988), 422\u2013431.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"48_CR27","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, Combinatorial Problem and Exercises, 2nd edition, Elsevier, 1993.","DOI":"10.1016\/B978-0-444-81504-0.50006-0"},{"key":"48_CR28","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"W. Mader","year":"1971","unstructured":"W. Mader, \u201cMinimale n-fach Kantenzusammenhangende Graphen\u201d, Math. Ann., 191 (1971), 21\u201328.","journal-title":"Math. Ann."},{"key":"48_CR29","unstructured":"A. D. McAulay, Optical Computer Architectures, John Wiley, 1991."},{"key":"48_CR30","unstructured":"M. Mihail, K. Kaklamanis, S. Rao, \u201cEfficient Access to Optical Bandwidth\u201d, in: Proceedings of FOCS '95, (1995), 548\u2013557."},{"key":"48_CR31","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(89)90029-4","volume":"47","author":"B. Mohar","year":"1989","unstructured":"B. Mohar, \u201cIsoperimetric Number of Graphs\u201d, J. Combinatorial Theory, Series B, vol. 47, (1989), 274\u2013291.","journal-title":"J. Combinatorial Theory, Series B"},{"key":"48_CR32","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/65.139139","volume":"6","author":"B. Mukherjee","year":"1992","unstructured":"B. Mukherjee, \u201cWDM-Based Local Lightwave Networks, Part I: Single-Hop Systems\u201d, IEEE Networks, vol. 6 (1992), 12\u201327.","journal-title":"IEEE Networks"},{"key":"48_CR33","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/65.145161","volume":"6","author":"B. Mukherjee","year":"1992","unstructured":"B. Mukherjee, \u201cWDM-Based Local Lightwave Networks, Part II: Multihop Systems\u201d, IEEE Networks, vol. 6 (1992), 20\u201332.","journal-title":"IEEE Networks"},{"key":"48_CR34","volume-title":"PhD Thesis","author":"R.K. Pankaj","year":"1992","unstructured":"R.K. Pankaj, Architectures for Linear Lightwave Networks, PhD Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1992."},{"key":"48_CR35","unstructured":"A. Pelc, \u201cFault Tolerant Broadcasting and Gossiping in Communication Networks\u201d, Technical Report, University of Quebec."},{"key":"48_CR36","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/JSAC.1983.1145958","volume":"3","author":"S. Personick","year":"1983","unstructured":"S. Personick, \u201cReview of Fundamentals of Optical Fiber Systems\u201d, IEEE J. Selected Areas in Comm., vol. 3, (1983), 373\u2013380.","journal-title":"IEEE J. Selected Areas in Comm."},{"key":"48_CR37","unstructured":"G. R. Pieris and G. H. Sasaki, \u201cA Linear Lightwave Benes Network\u201d, to appear in: IEEE\/ACM Trans, on Networking."},{"key":"48_CR38","doi-asserted-by":"crossref","unstructured":"P. Raghavan and E. Upfal, \u201cEfficient Routing in All-Optical Networks\u201d, in: Proceedings of STOC '94, (1994), 133\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"48_CR39","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/35.186364","volume":"31","author":"R. Ramaswami","year":"1993","unstructured":"R. Ramaswami, \u201cMulti-Wavelength Lightwave Networks for Computer Communication\u201d, IEEE Communication Magazine, vol. 31, (1993), 78\u201388.","journal-title":"IEEE Communication Magazine"},{"key":"48_CR40","doi-asserted-by":"crossref","unstructured":"R. Ravi, \u201cRapid Rumour Ramification: Approximating the Minimum Broadcasting Time\u201d, Proc. FOCS '94, (1994), 202\u2013213.","DOI":"10.1109\/SFCS.1994.365693"},{"key":"48_CR41","unstructured":"R. Saad, \u201cComplexity of the Forwarding Index Problem\u201d, SIAM J. Discrete Math., (1995), xxx."},{"key":"48_CR42","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0166-218X(93)E0118-I","volume":"58","author":"P. Sol\u00e9","year":"1995","unstructured":"P. Sol\u00e9, \u201cExpanding and Forwarding\u201d, Discr. Appl. Math., vol. 58, (1995), 67\u201378.","journal-title":"Discr. Appl. Math."},{"key":"48_CR43","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/2.191977","volume":"26","author":"R.J. Vitter","year":"1993","unstructured":"R.J. Vitter and D.H.C. Du, \u201cDistributed Computing with High-Speed Optical Networks\u201d, IEEE Computer, vol. 26, (1993), 8\u201318.","journal-title":"IEEE Computer"},{"key":"48_CR44","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0220027","volume":"20","author":"O. Wolfson","year":"1991","unstructured":"O. Wolfson and A. Segall, \u201cThe Communication Complexity of Atomic Commitment and Gossiping\u201d, SIAM J. on Computing, 20 (1991), 423\u2013450.","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61440-0_160.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:19:25Z","timestamp":1742599165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61440-0_160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614401","9783540685807"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-61440-0_160","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}