World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

ON THE FAULT-TOLERANCE AND SIZE OF WDM OPTICAL NETWORKS

    In optical networks the approach called wavelength division multiplexing allows multiple data streams to be transmitted concurrently along a single optical link, with different streams assigned separate wavelengths. In this paper we refer to all-optical networks, in which each connection is totally optical except at the terminal nodes. For these networks we determine the minimum possible number of links required to perform a fault tolerant broadcast from any node, in terms of the number of nodes, the number of link failures to tolerate and the number of wavelengths to use. We also give lower and upper bounds on the number of wavelengths required for any broadcast which tolerates a given number of link failures on networks with arbitrary topologies.

    References

    • N. K. Cheung, K. Nosu and G. Winzer, IEEE JSAC: Special Issue on Dense WDM Networks 8, (1990). Google Scholar
    • C. Siva Ram   Murthy and M.   Gurusamy , WDM Optical Networks - Concepts, Design and Algorithms ( Prentice Hall PTR , Upper Saddle River, NJ , 2001 ) . Google Scholar
    • P. E.   Green , Fiber-Optic Communication Networks ( Prentice Hall , Englewood Cliffs, NJ , 1992 ) . Google Scholar
    • P. E. Green, IEEE J. Selected Areas in Comm. 14, 764 (1996), DOI: 10.1109/49.510902. Crossref, ISIGoogle Scholar
    • R. Ramaswami, IEEE Comm. Magazine 31, 78 (1993), DOI: 10.1109/35.186364. CrossrefGoogle Scholar
    • R. J. Vetter and D. H. C. Du, IEEE Computer 26, 8 (1993). CrossrefGoogle Scholar
    • J.-C. Bermondet al., Efficient Collective Communication in Optical Networks, Proc. 23th International Colloquium on Automata, Languages and Programming pp. 574–585. Google Scholar
    • Q. Gu and S. Peng, IEEE Trans. on Parallel and Distributed Systems 14, 477 (2003). ISIGoogle Scholar
    • J. Maňuch and L. Stacho, Theoretical Informatics and Applications 37, 255 (2003), DOI: 10.1051/ita:2003019. Crossref, ISIGoogle Scholar
    • A. Gupta, J. Maňuch and L. Stacho, Journal of Combinatorial Designs 14, 25 (2006), DOI: 10.1002/jcd.20062. Crossref, ISIGoogle Scholar
    • S. Bessy and C. Lepelletier, Networks 56, 95 (2010). ISIGoogle Scholar
    • C.   Berge , Graphs , 3rd edn. ( North-Holland , 1989 ) . Google Scholar
    • D. B.   West , Introduction to Graph Theory , 2nd edn. ( Prentice Hall , Upper Saddle River, NJ , 2000 ) . Google Scholar