Reliable ILP Approach of Max-RWA Problem for

Translucent Optical Network

Dinesh Kumar Shah1
National Institute of Technology,
Uttarakhand, India
csedinesh10@gmail.com

Hifzan Ahmad2
Kamla Nehru Institute of Technology,
Sultanpur, Uttar Pradesh, India
hifzan@gmail.com

AbstractIn an all-optical WDM network; optical fibers are used

to transmit data followed by WDM technology. An optical fiber
carries light along its length path at high rates and with little loss.
Several wavelengths on a single fiber can be used to transfer data,
when using wavelength-division multiplexing. In this way, several
data transmissions at very high speed can take place on a single
fiber. The routing and wavelength assignment (RWA) problem
consists of finding a path and a wavelength for a set of data
connections. The objective is typically to maximize the profit of
established data by achieving as much as possible lightpath for
transmitting optical signal (max-RWA). The RWA is NP -hard,
thus much research has been conducted to finding a good way of
approaching the RWA. This work mainly focuses on the analyzes
work RWA problem based on integer linear programming (ILP)
and reliable heuristics for variant topology of WDM networks.
For performance analysis heuristics method as well as others
variants of solution for RWA problem also had been implemented
which results give some interesting observation about resources as
well as optimal solution.

Anchal Uniyal3
G. B. Pant Engineering College,
Uttarakhand, India
aanchal.uniyal@gmail.com

Optical devices are much more expensive compared to

electronic devices, so it is important to optimize the use
of optical network resources.
A number of optical signals at different carrier
wavelengths may be simultaneously carried by the same
fiber.
The speed at which optical signals may be communicated is
far greater than the speed at which data can be processed by
electronic circuits.

Keywords: ILP, Optical network, WDM, RWA

Fig. 1. Optical Fiber Cable

I. INTRODUCTION
As we know in today scenario big amount of data is
travelled in around the word 24*7. Computer communication
started with copper wire as the medium for carrying electrical
signals encoding the data to be communicated from one
computer to another. Copper as a medium of communication
has a number of limitations and, in the last two decades,
enormous progress has been made in using alternative media for
communication.
Optical fibers are essentially very thin glass cylinders or
filaments which carry signals in the form of light (optical
signals). An optical network connects computers (or any other
device which can generate or store data in electronic form)
using optical fibers. To facilitate data communication, an
optical network also includes other optical devices to generate
optical (electrical) signals from electrical (respectively optical)
data, to restore optical signals after it propagates through fibers,
and to route optical signals through the network.
Optical networks have found widespread use because the
bandwidth of such networks using current technology is 50 terabits per second. In other words, it is theoretically possible to
send 501012 bits per second using a single fiber. Firstgeneration optical networks simply replaced copper wires with
optical fibers. However, there are the following important
differences between copper and fiber as communication media:

Transparency, using a strict definition implies that the

lightpath should support end-to-end communication of data,
independent of bit rates and signal formats.
A. WDM Network Classification
a) Transparent optical network: In transparent optical
network, a call bypasses the expensive electronic signal
processing at intermediate nodes. However, its difficult to be
practically deployed on a large scale. The reason for this is the
effect of transmission impairment on the signal quality after a
call travels through several optical components without
regeneration.
b) Opaque optical network: It incorporates such signal
regeneration at every intermediate node along the lightpath.
Hence in opaque optical network, a single optical hop of a
lightpath never span more than one physical fiber link in the
network.
c) Translucent optical network: It is solution of cost and
quality of transmission. Electronic regeneration is expensive in
WDM optical network because every optical need electronic to
optical and optical to electronic conversion at all the
intermediate nodes. An important point to be considered in the
case of opaque network is the overhead due to regeneration

wavelength.in a translucent optical network, a signal is made to

