skip to main content
10.1145/3097766.3097769acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
short-paper
Free Access

Learning Reproducibility with a Yearly Networking Contest

Published:11 August 2017Publication History

ABSTRACT

Better reproducibility of networking research results is currently a major goal that the academic community is striving towards. This position paper makes the case that improving the extent and pervasiveness of reproducible research can be greatly fostered by organizing a yearly international contest. We argue that holding a contest undertaken by a plurality of students will have benefits that are two-fold. First, it will promote hands-on learning of skills that are helpful in producing artifacts at the replicable-research level. Second, it will advance the best practices regarding environments, testbeds, and tools that will aid the tasks of reproducibility evaluation committees by and large.

Skip Supplemental Material Section

Supplemental Material

learningreproducibilitywithayearlynetworkingcontest.webm

webm

97.6 MB

References

  1. AT&T's SDN Network Design Challenge. http://about.att.com/innovationblog/051515acallouttoacad.Google ScholarGoogle Scholar
  2. Cisco Networking Academy Contest. http://www.academynetriders.com/.Google ScholarGoogle Scholar
  3. Congestion-Control Contest. https://web.stanford.edu/class/cs344g/contest.html.Google ScholarGoogle Scholar
  4. DARPA Grand Challenge. http://www.darpa.mil/grandchallenge/.Google ScholarGoogle Scholar
  5. Jubilee 15th Challenge24 Contest Networking. http://ch24.org/networking.html.Google ScholarGoogle Scholar
  6. ONUG Grand Challenge Hackathon. https://opennetworkingusergroup.com/onug-grand-challenge-hackathon/.Google ScholarGoogle Scholar
  7. OpenFlow Driver Competition. https://www.opennetworking.org/competition.Google ScholarGoogle Scholar
  8. Reproducing Network Research. https://reproducingnetworkresearch.wordpress.com/.Google ScholarGoogle Scholar
  9. Stanford CS 244 -- Programming Assignment 3. http://web.stanford.edu/class/cs244/pa3.html.Google ScholarGoogle Scholar
  10. VideoNet -- A benchmark initiative for all things video. http://videonet.team/.Google ScholarGoogle Scholar
  11. Wireless Battle of the Mesh. http://battlemesh.org/.Google ScholarGoogle Scholar
  12. METRICS Bootcamp. http://metrics-itn.eu/metrics-bootcamp/, 2014.Google ScholarGoogle Scholar
  13. New gold standard established for open and reproducible research. http://www.cam.ac.uk/research/news/new-gold-standard-established-for-open-and-reproducible-research, 2015.Google ScholarGoogle Scholar
  14. R. F. Boisvert. Incentivizing Reproducibility. Commun. ACM, 59(10), Oct. 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. O. Bonaventure. The january 2017 issue. SIGCOMM Comput. Commun. Rev., 47(1), Jan. 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. B. Clark, T. Deshane, E. Dow, S. Evanchik, M. Finlayson, J. Herne, and J. N. Matthews. Xen and the Art of Repeated Research. In ATEC, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. Collberg and T. A. Proebsting. Repeatability in Computer Systems Research. Commun. ACM, 59(3), Mar. 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Crowcroft, M. Fidler, K. Nahrstedt, and R. Steinmetz. Future Internet (Dagstuhl Seminar 13131). Dagstuhl Reports, 3(3), 2013.Google ScholarGoogle Scholar
  19. S. Edwards, X. Liu, and N. Riga. Creating Repeatable Computer Science and Networking Experiments on Shared, Public Testbeds. SIGOPS Oper. Syst. Rev., 49(1), Jan. 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. E. Eide. Foreword: Special Issue on Repeatability and Sharing of Experimental Artifacts. SIGOPS Oper. Syst. Rev., 49(1), Jan. 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. J. Freire, P. Bonnet, and D. Shasha. Computational Reproducibility: State-of-the-art, Challenges, and Database Research Opportunities. In SIGMOD, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. P. B. Godfrey. What are Networking's Grand Challenges? http://conferences2.sigcomm.org/co-next/2015/#!/keynote, 2015. CoNEXT keynote.Google ScholarGoogle Scholar
  23. N. Handigol, B. Heller, V. Jeyakumar, B. Lantz, and N. McKeown. Reproducible Network Experiments Using Container-based Emulation. In CoNEXT, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. H. Howard, M. Schwarzkopf, A. Madhavapeddy, and J. Crowcroft. Raft Refloated: Do We Have Consensus? SIGOPS Oper. Syst. Rev., 49(1), Jan. 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. Krishnamurthi and J. Vitek. The Real Software Crisis: Repeatability As a Core Value. Commun. ACM, 58(3), Mar. 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. I. Manolescu, L. Afanasiev, A. Arion, J. Dittrich, S. Manegold, N. Polyzotis, K. Schnaitter, P. Senellart, S. Zoupanos, and D. Shasha. The Repeatability Experiment of SIGMOD 2008. SIGMOD Rec., 37(1), Mar. 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. D. Pediaditakis, C. Rotsos, and A. W. Moore. Faithful Reproduction of Network Experiments. In ANCS, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. J. Rexford. The Networking Philosopher's Problem. SIGCOMM Comput. Commun. Rev., 41(3), July 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. R. Ricci, G. Wong, L. Stoller, K. Webb, J. Duerig, K. Downie, and M. Hibler. Apt: A Platform for Repeatable Research in Computer Science. SIGOPS Oper. Syst. Rev., 49(1), Jan. 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Q. Scheitle, M. Wählisch, O. Gasser, T. C. Schmidt, and G. Carle. Towards an Ecosystem for Reproducible Research in Computer Networking. In Reproducibility, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. A. Sivaraman, K. Winstein, P. Varley, J. a. Batalha, A. Goyal, S. Das, J. Ma, and H. Balakrishnan. Protocol Design Contests. SIGCOMM Comput. Commun. Rev., 44(3), July 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. V. Stodden, M. McNutt, D. H. Bailey, E. Deelman, Y. Gil, B. Hanson, M. A. Heroux, J. P. Ioannidis, and M. Taufer. Enhancing reproducibility for computational methods. Science, 354(6317):1240--1241, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  33. L. Yan and N. McKeown. Learning Networking by Reproducing Research Results. SIGCOMM Comput. Commun. Rev., 47(2), Apr. 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Learning Reproducibility with a Yearly Networking Contest

      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
      • Published in

        cover image ACM Conferences
        Reproducibility '17: Proceedings of the Reproducibility Workshop
        August 2017
        31 pages
        ISBN:9781450350600
        DOI:10.1145/3097766

        Copyright © 2017 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 11 August 2017

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • short-paper
        • Research
        • Refereed limited

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader