Name
Abstract | ||
|---|---|---|
Many production datacenters nowadays service multiple applications with dynamically allocated network bandwidth, and some applications are time-critical so their data transfers or flows are constrained by deadlines. To meet deadlines, several flow scheduling schemes for datacenter networks are proposed, but most of them are unaware of bandwidth variations, leading to suboptimal throughputs. In thi... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TSC.2017.2701363 | IEEE Transactions on Services Computing |
Keywords | DocType | Volume |
Channel allocation,Bandwidth,Throughput,Approximation algorithms,Facebook,Dynamic scheduling,Algorithm design and analysis | Journal | 13 |
Issue | ISSN | Citations |
3 | 1939-1374 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiann-Min Ho | 1 | 0 | 0.68 |
| Pi-Cheng Hsiu | 2 | 398 | 34.30 |
| Ming-Syan Chen | 3 | 59 | 5.65 |