traverse as long as possible before its quality falls below the
threshold value. Because a signal is regenerated only if
necessary, we need fewer regeneration resources. Such a type
of regeneration is termed as sparse regeneration.
B. Routing and Wavelength Assignment Problem in
Translucent Optical Network
Optical networking, like all of the other networks, has many
problems. One general problem of all-optical routing is finding
a path and a free wavelength for a source destination pair such
that traffic data can be transmitted along the lightpath (path &
wavelength) without the need to convert to an electrical signal
or change wavelength at intermediate nodes. This requirement
is referred to in the literature as the RWA problem of optical
routing. The general aim of the RWA problem is to increase the
number of established connections. Each connection request
should be given a route and wavelength. The wavelength must
be consistent for the entire path, unless wavelength converters
are included. Two connection requests can share the same
optical link provided that they use different wavelengths. The
RWA problem in optical networks is demonstrated in Fig. 2,
where it is assumed that each fiber can carry two wavelengths
[1]. The effect of the wavelength continuity constraint is
represented by duplicating the network into as many copies as
the number of wavelengths (in this case, two). If wavelength i is
selected for a lightpath, the source and destination edge nodes
communicate over the i-th copy of the network. Thus, finding a
path for a connection may potentially involve solving W routing
problems for a network with W wavelengths, one for each copy
of the network.

source to the destination edge node. This constraint is

illustrated in Fig. 3 in which each lightpath is represented by a
single color (wavelength) along all the links in its path.
b) Distinct wavelength constraint: all lightpaths using the
same link (fiber) must be allocated distinct wavelengths. In
Fig. 3, this constraint is satisfied because the two lightpaths
sharing a link are shown in different colors (wavelengths).
Traditionally, the RWA problem is addressed by a two-step
process to decrease complexity [7]: first, a path from the source
to the destination is found using a routing algorithm, and then a
free wavelength on the chosen path is determined using a
wavelength-assignment algorithm. The constraints of the RWA
problem include wavelength continuity, physical impairments,
and traffic engineering considerations.

Fig. 3. A wavelength routed through a WDM network [1]

The wavelength-continuity constraint requires a connection

to use the same wavelength along a lightpath. In some
networks, wavelength converters are deployed at switch nodes,
and the wavelength continuity constraint can be relaxed.
However, wavelength converters are expensive and we assume
no converter exists in the networks in our research. The traffic
engineering constraints aim to improve resource-usage
efficiency and decrease the probability that connections are
blocked. The physical impairment constraints are used to
guarantee signal quality to some level.
C. Approach in Lightpath RWA
As state, because of the necessity of optimize solution in
real time several method has been proposed by many author.
Here is the categorization of method:
a. Heuristic approach
b. Meta-heuristics approach
c. Integer linear programming with relaxation.

Fig. 2. The RWA problem with two wavelengths per fiber [1]

A unique feature of optical WDM networks is the tight

coupling between routing and wavelength selection [1]. As seen
in Fig. 3, a lightpath is implemented by selecting a path of
physical links between the source and destination edge nodes
and reserving a particular wavelength on each of these links for
the lightpath. Thus, establishing an optical connection requires
both routing (selecting a suitable path) and wavelength
assignment (allocating an available wavelength for the
connection). The resulting problem is referred to as the routing
and wavelength assignment (RWA) problem [6], and it is
significantly more difficult than the routing problem in
electronic networks. The additional complexity arises from the
fact that routing and wavelength assignments are subject to the
following two constraints [1]:
a) Wavelength continuity constraint: a lightpath must use
the same wavelength on all the links along its path from the

D. Organization of Dissertation
This work focuses on performance analysis of translucent
optical network with objective of lightpath setup with minimum
number of wavelength and resultant value should be reliable.
Here several approaches are attempted and result obtained is
discussed. The organization of paper is as follow Introduction start with the general optical network,
problems and ends with the approaches. Over all work
and scope of the work is also illustrated.
Review section discussing and categorizing RWA
problem, different approaches and its time complexity
and some results.
II. LITERATURE REVIEW
This [28] paper considers the problem of routing
connections in a reconfigurable optical network using
wavelength-division multiplexing.

