PIAS: Practical Information-Agnostic Flow Scheduling for Commodity Data Centers

Cited 31 time in webofscience Cited 0 time in scopus
  • Hit : 446
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorBai, Weiko
dc.contributor.authorChen, Liko
dc.contributor.authorChen, Kaiko
dc.contributor.authorHan, Dongsuko
dc.contributor.authorTian, Chenko
dc.contributor.authorWang, Haoko
dc.date.accessioned2017-09-25T06:02:51Z-
dc.date.available2017-09-25T06:02:51Z-
dc.date.created2017-09-18-
dc.date.created2017-09-18-
dc.date.created2017-09-18-
dc.date.issued2017-08-
dc.identifier.citationIEEE-ACM TRANSACTIONS ON NETWORKING, v.25, no.4, pp.1954 - 1967-
dc.identifier.issn1063-6692-
dc.identifier.urihttp://hdl.handle.net/10203/226139-
dc.description.abstractMany 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 mechanism that aims to minimize FCT by mimicking shortest job first (SJF) on the premise that flow size is not known a priori. At its heart, PIAS leverages multiple priority queues available in existing commodity switches to implement a multiple level feedback queue, in which a PIAS flow is gradually demoted from higher-priority queues to lower-priority queues based on the number of bytes it has sent. As a result, short flows are likely to be finished in the first few high-priority queues and thus be prioritized over long flows in general, which enables PIAS to emulate SJF without knowing flow sizes beforehand. We have implemented a PIAS prototype and evaluated PIAS through both testbed experiments and ns-2 simulations. We show that PIAS is readily deployable with commodity switches and backward compatible with legacy TCP/IP stacks. Our evaluation results show that PIAS significantly outperforms existing information-agnostic schemes, for example, it reduces FCT by up to 50% compared to DCTCP [11] and L2DCT [32]; and it only has a 1.1% performance gap to an ideal information-aware scheme, pFabric [13], for short flows under a production DCN workload.-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.titlePIAS: Practical Information-Agnostic Flow Scheduling for Commodity Data Centers-
dc.typeArticle-
dc.identifier.wosid000408419600002-
dc.identifier.scopusid2-s2.0-85016482374-
dc.type.rimsART-
dc.citation.volume25-
dc.citation.issue4-
dc.citation.beginningpage1954-
dc.citation.endingpage1967-
dc.citation.publicationnameIEEE-ACM TRANSACTIONS ON NETWORKING-
dc.identifier.doi10.1109/TNET.2017.2669216-
dc.contributor.localauthorHan, Dongsu-
dc.contributor.nonIdAuthorBai, Wei-
dc.contributor.nonIdAuthorChen, Li-
dc.contributor.nonIdAuthorChen, Kai-
dc.contributor.nonIdAuthorTian, Chen-
dc.contributor.nonIdAuthorWang, Hao-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorData center networks-
dc.subject.keywordAuthorflow scheduling-
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 31 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0