Open Access Open Access  Restricted Access Subscription or Fee Access

Reduction of Congestion in Optical Networks

Sonal Punia, Suresh Kumar


Routing in networks is a challenging issue. In this paper, we assume routing in an All to All communication mode in an N × N grid optical network. Horizontal-Vertical routing has been employed. This type of routing uses the center node to route packets from source to destination, so the load on the center node increases and packet loss starts. To route the packets from same source to destination, alternate paths are followed (without center). In other words load balancing is done to reduce or eliminate the load at over utilized central node and increase the load at under utilized corner or other intermediate nodes. In this paper, through simulation results it has been shown how load balancing reduces the congestion and packet drop rate, which is highly desirable in any kind of network


Center Node, Congestion, Grid Optical Network, Load Balancing, Over Utilization.

Full Text:



M. Ajmone Marson, Andrea Bianco, Emilio Leonardi and Fabio Neri, “Topologies for wavelength-routing all optical networks”IEEE/ACM transactions on networking, Vol 1, no 5, October 1993

M. Kaufmann, J. F. Sibeyn, and T. Suel, “Derandomizing Algorithms for Routing and Sorting on Meshes,” Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 669–679, Arlington, Virginia, 1994.

Michael T. Frederick and Arun K. Somani, “A single-fault recovery strategy for optical Networks using sub graph routing”, The International Journal of Computer and Telecommunications Networking, Volume 50, Issue 2 (February 2006)

Muriel M´edard, “Network Reliability and Fault Tolerance”, IEEE Transactions on Volume 50, Issue 1, Page(s):85 – 91, Mar 2001

Hongsik Choi, Suresh Subramaniam, and Hyeong-Ah Choi, “On Double-Link Failure Recovery in WDM Optical Networks”, INFOCOM Volume: 2, On page(s): 808- 816 vol.2, 2002

Rajkumar and Dr.N.S.Murthy Sharma, "A Distributed Priority Based Routing Algorithm for Dynamic Traffic in Survivable WDM Networks", International Journal of Computer Science and Network Security, vol.8, no.11, November 2008.

Dong-won Shin, Edwin K.P.Chong and Howard Jay Siegel, “Survivable Multipath Routing Using Link Penalization”, Computing and Communications, 2004 IEEE International Conference.

S. Hinrichs, C. Kosak, D. R. O’Hallaron, T. M. Stricker and R. Take, “An Architecture for Optimal All-to-All Personalized Communication,” Proceedings of the sixth annual ACM Symposium on Parallel Algorithms and Architectures,pp. 310–319, Cape May, New Jersey, 1994.

R. Thakur and A. Choudhary, “All-to-All Communication on Meshes With Wormhole Routing,” Eighth International Parallel Processing Symposium, pp. 561–565, Cancun, Mexico, April 1994.

Lakshmana Prasanth Nittala Venkata,”Routing Algorithms for Large Scale Wireless Sensor Networks”, Master Thesis, Graduate Studies of Texas A &M University, December 2004.

J. Gao, and L. Zhang, “Load Balanced Short Path Routing in Wireless Networks,” IEEE INFOCOM 2004 - The Conference on Computer Communications, vol. 23, no. 1, pp. 1099-1108, Hong Kong, March 2004. Simulator


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.