As per my knowledge it is first time when RWA problem is

try to formulate by using approach which is different from
heuristic method i.e. ILP formulation for max-RWA problem.
In this paper author consider RWA problem as max-RWA
problem i.e. maximizing the number of connection given a
connection matrix and number of wavelength supported by
fiber. The paths that the sourcedestination pair is allowed to
take had to be specified beforehand. This is called as the path
formulation ILP.
Here [28] Optical network is referring to a network that
does not use wavelength converters. In this paper author used
the network in which node does not have capability of
wavelength converter. i.e. No regenerators node is used in

experiment and if used it mentioned as circuit switching

network.
Here upper bound is derived for the carried traffic of
connections and equivalently, a lower bound on the blocking
probability for any routing and wavelength assignment (RWA)
algorithm in a small WDM network.
Here author formulate RWA problem as an ILP where the
objectives are:
1. Maximize the number of connections (i.e. Upper bound)
that are successfully routed.
2. LP formulation (i.e. ILP with integer constraint
relaxation) for getting the upper bound for the number of
connection that is finally routed.

TABLE 1. COMPARATIVE STUDY

Formulation
Method

Objective

ILP, relaxed ILP

Max-RWA

ILP

RP,
Max-RWA

0-1 ILP

Max-RWA

ILP

Max-RWA

IP

Min-RWA

LP

Min-RWA

LP

Min-RWA

Conclusion
1. Upper bound is derived for the carried traffic of
connections.
2. Lower bound on the blocking probability
1. Expanded node representation for regenerators
node.
2. Routing with regenerators assignment
(RRA) & Max-RWA problem.
1. Reconsider for comparison
2. Two formulation given by changing wavelength
continuity constraint.
R. M. Krishnaswamy & K. N.
Sivarajan, design of logical topology
New proposed in this by author.
3. Take less memory and less computational time.
1. CR- model consider.
2. Lower and upper bound for symmetrical and
asymmetrical is given.
1. Column generation technique.
2. Branch-and-price procedure.
1. Formulation is given for opaque, translucent &
transparent network.
2. Integer optimal solution even integrality constraint
are relaxed and if not then network is opaque.
3. Minimizing the call blocking probability.
4. Optimal multi commodity routing.
1. Randomized rounding technique takes care of LP.
2. Graph coloring approach for wavelength
assignment.

In [27] this paper Min-RWA problem is considered for large

WDM network. Author given the ILP formulation for MinRWA i.e. minimize the number of wavelength for successfully
RWA for the given set of lightpath and state that RWA problem
without the wavelength continuity constraint can be formulated
as multi commodity flow problem with integer link flow.
In this, Problem is solved by divided RWA into two sub
problem: Routing problem and Wavelength assignment.
A comparative study is done in Table 1 on the basic of
formulation, objective and achievements of individuals
respectively.

Reference
,Year
[R. RAMASWAMI,et
al 28] , 1995
[T. LEE, et al 29] ,
2012

[KRISHNASWAMY,et
al 25] , 2001

[JAUMARD.et al 10] ,
2004
[T. LEE,et al 29] , 2000

[OZDAGLAR,et al 26]
, 2003

[D. BANERJEE,et al
27] , 1996

III. PROPOSED ILP FOR RWA PROBLEM IN TRANSLUCENT

OPTICAL NETWORK
In transparent optical networks, the signal carried on a
lightpath remains in the optical domain and does not undergo
any opto-electronic conversions over the entire route of the
lightpath. However, physical impairments such as crosstalk,
chromatic dispersion, polarization mode dispersion and
amplifier noise can lead to significant deterioration of the
transmitted signal as it travels along an established lightpath
[12]. The optical reach [13] is the maximum distance that the
optical signal can travel, along a lightpath, before regeneration
is required to maintain acceptable quality of transmission
(QoT). Typically, such regeneration involves reshaping,

