Simple, efficient routing schemes for all-optical networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Simple, efficient routing schemes for all-optical networks

Full text

Pdf (1.18 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures table of contents

Newport, Rhode Island, United States

Pages: 170 - 179

Year of Publication: 1997

ISBN:0-89791-890-8

Authors

Michele Flammini	Department of Mathematics, University of L'Aquila, Via Vetoio loc. Coppito, I-67100 L'Aquila, Italy
Christian Scheideler	Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, 76100 Rehovot, Israel

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 10, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/258492.258509 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alok Aggarwal , Amotz Bar-Noy , Don Coppersmith , Rajiv Ramaswami , Baruch Schieber , Madhu Sudan, Efficient routing and scheduling algorithms for optical networks, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.412-423, January 23-25, 1994, Arlington, Virginia, United States
	2	K. Bala, T.E. Stern. Algorithms for routing in a linear lightwave network. In Proc. of INFOCOM, pp. 1-9, 1991.
	3	R.A. Barry, P.A. Humblet. Bounds on the number of wavelengths needed in WDM networks. In LEOS'9# Summer Topical Mtg. Digest, pp. 114-127, 1992.
	4	R.A. Barry, P.A. Humblet. On the number of wavelengths and switches in all-optical networks. In IEEE Trans. on Communications 42, pp. 583-591, 1994.
	5	T.A. Birks, D.O. Culverhouse, S.G. Farwell, P.St.J. Russel. 2 X 2 single-mode fiber routing switch. Optics Letters 21, pp. 722-724, 1996.
	6	C. Brackett. Dense wavelength division multiplexing networks: Principles and applications. IEEE J. Selected Areas in Comm. 8, pp. 373-380, August 1990.
	7	V.W.S. Chan. All-optical networks. Scientific American, pp. 56-59, Sept. 1995.
	8	N.K. Chung, K. Nosu, G. Winzer. IEEE JSAC: Special Issue on Dense WDM Networks 8. 1990.
	9	Robert Cypher , Friedhelm Meyer auf der Heide , Christian Scheideler , Berthold Vöcking, Universal algorithms for store-and-forward and wormhole routing, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.356-365, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.237982]
	10	Ronald J. Vetter , David H. C. Du, Distributed computing with high-speed optical networks, Computer, v.26 n.2, p.8-18, February 1993 [doi>10.1109/2.191977]
	11	R.D. Gitlin, Z. Haas. Field coding: A high-speed 'almostall' optical interconnect. $Sth Ann. Conf. Information Sci. Syst. CISS (Baltimore, MD), March 20-22, 1991.
	12	P.E. Green. Fiber-Optic Communication Networks. Prentice Hall, 1992.
	13	Z. Haas. The 'staggering switch': an 'almost-all' optical packet switch. In Tech. Dig. Optical Fiber Commun. Conf. 0FC'92 (San Jos#, CA), paper WH6.
	14	Torben Hagerup , C. Rüb, A guided tour of Chernoff bounds, Information Processing Letters, v.33 n.6, p.305-308, February 1990 [doi>10.1016/0020-0190(90)90214-I]
	15	G.R. Hill, P.J. Chidgey et al. A transport network layer based on optical network elements. J. of Lightwave Techn. 11, pp. 667-677, 1993.
	16	H.S. Hinton. Architectural considerations for photonic switching networks. IEEE J. Selected Areas in Comm. 6, pp. 1209-1226, August 1988.
	17	M. Hofri, Probabilistic analysis of algorithms: on computing methodologies for computer algorithms performance evaluation, Springer-Verlag New York, Inc., New York, NY, 1987
	18	K.C. Lee, V.O.K. Li. A wavelength-convertible optical network. J. of Lightwave Techn. 11, pp. 962~970, 1993.
	19	A. Lubotzky, R. Phillips, R. Sarnak. Ramanujan graphs. Combinatorica 8(3), pp. 261-277, 1988.
	20	F. Matera, S. Settembre. All optical implementations of high capacity TDMA networks. Fiber and Integrated Optics 12, pp. 173-186, 1993.
	21	Friedhelm Meyer auf der Heide , Christian Scheideler, Communication in Parallel Systems, Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics, p.16-33, November 23-30, 1996
	22	Rajesh Kumar Pankaj, Architectures for linear lightwave networks, Massachusetts Institute of Technology, Cambridge, MA, 1992
	23	S. Personick. Review of fundamentals of optical fiber systems. IEEE J. Selected Areas in Comm. 3, pp. 373-380, April 1983.
	24	Gerard R. Pieris , Galen H. Sasaki, A linear lightwave Benes network, IEEE/ACM Transactions on Networking (TON), v.1 n.4, p.441-445, Aug. 1993 [doi>10.1109/90.251896]
	25	Prabhakar Raghavan , Eli Upfal, Efficient routing in all-optical networks, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.134-143, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195119]
	26	R. Ramaswami. Multi-wavelength lightwave networks for computer communication. IEEE Communications Magazine 31, pp. 78-88, 1993.
	27	Rajiv Ramaswami , Kumar N. Sivarajan, Routing and wavelength assignment in all-optical networks, IEEE/ACM Transactions on Networking (TON), v.3 n.5, p.489-500, Oct. 1995 [doi>10.1109/90.469957]
	28	Christian Scheideler , Berthold Vöcking, Universal continuous routing strategies, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.142-151, June 24-26, 1996, Padua, Italy [doi>10.1145/237502.237519]
	29	Jeanette P. Schmidt , Alan Siegel , Aravind Srinivasan, Chernoff-Hoeffding Bounds for Applications with Limited Independence, SIAM Journal on Discrete Mathematics, v.8 n.2, p.223-250, May 1995 [doi>10.1137/S089548019223872X]

CITED BY

Micah Adler , Ramesh K. Sitaraman , Arnold L. Rosenberg , Walter Unger, Scheduling time-constrained communication in linear networks, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.269-278, June 28-July 02, 1998, Puerto Vallarta, Mexico

INDEX TERMS

Primary Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.2 Nonnumerical Algorithms and Problems
Subjects: Routing and layout

Additional Classification:
B. Hardware
B.7 INTEGRATED CIRCUITS
B.7.2 Design Aids
Subjects: Placement and routing

C. Computer Systems Organization
C.2 COMPUTER-COMMUNICATION NETWORKS

General Terms:
Design, Performance, Reliability, Standardization, Theory, Verification

Collaborative Colleagues:

Michele Flammini: colleagues

Christian Scheideler: colleagues

Peer to Peer - Readers of this Article have also read:

Constructing reality Proceedings of the 11th annual international conference on Systems documentation
Douglas A. Powell , Norman R. Ball , Mansel W. Griffiths
Data structures for quadtree approximation and compression Communications of the ACM 28, 9
Hanan Samet
A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee , Huizhu Lu , D. D. Fisher
An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen , Daniel D. Gajski
The GemStone object database management system Communications of the ACM 34, 10
Paul Butterworth , Allen Otis , Jacob Stein

Adobe Acrobat

QuickTime

Windows Media Player

Real Player