The fault tolerance network analysis of an optical network in case of link failure is done in Matplan WDM software

1. FAULT TOLERANCE AND
PERFORMANCE ANALYSIS OF
OPTICAL WDM NETWORKS
Presented By:
ASHIT CHANDER
1

2. OUTLINE
INTRODUCTION
TERMINOLOGY
CLASSIFICATION OF SCHEMES
LITERATURE REVIEW
PROPOSED WORK
SIMULATION AND RESULTS
CONCLUSION
FUTURE WORK
REFERENCES
2

3. WAVELENGTH DIVISION MULTIPLEXING (WDM) CONCEPT
OVERVIEW
WDM Concept was first published in 1978 and 2 years latter
realised.
In WDM the bandwidth of the fibre is divided into many non-
overlapping channels
INTRODUCTION
[21]
3

4. TERMINOLOGY
Protection
Uses pre-assigned capacity to ensure survivability
Restoration
Reroutes the affected traffic after failure occurrence by using
available capacity
 Survivability
Property of a network to be resilient to failures
[2]
4

5. CLASSIFICATION OF SCHEMES
[6]
5

6. REACTIVE / PROACTIVE:
Reactive
When an existing light path fails, a search is initiated to find a
new light path which does not use the failed components.
(After the failure happens)
It cannot guarantee successful recovery
Longer restoration time
Proactive
Backup light paths are identified and resources are reserved
along the backup light paths during primary light paths
creation.
100% restoration guarantee
Faster recovery
6

7. LINK BASED VS PATH BASED :
Link-based
− Shorter restoration time
− Less efficient.
− Can only fix link failures
• Path-based
– Restoration time is
longer.
– More efficient.
7

8. DEDICATED VS MULTIPLEXED BACKUP:
• Dedicated backup
– More robust
– Less efficient.
• Backup multiplexing
– Less robust
– More efficient.
8

9. PRIMARY BACKUP MULTIPLEXING
Wavelength channel to be shared by a primary paths or more than
one backup paths
9

10. Sr. No. TITLE AUTHOR MERITS DEMERITS
1 Light Restoration in
WDM Optical
Networks
Gurusamy
Mohan, C. Siva
Ram Murthy
• Less restoration
Time
• Promising
architecture
• Carry large traffic
• Face more
failures
• SONET ‘S fast
healing concept
could be applied
2 A Highly Scalable
structure for WDM
Multihop Lightweight
Networks
Wang-Hong Yu • Easy implementation
• Good scalability and
Routing complexity
• Wavelength
reuse could be
used
LITERATURE REVIEW
10

11. 3
A Dynamic
Partitioning Sub-
Path Protection
Routing Technique
in WDM Mesh
Networks
Ajay Todimala,
Byrav
Ramamurthy
• FTPS(fault tolerance
path set) scheme is
proposed
• Results in terms of
down-time are better
than other protection
schemes
4 Performance of
shortest path
algorithm based on
parallel vertex
traversal
Mihailo Vesovic,
Aleksandra
Smiljanic, Dusan
Kostic
• Parallel algorithm’s
proposed in this paper
outperforms
outperforms Bellman
-Ford and Dijkstra
• Less popular
than Bellman-
Ford and
Dijkstra on the
internet
5 Dynamic any cast
Routing and
Wavelength
Assignment in
WDM Networks
Using Ant Colony
Optimization
(ACO)
Kavitha
Bhaskaran , Joan
Triay , Vinod M.
Vokkarane
• Ant colony
optimization based on
the fault localization
mechanism has low
flooding time
• Success rate is better
in tested topology
• Hard to
implement in
real world as the
nodes are
significantly high
11