retiming, and re-amplification of the signal (known as 3R

regeneration) and requires O-E-O conversion at the
regeneration site(s). Lightpaths with a total length that is less
than the optical reach can be routed transparently along the
entire route. Longer lightpaths must undergo 3R regeneration at
one or more intermediate nodes. Such networks, where
lightpaths are routed optically at certain nodes, and may require
O-E-O conversion and regeneration at other intermediate nodes
are called translucent optical networks [12, 14, 15].
One approach, for translucent network design, considers
sparse placement of regenerators only at a few designated
nodes. Two main problems have been investigated in the
literature for such networks. The first is the regenerator
placement (RP) problem [1619], where the goal is to
determine the minimum number of regenerators (alternatively,
the minimum number of regeneration sites [20, 21]) and their
locations that needs to be deployed in order to support a
specified set of lightpath demands. The second is the routing
with regenerator assignment (RRA) problem [22, 23], where,
the number and the locations of the regenerators are already
known, and the goal is to use the available regenerators and
other resources as efficiently as possible, when performing the
RWA for each lightpath. For the static RWA problem, the
RWA and regenerator assignment must be performed for the
entire set of lightpath demands as a whole, in a way that
optimizes certain design objectives. As pointed out in [22],
most of the research in this area has focused on the simpler
dynamic RWA problem and only a handful of papers so far
(e.g., [22, 23]) have considered the static RWA problem.
In my work, we focus on the static RRA problem for
translucent networks with sparse regenerator placement and
propose a comprehensive integer linear program (ILP)
formulation that minimizes the amount of resources required to
establish a given set of lightpaths. Since regenerators are
sparsely located, the primary goal of our formulation is to
reduce the number of wavelength- links.
A. Basic Structure of Optical Network

For our simulations, we used the 14-node NSFNET

topology [25], along with the link distances as shown in Fig. 4,
except this several other topologies also being taken into the
account.

This is demonstrated in Fig. 5 & Fig. 6. In Fig. 5, node i

which is in square shape is regenerators node. In Fig. 5, node i
(square shaped node) is expanded into three virtual nodes ia, ib
and ic. In this three node ic are actually regenerators node i.e. If
any node need regeneration then its need to go through node ic
else if its do not need of regeneration then it will bypass
through node ia and ib. Here are some important things which
need to be treated carefully. The edge in expanded node is not a
part of physical fiber links but it is internally part of node i.
These edges will be acted like regenerators edges and there is
exactly three edge for each regenerators node will be
available.

Fig. 5. E.g. of network with regenerator node i

Fig. 6. Expended regenerator node i

2) Input Set of Lightpath

Input set of lightpath generally contain source and
destination in excel format which will read by tool easily as
input.
TABLE 2. SHOW THE SMALL STRUCTURE OF INPUT DATA SET

Source
1

Destination
2

10

12

13

Fig. 4. 14-node NSFNET topology with link distances

Here a 14 node in which 5 nodes(3,4,7,8,9) [25] is

regenerators node but in our experiment we will take care of
regenerators node on the basis number of in-degree and outdegree.so these variation will also be shown in result and
discussion section.
1) Node Structure
In our ILP we are expending node in a way such that if there
is need of regeneration then only lightpath will pass through
regenerators otherwise it will bypass. By adopting this we are
able to increase efficiency.
Here is illustration of how exactly expending node work and
help in achieving goal.
Each such node i is represented by a group of three virtual
nodes.

Generally our dataset will be in the multiple of 50 so can we

are able to perform the operation on large scale.
3) Variables and Its Structure
Here we are considering some dataset and variable as input.
N:
Sets of nodes including both regular and virtual node
in representation
RN:
Sets of regenerators node
Ri:
Number of regenerators available at node i
Up:
Set of unidirectional fiber links in the physical

