.png){kind=icon}
.png){kind=icon}
Return
A Partial Store-and-Forward Scheduling Method for Inter-Datacenter Bulk Data Transfers
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3007954.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Temporarily storing delay-tolerant data at peak hours and forwarding the data at off-peak hours, i.e., performing Store-and-Forward (SnF) using datacenter storage, can mitigate peak-hour congestion and exploit off-peak-hour bandwidth in inter-datacenter networks. Most prior studies considered a case where all nodes along their routing paths provided SnF options for the scheduling decision making. Intuitively, their solutions maximize the scheduling flexibility. However, the computational complexity of their solutions increases exponentially with the hop count. Meanwhile, SnF operations are generally performed on a portion of nodes rather than every node along the path. Thus, the considered case seems to be unnecessary in practice. In this paper, our studies reveal that desirable performance can be attained by involving a portion of nodes rather than all nodes along the path in the decision making. Thus, we propose a partial SnF scheduling method, which involves a portion of nodes in scheduling and introduces a network abstraction based on the involved nodes. Simulations demonstrate that the proposed method has lower complexity while achieving high performance.
Keywords:
Bulk data transfers
inter-datacenter networks
wavelength routing
storage
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
View more organizations