Name
Abstract | ||
|---|---|---|
Many existing data center network (DCN) flow scheduling schemes, that minimize flow completion times (FCT) assume prior knowledge of flows and custom switch functions, making them superior in performance but hard to implement in practice. By contrast, we seek to minimize FCT with no prior knowledge and existing commodity switch hardware. To this end, we present PIAS, a DCN flow scheduling mechanis... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TNET.2017.2669216 | IEEE/ACM Transactions on Networking |
Keywords | Field | DocType |
Switches,TCPIP,IEEE transactions,Minimization,Servers,Hardware,Heart | Byte,Computer science,Queue,Server,Computer network,Internet protocol suite,Testbed,Priority queue,Shortest job next,Backward compatibility,Distributed computing | Journal |
Volume | Issue | ISSN |
25 | 4 | 1063-6692 |
Citations | PageRank | References |
13 | 0.63 | 26 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Bai 0001 | 1 | 190 | 13.46 |
| Li Chen | 2 | 158 | 11.63 |
| Kai Chen | 3 | 744 | 59.02 |
| Dongsu Han | 4 | 994 | 48.46 |
| Chen Tian | 5 | 1119 | 84.93 |
| Hao Wang | 6 | 193 | 32.36 |