topology
C:
Cardinality of set Up
ER:
Set of regenerators edges in the expanded nodes
E:
Sets of all edge in the network{ Up U ER }
Cs :
Number of channels supported by each fiber in the
link.
K:
Set {1,2,..Cs } of channel number of each fiber
Pl :
Set of lightpath where l represent lth lightpath in the
set(input).
Ol:
Originating node of lightpath l
Tl:
Terminating node of lightpath l
MoR: Maximum optical reach without regeneration.
Ml:
Maximum No. of regeneration allowed for lightpath
l.
d (i,j): Length of edge from node i to node j.
Here some variables are defined for taking account of
accommodation, MoR etc.

5. Taking care of resources

Sl(j)+Sl(i) Rn U Destination node MoR p P, (ij) E
Ensure that no attempt will be taken if resource not
available to reach either destination node or regenerator node.
6. Wavelength conversion constraint.
Case: 1
Sl(j)+Sl(i) Rn U Destination MoR p P
Case: 2
If dl,k(j) and if dl,k(j) i where ll and (Ji) is on physical
route of lightpath l then initialize dl , k (j)=0 k {1,2,..c} &
k= k &Sl(j)=0 l L
6.1 Ml=Ml+1 if case 2 true
6.1.1 check Ml MNORl
if true then contd.
Else drop the lightpath

Sl(j) : Distance traveled by lightpath l & its present status is

node j.
fl(i,j): Distance from the beginning of the current segment to
node i , if edge i j is on the physical route for lightpath p,
and 0 otherwise.
dl,k j:
Distance traveled by lightpath l when he used channel
k and its present status is node j.
MNORl: Maximum number of regeneration allowed for
lightpath l
4) Simulation Setup and System Requirement Tool
Information
For performing the experiment we use Linux based
operating system fedora 20.
System hardware specification is as follow.
TABLE 3. SYSTEM SPECIFICATIONS

Hardware
RAM
PROCESSOR

Specification
4 GB
I-7

SCIP: Solving Constraint Integer Programs is a mixed

integer programming solver and a framework for Branch and
bound developed at Zuse Institute Berlin. http://scip.zib.de/
5) Proposed Formulation/Algorithm
ILP formulation for static RWA problem. The main
objective is to maximize the lightpath over l, where l represents
the lth lightpath of the set.

Remark: ensure that if channel is assign to other lightpath

then one of remaining wavelength should be assign to this
lightpath.
Wavelength continuity constraints within the same segment
as well as segment length should not be reach to optical
reach(in previous formulation it was mentioned explicitly)
because distance traveled by a particular lightpath is initialize
with 0
7. Define continuous variable for keep track of distance
Sl(j)fl(i,j).
6) Nature for Running Complexity of Formulation
ILP formulation and RWA both fall in the category of NPhard problem [24].
7) Performance and Result of Formulation
In this section, we present the simulation result for our static
RWA formulation. Number of regenerators at regenerators node
is assign on the basis of indegree and outdegree of edge. i.e.
Except the NSFNET if other topology is taken for experiment
then list of node is being selected on total indegree + outdegree.
Top 20% of the node will be act as Rn.
Number of regenerators will be uniform in nature in a way
that each consecutive node in list will get 1 less number of
regenerators. Upper bound of regenerators will be based on hit
& try.
For our 1st simulation 14-node NSFNET is taken with Rmax
=3000(initially) and 64 channel per fiber. Number of lightpath
|L|= multiple of 50.

Fig. 7. Result of existing ILP[13] on common dataset

REFERENCES
[1]
[2]
[3]

[4]

[5]
Fig. 8. Experimental result of proposed formulation.

Here in Fig. 7 we can see that for Rmax =2500 ,the exixting
ILP not able to generate because in ILP number of variables
and constraints grows exponentially and due to this exiting
formulation give segmentation fault after almost 6 hour of
operation. But in our approach we dont try to keep record by
defining variables in formula instead of this we keep track these
manually that why in Fig.8 somehow we able to perform for
more numbers.

