1. 11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University j-katou@nal.ics.es.osaka-u.ac.jp

2. 11/02/2001Workshop on Optical Networking2 Background Protection : backup paths are prepared for each primary lightpath for recovery from a failure Many researchers have proposed several logical topology design algorithms with protection. – example objective ： minimize # of wavelength 、 minimize the blocking rate few research mention the quality of protection  QoP (Quality of Protection) one realization of QoS suitable to the WDM network QoS for failure tolerance Dr. O. Gerstel propose probability-based QoP  SLSP (Short Leap Shared Protection) Dr. Pin-Han. Ho propose a protection method he propose new QoP based on the length of protection paths

3. 11/02/2001Workshop on Optical Networking3 SLSP : Short Leap Shared Protection SLSP Sample Model  configure the length of protection paths by selecting the end nodes for each protection path to satisfy the required QoP  Original SLSP require QoP to determine the maximum length of protection paths for each primary lightpath  Our Proposal set QoP as a QoS to determine the maximum recovery time for each primary lightpath propose logical topology with SLSP design algorithm which can deal with our proposed QoP

4. 11/02/2001Workshop on Optical Networking4 Recovery time modeling mm+1nn-1n+1m-1 Protection Path Px : ｈ hops propagation delay of the segment covered by Px : Dp Recovery time of segment (m, n) = DpDp D node × ｈ D conf + + Maximum failure detection time path configuration time path switching time D conf D node

5. 11/02/2001Workshop on Optical Networking5 Proposed QoS considering recovery time D min ： minimum waiting time to recover from a failure D scale : step-width of the recovery time be determined properly for each network environment QoP n D min + (n-1)×D scale  Each path connection between node pairs require QoP For all segment(m,n) of primary path Recovery time of segment (m, n) DpDp D node × ｈ D conf + +

6. 11/02/2001Workshop on Optical Networking6 First Fit wavelength assignment method assign paths to the assignable wavelength with the smallest index of λ λ0 λ1 λ2 available Wavelength not available Wavelength not available available assign

7. 11/02/2001Workshop on Optical Networking7 Max Share wavelength assignment method λ0 λ1 λ2 cost ２ ０ １ assign newly-used W shared W assign paths to maximize the number of shared wavelength cannel by protection paths Cost : the number of newly-used wavelength cannel by protection paths

8. 11/02/2001Workshop on Optical Networking8 proposed Logical Topology Design Algorithms  Propose 2 Algorithms  Protection Method both algorithms use SLSP  Routing of primary and protection path both algorithms use shortest path between each each node pair for primary lightpath both algorithms use shortestpath between selected end nodes for protection path  Wavelength Assignment Method Algorithm 1 use First Fit Algorithm 2 use Max Share

9. 11/02/2001Workshop on Optical Networking9 Evaluation Model  Network model ： NSFNET(14nodes, 21links)  Traffic matrix ： 0.1-20.0Gbps real traffic trace value  Wavelength capacity ： 10Gbps / wavelength  QoP ： set 1 to ∞ for each node pair  Performance metric ： # of necessary wavelengths D min minimum waiting time for the recovery10ms D scale step-width of the QoP2ms D node path configuration time at each node1ms D conf path switching time0ms

10. 11/02/2001Workshop on Optical Networking10 Evaluation1 : QoP vs # of necessary wavelengths assigned by First Fit 0 10 20 30 40 50 60 2468101214161820 # of necessary Wavelength QoP: Quality of Protection  QoP requirement for each node pairs is set identically High QoPLow QoP the number of necessary wavelengths is  decreasing according to the decreasing of the QoP level  fixed at low QoP  dropping at QoP4 and not showing simple decrease at high QoP

11. 11/02/2001Workshop on Optical Networking11 Evaluation1 : the reason for the dropping of the # of necessary wavelengths There are some node pairs not to satisfy the required QoP REASON lack of route for protection path which is enough short to satisfy the required QoP we call this blocking In this case, only primary path is set up

12. 11/02/2001Workshop on Optical Networking12 Evaluation2 : comparison of two wavelength assignment method 0 100 200 300 400 500 600 700 800 900 1000 1020304050607080 # of Wavelength Traffic scale α First Fit Max Share  randomly set QoP requirement for each node pairs  given traffic ： traffic matrix multiplied by α proposed algorithm 2 needs less # of wavelengths algorithm 2 tries to share wavelength by more protection paths than algorithm 1

13. 11/02/2001Workshop on Optical Networking13 Conclusions and future works  Conclusions – propose QoP considering the recovery time form failure – propose two logical topology design algorithms with QoP – show the relationship between QoP and the number of necessary wavelengths – algorithm 2 show effective utilization of wavelengths  Future works – evaluations under non-blocking condition – to gain the performance by changing the routing of paths – to design logical topology applying the behavior of upper layer protocol (e.g. IP)