skip to main content
research-article

On max-min fair allocation for multi-source transmission

Published:28 January 2019Publication History
Skip Abstract Section

Abstract

Max-min fair is widely used in network traffic engineering to allocate available resources among different traffic transfers. Recently, as data replication technique developed, increasing systems enforce multi-source transmission to maximize network utilization. However, existing TE approaches fail to deal with multi-source transfers because the optimization becomes a joint problem of bandwidth allocation as well as flow assignment among different sources. In this paper, we present a novel allocation approach for multi-source transfers to achieve global max-min fairness. The joint bandwidth allocation and flow assignment optimization problem poses a major challenge due to nonlinearity and multiple objectives. We cope with this by deriving a novel transformation with simple equivalent canonical linear programming to achieve global optimality efficiently. We conduct data-driven simulations, showing that our approach is more max-min fair than other single-source and multi-source allocation approaches, meanwhile it outperforms others with substantial gains in terms of network throughput and transfer completion time.

References

  1. Anoymous Technical Report. https://github.com/technical-report-2018/CCR2018.Google ScholarGoogle Scholar
  2. Mosharaf Chowdhury, Srikanth Kandula, and Ion Stoica. Leveraging endpoint flexibility in data-intensive clusters. In ACM SIGCOMM CCR, volume 43, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Mosharaf Chowdhury and Ion Stoica. Coflow: A networking abstraction for cluster applications. In Proceedings of HotNet, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Mosharaf Chowdhury, Yuan Zhong, and Ion Stoica. Efficient coflow scheduling with varys. In ACM SIGCOMM CCR, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. CMS Collaboration et al. The cms experiment at the cern lhc (journal of instrumentation 3 s08004, 2008) p. 158.Google ScholarGoogle Scholar
  6. Fahad R Dogar, Thomas Karagiannis, Hitesh Ballani, and Antony Rowstron. Decentralized task-aware scheduling for data center networks. In ACM SIGCOMM CCR, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung. The google file system. In ACM SIGOPS operating systems review, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Chi-Yao Hong, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Vijay Gill, Mohan Nanduri, and Roger Wattenhofer. Achieving high utilization with software-driven wan. In SIGCOMM CCR, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Sushant Jain, Alok Kumar, Subhasree Mandal, Joon Ong, Leon Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, et al. B4: Experience with a globally-deployed software defined wan. SIGCOMM CCR, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Xin Jin, Yiran Li, Da Wei, Siming Li, Jie Gao, Lei Xu, Guangzhi Li, Wei Xu, and Jennifer Rexford. Optimizing bulk transfers with software-defined optical wan. In Proceedings of SIGCOMM 2016 Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Alok Kumar, Sushant Jain, Uday Naik, Anand Raghuraman, Nikhil Kasinad-huni, Enrique Cauich Zermeno, C Stephen Gunn, Jing Ai, Björn Carlin, Mihai Amarandei-Stavila, et al. Bwe: Flexible, hierarchical bandwidth allocation for wan distributed computing. In SIGCOMM CCR, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Geng Li, Yichen Qian, Lili Liu, and Y Richard Yang. Jms: Joint bandwidth allocation and flow assignment for transfers with multiple sources. In 2018 IEEE Third International Conference on Data Science in Cyberspace (DSC). IEEE, 2018.Google ScholarGoogle ScholarCross RefCross Ref
  13. Qingming Ma, Peter Steenkiste, and Hui Zhang. Routing high-bandwidth traffic in max-min fair share networks. In Conference proceedings on Applications, technologies, architectures, and protocols for computer communications, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Dritan Nace and Michal Pioro. Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial. IEEE Communications Surveys & Tutorials, 10(4):5--17, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Michael Ovsiannikov, Silvius Rus, Damian Reeves, Paul Sutter, Sriram Rao, and Jim Kelly. The quantcast file system. Proceedings of the VLDB Endowment, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Sajjad Rizvi, Xi Li, Bernard Wong, Fiodar Kazhamiaka, and Benjamin Cassell. Mayflower: Improving distributed filesystem performance through sdn/filesystem co-design. In Distributed Computing Systems (ICDCS), 2016 IEEE 36th International Conference on, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  17. Konstantin Shvachko, Hairong Kuang, Sanjay Radia, and Robert Chansler. The hadoop distributed file system. In Mass storage systems and technologies (MSST), 2010 IEEE 26th symposium on, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Qiao Xiang, X. Tony Wang, J. Jensen Zhang, Harvey Newman, Y. Richard Yang, and Y. Jace Liu. Unicorn: Resource Orchestration for Multi-Domain, Geo-Distributed Data Analytics. https://datatracker.ietf.org/doc/draft-xiang-alto-multidomain-analytics, 2018.Google ScholarGoogle Scholar

Index Terms

  1. On max-min fair allocation for multi-source transmission

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader