Improving Double Link Failure Tolerance in Optical Networks Using P-Cycles

Improving Double Link Failure Tolerance in Optical Networks Using P-Cycles

Improving Double Link Failure Tolerance in Optical Networks using p-Cycles A Thesis Submitted in Partial Fulfilment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY by PALLAVI ATHE to the DEPARTMENT OF ELECTRICAL ENGINEERING INDIAN INSTITUTE OF TECHNOLOGY KANPUR January, 2018 CERTIFICATE It is certified that the work contained in the thesis entitled " Improving Double Link Failure Tolerance in Optical Networks using p-Cycles,, being submitted by Pallavi Athe has been carried out under my supervision. In my opinion, the thesis has reached the standard fulfilling the requirement of regulation of the Ph.D. degree. The results embodied in this thesis have not been submitted elsewhere for the award of any degree or diploma. Professor Department of Electrical Engineering Indian Institute of Technology Kanpur January,2018 Kanpur, INDIA Synopsis Name of the Student : Pallavi Athe Roll Number : 10204070 Degree for which submitted : Ph.D. Department : Electrical Engineering Thesis Title : Improving Double Link Failure Tolerance in Optical Networks using p-Cycles Thesis Supervisor : Dr. Yatindra Nath Singh Month and year of submission : Jan, 2018 Optical networks are high speed networks, built using fiber optic communication systems and dense wave division multiplexing(DWDM) technology and are capable of using huge bandwidth available in optical fiber. Optical network forms the major part of Internet backbone and carries enormous information. A link or node failure even for a few minutes can cause huge loss of data and hence the revenue. After such failure, the ability of network to maintain service is known as its survivability. Designing a sur- vivable optical network having fast recovery from failures with least possible redundant resources has been an area of extensive research. Single link failure has been explored extensively. Double link failure protection has also gained interest due to significant probability of two simultaneous link failures. The double link protection optimization problem has higher complexity, since large numbers of variables are involved as com- pared to the single link protection. One of the efficient option for achieving double link survivability could be use of pre- iv configured cycles (p-cycles). They provide the speed of ring protection and capacity efficiency of mesh based protection schemes. In this work we have proposed three dif- ferent p-cycle based protection methods to protect an optical network from two-link failures. We have also proposed the concept of impact zone which quantifies the loss of protection in a network after first link failure and used it to improve the double link failure protection of the optical network. The work has been organized in chapters 1 through 6 in the present thesis. Chapter 1 describes the evolution of present telecommunication networks. A brief de- scription of optical networks and technology advancements in them from first through the fifth generation have been described in this chapter. Architectures of communica- tion networks based on geography and technology have been presented, which illustrate the place and importance of optical networks in the communication network. In Chapter 2, various survivability schemes for optical networks have been reviewed. P-cycles is the most promising method of link protection due to high recovery speed as well as spare capacity efficiency. Different kinds of protections which can be provided by p-cycles have been described in this chapter. Various methods to form and implement p-cycles in optical networks are also described in this chapter. Multiple failure scenarios in the network with the importance of double link protection have also been studied. Chapter 2 also presents a brief literature review on double link failure survivability techniques. Improved double cycle method (IDB) which is an improvement over double cycle method has been introduced in Chapter 3. DB and IDB methods use a pair of p-cycles for each link to protect the optical network from two link failures. In IDB method pri- ority is assigned to each p-cycle within the pairs to protect the link. The strategy of assigning priorities among the p-cycles of the pair reduces the number of variables and constraints which are required to formulate the integer linear program (ILP) of IDB. SYNOPSIS v Thus, the number of variables and constraints becomes much less than what is needed in DB method. We observed that the spare capacity efficiency and time required to solve the ILP reduces for IDB method. In Chapter 4 link pair method (LPM) and Single p-cycle (SG) method for double link protection have been introduced. In the LPM all the possible pairs of links in the optical network are considered, and p-cycles are selected from the non-intersecting set of cycles for each pair of links. We also observed that LPM requires less computational resources as compared to both DB and IDB method. Single p-cycle (SG) method, which uses one p-cycle to protect a link from two simultaneous link failures, is also introduced in this thesis. SG method is also able to compute the spare capacity of large networks for which DB method fails, because number of variables required for the SG method is O(L:P ) while DB method requires O(L:P 2) variables (where L and P represents the number of links and the number of cycles respectively for a given network). Also, ILP of the SG method is simpler than for any other two-link failure protection method. Consequently, the time required in the ILP formulation and ILP solution is significantly less. An optical network designed for single link failure also has some inherent double link failure survivability. In Chapter 5, we have defined impact zone which mathemati- cally represents the effect of the link failure on the network protection capacity. Various methods are then proposed and analyzed to reduce the impact zone, which leads to in- crease in double link failure survivability of the network. Finally, conclusion, future scope and contributions of the present thesis is given in Chapter 6. Dedicated to My Family Acknowledgements This thesis has become a reality with the kind support and help of many individ- uals. I would like to express my sincere thanks to all of them. I want to express my heartfelt gratitude to my thesis supervisor Professor Y. N. Singh for his guidance, encouragement and support throughout the course of my work. His expertise in the field and faith in my work motivated me and helped me at every stage of this research. I have learned and grown a lot under his guidance. I am grateful to Dr. Rachna Asthana for helping me start my thesis work. Her research in the field of survivable optical network enabled me to build the foundation of my thesis work. I am grateful to all the faculty members of the I.I.T. Kanpur for the invaluable knowl- edge they imparted to me during my academic program and the time of association with them as a teaching assistant. I owe my sincere gratitude to Dr. Prabhat Munshi and Sangita Ma'am for their loving support and help at the most needed time. Word fail to express my appreciation to Dr. Vandana Singh for her generous care, homely feeling and the lively company on various occasions. I have been fortunate to have wonderful colleagues Varsha, Anjali, Rashmi, Ramesh- viii Acknowledgements war, Gaurav, Sateesh, Sateeshkrishna, Anupam, Nitin, Amit who creates a pleasant and supportive environment. The time spent with them at canteen were delightful. I am especially thankful to Gaurav and Sateesh for the discussions which helped me solve mathematical glitches encountered during my thesis work. My long stay at IITK would not have been possible without the friends I made here. I am grateful to hall mates, hall workers, Taekwondo club, members of nature club who made my life most memorable and pleasant here. I would like to express my profound gratitude to Devika, Surendra Sir, Ankur, Parul, Sabah for making me feel at home during my stay. I would like to express my thanks to my friends Mousumi, Swati, Kusumita, Manju, Sushma, Arun, Sowjanya, Deepa, Kavita, Praneet, Gagan, Esha, Bushra, Aditi for all the good moments spent together. I consider myself fortunate to have Ashu, Sanjukta, Amrita, Arpita as my friends who have been a great support during my tough time. There friendship will always be most cherished one for me. Biggest thanks to my family for their incredible love and support. They are the reason I have come so far. (Pallavi Athe ) List of Symbols G(N; L) Bidirectional graph with N number of nodes and L number of links. < k > Average node degree. S Set of spans, indexed by i. P Set of cycles, indexed by p. ci Cost of unit capacity of link i. np Number of unit capacity copies of p-cycle p. ni;p Number of unit capacity copies of p-cycle p required to protect link i. SE Spare capacity efficiency. wi Working capacity on link i. Qi Set of protection-pairs of link i, indexed as (p; q)i. List of Abbreviations ARPANET Advanced Research Projects Agency Network APS Automatic Protection Switching BLSR Bidirectional line Switched ring CDC Cycle Double Covers DARPA U.S. Defense Advanced Research Project Agency DB Double Cycle Method DCF Dispersion Compensated Fiber DWDM Dense Wavelength division Multiplexing EON Elastic Optical Network FIPP Failure Independent Path Protecting p-cycles FIPP Failure Independent Path Protecting p-cycles HOS Hybrid Optical Switching IDB Improved Double Cycle Method ILP Integer Linear Program IP Internet Protocol IZ Impact Zone LPM Link Pair Method NEPC Node Encircling P-cycles NFV Network Function

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    119 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us