12. 6
QoS based optical
protocols
A. Durresi ,
V. Krishna , J.S
Innamuri, B.L.
Anderson, R. Jain
• The paper proposes
set of protocols which
decides a threshold
for QoS
7
On traffic
domination in
communication
networks
Walid Ben-Ameur,
Pablo Pavon-
Marino, Michal
Pioro
• Delay of packets
• Congestion of traffic
• Network Utilization's is
better
• Poor connection
are not
considered
which might be
able to transfer
data
8 Routing with
multiple quality-of-
services
constraints: An
approximation
perspective
J.Huang,
X.Huang, Y. Ma
• Algorithm Propose to
reduces time
• Low Complexity
• Preferable Quality
12

13. PROPOSED WORK
This work proposes a fault-tolerant network design having
following features:
• Optimum cost
• Scalability
• High capacity
• Low delay and Latency
• Resource efficient
Tools to used for Simulation:
C, C++, NS-2,MatplanWDM,TOMLAB.
13

14. Simulation And Results
• Software used is MatPlanWDM0.61 simulator
• Comparison between 6 nodes and 12 nodes topologies is done
14

15. 12-Nodes Bidirectional Mesh
Topology
6-Nodes Bidirectional Mesh
Topology
15

16. Testing Topology for Transfer of data in 4 nodes system
Virtual Topology
16

17. Virtual Topology Designed After using shortest path algorithm with
45.45% Utilization for 1—2 node
17

18. Performance Curves for offered Traffic in a 4 node Bidirectional
Network
18

19. Carried/Offered capacity vs Channel Capacity
19

20. Number of used wavelengths Vs Channel Capacity
20

21. Message Propagation Delay Vs Channel Capacity
21

22. Network Congestion Vs Traffic Demands
22

23. Number of Virtual Hops Comparison Between MILP & Testing
Algorithm
23

24. Network Congestion Comparison Between MILP & Testing
Algorithm
24

25. Message propagation Delay Comparison Between MILP & Testing
Algorithm
25

26. Offered Traffic Comparison Between MILP & Testing Algorithm
26

27. Number Of Lightpaths Comparison Between MILP & Testing
Algorithm
27

28. Comparison Of results Between MILP And Testing Algorithm
ALOGORITHM
USED
AVAILABILITY
OF
LIGHTPATHS
NETWORK
CONGESTION
OFFEREED
TRAFFIC PER
HOP
NUMBER OF
VIRTUAL PATH
AVAILABLE IN
CASE OF
FAILURE
MESSAGE
PROPAGATION
DELAY
MILP
ALOGORITHM
More and
constant
lightpath‘s
Remains
fixed as the
hop count
increase.
All resources
available for
each hop.
More paths. More delay
TESTING
ALGORITHM
Less number
of lightpath’s
available
Increase
with increase
in hops.
Declines as
the hop
counts
increase and
becomes
constant
after critical
value.
Less number
of paths.
Less delay
28

29. Conclusion
• The number of nodes increased leads to decrease in delay
• Network congestion increase with increase in number of nodes
• Lightpaths also increase with increase with number of nodes
• The traffic at each node decreases as the number of nodes
increases in an network.
29

30. Future Work
• In future work ,the intent would be to work on topologies with
Link failure and to find a reliable cost efficient network .
30

