Skip to main content
USENIX
  • Conferences
  • Students
Sign in
  • Home
  • Attend
    • Registration Information
    • Registration Discounts
    • Students and Grants
    • Venue, Hotel, and Travel
    • Oakland Dining Guide
  • Activities
    • Birds-of-a-Feather Sessions
    • Poster Session
  • Program
    • At a Glance
    • Technical Sessions
  • Participate
    • Call for Papers
    • Call for Posters
    • Instructions for Participants
  • Sponsorship
  • About
    • Symposium Organizers
    • Past Symposia
    • Questions?
    • Help Promote!
  • Home
  • Attend
    • Registration Information
    • Registration Discounts
    • Students and Grants
    • Venue, Hotel, and Travel
    • Oakland Dining Guide
  • Activities
  • Program
    • At a Glance
    • Technical Sessions
  • Participate
    • Call for Papers
    • Call for Posters
    • Instructions for Participants
  • Sponsorship
  • About
    • Symposium Organizers
    • Past Symposia
    • Questions?
    • Help Promote!

sponsors

Gold Sponsor
Silver Sponsor
Silver Sponsor
Silver Sponsor
Bronze Sponsor
Bronze Sponsor
Bronze Sponsor
Bronze Sponsor
Bronze Sponsor
General Sponsor
General Sponsor
Media Sponsor
Media Sponsor
Media Sponsor
Media Sponsor
Media Sponsor
Media Sponsor
Media Sponsor
Media Sponsor
Media Sponsor
Media Sponsor
Industry Partner

help promote

NSDI '15 button

Get more
Help Promote graphics!

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home » Information-Agnostic Flow Scheduling for Commodity Data Centers
Tweet

connect with us

https://twitter.com/usenix
https://www.facebook.com/usenixassociation
https://plus.google.com/108588319090208187909/posts
http://www.linkedin.com/groups/USENIX-Association-49559/about
http://www.youtube.com/user/USENIXAssociation

Information-Agnostic Flow Scheduling for Commodity Data Centers

Authors: 

Wei Bai, Li Chen, and Kai Chen, The Hong Kong University of Science and Technology; Dongsu Han, Korea Advanced Institute of Science and Technology (KAIST); Chen Tian, Nanjing University; Hao Wang, The Hong Kong University of Science and Technology

Abstract: 

Many existing data center network (DCN) flow scheduling schemes minimize flow completion times (FCT) based on prior knowledge of flows and custom switch functions, making them superior in performance but hard to use 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 (MLFQ), 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% and 40% over DCTCP and L2DCT respectively; and it only has a 4.9% performance gap to an ideal information-aware scheme, pFabric, for short flows under a production DCN workload.

Wei Bai, The Hong Kong University of Science and Technology

Li Chen, The Hong Kong University of Science and Technology

Kai Chen, The Hong Kong University of Science and Technology

Dongsu Han, Korea Advanced Institute of Science and Technology (KAIST)

Chen Tian, Huazhong University of Science and Technology

Hao Wang, The Hong Kong University of Science and Technology

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

Bai PDF
View the slides

Presentation Video 

Presentation Audio

MP3 Download

Download Audio

  • Log in or    Register to post comments

Gold Sponsors

Silver Sponsors

Bronze Sponsors

General Sponsors

Media Sponsors & Industry Partners

© USENIX

  • Privacy Policy
  • Contact Us