The week's pick
Random Articles
Reseach Article
An Overview of Routing and Allocation of Equalized Wavelength or Power Distribution in Optical Network Security
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 36 - Number 10 |
| Year of Publication: 2011 |
| Authors: Suresh K. |
10.5120/4526-6402
|
Suresh K. . An Overview of Routing and Allocation of Equalized Wavelength or Power Distribution in Optical Network Security. International Journal of Computer Applications. 36, 10 ( December 2011), 17-23. DOI=10.5120/4526-6402
Abstract
Optical networks play an important role in information communication supporting both small-scale and large-scale networks through its capacity of seamless transmission of massive volume of data within a short time period. Some of the issues related to information communication using optical networks are routing, assignment of the wavelength and minimizing lightpath attack radius. By using adequate security measures and routing the lightpaths in an appropriate manner, we can decrease the potential damage like jamming attacks, flooding attacks occurred in the physical layer and we can overcome the congestion problems also. Routing in the optical networks needs to be dynamic as the wavelengths and its parameters are changing frequently. This paper presents a brief survey about the existing approaches in the Routing and Wavelength Assignment (RWA) using Wavelength Division Multiplexing (WDM) and optical cross connect switches which also provides solutions for the security threats in the physical layer of optical fiber networks. Based on the analysis carried out over the existing solutions we are proposing an equalized wavelength or power distribution using Wavelength Division Multiplexing (WDM), optical crossconnect equalization at the network nodes and power equalization placement in order to prevent jamming attacks and reducing LAR with minimum cost.
References
- GuJinling,“Design of the whole teaching quality evaluation system of higher colleges and universities[J]”. China Scienceand Technology Information .2007 (8) :240-242.
- I.Chlamtac, A.Ganz, and G.Karmi,“ Lightpath communications: Anapproach to high-bandwidth optical WANs,” IEEE Trans. Commun., vol. 40, no. 7, pp. 1171–1182, Jul. 1992.
- T. F. Noronha, M. G. C. Resende, and C. C. Ribeiro, “A genetic algorithm with random keys for routing and wavelength assignment,” Networks, submitted for publication.
- N.Skorin-Kapov, “Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks,” IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 2–15, Aug. 2006.
- X.Chu and B.Li, “Dynamic routing and wavelength assignment in the presence of wavelength conversion for all-optical networks,” IEEE/ACM Trans. Netw., vol. 13, no. 3, pp. 704–715, Jun. 2005.
- B.Ramamurthy, D. Data, H. Feng, J. P. Heritage, and B. Mukherjee, “Impact of transmission impairments on the teletraffic performance of wavelength-routed optical networks,” J. Lightw. Technol., vol. 17, no. 10, pp. 1713–1723, Oct. 1999.
- M. Médard, D. Marquis, R. Barry, and S. Finn, “Security issues in all optical networks,” IEEE Network, vol. 11, no. 3, pp. 42–48, May/Jun. 1997.
- T.Wu&A.somani “Cross-talk attack monitoring and localization in all-optical networks,” IEEE/ACM Trans.Netw, vol. 13, no. 6, pp. 1390–1401,Dec. 2005.
- C. Mas, I. Tomkos, and O. Tonguz, “Failure location algorithm for transparent optical networks,” IEEE J. Sel. Areas Commun., vol. 23, no. 8, pp. 1508–151, Aug. 2005.
- N. Skorin-Kapov, J. Chen, and L.Wosinska, “A tabu search algorithm for attack-aware lightpath routing,” in Proc. ICTON, Athens, Greece,Jun. 2008, pp. 42–45.
- R. L. Brooks, “On coloring the nodes of a network,” in Proc. Cambridge Phil. Soc., 1941, vol. 37, pp. 194–197.
- D. Kirov ski and M. Potkonjak, “Efficient coloring of a large spectrum of graphs,” in Proc. 35th Conf. Design Autom., San Francisco, CA, Jun. 1998, pp. 427–432.
- F. Glover and M. Laguna, Tabu Search. Boston, MA: Kluwer Academic, 1997.
- L. Stacho,“New upper bounds for the chromatic number of a graph,” J. Graph Theory, vol. 36, no. 2, pp. 117–120, Feb. 2001.
- N. Skorin-Kapov, “Routing and wavelength assignment in optical networks using bin packing based algorithms,” Eur. J. Oper. Res.,vol.177, pp.1167–1179, 2007.
Index Terms
Keywords