Comparison of k-shortest paths and maximum flow routing for network facility restoration

Dunn, D. A.; Grover, W.D.; MacGregor, M.H.

doi:10.1109/49.265708

Cited by 168 publications

(70 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we use the term, k-shortest disjoint paths, as a short hand for a better term, k-successive shortest edge-disjoint paths between a node pair, which has been used quite widely in the networking literature, especially for network failure recovery (e.g., [18]). The latter term is defined algorithmically by repeating the following steps: find the shortest path, remove the edges on the shortest path from the network, and then find the next shortest path on the remaining network.…”

Section: K-shortest Disjoint Pathsmentioning

confidence: 99%

Scheduling bulk file transfers with start and end times

2008

View full text Add to dashboard Cite

The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-intensive applications, we develop and evaluate control plane algorithms for scheduling bulk file transfers, where each transfer has a start time and an end time. We formulate the scheduling problem as a special type of the multi-commodity flow problem. To cope with the start and end time constraints of the file-transfer jobs, we divide time into uniform time slices. Bandwidth is allocated to each job on every time slice and is allowed to vary from slice to slice. This enables periodical adjustment of the bandwidth assignment to the jobs so as to improve a chosen performance objective: throughput of the concurrent transfers. In this paper, we study the effectiveness of using multiple time slices, the performance criterion being the tradeoff between achievable throughput and the required computation time. Furthermore, we investigate using multiple paths for each file transfer to improve the throughput. We show that using a small number of paths per job is generally sufficient to achieve near optimal throughput with a practical execution time, and this is significantly higher than the throughput of a simple scheme that uses single shortest path for each job.

show abstract

Section: K-shortest Disjoint Pathsmentioning

confidence: 99%

Scheduling bulk file transfers with start and end times

2008

View full text Add to dashboard Cite

show abstract

“…Using another fourth path, e.g., 1-9-5-4-8-10 enlarges the different E3-DODP sets from four to eight. The reader might be surprised to know that the pair (1)(2)(3)(4)(5)(6)(7)(8)(9)(10), in the network (ignoring fiber duct considerations), is associated with a total of 62 E3-DODP sets compared to 132 E2-DODP sets. The network model, based on OD Cycles, uses different E2-DODP and E3-DODP sets and only a fraction of the total sets is considered for network optimization.…”

Section: Failure-independent (Fi) Od Cyclesmentioning

confidence: 99%

“…If fibers 5-6 and 4-6 traverse a common conduit or duct (indicated by a bidirectional arrow) that cycle is not eligible for OD pair (6-8) as it does not meet SRLG route-diversity considerations. Despite this, the cycle is still eligible for other OD pairs with survivable traffic, such as OD pair (4)(5)(6)(7)(8), composed of the 2-disjoint paths 4-8 and 4-6-5-8.…”

Section: Expending Od Cycles To Multi-network Failuresmentioning

confidence: 99%

“…It can be ascertained that a recovery path from that failure, which is totally disjoint from the protection (working) path, does not exist. Such situations are known as "traps", often associated with non-disjoint path flows (see for example [5]). OD Cycles is applied to avoid trap situations by using E3-DODP sets, where the first and second paths are used for working and dedicated protection, respectively, as illustrated in Figure 2(b).…”

Section: Failure-dependent (Fd) Od Cyclesmentioning

confidence: 99%

See 1 more Smart Citation

Compound OD Cycles for a Wide Variety of Survivability Policies in Transport Networks

Herzberg¹,

Shleifer²,

Ring³

2009

NPA

View full text Add to dashboard Cite

Converged telecommunication networks, which simultaneously support a growing variety of services through a common network infrastructure, are aimed at significantly reducing network expenditures. This trend has encouraged the development of a unified network paradigm capable of supporting a wide variety of cost-effective recovery solutions, each of which may cope differently with fiber cuts and nodal equipment failures in order to satisfy service-dependent requirements. Expansion of the Origin-Destination (OD) Cycles approach is used to meet that challenge by offering ten different policies for survivability and their relative performance measures in terms of consumption of network resources and the resulting times of recovery. For practical purposes the scope of failure scenarios is limited to single and double-network failures only, even though the approach suggested is generic and can basically address even more complex events. Three test networks are extensively analyzed to demonstrate the paradigm developed and to present some useful observations about the relative positioning of the policies considered for survivability

show abstract

“…A "trap" is a topology where a corresponding set of backup routes are not available due to the disjointness constraint although disjoint working and backup routes may be available if selected differently. [3] Before this investigation, it was assumed that the ST approach would be least cost since it is well-known that the Steiner Tree solution is least cost. However, we found that the cost of a disjoint backup ST is 150% greater than the cost of a working ST (when a disjoint backup is available) and thus the total cost of combined workingldisjoint backup STs can be greater than the workinghackup rings.…”

Section: Feasibility and Costmentioning

confidence: 99%