www.ijecs.

in
International Journal Of Engineering And Computer Science ISSN:2319-7242
Volume 3 Issue 9 September, 2014 Page No. 8064-8070

Wavelength Assignment in Optical WDM Optical

Network
Mudasir Ali 1,Parminder Singh Saini2

1. Department of ECE,Doaba Institute of Engineering and Technology, Punjab, India

[email protected]

2. Professor in Department of ECE, Doaba Institute of Engineering and Technology, Punjab,India

[email protected]

ABSTRACT
This paper analyses the wavelength assignment problem in case of WDM optical networks. The random
wavelength assignment algorithm is compared with the first – fit wavelength assignment algorithm .These
two assignment strategies are also compared with wavelength conversion case. These comparisons are made
on the basis of blocking probability, keeping the number of channels and number of links constant and the
response is calculated by varying load per link ( in erlangs). Blocking probability on a link is calculated by
using famous Erlang B formula. It is seen that blocking probability in case of random wavelength
assignment is always greater than first –fit wavelength assignment algorithm. The blocking probability in
case of WDM networks employing wavelength converters is minimum but it increases the overall cost of the
optical network.

1. INTRODUCTION point to point basis , with optical signals

converted back to their electronic format at each
Wavelength assignment problem is one of the node.
important problems in optical networks as on the
first stage route of the optical network is to be The great challenge faced in designing
decided and after selecting the route , the wavelength routed networks is to devise efficient
wavelength must be assigned to the route. algorithms for establishing light paths in the
Wavelength division multiplexing (WDM) optical network. These algorithms must have
technology in optical fiber networks has been capability to select routes and assign wavelengths
gaining a great acceptance as a means to full fill to selected routes in such a way that uses network
the ever increasing bandwidth demands of resources efficiently and which increases the
network users. WDM technology has been number of established paths.
improving with a steady pace since few years.
WDM systems are currently being employed in
1.1 ROUTING AND WAVELENGTH
long distance telecommunication networks on a ASSIGNMENT
Mudasir Ali, IJECS Volume3 Issue9 September ,2014 Page No.8064-8070 Page 8064
 same on all the links it traverses froms ourceend-
RWA is the unique feature of WDM networks in node to destination end- node[4].
which light path is implemented by selecting the
path of a physical link between source and
destination dgenodes and reserving a particular
wave length on each of these links for the light 1.3 WAVELENGTH ASSIGNMENT
path. Thus for establishment of an optical ALGORITHM
connection, one must deal with these lection of the Wave length assignment is a unique feature
path (Routing problem) as well as allocating the in wave length routed networks that disting
available wave lengths forth econnections (Wave uis hes them from conventional networks.
length Assignment problem). This resulting Based on the order in which the wavelengths
problem is known as routing and wave length researched, wavelength assignment methods
assignment problem [1].Wecan divide this problem are classifiedin to most-used, first-fit ,rando
in two problems namely ;routing problem and mand
wavelength assignment problem and then we can Wavelength conversion algorithm.
propose different solutions to this problem. Sobriefint roof wavelength assignment
Findar out efrom the source the destination. algorithms are following:-
Assign a wavelength to the selected route.
Anend-to-end light path has to be Random wavelength assignment [8]: In
established prior to the communication this algorithm as et of wavelengths that can
between any two nodes. To establish a light be used to establish the connection is
path, it is required that the same wave length determined. After that wavelength is
be allocated on all the links along the path. randomly select with uniform probability
This limitationis known as the wave length distribution from the set.
continuity constraint [2] Most- used wave length assignment
[8]: The most-used algorithm selects the
1.2WAVELENGTH ROUTED wave length most often used in the network.
CONSTRAINTS The objective of this policy is to keep more
There are two constraints that have to be kept in wavelengths available for calls traveling
mind by the approaches when trying to solver wa. over long paths. This algorithm requires
The first distinct wave length assignment communication over head and storage
constrain tholds for solving wavelength requirements.
assignment problem in any wave length routing Wavelength conversion wavelength
network. These cond wave length continuity assignment [5] :Any incoming light-path can
constrain tapplies only to the simple case of wave be assigned to any wavelength on the out
length routing networks that have no wave length put side.This eliminates wavelength-
conversion capability inside their nodes[3].so brief continuity constraints.
introit the miss following: A) distinct wave length First-Fit wave length assignment
assignment constraint :all light paths sharing [7]:This algorithm numbers all wavelengths,
common fiber must be assigned distinct wave so that when there is ademand for
lengths to avoid interference. This applies ot only wavelengths available, those of a small
with in the all-optical network but in access links ernumberare
as well.

