Abstract

To meet the increasing inter-datacenter traffic, datacenter storage is brought in the forwarding path. Bulk data that are delay-tolerant can be temporarily stored and forwarded (SnF) at a later time when link is less busy. However, the use of storage transforms the conventional routing problem into a scheduling problem, where both bandwidth and storage resources must be allocated and both spatial routing and temporal scheduling must be performed. Such an SnF scheduling problem is critically important for the efficiency of SnF approaches. Most prior solutions aimed to jointly solve its temporal and spatial components and formulated this problem into difficult optimization problems, which contributes to a huge expansion size of the problem and hence are too complex for large networks and dynamic traffic. In this paper, we present analytic models to quantify the performance-complexity tradeoff in the SnF scheduling problem. Our key findings reveal that desirable performance can be obtained by considering only a few pre-selected routes rather than searching in the entire network topology. Thus, we propose a time-space decoupled (TSD) SnF scheduling method. Compared to the conventional joint methods, the advantages of the TSD method are as follows: (i) by decoupling the problem and solving them separately, the TSD method reduces the quadratic complexity of the joint methods to linear complexity; (ii) by condensing the redundant states, the TSD method obtains a longer horizon of temporal scheduling, given the same computational cost; (iii) by bounding the spatial hop count of routing paths, the TSD method avoids the detour issue faced by the joint methods and hence uses bandwidth more efficiently; (iv) by formulating the problem into a routing problem, the TSD method greatly simplifies the problem for dynamic traffic. Simulations demonstrate that the TSD method can outperform the conventional joint method, especially when the traffic load is moderate-to-high.

Highlights

  • Emerging data-intensive applications pour massive bulk data flows into inter-datacenter networks on a daily basis

  • We extended our prior work as follows: (i) we conducted a comprehensive survey of existing efforts in leveraging stored and forwarded (SnF) approaches to transfer bulk data as well as existing SnF scheduling methods; (ii) we extended our analytic models of the SnF scheduling problem to compute the upper bound of the probability of reservation failure; (iii) we presented a condense algorithm for the time-space decoupled (TSD) method to condense the redundant network states; (iv) we ran extensive simulations to investigate the impact of the condense algorithm on the reservation window and the impact of the TSD method on the SnF operations

  • Unlike the prior decoupled method that formulated the temporal scheduling problem into LP problems or network flow problems, the proposed method formulates the problem into a routing problem with the time-shifted multilayer graph (TS-MLG), which greatly simplifies the problem for dynamic traffic

Read more

Summary

INTRODUCTION

Emerging data-intensive applications pour massive bulk data flows into inter-datacenter networks (inter-DCNs) on a daily basis. We extended our prior work as follows: (i) we conducted a comprehensive survey of existing efforts in leveraging SnF approaches to transfer bulk data as well as existing SnF scheduling methods; (ii) we extended our analytic models of the SnF scheduling problem to compute the upper bound of the probability of reservation failure; (iii) we presented a condense algorithm for the TSD method to condense the redundant network states; (iv) we ran extensive simulations to investigate the impact of the condense algorithm on the reservation window (i.e., the horizon of temporal scheduling) and the impact of the TSD method on the SnF operations. Our key finding is that more requests in the TSD method need to be stored before reaching their destinations with the traffic load increasing, majority of the stored requests only need one or two SnF operations This suggests that transferring data through SnF will not incur high deployment cost or impose heavy management burden on the network.

RELATED WORK
A ROUTING FRAMEWORK FOR SNF
ANALYTIC MODELS FOR SNF SCHEDULING ON A FIXED ROUTE
ANALYTIC MODELS FOR MULTIPLE ROUTES
POTENTIAL OF DECOUPLED SOLUTION
2: Output
21: Find a viable path and return Path
EVALUATIONS AND DISCUSSIONS
Findings
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call