Resilient optical multicasting utilizing cycles in WDM optical networks

High capacity telecommunications of today is possible only because of the presence of optical networks. At the heart of an optical network is an optical fiber whose data carrying capabilities are unparalleled. Multicasting is a form of communication in wavelength division multiplexed (WDM) networks that involves one source and multiple destinations. Light trees, which employ light splitting at various nodes, are used to deliver data to multiple destinations. A fiber cut has been estimated to occur, on an average, once every four days by TEN, a pan-European carrier network. This thesis presents algorithms to make multicast sessions survivable against component failures. We consider multiple link failures and node failures in this work. The two algorithms presented in this thesis use a hybrid approach which is a combination of proactive and reactive approaches to recover from failures. We introduce the novel concept of minimal-hop cycles to tolerate simultaneous multiple link failures in a multicast session. While the first algorithm deals only with multiple link failures, the second algorithm considers the case of node failure and a link failure. Two different versions of the first algorithm have been implemented to thoroughly understand its behavior. Both algorithms were studied through simulators on two different networks, the USA Longhaul network and the NSF network. The input multicast sessions to all our algorithms were generated from power efficient multicast algorithms that make sure the power in the receiving nodes are at acceptable levels. The parameters used to evaluate the performance of our algorithms include computation times, network usage and power efficiency. Two new parameters, namely, recovery times and recovery success probability, have been introduced in this work. To our knowledge, this work is the first to introduce the concept of minimal hop cycles to recover from simultaneous multiple link failures in a multicast session in optical networks

Survivability issues in WDM optical networks

WDM optical networks make it possible for the bandwidth of transport networks to reach a level on which any failures would cause tremendous data loss and affect a lot of users. Thus, survivability issues of WDM optical networks have attracted a lot of research work. Within the scope of this dissertation, two categories of problems are studied, one is survivable mapping from IP topology to WDM topology, the other is p-cycle protection schemes in WDM networks.;Survivable mapping problem can be described as routing IP links on the WDM topology such that the IP topology stays connected under any single link failure in the WDM topology. This problem has been proved to be NP-complete [1]. At first, this dissertation provides a heuristic algorithm to compute approximated solutions for input IP/WDM topologies as an approach to ease the hardness of it. Then, it examines the problem with a different view, to augment the IP topology so that a survivable mapping can be easily computed. This new perspective leads to an extended survivable mapping problem that is originally proposed and analyzed in this dissertation. In addition, this dissertation also presents some interesting open problems for the survivable mapping problem as future work.;Various protection schemes in WDM networks have been explored. This dissertation focuses on methods based on the p-cycle technology. p-Cycle protection inherits the merit of fast restoration from the link-based protection technology while yielding higher efficiency on spare capacity usage [2]. In this dissertation, we first propose an efficient heuristic algorithm that generates a small subset of candidate cycles that guarantee 100% restorability and help to achieve an efficient design. Then, we adapt p-cycle design to accommodate the protection of the failure of a shared risk link group (SRLG). At last, we discuss the problem of establishing survivable connections for dynamic traffic demands using flow p-cycle

Survivable mesh-network design & optimization to support multiple QoP service classes

Every second, vast amounts of data are transferred over communication systems around the world, and as a result, the demands on optical infrastructures are extending beyond the traditional, ring-based architecture. The range of content and services available from the Internet is increasing, and network operations are constantly under pressure to expand their optical networks in order to keep pace with the ever increasing demand for higher speed and more reliable links

A survey of strategies for communication networks to protect against large-scale natural disasters

Recent natural disasters have revealed that emergency networks presently cannot disseminate the necessary disaster information, making it difficult to deploy and coordinate relief operations. These disasters have reinforced the knowledge that telecommunication networks constitute a critical infrastructure of our society, and the urgency in establishing protection mechanisms against disaster-based disruptions

Survivability through pre-configured protection in optical mesh networks

Network survivability is a very important issue, especially in optical networks that carry huge amount of traffic. Network failures which may be caused by human errors, malfunctional systems and natural disaster (eg. Earthquakes and lightening storms), have occurred quite frequently and sometimes with unpredictable consequences. Survivability is defined as the ability of the network to maintain the continuity of service against failures of network components. Pre-configuration and dynamic restoration are two schemes for network survivability. For each scheme, survivability algorithms can be applied at either Optical Channel sublayer (Och) known as link-based. Or, Optical Multiplex Section sublayer (OMS) known as path-based. The efficiency of survivability algorithms can be assessed through such criteria as capacity efficiency, restoration time and quality service. Dynamic restoration is more efficient than pre-configuration in terms of capacity resource utilization, but restoration time is longer and 100% service recovery cannot be guaranteed because sufficient spare capacity may not be available at the time of failures. Similarly, path-based survivability offers a high performance scheme for utilizing capacity resource, but restoration time is longer than link based survivability

Design and operation of mesh-restorable WDM networks

The explosive growth of Web-related services over the Internet is bringing millions of new users online, thus creating a growing demand for bandwidth. Wavelength Division Multiplexed (WDM) networks, employing wavelength routing has emerged as the dominant technology to satisfy this growing demand for bandwidth. As the amount of traffic carried is larger, any single failure can be catastrophic. Survivability becomes indispensable in such networks. Therefore, it is imperative to design networks that can quickly and efficiently recover from failures.;In this dissertation, we explore the design and operation of survivable optical networks. We study several survivability paradigms for surviving single link failures. A restoration model is developed based on a combination of these paradigms. We propose an optimal design and upgrade scheme for WDM backbone networks. We formulate an integer programming-based design problem to minimize the total facility cost. This framework provides a cost effective way of upgrading the network by identifying how much resources to budget at each stage of network evolution. This results in significant cost reductions for the network service provider.;As part of network operation, we capture multiple operational phases in survivable network operation as a single integer programming formulation. This common framework incorporates service disruption and includes a service differentiation model based on lightpath protection. However, the complexity of the optimization problem makes the formulation applicable only for network provisioning and o2ine reconfiguration. The direct use of such methods for online reconfiguration remains limited to small networks with few tens of wavelengths. We develop a heuristic algorithm based on LP relaxation technique for fast, near optimal, online reconfiguration. Since the ILP variables are relaxed, we provide a way to derive a feasible solution from the relaxed problem. Most of the current approaches assume centralized information. They do not scale well as they rely on per-flow information. This motivates the need for developing dynamic algorithms based on partial information. The partial information we use can be easily obtained from traffic engineering extensions to routing protocols. Finally, the performance of partial information routing algorithms is compared through simulation studies

SPS phase control system performance via analytical simulation

A solar power satellite transmission system which incorporates automatic beam forming, steering, and phase control is discussed. The phase control concept centers around the notation of an active retrodirective phased array as a means of pointing the beam to the appropriate spot on Earth. The transmitting antenna (spacetenna) directs the high power beam so that it focuses on the ground-based receiving antenna (rectenna). A combination of analysis and computerized simulation was conducted to determine the far field performance of the reference distribution system, and the beam forming and microwave power generating systems

Dynamic routing of reliability-differentiated connections in WDM optical networks

Master'sMASTER OF ENGINEERIN