B) wave length continuity constraint: the wave

length assigned to each lightpath remains the

Mudasir Ali, IJECS Volume3 Issue9 September ,2014 Page No.8064-8070 Page 8065
Considered first. The first available
wavelength is then selected. This algorithm
does not require global information system.
Its computational cost is lower because no
storage is needed to keep the network states.
It works well interms of blocking
probability and fairness so fallocation. This
algorithm is preferred for it ssmall over head
and low computational complexity. The
objective of this allocation scheme is to
minimize wavelength fragmentation [6].
2. METHODOLOGY
Our research focused on the prevention of
congestion in Wavelength division multiplexing
optical networks by developing an adaptive
dynamic natured algorithm which is tested in Figure 1.1: Simulation scenario for dynamic
Network simulator version 2 (NS2). The basic routing
implementation started with creation of optical The simulation study has been done for dynamic
network with ten nodes and high speed links for
algorithm along with first fit and random routing
connectivity and communication. Research has
been divided into three phases. In the first phase scheme in network simulator version 2. In
i.e. Random algorithm, the blocking probability simulation setup we have considered optical
was much higher. Then we switched to the second
communication with ten optical nodes for
phase i.e. First fit algorithm which has lesser
blocking probability than the previous one. Finally representing routing process. The base simulation
there is development of dynamic conversion scenario for dynamic routing is shown above in
algorithm which has the best results out of all figure 1.1.
three. Comparison has been done with variation of
load per links for various nodes in the network.
The simulation scenario for dynamic routing
In this research, we have developed and contains 5 subnets and traffic start after finding
implemented a dynamic routing algorithm for load and frequency value on all nodes. For
wavelength division multiplexing which use to different nodes, we have considered blocking
fetch information in early state of communication probability with variation of load on nodes.
and sort the wavelengths according to the
channels available with same frequencies on the The blocking probability is good parameters for
further nodes in optical network. Dynamic deciding the efficiency of the optical routing
algorithm finds the available paths with clearance process. If the intermediate node doesn’t have
from further nodes with information of load and same frequency as carried by wavelength at
availability of the same frequency as on base starting then packets will be dropped and
node. converters are required for conversion of the
frequency to suitable value. Below figure 1.2
shows the blocking and packet drop in simulation.

Mudasir Ali, IJECS Volume3 Issue9 September ,2014 Page No.8064-8070 Page 8066
 ii. List the free wavelengths on route
to next node

iii. If no free wavelength is there, then

RQ fails otherwise compare the
wavelength of RQ with the
available wavelengths. If
wavelength matches then XR is not
required and select that wavelength
otherwise XR will be required

iv. Add on RQ the information about

the requirement of XR, Load and
wavelength status of outgoing
route.
Figure 1.2 Simulation scenario for blocking v. Forward RQ to next node
and packet drop

2.1ALGORITHM FOR otherwise go to 6

DYNAMIC CONVERSION
5. Go to 4
The proposed algorithm is to reduce the cost
6. do
factor and to improve the performance of the
optical fiber network. Here the steps from 1 to 3 i. Find out the information with RQ
are for source node, step 4 is for intermediate for R.
node , step 5 for destination node and steps 6,7 are
for control operation. The algorithm is given ii. Calculate NR, LR, LRA, VR, XR, TR
below:-
7. Calculate Integrated route cost (CI(R)) of
1. Find the routes from source node having route R through
one or more free wavelengths and list them
CI(R) = ε(NR) + λ(LR) + ζ(LRA) + η(VR) + κ(XR)
2. Choose first two routes R1 and R2 from the
where ε, ζ, η, κ are the parameters having value
list through shortest route algorithm and
from 0 to 1 and λ is the parameter having value to
put RP← R1 and Rs← R2.
be considered as the ratio between the rate of
3. Send the request RQ on R1 and R2 with the wavelength converters and optical fibers.
information about destination node, route,
8. Compare CI(R) of both routes and fix the
wavelength status for outgoing route, route
primary and backup route by using
cost, load per link and route time
compare algorithm.
4. If the next node is not the destination node
then

i. Get the request RQ and find out the

information on signal

Mudasir Ali, IJECS Volume3 Issue9 September ,2014 Page No.8064-8070 Page 8067
Choose next two routes from the list and go to (3)
till the list ends

(b)First fit algorithm

(a) Algorithm of proposed dynamic
wavelength assignment 2.3 ALGORITHM FOR RANDOM
ASSIGNMENT

2.2 ALGORITHM FOR FIRST FIT  Store the number of wavelengths