[6]

[7]

[8]
[9]
[10]

[11]

[12]

[13]
Fig. 9. Show the difference in variables for R=3000

But here is the limitation both existing and proposed method

not able to give optimal result for more than 300 lightpath for
Rmax=3000 even asthis can be seen in Fig. 9.
IV. CONCLUSION AND FUTURE SCOPE
In this work, we had presented an ILP formulation for
solving the RWA problem, for a given set of lightpath demands,
in translucent WDM networks with sparse regenerators.
We have discussed objectives maximizing the number of
lightpaths established, if sufficient resources are not available.
Therefore, using ILP formulations that can generate optimal
solutions in a reasonable amount of time is a useful and
attractive option.
For different numbers of regenerators the resultant value
remains same.it is because in this formulation if lightpath need
regeneration it will either regenerate or drop at that time &
reconsider when all setup complete.
Here are some highlights which can be scope for future
work:
Number of regenerators taken randomly so
formulation can be possible for Rnode as well as
numbers of regenerators.

It may be possible that optimal number of

Regenerators can increase operation for large data set.

[14]

[15]

[16]

[17]

[18]

[19]

[20]

George N. Rouskas, Routing and Wavelength Assignment in

Optical WDM Networks, North Carolina State University.
C.Murthy and M.Gurusamy, \WDM optical networks, concepts,
design and algorithms," Prentice Hall, pp.67-69, 85-90, 2001
P. C. Becker, N. A. Olsson, J. R. Simpson, \Erbium-doped Fiber
Amplifiers: Fundaments and Technology," Academic Press,
pp.266, 1999.
Y. Huang, P. Heritage and B. Mukherjee, \Connection
provisioning with transmission impairment consideration in
optical WDM networks with high-speed channels," Journal of
Lightwave Technology, vol.23, no.3, March 2005.
R. Sabella and P. Iovanna, \Traffic engineering in next
generation multilayer networks based on the GMPLS
paradigm," Proc. HETNETs `04, West Yorkshire, U.K, July
2004.
H. Zang, J. P. Jue, and B. Mukherjee. A review of routing and
wavelength assignment approaches for wavelength-routed
optical WDM networks. Optical Networks, 1(1):47{60, January
2000.
Wenhao Lin, Doctor of Philosophy: PHYSICALLY AWARE
AGILE OPTICAL NETWORKS, Bozeman, Montana, July
2008.
G. P. Agrawal,G. P. Agrawal, \Fiber-optical Communication
Systems," 3th edition, Wiley-Interscience, pp.345, 2002.
D. K. Mynbaev and L. L. Scheiner, \Fiber-optical
Communications Technology," Prentice Hall, pp.617, 2001.
Jaumard, Brigitte, et al. "Ilp formulations and optimal solutions
for the rwa problem." global telecommunications conference,
2004. Globecom'04. IEEE. Vol. 3. IEEE, 2004.
APPLIED INTEGER PROGRAMMING Modeling and
Solution DER-SAN CHEN The University of Alabama
ROBERT G. BATSON The University of Alabama YU DANG
Quickparts.com, Inc. JOHN WILEY & SONS, INC.,
PUBLICATION
Ramamurthy, B., Feng, H., Datta, D., Heritage, J.P., Mukherjee,
B.: Transparent vs. opaque vs. translucent wavelength-routed
optical networks. Optical Fiber Communication Conference,
OFC/IOOC. Vol. 1, pp. 5961 (1999)
Morea, A., Nakajima, H., Chacon, L., Le Louedec, Y., Sebille,
J.P.: Impact of the reach distance of WDM systems on the cost
of translucent optical transport networks. Telecommunications
Network Strategy and Planning Symposium. Networks, pp.
321325 (2004)
Shen, G., Tucker, R.S.: Translucent optical networks: the way
forward [Topics in optical communications]. Commun. Mag.
IEEE. 45(2), 4854 (2007)
Ramamurthy, B., Yaragorla, S., Yang, X.: Translucent optical
WDM networks for the next-generation backbone networks.
Global Telecommunications Conference, GLOBECOM c601.
Vol. 1, pp. 6064 (2001)
Shen, G., Grover, W.D., Cheng, T.H., Bose, S.K.: Sparse
placement of electronic switching nodes for low-blocking in
translucent optical networks. OSA J. Opt. Netw. 1(12), 424441
(2002)
Ye, Y., Chai, T.Y, Cheng, T.H., Lu, C.: Algorithms for the
design of WDM translucent optical networks. Opt. Express.
11(22), 2917 (2002)
Shinomiya, N., Hoshida, T., Akiyama, Y., Nakashima, H.,
Terahara, T.: Hybrid link/path-based design for translucent
photonic network dimensioning. J. Lightwave Technol. 25(10),
2931 2941 (2007)
Yang, X., Ramamurthy, B.: Sparse regeneration in translucent
wavelength-routed optical networks: architecture, network
design and wavelength routing. Photonic Netw. Commun.
10(1), 3953 (2005)
Rumley, S., Gaumier, C.: Cost aware design of
translucentWDM transport networks. Transparent Optical
Networks, ICTON. pp. 14 (2009)

[21] Pan, Z., Chatelain, B., Plant, D. V., Gagnon, F.,

Tremblay, C., Bernier, E.: Tabu search optimization in
translucent network regenerator allocation. Broadband

Communications, Networks and

Broadnets 2008. pp. 627631 (2008)

Systems,

2008.

[22] Manousakis, K., Christodoulopoulos, K., Kamitsas, E.,

Tomkos,I., Varvarigos, E.A.: Offline impairment-aware routing
and wavelength assignment algorithms in translucent WDM
optical networks. J. Lightwave Technol. 27(12), 1866
1877(2009)
[23] Yang, X., Shen, L., Ramamurthy, B.: Survivable lightpath
provisioning in WDM mesh networks under shared path
protection and signal quality constraints. J. Lightwave Technol.
23(4), 15561567 (2005)
[24] Chen, Ying, Ataul Bari, And Arunita Jaekel, "Optimal
Regenerator Assignment And Resource Allocation Strategies
For Translucent Optical Networks" Photonic Network
Communications 23.1 (2012): 16-24
[25] R. M. Krishnaswamy, K. N. Sivarajan, Design of Logical
Topologies: A Linear Formulation For Wavelength Routed

Optical Network With No Wavelength Changers, IEEE/ACM

Trans. Networking, PP. 186198, APR. 2001
[26] OZDAGLAR, ASUMAN E., AND DIMITRI P. BERTSEKAS. "ROUTING
AND WAVELENGTH ASSIGNMENT IN OPTICAL NETWORKS."
IEEE/ACM TRANSACTIONS ON NETWORKING (TON) 11.2
(2003): 259-272.
[27] D. BANERJEE,B.MUKHERJEE,A PRACTICAL APPROACHFOR

[28]

[29]

ROUTING
AND
WAVELENGTH
ASSIGNMENT
IN
LARGE
WAVELENGTH-ROUTED OPTICAL NET-WORKS,IEEE JOURNAL ON
SELECTED AREAS IN COMMUNICATIONS14(1996)903908
R. RAMASWAMI AND K. N. SIVARA JAN. ROUTING AND
WAVELENGTH ASSIGNMENT IN ALL-OPTICAL NETWORKS. IEEE/A
CM TRANSACTIONS ON NETWORKING, 3: 489-500, 1995.
T. LEE, K. LEE AND S. P ARK. OPTIMAL ROUTING AND
WAVELENGTH ASSIGNMENT IN WDM RING NETWORKS. IEEE
JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 18(10):

2146-2154, 2000.