Network survivability, reflecting the ability of a network to maintain an acceptable level of service during and after failures, is an important requirement for WDM optical networks due to the ultrahigh capacity. The most common network failure is the link failure which could cause enormous data loss and lots of service disruption to Internet users. Although single-link failures are the most common failure scenarios, double-link failures can occur in some cases and cause more severe problem. Compared to unicast sessions, multicast sessions suffer more seriously from link failures because a link may carry traffic to multiple destinations rather than to a single destination. Hence, multicast sessions demand more effective and efficient protection against link failures. With the increasing demand for access bandwidth, the access networks draw more attention. The hybrid wireless-optical broadbandaccess network (WOBAN) is a promising architecture for future access networks because it combines the high capacity of optical communication and the flexibility and cost-effectiveness of a wireless network.
First, we consider the problem of protecting unicast connections against double link failures. The basic idea is to use two p-Cycles, with link-disjoint protection segments, to protect each working link. To utilize spare capacity more efficiently, we also propose a new hybrid protection/restoration scheme to handle two-link failures. Our scheme uses protection to ensure that most of the affected demands can be restored using the pre-planned backup paths upon a two-link failure. For the demands not restorable with protection, we use dynamic restoration to find new backup paths for them.
Second, we propose protection schemes for multicast sessions under one link failure. An intelligent p-Cycle (I pC) scheme is presented to provide p-Cycle protection for dynamic multicast sessions. When a multicast request arrives, a multicast tree is computed for it and then the IpC scheme is used to compute a set of high efficient p-Cycles on-demand to protect each link on the multicast tree. Then we propose a p-cycle-based path protection scheme and a PXT-based path protection scheme to provide protection for dynamic multicast sessions. Basically, to protect a multicast tree, we compute one p-Cycle and one PXT for each destination node v such that the p-Cycle and the PXT can be used to restore the traffic to v when a link failure occurs on the path from the source node to v.
Finally, we propose a new protection scheme for the hybrid wireless-optical broadband-access network(WOBAN). The scheme is cost-effective in that it does not require the PONs to have self-protecting capability. Based on the proposed protection scheme, we define the maximum protection with minimum cost(MPMC) problem and present one ILP solution approach to the MPMC problem. Then we prove the MPMC problem is NP-Hard and provide one heuristic algorithm for the MPMC problem.
|Advisor:||Ruan, Lu, Zhang, Wensheng|
|Commitee:||Fernandez-Baca, David, Kamal, Ahmed E., Wong, Johnny S.|
|School:||Iowa State University|
|School Location:||United States -- Iowa|
|Source:||DAI-B 72/03, Dissertation Abstracts International|
|Keywords:||Access networks, Backbone networks, Optical networks, Survivability|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be