Download - Mohammad Reza Faghani
![Page 1: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/1.jpg)
A Review of Routing and Wavelength Assignment
Approaches for Wavelength-Routed
Optical WDM NetworksMohammad Reza Faghani
In the name of God, The Beneficent, The Merciful
![Page 2: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/2.jpg)
Outline
Introduction Static Lightpath Establishment (SLE)
problem Routing Wavelength Assignment Simulation Results Wavelength assignment in distributed
fashion.
![Page 3: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/3.jpg)
Introduction
![Page 4: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/4.jpg)
Wavelength Routed Network Definition
A wavelength routed network consists of WXC (wavelength crossconnect) interconnected by point-point fiber links in any arbitrary topology.
A lightpath is an all-optical communication path between two nodes, established by allocating the same wavelength throughout the route of the transmitted data.
Issues in wavelength routed networks Route and wavelength assignment Centralized Versus Distributed Control
![Page 5: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/5.jpg)
Wavelength-continuity constraint
B
A
CD
E
F
G
HI
J
K
L
M
N
O
1
2
32
1
1
1
OXC
IP SONET
SONET
IP
OXC allows the efficient network management of wavelengths at the optical layer. The variety of functions that it provides are signal monitoring, restoration, provisioning and grooming.
![Page 6: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/6.jpg)
Wavelength Routed Networks Given a set of connections, the problem of setting up
lightpaths by routing and assigning a wavelength to each connection is called the Routing and Wavelength-Assignment (RWA) problem.
Minimize the number of wavelength needed for certain set of connection or Alternatively, maximize the number of connection for a given fixed number of wavelengths.
![Page 7: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/7.jpg)
Connection Requests
Static Lightpath Establishment (SLE) problem Static : The set of connections is known in advance
Dynamic Lightpath Establishment (DLE) problem Incremental : Connection requests arrive
sequentially,a lightpath is established for each connection, and a lightpath remains in the network indefinitely
Dynamic : A lightpath is set up for each connection request as it arrives, and the lightpath is released after some finite amount of time
![Page 8: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/8.jpg)
Static Lightpath Establishment (SLE) problem
![Page 9: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/9.jpg)
Static Lightpath Establishment Characteristic
Lightpath requests are known in advance RWA operations are performed off-line
Objective Min (# of flow each link) Max (# of connections that can be
established)
![Page 10: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/10.jpg)
Static Lightpath Establishment The SLE problem can be formulated as a
linear program or ILP while DLE employs heuristic methods.
SLE can be partitioned into two subproblems Routing Wavelength assignment
Each subproblem can be solved separately
![Page 11: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/11.jpg)
ILP of SLE with wavelength-continuity constraint integer linear program (ILP) objective function
is to minimize the flow in each link, which, in turn, corresponds to minimizing the number of lightpaths passing through a particular link.
![Page 12: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/12.jpg)
ILP of SLE with wavelength-continuity constraint
s,d
sdwij
sdwij
sdw
sdw
sdw
sdw
k
sdwjk
i
sdwij
wds
sdwij
F
F
FF
FF
F
1
1 , 0
otherwise 0
jd if
js if
ij max
such that max : minimize
,,
Number of connection requests.
Number of connection needed.
Number of connection request on any s,d,w
![Page 13: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/13.jpg)
ILP of SLE with wavelength-continuity constraint This approach may be used to obtain the minimum
number of wavelengths required for a given set of connection requests by performing a search on the minimum number of wavelengths in the network.
We can apply the ILP to see if a solution can be found.This procedure is iterated until the minimum number of wavelengths is found.
the next ILP is used for maximizing the number of established connections for a fixed number of wavelengths
![Page 14: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/14.jpg)
ILP of SLE with wavelength-continuity constraint (cont.)
sdii
TW
LWT
sd
N
iO
Niqm
ACm
BC
WjPic
Nim
mqC
ij
i
sd
i
,...,2,1 ,
1
1
,...,2,1 ,,...,2,1 1,0
,...,2,1 integer, ,0
),( : Maximize1
![Page 15: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/15.jpg)
ILP of SLE with wavelength conversion the wavelength-continuity constraint can be
eliminated if we use wavelength converters to convert one wavelength on into another at an intermediate node before forwarding it to the next link.
wavelength conversion may improve the
efficiency by resolving the wavelength conflicts. This method can also be formulated using ILP.
![Page 16: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/16.jpg)
ILP of SLE with wavelength conversion
otherwise 0
jd if
js if
ij max
such that max : minimize
,
sd
sd
k
sdjk
i
sdij
ds
sdij
FF
FF
F
![Page 17: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/17.jpg)
ILP of SLE with wavelength conversion full wavelength conversion in the network
may not be preferred and may not even be necessary due to high costs and limited performance gains.
a subset of the nodes may allows wavelength conversion, or a node employs converters that can only convert to a limited range of wavelenghts.
Some Problem may arise due to limited conversions.
![Page 18: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/18.jpg)
Limited wavelength conversion Sparse location of wavelength converters
in network Place few converters in an arbitrary network Where Optimally to place ?
Sharing of converters Switch architectures that allow sharing of converters
among the various signals. Performance Saturates as no. of converters increases. Routing Dependent
Limited-range wavelength conversion Range is limited to k i max(i-k,1) through min(i+k,w)
![Page 19: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/19.jpg)
Routing
![Page 20: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/20.jpg)
Routing
Both SLE and DLE use three basic approches for routing. Fixed Routing Fixed Alternate Routing Adaptive Routing
Fixed Routing is Simplest, Adaptive yields the Best performance. Alternate offers Tradeoff.
![Page 21: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/21.jpg)
Fixed Routing
Always choose the same fixed route for a given source-destination pair
Ex: fixed shortest-path routing Dijkstra’s algorithm Bellman-Ford algorithm
Disadvantage Hign blocking probability in the dynamic case Unable to handle fault situation (altPath,Dyn)
![Page 22: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/22.jpg)
Fixed Routing
Fixed shortest path route from node 0 to 2.
![Page 23: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/23.jpg)
Fixed-Alternate Routing
Each node is required to maintain a routing table that contains an ordered list of a number of fixed routes to each destination node
A primary route between s-d is defined as the first route
An alternative route doesn’t share any links with the first route (link disjoint)
Advantage Provide some degree of fault tolerance Reduce the blocking probability compared to fixed
routing
![Page 24: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/24.jpg)
Fixed-Alternate Routing
Primary (Solid) and Alternate (Dashed) routes form node 0 to 2
![Page 25: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/25.jpg)
Adaptive Routing
The route from a source node to a destination node is chosen dynamically, depending on the network state
Ex: Shortest-cost-path routing Least-congestion-path routing
Congestion is measured by available wavelengths Advantage
Lower connection blocking than fixed and fixed-alternate routing
![Page 26: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/26.jpg)
Adaptive Routing
shortest-cost-path routing, well-suited for use in wavelength-converted networks.
Each unused link has a cost of 1 unit, each used link has a cost of ∞, and each wavelength-converter link has a cost of c units.
If wavelength conversion is not available, c = ∞. When a connection arrives, the shortest-cost
path between the source node and the destination node is determined.
![Page 27: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/27.jpg)
Adaptive Routing
Adaptive shortest cost path route from node 0 to 2.
![Page 28: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/28.jpg)
Consider fault-tolerant
Protection Set up two link/node-disjoint lightpaths Primary lightpath transmit data Backup lightpath must be reserved Fast but need reserve resource
Restoration The backup path is determined dynamically
after the failure has occurred Slow but doesn't need reserve resource
![Page 29: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/29.jpg)
Wavelength Assignment
![Page 30: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/30.jpg)
Static Wavelength-Assignment Minimizing the number of wavelengths
used in wavelength-continuity constraint, reduced to the graph coloring problem Construct an auxiliary graph G(V,E) Color the nodes of the graph G
Largest First Smallest Last
![Page 31: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/31.jpg)
Static Wavelength-Assignment (cont.)
Network With 8 routed Lightpath
Auxiliary Graph.
![Page 32: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/32.jpg)
Largest First
![Page 33: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/33.jpg)
Smallest Last
![Page 34: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/34.jpg)
Dynamic or Incremental Wavelength Assignment Heuristics For the case in which lightpaths arrive one at
a time (either incremental or dynamic traffic), heuristic methods must be used to assign wavelengths to lightpaths.
In dynamic problem, we assume that the number of wavelengths is fixed (as in practical situations), and we attempt to minimize connection blocking.
![Page 35: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/35.jpg)
Dynamic or Incremental Wavelength Assignment Heuristics Random Wavelength Assignment (R) First-Fit (FF) Least-Used (LU)/SPREAD Most-Used (MU)/PACK Min-Product (MP) Least-Loaded (LL) MAX-SUM (MΣ) Relative Capacity Loss (RCL) Distributed Relative Capacity Loss (DRCL) Wavelength Reservation (Rsv) Protecting Threshold (Thr)
![Page 36: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/36.jpg)
Wavelength-usage pattern Consider P1(2,4) and three potential paths
that share common link P2(1,5) P3(3,6) P4(0,3).
![Page 37: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/37.jpg)
Random Wavelength Assignment (R) First searches the space of wavelengths
to determine the set of all wavelengths that are available on the required route
Among the available wavelengths, one is chosen randomly
Advantage NO communication overhead
![Page 38: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/38.jpg)
First-Fit (FF)
When searching for available wavelengths, a lower-numbered wavelength is considered before a higher-numbered wavelength
The first available wavelength is then selected
Advantage Computation cost is lower No communication overhead
![Page 39: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/39.jpg)
FF example
λ0 will be assigned λ0 will also be assigned MP and LL as single
fiber.
![Page 40: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/40.jpg)
Least-Used (LU)/SPREAD
LU selects the wavelength that is the least used in the network, thereby attempting to balance the load among all the wavelengths
Disadvantage Additional communication overhead
![Page 41: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/41.jpg)
LU example
λ0 ,λ1 ,λ3 are each used two links λ2 is used only one link So LU will choose λ2
![Page 42: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/42.jpg)
Most-Used (MU)/PACK
MU selects the most-used wavelength in the network
Packing connections into fewer wavelengths
Advantage Overhead is similar to LU but MU
outperforms LU and FF Outperforms LU (fewer wavelength used).
![Page 43: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/43.jpg)
MU example
λ0 ,λ1 ,λ3 are each used two links λ2 is used only one link So MU will choose one of λ0 ,λ1 ,λ3 with equal
probability.
![Page 44: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/44.jpg)
Min-Product (MP)
MP is used in multi-fiber network In a Single Fiber , MP becomes FF. The goal of MP is to pack wavelengths into
fibers )(
minpl
ljD
Dlj indicates the number of assigned fibers on link l and wavelength j. MP does it for all j.
π(p): Set of links comprising path p.
![Page 45: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/45.jpg)
MP example
0 1 2 3 4 5
λ1=2
λ2=3
λ3=1
λ1=3
λ2=2
λ3=2
λ1=1
λ2=4
λ3=1
λ1=3
λ2=1
λ3=2
λ1=5
λ2=2
λ3=1
λ1 : 2*3*1*3*5=90
λ2 : 3*2*4*1*2=48
λ3 : 1*2*1*2*1=4
So choose λ3 for path 0 to 5.
![Page 46: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/46.jpg)
Least-Loaded (LL)
LL is also used in multi-fiber network To select the wavelength that has the largest
residual capacity on the most-loaded link along route p
)(minmax)(
ljlplSpj
DM
Ml: Number of fibers on link l. Sp: Set of available wavelengths along the selected paths
p.
![Page 47: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/47.jpg)
LL example
0 1 2 3 4 5
Assume 7 fibers per link
λ1=2(5)
λ2=3(4)
λ3=1(6)
λ1=3(4)
λ2=2(5)
λ3=2(5)
λ1=1(6)
λ2=4(3)
λ3=1(6)
λ1=3(4)
λ2=1(6)
λ3=2(5)
λ1=5(2)
λ2=2(5)
λ3=1(6)Set up lightpath from 0 to 2
Choose λ3 Max(min(residual capacity))=5
![Page 48: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/48.jpg)
MAX-SUM (MΣ)
MΣ considers all possible paths in the network and attempts to maximize the remaining path capacities after lightpath establishment.
Applied to both single and multi-fiber Networks
Pp
W
jpl
pl
ljl
pjR
jlrpR
jlrjpr
DMjlr
)),('( maximize that jh wavelengt thechoose
),,(min),(
),,(min),,(
)(),,(
1)(
)(
![Page 49: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/49.jpg)
MΣexample
Choosing λ0 will block path P4
λ2 has the highest capacity loss
What about choosing λ0 ?
![Page 50: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/50.jpg)
RCL attempts to improve on MΣ by taking into consideration the number of available alternate wavelengths for each potential future connection.
MΣ
RCL
Relative Capacity Loss (RCL)
Pp
jprpjrjpR ),,(/))),('(),,'((min
Pp
pjrjpr ))),('(),,'((min
![Page 51: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/51.jpg)
RCL example
Choosing the Wavelength with smallest Total RCL.
![Page 52: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/52.jpg)
Distributed Relative Capacity Loss (DRCL) MΣ and RCL are difficult and expensive to
implement in a distributed environment.
MΣ and RCL both require fixed routing, which makes it difficult to improve network performance.
Two Problem of implementation. how is information of network state exchanged? how can we reduce the amount of calculation upon
receiving a connection request?
![Page 53: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/53.jpg)
Distributed Relative Capacity Loss (DRCL) Speed up the wavelength-assignment
procedure each node stores information on the
capacity loss on each wavelength. only table lookup. (w,d,rcl(w,d)) small amount of calculation are required
upon the arrival of a connection request. Routing is implemented using the Bellman-
Ford (each node exchange table with its neighboring nodes and updates its table).
![Page 54: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/54.jpg)
Distributed Relative Capacity Loss (DRCL) (cont.)
DRCL considers all of the paths from the source node of the arriving connection request to every other node ,excluding the destination node of the arriving connection request.
DRCL choose the wavelength that minimize the sum of rcl(w,d) over all possible destination d.
![Page 55: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/55.jpg)
Distributed Relative Capacity Loss (DRCL) (cont.) If there is no path from node s to node d on
wavelength w, then rcl(w,d) = 0
If there is a direct link from node s to node d, and the path from s to d on wavelength w is routed through this link, then rcl(w,d) = 1/k, where k is the number of available wavelengths on this link through which s can reach.
![Page 56: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/56.jpg)
DRCL exampleWe have to Calculate RCL for (2,0)(2,1),(2,3),(2,5) and (2,6).
(2,0) can only be established on λ0.
(2,1) can establish on three wavelengths giving the RCL value of 1/3and so on.
These entry are calculated just usingthe RCL table of Adjacent nodes.
![Page 57: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/57.jpg)
Wavelength Reservation (Rsv)λ1 is always reserved on link (1,2) for traffics of node 0 to
node 3.So node 1 cannot connect to node 2 using λ1.
![Page 58: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/58.jpg)
Wavelength Reservation (Rsv) A given wavelength on a specified link
is reserved for a traffic stream, usually a multihop stream
To protect only the connections that traverse multihop connections.
Must be combined with other wavelength-assignment scheme.
![Page 59: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/59.jpg)
Simulation Results
![Page 60: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/60.jpg)
Simulation Results
Comparison of Random, FF, LU,MU, Max-Sum, andRCL for single-fiber network with 16 wavelengths.
![Page 61: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/61.jpg)
Simulation Results
Comparison of Random, FF, LU,MU, LL, Max-Sum,and RCL for two-fiber network with 8 wavelengths.
![Page 62: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/62.jpg)
Simulation Results
In the single-fiber case, MU is found to achieve the best performance under low load while MΣ and RCL work well when the load is high ( ≥ 50 Erlangs), with the other approaches not that far behind.
When the number of fibers per link is two (M = 2), MU, MP, and RCL perform well under low load, while LL and MΣ offer better performance under a higher load.
![Page 63: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/63.jpg)
Simulation Results
Comparison of Random, FF, LU, MU, MP, LL,Max-Sum, and RCL for four-fiber network with 4 wavelengths. LL performs better.
![Page 64: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/64.jpg)
Simulation Results
Comparison of DRCL, FF with adaptive routing, RCL(which can only be implemented with fixed routing), and FF withfixed routing.
![Page 65: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/65.jpg)
Simulation Results
Note that RCL cannot be implemented with adaptive routing.
DRCL slightly outperforms FF (with adaptive routing) in the reasonable region, which is 45-65 Erlangs in this network, and they both perform better than RCL and FF with fixed routing.
![Page 66: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/66.jpg)
Simulation Results
Overall, it appears that the routing scheme has much more of an impact on the performance of the system than the wavelength-assignment scheme.
It is important to first decide on a good routing mechanism, and then to choose a wavelength-assignment scheme that can easily be implemented in conjunction with the selected routing mechanism.
![Page 67: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/67.jpg)
References
[1] H. Zang et al A Review of Routing and Wavelength Assignment Approaches for Wavelength Routed Optical WDM Networks, Optical Networking Magazine, IEEE Jan 2000
![Page 68: Mohammad Reza Faghani](https://reader035.vdocuments.site/reader035/viewer/2022062309/5681584e550346895dc5ab09/html5/thumbnails/68.jpg)
Thanks to Audiences