STRATEGY calculated and available. Check each
possible wavelength available with cost
 Initially number of wavelength is of wavelength.
calculated which is given by W = {n/k}
in given communication.  If the wavelengths are available at
source is more than two.
 If the wavelengths are available at
source is more than two. Begin the process with sorting SD pairs of the
wavelength
Begin the process with sorting SD pairs of the
wavelength Random Order selection
if
Non Decreasing Order selection If Two or more Two or more sequence of same frequency
sequence of wavelength available Then put wavelength available
highest value of wavelength as initial stage of then
communication else start communication with put randomly the value of wavelength as initial
first available wavelength stage of communication
else
 Path is searched for the first wavelength start communication with first available
selected. wavelength
 Connect the pairs for communication. If
Combination is not formed  Start matching communication frequency.
Then discard the wavelength combination end If Frequency of wavelength found Then Connect
it with wavelength value Else Discard wavelength
at particular source

Mudasir Ali, IJECS Volume3 Issue9 September ,2014 Page No.8064-8070 Page 8068
 120
 Output is W which is the number of

Blocking Probability %
100
wavelengths.
80
60
40 Random

20 First Fit

0 Conversion

Number of nodes
Figure 1

120

Blocking Probabaility %
100
80
60
40 Random

20 First Fit

0 Conversion

3.

(c)Random assignment algorithm Number of nodes

Fig 2

3. RESULTS AND DISCUSSION

120
The following graphes clearly shows comparison
Blocking Probability %

100
of first fit , random and conversion wavelength
80
assignment strategies. These show blocking
probability variation for loads 10, 20 and 30 60
erlangs respectively. Moreover, it is also evident 40 Random
from these plots that blocking probability is 20 First Fit
maximum in case of Random wavelength Conversion
0
assignment algorithm and is minimum in
wavelength conversion strategy.

Number of nodes
Fig 3

4.CONCLUSION
Optical wavelength routed network offer huge
capacity with highs calability which makes them a
very attractive choice for then ext generation

Mudasir Ali, IJECS Volume3 Issue9 September ,2014 Page No.8064-8070 Page 8069
optical networks. The wavelength division ghtwaveTechnology,vol.23,no.3, pp.955-
multiplexing technique is considered to be one of 971,March2005.
the best possible techniques in optical network to [8]RajneeshRandhawa,J.S.Sohal,“Blockingp
enhance the capacity of optical fiber. Wave length robabilityanalysisofsurvivableroutingin
assignment problems are the major problems of WDMopticalnetworkswith/withoutsparse-
WDM networks. Wavelength assignmentisa wavelengthconversion”,Optik121(2010)
unique feature in wavelength routed networks that 462-466.
distinguishes them from conventional networks. [9]AnwarAlyatama,“Wavelengthdecomposit
So we analyze the performance of First-fit, ionapproachforcomputingblocking
Random, Most-used and Wavelength conversion probabilitiesinWDMopticalnetworkswithout
Algorithms for wavelength assignment in WDM wavelengthconversions,”ComputerNetwork
unidirectional opticalring network. We compare s, vol.49,pp. 727–742, 200
the blocking probability of various algorithms
with the variationinnum berof events.

REFERENCES
[1]SureshSubramaniam,ArunK.Somani“All-
opticalnetworkswithsparsewavelength
conversion”,IEEE/ACMTransactionsonNetw
orking4(4)(1996) 544–557.
[2]XuehongSun',YunheoLit,IoannisLambad
aristandYiqiangQ.Zhao'“Performance
AnalysisofFirst-
FitWavelengthAssignmentAlgorithminOptic
alNetworks”,IEEE, pp.403-409June 11-
13,2003.
[3]A.Birman,“Computationapproximationbl
ockingprobabilitiesforaclassofall-
opticalnetwork”, IEEE
J.Select.AreasCommun.14(5)(1996) 852–
857.
[4]AmitWason,R.S.Kaler,“Wavelengthassig
nmentalgorithmsforWDMoptical networks”
Optik122(2011)877-880.
[5]Kai-
YeungSiu,ChingLaw,“OnlineRoutingandWa
velengthAssignmentinSingle-
HubWDMRings”,IEEE,pp.2111-
2123,vol.18,October2000.
[6]AmitWason,R.S.Kaler,“Blockingprobabili
tycalculationinwavelength-routedall-
opticalnetworks”,Optik122(2011).
[7]XiYangandByravRamamurthy,“Dynamic
RoutinginTranslucentWDMOptical
Networks:TheIntradomainCase,”JournalofLi

Mudasir Ali, IJECS Volume3 Issue9 September ,2014 Page No.8064-8070 Page 8070