Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Priority Based Routing and Wavelength Assignment With Traffic Grooming for Optical Networks

Not Accessible

Your library or personal account may give you access

Abstract

One of the challenging issues in optical networks is call blocking and it increases with the number of connection requests due to the limited number of wavelength channels in each fiber link. In this paper, we propose a priority based routing and wavelength assignment scheme with incorporation of a traffic grooming mechanism (PRWATG) to reduce call blocking. In this scheme, the connection requests having the same source–destination (s–d) pair are groomed first to avoid intermediate optical–electrical–optical conversation and then these groomed connection requests are served for routing and wavelength assignment according to their priority order. The priority order of each groomed connection request is estimated based on type of path (direct link physical path or indirect link physical path) first and then the traffic volume. If the priority order of connection requests is estimated using these criteria, blocking of connection requests due to wavelength continuity constraints can be reduced to a great extent, which will in turn lead to better performance of the network in terms of lower blocking probability and congestion. The performance analysis of our proposed scheme is made in terms of blocking probability and congestion and compared with a similar non-priority based routing and wavelength assignment scheme (NPRWATG). It is seen that using the PRWATG scheme, the blocking probability and the congestion of the network are significantly reduced compared to NPRWATG. It is also seen that the performance of the proposed scheme is better compared to NPRWATG when the number of connection requests increases in the network.

©2012 Optical Society of America

Full Article  |  PDF Article
More Like This
Distributed Grooming, Routing, and Wavelength Assignment for Dynamic Optical Networks Using Ant Colony Optimization

X. Wang, M. Brandt-Pearce, and S. Subramaniam
J. Opt. Commun. Netw. 6(6) 578-589 (2014)

Fairness in Zone-Based Algorithms for Dynamic Traffic Grooming in WDM Mesh Networks

André C. Drummond and Nelson L.S. da Fonseca
J. Opt. Commun. Netw. 2(6) 305-318 (2010)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (10)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (4)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (7)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved