Abstract:Abstract-Network survivability provided at the optical layer is a desirable feature in modern high-speed networks. For example, the wavelength division multiplexed (WDM) self-healing ring (or SHR/WDM) provides a simple and fast optically transparent protection mechanism against any single fault in the ring. Multiple self-healing rings may be deployed to design a survivable optical mesh network by superposing a set of rings on the arbitrary topology. However, the optimum design of such a network requires the jo… Show more
“…Although the notion of mesh networking has been discussed extensively in wireline and optical networks [7,9], the research mainly focuses on restoration of link failure and/or design of survivable and healing networks. When applying mesh networking techniques over shared wireless medium with limited radio spectrum, many new challenges are raised such as fading mitigation, effective and efficient medium access control (MAC), quality of service (QoS) routing, call admission control, etc.…”
“…Although the notion of mesh networking has been discussed extensively in wireline and optical networks [7,9], the research mainly focuses on restoration of link failure and/or design of survivable and healing networks. When applying mesh networking techniques over shared wireless medium with limited radio spectrum, many new challenges are raised such as fading mitigation, effective and efficient medium access control (MAC), quality of service (QoS) routing, call admission control, etc.…”
“…Reliability may be measured by how efficiently an application can deal with network failures. Traditional approaches deal with failures using full-protection mechanisms such as path protection [2,5,8,12,13,17] and path restoration [3,6,10,11,13]. Although these approaches offer full recovery in case of network failures, this assurance can be expensive.…”
We study the problem of reliably provisioning traffic using multipath routing in a mesh network. Traditional approaches handled reliability requirements using full-protection schemes. Although full-protection approaches offer high assurance, this assurance can be costly. We take a less expensive approach to maintain reliability by offering partial-protection. Specifically, our approach guarantees part of the requested bandwidth, rather than the full amount, in the event of a link failure. We first show that the amount of partial-protection that can be guaranteed is limited by the topology of the network and the bandwidth requirement of a connection request. We then propose an effective multipath algorithm that attempts to provision bandwidth requests while guaranteeing the maximum partial-protection possible. Results show that by effectively selecting paths that limit edge overuse, our algorithm achieves very low bandwidth blocking probability. Our algorithm also serves significantly more requested bandwidth than the protection approach.
“…Now we assume that any allocated fiber can support 4 wavelengths. Moreover, we let the s-d pairs of interest be (1,13), (2,7), (3,15), (6,8), (11,14), (4,20), (5,19), (9,18), (10,17), and (12,16). We generate 20 traffic matrices.…”
Section: Numerical Examples and Resultsmentioning
confidence: 99%
“…A direct consequence of the tremendous bandwidth made available by WDM, however, is that link failures due to fiber cuts will result in severe data loss. A survivable WDM network design, that provides the network with the ability to recover connections that are disrupted by network failures, is therefore essential [4].…”
Section: Introductionmentioning
confidence: 99%
“…In the failure-dependent path protection strategy, however, a distinct set of backup lightpaths is computed for every possible failure scenario [2], [3], [13]. Link protection is achieved by re-routing the failed working path around the failed link whilst maintaining the remainder of the path, and is often performed using self-healing rings [4], optical loop-back recovery [5], or pre-configured (p-) cycles [11]. Protection strategies can be further classified as dedicated versus shared.…”
We address the problem of allocating fibers (each supporting only a limited set of wavelengths) on the links of a WDM network at minimum cost, such that a set of edge-disjoint path protected connection requests can be realized. The cost of a link is assumed to be linear in the number of fibers rather than being linear in the number of wavelengths used on this link, reflecting modular capacity considerations. Therefore, a solution induced by routing each connection "simply" along the minimumcost (shortest) pair of edge-disjoint lightpaths may not minimize the total fiber cost. In this paper we quantify the increase in the total fiber cost due to this simple routing strategy. In particular, we prove that the cost of a solution induced by routing along shortest path pairs is guaranteed to lie within a certain factor of the minimum possible cost. This leads also to the fact that the cost of this solution is asymptotically minimum in heavily loaded networks, and in networks that are large, sparse and supporting all-to-all communications. En route, we prove that the optimal objective function value of the linear programming (LP-) relaxation actually corresponds to routing along shortest path pairs. We have thus presented a provably good upper bound and a lower bound on the total fiber cost, that can be computed in polynomial-time, and can be used as benchmarks against which exact and heuristic approaches are compared.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.