31. REFERENCES
[1] wikipedia.org/wiki/Wavelength-division_multiplexing
[2] https://www.itu.int/rec/T-REC-G.872-201210-I/en
[3] B. Mukherjee,’’WDM Optical Communication Networks: Progress and Challenges” IEEE
Journal on Selected Areas in Communications, Vol. 18,Issue: 10, pp1810 - 1824, 2000.
[4] R.Plestys, A.Siurkus,“Information transmission availability in WDM networks”, 28th
International Conference on Information Technology Interfaces, pp: 639 - 644 ,2006
[5] Kavitha Bhaskaran, oan Triay, Vinod M. Vokkarane, “Dynamic ,”Any cast Routing and
Wavelength Assignment in WDM Networks Using Ant Colony Optimization
(ACO)”,Communications (ICC), 2011 IEEE International Conference 2011.
[6] Ajay Todimala and Byrav Ramamurthy, “A Dynamic Partitioning Sub-Path Protection
Routing Technique in WDM Mesh Networks”, ICCC '02 Proceedings of the 15th
international conference on Computer communication, pp- 327-340 , 2002
[7] Network Reliability and Fault Tolerance Muriel Médard medard@mit.edu Laboratory for
Information and Decision Systems, Massachusetts Institute of Technology*6999/*
[8] Vesović, Mihailo; Smiljanić, Aleksandra; Kostić, Dušan, “Performance of Shortest Path
Algorithm Based on Parallel Vertex Traversal” ,Serbian Journal of Electrical Engineering .
Vol. 13 Issue 1, pp 31-43, Feb2016
[9] George N. Rouskas, “Routing and wavelength assignment in optical WDM network”IEEE
journal, 2007.
31

32. [10] N. Golmie , T. D. Ndousse , and D. H. Su, “A differentiated optical services
model for WDM networks ,“ Communications Magazine, IEEE, vol. 38, no. 2, pp.
68-73, 2000
[11] Zhu, Keyao, and Biswanath Mukherjee, "Traffic grooming in an optical WDM
mesh network," IEEE Journal on selected areas in communications 20.1 (2002):
122-133.
[12] Walid Ben-Ameur1, Pablo Pavon-Marino2, and Michal Pioro3, “On traffic
dominationin communication networks”, 41TELECOM SudParis, 9, rue Charles
Fourier, 2008.
[13] Jing Fang, R. Srinivasan and Arun K. Somani, “Performance analysis of WDM
optical Network with wavelength usage constrain”, journal, 2002.
[14] Durresi, A., Krishna, V., Innamuri, J.S., Anderson, B.L. and Jain, R., 2003,
August. Quality-based optical routing protocol. In ITCom2003 (pp. 410-420).
International Society for Optics and Photonics.
[15] Jing Fang, R. Srinivasan and Arun K. Somani, “Performance analysis of WDM
opticalnetwork with wavelength usage constrain”, journal, 2002
[16] J. Huang, X. Huang, and Y. Ma, “Routing with multiple quality-of-services
constraints: Anapproximation perspective," J. Netw. Comput. Appl., vol. 35, no.
1, pp. 469-479, Jan. 2012
32

33. [17] Tanmay De, Ajit Pal, Indranil Sengupta, “Traffic grooming, routing, and wavelength
assignment in an optical WDM mesh networks based on clique partitioning,” Photonic
Network Communications, 2010, Volume 20, Number 2, Page 101.
[18] Jun Zheng & Hussein T.Mouftah, “Optical WDM networks, concepts and Design”,IEEE
press, John Wiley –Sons, Inc., Publication, p.1-4, 2004
[19] H. Zang, J. P. Jue, and B. Mukherjee, “A Review of Routing and WavelengthAssignment
Approachs for Wavelength-Routed Optical WDMNetworks,” Optical Network Magazine,
pp. 47-59, Jan. 2000 [20] Senior, John M., and M. Yousif Jamro, “Optical fiber
communications: principles and practice”, Pearson Education, 2009.
[21] G. Mohan; C. S. R. Murthy,”Light path Restoration in WDM Optical Networks “, IEEE
Network , Vol.14, Issue: 6, pp.24 - 32, 2000
[2] Hong Yu Wang and Weikang , "Highly scalable interconnection network for parallel image
processing", ISSN 1009- 3095 Journal of Zl~ejiang University(SCIENCE) ,V. 1 ,No.3, pp.
254- 263, 2000
[23] D. Banerjee and B. Mukherjee, “A practical approach for routing and
wavelengthassignment in large wavelength routed optical networks”, IEEE J. Select
AreasCommunication, vol. 14, pp. 903–908, 1996
[24] George N. Rouskas, “Routing and wavelength assignment in optical WDM network”journal,
2007
[25] http://girtel.upct.es/~ppavon/matplanwdm/download.php
[26] http://tomopt.com/tomlab/
33

34. THANK YOU
34