Efficient protocols for permutation routing on all-optical multistage interconnection networks

Proceedings of the International Conference on Parallel Processing

Volumn 2000-January, Issue , 2000, Pages 513-520

  Gu, Qian Pin ^a   Peng, Shietung ^b  

^a UNIVERSITY OF AIZU   (Japan)

^b HOSEI UNIVERSITY   (Japan)

Author keywords

All optical networks; Bandwidth; Multiprocessor interconnection networks; Optical fiber networks; Optical interconnections; Parallel processing; Routing protocols; Wavelength division multiplexing; Wavelength routing; WDM networks

Indexed keywords

ALGORITHMS; BANDWIDTH; INTERCONNECTION NETWORKS (CIRCUIT SWITCHING); MULTIPLEXING; OPTICAL COMMUNICATION; OPTICAL FIBERS; OPTICAL INTERCONNECTS; ROUTING PROTOCOLS; TELECOMMUNICATION NETWORKS; WAVELENGTH DIVISION MULTIPLEXING;

ALL- OPTICAL NETWORKS; OPTICAL FIBER NETWORKS; PARALLEL PROCESSING; WAVELENGTH ROUTING; WDM NETWORKS;

NETWORK ROUTING;

EID: 0003387493     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2000.876168     Document Type: Conference Paper

References (29)

1. D.P. Agrawal. Graph theoretical analysis and design of multistage interconnection networks. IEEE Trans. on Computers, C-32(7):637-648, 1983.
2. V.E. Benes. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965.
3. A. Borella, G. Cancellieri, and F. Chiaraluce. Wavelength Division Multiple Access Optical Networks. Artech House Publishers, 1998.
4. R. Cole et.al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proc. of the 30th Annual ACM Symposium on Theory of Computing, STOC'81, pages 378-388, 1998.
5. P.E. Green. Fiber Optic Networks. Englewood Cliffs, NJ: Prentice-Hall, 1993.
6. Q. Gu and S. Peng. Wavelengths requirement for permutation routing in all-optical multistage interconnection networks. In Proc. of International Parallel and Distributed Processing Symposium, IPDPS'2000, page to appear, 2000.
7. Q.P. Gu and H. Tamaki. Multicolor routing in the undirected hypercube. In Proc. of the 8th International Symposium on Algorithms and Computation (ISAAC'97), pages LNCS 1350, 72-81, Springer, 1997
8. Discrete Applied Mathematics, 1997.
9. Q.P. Gu and H. Tamaki. Routing a permutation in the hypercube by two sets of edge-disjoint paths. Journal of Parallel and Distributed Computing, 44:147-152, 1997.
10. J. Kleinberg and A. Kumar. Wavelength conversion in optical networks. In Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '99, pages 566-575, 1999.
11. N. Koike. Nec cenju-3: a microprocessor-based parallel computer. In Proc. of the International Parallel Processing Symposium, pages 396-401, 1994.
12. S.R. Kumar, R. Panigraphy, A. Russell, and R. Sundarm. A note on optical routing on trees. Information Processing Letters, 62:295-300, 1997.
13. J. Lanfant. Parallel permutations of data: a benes network control algorithm for frequently used permutations. IEEE Trans. on Computers, C-27(7):637-647, 1978.
14. F.T. Leighton. Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
15. M. Milail, C. Kaklamanis, and S. Rao. Efficient access to optical bandwidth. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), pages 548-557, 1995.
16. A. Mokhtar and M. Azizo glu. Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. on Networking, 6(2):197-206, 1998.
17. L. Narayanan, J. Opatrny, and D. Sotteau. All-to-all optical routing in optimal chrodal rings of degree four. In Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '99, pages 695-703, 1999.
18. R.K. Pankaj and R.G. Gallager. Wavelength requirements of all-optical networks. IEEE/ACM Trans. on Networking, 3(3):269-280, 1995.
19. D.S. Parker. Notes on shuffle/exchange-type switching networks. IEEE Trans. on Computers, C-29(3):213-222, 1980.
20. Y.R. Potlapalli and D.P. Agrawal. Bounds on the number of passes in multistage interconnection networks. In Proc. of the 6th Symposium on Parallel and Distributed Processing SPDP'94, pages 460-467, 1994.
21. R. Ramaswami and G. Sasaki. Multiwavelength optical networks with limited wavelength conversion. IEEE/ACM Trans. on Networking, 6(6):744-754, 1998.
22. R. Ramaswami and K.N. Sivarajan. Optical Networks A Practical Perspective. Morgan Kaufmann, 1998.
23. C.B. Stunkel. The sp2 communication subsystem. Technical report, IBM Thomas J. Watson Research Center, 1994.
24. TMC. The cm-2 technical summary. Technical report, Thinking Machine Corporation, Cambridge, MA,1990.
25. L.G. Valiant. A scheme for fast parallel communication. SIAM J. on Computing, 11(2):350-361, 1982.
26. L.G. Valiant and G.J. Brebner. Universal schemes for parallel communication. In Proc. of the 13th Annual ACM Symposium on Theory of Computing, STOC'81, pages 263-277, 1981.
27. A. Walksman. A permutation network. J. ACM, 15:159-163, 1968.
28. G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '98, pages 333-341, 1998.
29. Y. Yang, J. Wang, and Y. Pan. Permutation capability of optical multistage interconnection networks. In Proc. of the 12th International Parallel Processing Symposium and the 9th Symposium on Parallel and Distributed Processing (1998 IPPS/SPDP), pages 125-133, 1998.