Lightpath Re-optimization in mesh optical networks

Bouillet, Eric; Labourdette, Jean‐François; Ramamurthy, Ramu; Chaudhuri, S.

doi:10.1109/tnet.2005.845540

Cited by 72 publications

(48 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Heuristic algorithms are then proposed. Many papers study advance reservation, re-routing, or re-optimization of lightpaths, at the granularity of a wavelength, in WDM optical networks [47,5,7]. They are complementary to our study.…”

Section: Related Workmentioning

confidence: 90%

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: Related Workmentioning

confidence: 90%

Scheduling bulk file transfers with start and end times

2008

View full text Add to dashboard Cite

show abstract

“…As a result, [26] does not have the admission control step. In WDM optical networks, some authors [27], [28] study advance reservation and re-routing of lightpaths at the granularity of a wavelength, but they do not consider the deadline constraint.…”

Section: B Grid Network Reservationsmentioning

confidence: 99%

Grid Network Dimensioning by Modeling the Deadline Constrained Bulk Data Transfers

Munir

Primet²,

Welzl

2009

2009 11th IEEE International Conference on High Performance Computing and Communications

View full text Add to dashboard Cite

Abstract-Grid applications need to move large amounts of data between distributed resources within deterministic time frames. In most cases it is possible to specify the volume and the deadline in advance. We formally define and analyze a mechanism of network reservations of bulk data transfer requests having opportunistic utilization of residual network capacity and analyze it using an M/M/1/N − RP S queue. We compare the analytical results of our mechanism with the analytical results obtained from an M/M/N/N queue, for the case in which there is no opportunistic sharing of residual capacity. We validate the analytical results through simulations in C++. The analytical model is also validated against ns-2 simulations taking into account network level details (IP and TCP protocols), showing remarkably good coherence even under heavy loads. The model is orders of magnitude faster than simulation, which enables its application for capacity planning of Grid networks (also known as network dimensioning), and to enforce Connection Admission Control (CAC) under the practical hypothesis of a dominating bottleneck on the transfer route.

show abstract

“…Specifically, as another major contribution, we prove that the Min-Min problem above is also NPC, whether each link in a directed or undirected network has only one cost (as in the case of dedicated protection) or dual costs (as in the case of shared path protection) 1 . Furthermore, we prove that even the problem of obtaining a k-approximation solution to the Min-Min problem is NPC for any k > 1, which means there is and will be no polynomial time heuristic algorithm that can achieve guaranteed near-optimal performance as long as P =NP.…”

Section: Introductionmentioning

confidence: 90%

“…In the former, the cost of using a link by AP, denoted by C a , is the same as that by BP, denoted by C b . In the latter, 1 Since having a single cost network is a special case of having a dual-cost network, as long as we can prove that the Min-Min problem in a single-cost network is NPC, the Min-Min problem in a dual-cost network is also NPC.…”

Section: A Related Workmentioning

confidence: 99%

“…The latter restriction is placed to avoid the overhead and delay involved in coordinating the rearrangement of existing connections, and more importantly, avoid data loss due to a link (or node) failure on an AP while its corresponding BP is being rearranged, for example. Techniques for and potential benefits of rearranging the existing connections (either both APs and BPs or just BPs) as a part of network maintenance have been described in [1]- [3].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On finding disjoint paths in single and dual link cost networks

Chen

Xiong

et al.

Ieee Infocom 2004

View full text Add to dashboard Cite

Abstract-Finding a disjoint path pair is an important component in survivable networks. Since the traffic is carried on the active (working) path most of the time, it is useful to find a disjoint path pair such that the length of the shorter path (to be used as the active path) is minimized. In this paper, we first address such a Min-Min problem. We prove that this problem is NP-complete in either single link cost (e.g. dedicated backup bandwidth) or dual link cost (e.g. shared backup bandwidth) networks. In addition, it is NP-hard to obtain a k-approximation to the optimal solution for any k > 1. Our proof is extended to another open question regarding the computational complexity of a restricted version of the Min-Sum problem in an undirected network with ordered dual cost links (called MSOD problem). To solve the Min-Min problem efficiently, we introduce a novel concept called conflicting link set which provides insights into the so-called trap problem, and develop a divide-and-conquer strategy. The result is an effective heuristic for the Min-Min problem called COLE, which can outperform other approaches in terms of both the optimality and running time. We also apply COLE to the MSOD problem to efficiently provide shared path protection and conduct comprehensive performance evaluation as well as comparison of various schemes for shared path protection. We show that COLE not only processes connection requests much faster than existing ILP based approaches but also achieves a good balance among the AP length, bandwidth efficiency and recovery time.

show abstract

Lightpath Re-optimization in mesh optical networks

Cited by 72 publications

References 24 publications

Scheduling bulk file transfers with start and end times

Scheduling bulk file transfers with start and end times

Grid Network Dimensioning by Modeling the Deadline Constrained Bulk Data Transfers

On finding disjoint paths in single and dual link cost networks

Contact Info

Product

Resources

About