Scheduling network requests with transmission window

Abstract : We consider the problem of bulk data transfers and bandwidth sharing in the context of grid infrastructures. Grid computing empowers high-performance computing in a large-scale distributed environment. Network bandwidth, which makes the expensive computational and storage resources work in concert, plays an active role on performance. Due to specific traffic patterns, network topology and application scenarios, bandwidth sharing encounters new challenges. From this perspective, this research report looks at bulk transfers among computing and storage elements. Referred to as short-lived, transfer requests with transmission window and volume are scheduled in the network. By manipulating the transmission window, the request accept rate and network resource utilization are to be optimized. The formulated optimization problem is proven NP-complete. Associated with proposed heuristics, simulations are carried out to study each bandwidth sharing strategy and its application scenarios. A tuning factor, that allows adaptation of performance objective, is introduced to adjust network infrastructure and workload.
Document type :
Reports
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102146
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:44:34 AM
Last modification on : Thursday, November 21, 2019 - 2:39:15 AM

File

RR2005-32.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102146, version 1

Collections

Citation

Loris Marchal, Yves Robert, Pascale Vicat-Blanc Primet, Jingdi Zeng. Scheduling network requests with transmission window. [Research Report] LIP RR-2005-32, Laboratoire de l'informatique du parallélisme. 2005, 2+13p. ⟨hal-02102146⟩

Share

Metrics

Record views

24

Files downloads

18