var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=www.cl.cam.ac.uk%2F%7Eawm22%2Ftmp%2Fjabref-master.bib&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=www.cl.cam.ac.uk%2F%7Eawm22%2Ftmp%2Fjabref-master.bib&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=www.cl.cam.ac.uk%2F%7Eawm22%2Ftmp%2Fjabref-master.bib&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2022\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Network Latency and Application Performance Aware Cluster Scheduling in Data Centers.\n \n \n \n \n\n\n \n Popescu, D. A.; and Moore, A. W.\n\n\n \n\n\n\n IEEE Networking, 36(2): 58–65. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"NetworkPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Popescu2022Network,\n  author    = {Diana Andreea Popescu and Andrew W. Moore},\n  journal   = {{IEEE} Networking},\n  title     = {Network Latency and Application Performance Aware Cluster Scheduling in Data Centers},\n  year      = {2022},\n  number    = {2},\n  pages     = {58--65},\n  volume    = {36},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  biburl    = {https://dblp.org/rec/journals/network/PopescuM22.bib},\n  doi       = {10.1109/MNET.001.2100414},\n  file      = {:foo:},\n  timestamp = {Wed, 08 Jun 2022 16:30:00 +0200},\n  url       = {https://doi.org/10.1109/MNET.001.2100414},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n DNA Archival Storage, a Bottom up Approach.\n \n \n \n \n\n\n \n Sella, O. S.; Apelbaum, A.; Heinis, T.; Quah, J.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 13th ACM Workshop on Hot Topics in Storage and File Systems, of HotStorage '21, pages 58–63, New York, NY, USA, 2021. Association for Computing Machinery\n \n\n\n\n
\n\n\n\n \n \n \"DNAPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Sella2021DNA,\n  author    = {Sella, Omer S. and Apelbaum, Amir and Heinis, Thomas and Quah, Jasmine and Moore, Andrew W.},\n  booktitle = {Proceedings of the 13th ACM Workshop on Hot Topics in Storage and File Systems},\n  title     = {DNA Archival Storage, a Bottom up Approach},\n  year      = {2021},\n  address   = {New York, NY, USA},\n  pages     = {58–63},\n  publisher = {Association for Computing Machinery},\n  series    = {HotStorage '21},\n  abstract  = {DNA is an attractive medium for storage of digital data in the cloud, owing to a form factor several orders of magnitude smaller than any other. Key to storing binary data in synthetic in DNA is the translation between the binary representation of digital data to the quaternary domain of DNA. This translation must adhere to constraints imposed by the synthesis and sequencing processes used to write and read respectively. A technological advance in either process changes the constraints and renders current encoding schemes obsolete. In this paper we present a recipe for taking constraints and producing an appropriate encoding scheme. Such a mechanism allows moving the encoding in lockstep with the technological advances in the underlying processes. We further show a method to understand trade-offs in constraints for a given overhead of bits needed to meet such constraints.},\n  doi       = {10.1145/3465332.3470880},\n  isbn      = {9781450385503},\n  location  = {Virtual, USA},\n  numpages  = {6},\n  url       = {https://doi.org/10.1145/3465332.3470880},\n}\n\n
\n
\n\n\n
\n DNA is an attractive medium for storage of digital data in the cloud, owing to a form factor several orders of magnitude smaller than any other. Key to storing binary data in synthetic in DNA is the translation between the binary representation of digital data to the quaternary domain of DNA. This translation must adhere to constraints imposed by the synthesis and sequencing processes used to write and read respectively. A technological advance in either process changes the constraints and renders current encoding schemes obsolete. In this paper we present a recipe for taking constraints and producing an appropriate encoding scheme. Such a mechanism allows moving the encoding in lockstep with the technological advances in the underlying processes. We further show a method to understand trade-offs in constraints for a given overhead of bits needed to meet such constraints.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Measuring Network Conditions in Data Centers Using the Precision Time Protocol.\n \n \n \n\n\n \n Popescu, D. A.; and Moore, A. W.\n\n\n \n\n\n\n IEEE Transactions on Network and Service Management, 18(3): 3753-3770. 2021.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Popescu2021Measuring,\n  author  = {Popescu, Diana Andreea and Moore, Andrew W.},\n  journal = {IEEE Transactions on Network and Service Management},\n  title   = {Measuring Network Conditions in Data Centers Using the Precision Time Protocol},\n  year    = {2021},\n  number  = {3},\n  pages   = {3753-3770},\n  volume  = {18},\n  doi     = {10.1109/TNSM.2021.3081536},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Real-time Experimental Demonstration of Timestamped Digitised Radio over Switched Optical Ethernet Fronthaul.\n \n \n \n \n\n\n \n Li, T.; Bai, L.; Zhang, J.; Moore, A. W.; White, I. H.; and Penty, R. V.\n\n\n \n\n\n\n In Conference on Lasers and Electro-Optics, pages STu2B.3, 2021. Optical Society of America\n \n\n\n\n
\n\n\n\n \n \n \"Real-timePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{Li2021Real,\n  author    = {Tongyun Li and Lu Bai and Jingyun Zhang and Andrew W. Moore and Ian H. White and Richard V. Penty},\n  booktitle = {Conference on Lasers and Electro-Optics},\n  title     = {Real-time Experimental Demonstration of Timestamped Digitised Radio over Switched Optical Ethernet Fronthaul},\n  year      = {2021},\n  pages     = {STu2B.3},\n  publisher = {Optical Society of America},\n  abstract  = {This paper experimentally demonstrates a novel digitised RF service transmission with data compression over switched 10Gbps optical Ethernet fronthaul showing low latency (\\&lt;2.4{\\textmu}s), high transmission efficiency (~1/3 that of CPRI) and wide dynamic range (40dB).},\n  doi       = {10.1364/CLEO_SI.2021.STu2B.3},\n  journal   = {Conference on Lasers and Electro-Optics},\n  keywords  = {Analog to digital converters; Millimeter waves; Network convergence; Optical ethernet; Packet switched networks; Space division multiplexing},\n  url       = {http://opg.optica.org/abstract.cfm?URI=CLEO_SI-2021-STu2B.3},\n}\n\n
\n
\n\n\n
\n This paper experimentally demonstrates a novel digitised RF service transmission with data compression over switched 10Gbps optical Ethernet fronthaul showing low latency (<2.4\\textmus), high transmission efficiency (~1/3 that of CPRI) and wide dynamic range (40dB).\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n NRG: A Network Perspective on Applications' Performance.\n \n \n \n \n\n\n \n Zilberman, N.; Moore, A. W.; Cooper, B.; Woodruff, J.; Tokusashi, Y.; Bressana, P.; Ramanujam, M.; Popescu, D. A.; and Galea, S.\n\n\n \n\n\n\n In Bajpai, V.; Haddadi, H.; and Hohlfeld, O., editor(s), 5th Network Traffic Measurement and Analysis Conference, TMA 2021, Virtual Event, September 14-15, 2021, 2021. IFIP\n \n\n\n\n
\n\n\n\n \n \n \"NRG:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Zilberman2021NRG,\n  author    = {Noa Zilberman and Andrew W. Moore and Billy Cooper and Jackson Woodruff and Yuta Tokusashi and Pietro Bressana and Murali Ramanujam and Diana Andreea Popescu and Salvator Galea},\n  booktitle = {5th Network Traffic Measurement and Analysis Conference, {TMA} 2021, Virtual Event, September 14-15, 2021},\n  title     = {{NRG:} {A} Network Perspective on Applications' Performance},\n  year      = {2021},\n  editor    = {Vaibhav Bajpai and Hamed Haddadi and Oliver Hohlfeld},\n  publisher = {{IFIP}},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  biburl    = {https://dblp.org/rec/conf/tma/Zilberman0CWTBR21.bib},\n  timestamp = {Fri, 01 Oct 2021 09:11:39 +0200},\n  url       = {http://dl.ifip.org/db/conf/tma/tma2021/tma2021-paper13.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Real-time Experimental Demonstration of Timestamped Digitised Radio over Switched Optical Ethernet Fronthaul.\n \n \n \n \n\n\n \n Li, T.; Bai, L.; Zhang, J.; Moore, A. W.; White, I. H.; and Penty, R. V.\n\n\n \n\n\n\n In 2021 Conference on Lasers and Electro-Optics (CLEO), pages 1-2, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"Real-timePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Li2021Reala,\n  author    = {Li, Tongyun and Bai, Lu and Zhang, Jingyun and Moore, Andrew W. and White, Ian H. and Penty, Richard V.},\n  booktitle = {2021 Conference on Lasers and Electro-Optics (CLEO)},\n  title     = {Real-time Experimental Demonstration of Timestamped Digitised Radio over Switched Optical Ethernet Fronthaul},\n  year      = {2021},\n  pages     = {1-2},\n  url       = {https://ieeexplore.ieee.org/document/9571339},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Enabling Event-Triggered Data Plane Monitoring.\n \n \n \n\n\n \n Kucera, J.; Popescu, D. A.; Wang, H.; Moore, A. W.; Korenek, J.; and Antichi, G.\n\n\n \n\n\n\n In Wang, A.; Rozner, E.; and Zeng, H., editor(s), SOSR '20: Symposium on SDN Research, San Jose, CA, USA, March 3, 2020, pages 14–26, 2020. ACM\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Kucera2020Enabling,\n  author    = {Jan Kucera and Diana Andreea Popescu and Han Wang and Andrew W. Moore and Jan Korenek and Gianni Antichi},\n  booktitle = {{SOSR} '20: Symposium on {SDN} Research, San Jose, CA, USA, March 3, 2020},\n  title     = {{Enabling Event-Triggered Data Plane Monitoring}},\n  year      = {2020},\n  editor    = {Anduo Wang and Eric Rozner and Hongyi Zeng},\n  pages     = {14--26},\n  publisher = {{ACM}},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  biburl    = {https://dblp.org/rec/conf/sosr/KuceraPW0KA20.bib},\n  doi       = {10.1145/3373360.3380830},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Thoughts about Artifact Badging.\n \n \n \n \n\n\n \n Zilberman, N.; and Moore, A. W.\n\n\n \n\n\n\n SIGCOMM Comput. Commun. Rev., 50(2): 60–63. May 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ThoughtsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{zilberman2020thoughts,\n  author     = {Zilberman, Noa and Moore, Andrew W.},\n  journal    = {SIGCOMM Comput. Commun. Rev.},\n  title      = {Thoughts about Artifact Badging},\n  year       = {2020},\n  issn       = {0146-4833},\n  month      = may,\n  number     = {2},\n  pages      = {60–63},\n  volume     = {50},\n  address    = {New York, NY, USA},\n  doi        = {10.1145/3402413.3402422},\n  issue_date = {April 2020},\n  keywords   = {Artifact Evaluation, Robustness, Reproducibility},\n  numpages   = {4},\n  publisher  = {Association for Computing Machinery},\n  url        = {https://doi.org/10.1145/3402413.3402422},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n .\n \n \n \n \n\n\n \n Miano, S.; Rétvári, G.; Risso, F.; Moore, A. W.; and Antichi, G.\n\n\n \n\n\n\n Automatic Optimization of Software Data Planes, pages 27–29. Association for Computing Machinery, New York, NY, USA, 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AutomaticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InBook{Miano2020Automatic,\n  author    = {Miano, Sebastiano and R\\'{e}tv\\'{a}ri, G\\'{a}bor and Risso, Fulvio and Moore, Andrew W. and Antichi, Gianni},\n  pages     = {27–29},\n  publisher = {Association for Computing Machinery},\n  title     = {Automatic Optimization of Software Data Planes},\n  year      = {2020},\n  address   = {New York, NY, USA},\n  isbn      = {9781450380485},\n  abstract  = {In this poster, we make a case for a compiler that continuously optimizes software data planes at run-time. Furthermore, we propose its architecture and discuss the challenges associated with its design.},\n  booktitle = {Proceedings of the SIGCOMM '20 Poster and Demo Sessions},\n  numpages  = {3},\n  url       = {https://doi.org/10.1145/3405837.3411379},\n}\n\n
\n
\n\n\n
\n In this poster, we make a case for a compiler that continuously optimizes software data planes at run-time. Furthermore, we propose its architecture and discuss the challenges associated with its design.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n No Delay: Latency-Driven, Application Performance-Aware, Cluster Scheduling.\n \n \n \n\n\n \n Popescu, D. A.; and Moore, A. W.\n\n\n \n\n\n\n arXiv preprint arXiv:1903.07114. 2019.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Popescu2019No,\n  author  = {Popescu, Diana Andreea and Moore, Andrew W.},\n  journal = {arXiv preprint arXiv:1903.07114},\n  title   = {{No Delay: Latency-Driven, Application Performance-Aware, Cluster Scheduling}},\n  year    = {2019},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Measuring Burstiness in Data Center Applications.\n \n \n \n\n\n \n Jackson, W.; Moore, A. W.; and Zilberman, N.\n\n\n \n\n\n\n In Proceedings of the 2019 Workshop on Buffer Sizing, dec 2019. ACM\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Jackson2019Measuring,\n  author    = {Jackson, Woodruff and Moore, Andrew W. and Zilberman, Noa},\n  booktitle = {Proceedings of the 2019 Workshop on Buffer Sizing},\n  title     = {{Measuring Burstiness in Data Center Applications}},\n  year      = {2019},\n  month     = {dec},\n  publisher = {{ACM}},\n  doi       = {10.1145/3375235.3375240},\n  groups    = {testing123},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Measuring Burstiness in Data Center Applications.\n \n \n \n\n\n \n Woodruff, J.; Moore, A. W.; and Zilberman, N.\n\n\n \n\n\n\n In Buffer Sizing Workshop, pages 5:1–5:1, Stanford University, CA, 2019. ACM\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Woodruff2019Measuring,\n  author    = {Woodruff, Jackson and Moore, Andrew W. and Zilberman, Noa},\n  booktitle = {Buffer Sizing Workshop},\n  title     = {{Measuring Burstiness in Data Center Applications}},\n  year      = {2019},\n  address   = {Stanford University, CA},\n  pages     = {5:1--5:1},\n  publisher = {ACM},\n  doi       = {10.1145/3375235},\n  isbn      = {978-1-4503-7745-4},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A First Look at Data Center Network Condition Through The Eyes of PTPmesh.\n \n \n \n\n\n \n Popescu, D. A.; and Moore, A. W.\n\n\n \n\n\n\n In 2018 Network Traffic Measurement and Analysis Conference (TMA), pages 1–8, 2018. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Popescu2018First,\n  author       = {Popescu, Diana Andreea and Moore, Andrew W.},\n  booktitle    = {2018 Network Traffic Measurement and Analysis Conference (TMA)},\n  title        = {{A First Look at Data Center Network Condition Through The Eyes of PTPmesh}},\n  year         = {2018},\n  organization = {IEEE},\n  pages        = {1--8},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n High speed adaptive rack-scale fabrics.\n \n \n \n\n\n \n Sella, O. S.; Moore, A. W.; and Zilberman, N.\n\n\n \n\n\n\n In Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos, pages 33–35, 2018. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Sella2018High,\n  author    = {Sella, Omer S. and Moore, Andrew W. and Zilberman, Noa},\n  booktitle = {Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos},\n  title     = {High speed adaptive rack-scale fabrics},\n  year      = {2018},\n  pages     = {33--35},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Revealing hidden hierarchical heavy hitters in network traffic.\n \n \n \n\n\n \n Galea, S.; Moore, A. W.; Antichi, G.; Bianchi, G.; and Bifulco, R.\n\n\n \n\n\n\n In Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos, pages 81–83, 2018. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Galea2018Revealing,\n  author    = {Galea, Salvator and Moore, Andrew W. and Antichi, Gianni and Bianchi, Giuseppe and Bifulco, Roberto},\n  booktitle = {Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos},\n  title     = {Revealing hidden hierarchical heavy hitters in network traffic},\n  year      = {2018},\n  pages     = {81--83},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n FEC killed the cut-through switch.\n \n \n \n\n\n \n Sella, O. S.; Moore, A. W.; and Zilberman, N.\n\n\n \n\n\n\n In Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies, pages 15–20, 2018. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Sella2018FEC,\n  author    = {Sella, Omer S. and Moore, Andrew W. and Zilberman, Noa},\n  booktitle = {Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies},\n  title     = {{FEC killed the cut-through switch}},\n  year      = {2018},\n  pages     = {15--20},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n OFLOPS-SUME and the art of switch characterization.\n \n \n \n\n\n \n Oudin, R.; Antichi, G.; Rotsos, C.; Moore, A. W.; and Uhlig, S.\n\n\n \n\n\n\n IEEE Journal on Selected Areas in Communications, 36(12): 2612–2620. 2018.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Oudin2018OFLOPS,\n  author    = {Oudin, R{\\'e}mi and Antichi, Gianni and Rotsos, Charalampos and Moore, Andrew W. and Uhlig, Steve},\n  journal   = {IEEE Journal on Selected Areas in Communications},\n  title     = {{OFLOPS-SUME and the art of switch characterization}},\n  year      = {2018},\n  number    = {12},\n  pages     = {2612--2620},\n  volume    = {36},\n  publisher = {IEEE},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Rethinking IXPs’ architecture in the age of SDN.\n \n \n \n\n\n \n Bruyere, M.; Antichi, G.; Fernandes, E. L.; Lapeyrade, R.; Uhlig, S.; Owezarski, P.; Moore, A. W.; and Castro, I.\n\n\n \n\n\n\n IEEE Journal on Selected Areas in Communications, 36(12): 2667–2674. 2018.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Bruyere2018Rethinking,\n  author    = {Bruyere, Marc and Antichi, Gianni and Fernandes, Eder L. and Lapeyrade, Remy and Uhlig, Steve and Owezarski, Philippe and Moore, Andrew W. and Castro, Ignacio},\n  journal   = {IEEE Journal on Selected Areas in Communications},\n  title     = {{Rethinking IXPs’ architecture in the age of SDN}},\n  year      = {2018},\n  number    = {12},\n  pages     = {2667--2674},\n  volume    = {36},\n  publisher = {IEEE},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Umbrella : A deployable SDN-enabled IXP switching fabric.\n \n \n \n\n\n \n Bruyere, M.; Lapeyrade, R.; Fernandes, E. L.; Castro, I.; Uhlig, S.; Moore, A. W.; and Antichi, G.\n\n\n \n\n\n\n In Proceedings of the Symposium on SDN Research, pages 1–2, Mar 2018. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Bruyere2018Umbrella,\n  author            = {Bruyere, Marc and Lapeyrade, Remy and Fernandes, Eder L. and Castro, Ignacio and Uhlig, Steve and Moore, Andrew W. and Antichi, Gianni},\n  booktitle         = {Proceedings of the Symposium on SDN Research},\n  title             = {{Umbrella : A deployable SDN-enabled IXP switching fabric}},\n  year              = {2018},\n  month             = {Mar},\n  pages             = {1--2},\n  abstract          = {© 2018 held by the owner/author(s). Software Defined internet eXchange Points (SDXs) are a promising solution to the long-standing limitations and problems of interdo- main routing. While proposed SDX architectures have improved the scalability of the control plane, these solutions have ignored the underlying fabric upon which they should be deployed. This work makes the case for a new fabric architecture that proposes stronger control and data plane separation.},\n  day               = {28},\n  doi               = {10.1145/3185467.3190790},\n  isbn              = {9781450356640},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n © 2018 held by the owner/author(s). Software Defined internet eXchange Points (SDXs) are a promising solution to the long-standing limitations and problems of interdo- main routing. While proposed SDX architectures have improved the scalability of the control plane, these solutions have ignored the underlying fabric upon which they should be deployed. This work makes the case for a new fabric architecture that proposes stronger control and data plane separation.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Seek and Push: Detecting Large Traffic Aggregates in the Dataplane.\n \n \n \n\n\n \n Kučera, J.; Popescu, D. A.; Antichi, G.; Kořenek, J.; and Moore, A. W.\n\n\n \n\n\n\n arXiv preprint arXiv:1805.05993. 2018.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Kucera2018Seek,\n  author        = {Kučera, J. and Popescu, D. A. and Antichi, G. and Kořenek, J. and Moore, A. W.},\n  journal       = {arXiv preprint arXiv:1805.05993},\n  title         = {{Seek and Push: Detecting Large Traffic Aggregates in the Dataplane}},\n  year          = {2018},\n  abstract      = {High level goals such as bandwidth provisioning, accounting and network\nanomaly detection can be easily met if high-volume traffic clusters are\ndetected in real time. This paper presents Elastic Trie, an alternative to\napproaches leveraging controller-dataplane architectures.\n  Our solution is a novel push-based network monitoring approach that allows\ndetection, within the dataplane, of high-volume traffic clusters. Notifications\nfrom the switch to the controller can be sent only as required, avoiding the\ntransmission or processing of unnecessary data. Furthermore, the dataplane can\niteratively refine the responsible IP prefixes allowing a controller to receive\na flexible granularity information. We report and discuss an evaluation of our\nP4-based prototype, showing our solution to be able to detect (with 95\\% of\nprecision), hierarchical heavy hitters and superspreaders using less than 8KB\nor 80KB of active memory respectively. Finally, Elastic Trie can identify\nchanges in the network traffic patterns, symptomatic of Denial-of-Service\nattack events.},\n  archiveprefix = {arxiv},\n  eprint        = {1805.05993v1},\n  keyword       = {cs.NI},\n}\n\n
\n
\n\n\n
\n High level goals such as bandwidth provisioning, accounting and network anomaly detection can be easily met if high-volume traffic clusters are detected in real time. This paper presents Elastic Trie, an alternative to approaches leveraging controller-dataplane architectures. Our solution is a novel push-based network monitoring approach that allows detection, within the dataplane, of high-volume traffic clusters. Notifications from the switch to the controller can be sent only as required, avoiding the transmission or processing of unnecessary data. Furthermore, the dataplane can iteratively refine the responsible IP prefixes allowing a controller to receive a flexible granularity information. We report and discuss an evaluation of our P4-based prototype, showing our solution to be able to detect (with 95% of precision), hierarchical heavy hitters and superspreaders using less than 8KB or 80KB of active memory respectively. Finally, Elastic Trie can identify changes in the network traffic patterns, symptomatic of Denial-of-Service attack events.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Understanding PCIe performance for end host networking.\n \n \n \n\n\n \n Neugebauer, R.; Antichi, G.; Zazo, J. F.; Audzevich, Y.; López-Buedo, S.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, pages 327–341, Aug 2018. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Neugebauer2018Understanding,\n  author            = {Neugebauer, Rolf and Antichi, Gianni and Zazo, Jos{\\'e} Fernando and Audzevich, Yury and L{\\'o}pez-Buedo, Sergio and Moore, Andrew W.},\n  booktitle         = {Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication},\n  title             = {{Understanding PCIe performance for end host networking}},\n  year              = {2018},\n  month             = {Aug},\n  pages             = {327--341},\n  abstract          = {© 2018 Copyright held by the owner/author(s). In recent years, spurred on by the development and availability of programmable NICs, end hosts have increasingly become the enforcement point for core network functions such as load balancing, congestion control, and application specific network offloads. However, implementing custom designs on programmable NICs is not easy: many potential bottlenecks can impact performance. This paper focuses on the performance implication of PCIe, the de-facto I/O interconnect in contemporary servers, when interacting with the host architecture and device drivers. We present a theoretical model for PCIe and pcie-bench, an open-source suite, that allows developers to gain an accurate and deep understanding of the PCIe substrate. Using pcie-bench, we characterize the PCIe subsystem in modern servers. We highlight surprising differences in PCIe implementations, evaluate the undesirable impact of PCIe features such as IOMMUs, and show the practical limits for common network cards operating at 40Gb/s and beyond. Furthermore, through pcie-bench we gained insights which guided software and future hardware architectures for both commercial and research oriented network cards and DMA engines.},\n  day               = {7},\n  doi               = {10.1145/3230543.3230560},\n  isbn              = {9781450355674},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n © 2018 Copyright held by the owner/author(s). In recent years, spurred on by the development and availability of programmable NICs, end hosts have increasingly become the enforcement point for core network functions such as load balancing, congestion control, and application specific network offloads. However, implementing custom designs on programmable NICs is not easy: many potential bottlenecks can impact performance. This paper focuses on the performance implication of PCIe, the de-facto I/O interconnect in contemporary servers, when interacting with the host architecture and device drivers. We present a theoretical model for PCIe and pcie-bench, an open-source suite, that allows developers to gain an accurate and deep understanding of the PCIe substrate. Using pcie-bench, we characterize the PCIe subsystem in modern servers. We highlight surprising differences in PCIe implementations, evaluate the undesirable impact of PCIe features such as IOMMUs, and show the practical limits for common network cards operating at 40Gb/s and beyond. Furthermore, through pcie-bench we gained insights which guided software and future hardware architectures for both commercial and research oriented network cards and DMA engines.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Dataset and Reproduction Environment for paper\" A First Look At Network Conditions Through The Eyes of PTPmesh\".\n \n \n \n\n\n \n Popescu, D.; and Moore, A.\n\n\n \n\n\n\n 2018.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Misc{Popescu2018Dataset,\n  author   = {Popescu, Diana and Moore, Andrew},\n  title    = {{Dataset and Reproduction Environment for paper" A First Look At Network Conditions Through The Eyes of PTPmesh"}},\n  year     = {2018},\n  abstract = {PTP measurements taken between pairs of VMs in different cloud providers.\n\nThe dataset is organised as follows:\n\n1. LowMessageFrequency/ contains the data for sections IV A (stats files) and V (messages log files).\n\n2. HighMessageFrequency/ contains the data for section IV B.\n\n3. OtherExperiments/ contains the data for sections III and V.\n\nThe folders have names according to the conventions used in the paper.\n\nThe folder environment contains the scripts used to collect the data.},\n  keyword  = {PTP},\n}\n\n
\n
\n\n\n
\n PTP measurements taken between pairs of VMs in different cloud providers. The dataset is organised as follows: 1. LowMessageFrequency/ contains the data for sections IV A (stats files) and V (messages log files). 2. HighMessageFrequency/ contains the data for section IV B. 3. OtherExperiments/ contains the data for sections III and V. The folders have names according to the conventions used in the paper. The folder environment contains the scripts used to collect the data.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (15)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Re-architecting datacenter networks and stacks for low latency and high performance.\n \n \n \n\n\n \n Handley, M.; Raiciu, C.; Agache, A.; Voinescu, A.; Moore, A. W.; Antichi, G.; and W$\\$$\\$'o$\\$jcik, M.\n\n\n \n\n\n\n In Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pages 29–42, 2017. ACM\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Handley2017Re,\n  author       = {Handley, Mark and Raiciu, Costin and Agache, Alexandru and Voinescu, Andrei and Moore, Andrew W. and Antichi, Gianni and W$\\{$$\\backslash$'o$\\}$jcik, Marcin},\n  booktitle    = {Proceedings of the Conference of the ACM Special Interest Group on Data Communication},\n  title        = {Re-architecting datacenter networks and stacks for low latency and high performance},\n  year         = {2017},\n  organization = {ACM},\n  pages        = {29--42},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n HyPaFilter+: Enhanced hybrid packet filtering using hardware assisted classification and header space analysis.\n \n \n \n\n\n \n Fiessler, A.; Lorenz, C.; Hager, S.; Scheuermann, B.; and Moore, A. W.\n\n\n \n\n\n\n IEEE/ACM Transactions on Networking, 25(6): 3655–3669. 2017.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Fiessler2017HyPaFilter+,\n  author    = {Fiessler, Andreas and Lorenz, Claas and Hager, Sven and Scheuermann, Bj{\\"o}rn and Moore, Andrew W.},\n  journal   = {IEEE/ACM Transactions on Networking},\n  title     = {{HyPaFilter+: Enhanced hybrid packet filtering using hardware assisted classification and header space analysis}},\n  year      = {2017},\n  number    = {6},\n  pages     = {3655--3669},\n  volume    = {25},\n  publisher = {IEEE},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Where has my time gone?.\n \n \n \n\n\n \n Zilberman, N.; Grosvenor, M.; Popescu, D. A.; Manihatty-Bojan, N.; Antichi, G.; Wójcik, M.; and Moore, A. W.\n\n\n \n\n\n\n In International Conference on Passive and Active Network Measurement, pages 201–214, 2017. Springer, Cham\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Zilberman2017Wherea,\n  author       = {Zilberman, Noa and Grosvenor, Matthew and Popescu, Diana Andreea and Manihatty-Bojan, Neelakandan and Antichi, Gianni and W{\\'o}jcik, Marcin and Moore, Andrew W.},\n  booktitle    = {International Conference on Passive and Active Network Measurement},\n  title        = {Where has my time gone?},\n  year         = {2017},\n  organization = {Springer, Cham},\n  pages        = {201--214},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Enabling fast hierarchical heavy hitter detection using programmable data planes.\n \n \n \n\n\n \n Popescu, D. A.; Antichi, G.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the Symposium on SDN Research, pages 191–192, 2017. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Popescu2017Enabling,\n  author    = {Popescu, Diana Andreea and Antichi, Gianni and Moore, Andrew W.},\n  booktitle = {Proceedings of the Symposium on SDN Research},\n  title     = {Enabling fast hierarchical heavy hitter detection using programmable data planes},\n  year      = {2017},\n  pages     = {191--192},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Ptpmesh: Data center network latency measurements using ptp.\n \n \n \n\n\n \n Popescu, D. A.; and Moore, A. W.\n\n\n \n\n\n\n In 2017 IEEE 25th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 73–79, 2017. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Popescu2017Ptpmesh,\n  author       = {Popescu, Diana Andreea and Moore, Andrew W.},\n  booktitle    = {2017 IEEE 25th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)},\n  title        = {{Ptpmesh: Data center network latency measurements using ptp}},\n  year         = {2017},\n  organization = {IEEE},\n  pages        = {73--79},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Network traffic classification via neural networks.\n \n \n \n\n\n \n Michael, A. K. J.; Valla, E.; Neggatu, N. S.; and Moore, A. W.\n\n\n \n\n\n\n Technical Report 2017.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Michael2017Network,\n  author = {Michael, Ang Kun Joo and Valla, Emma and Neggatu, Natinael Solomon and Moore, Andrew W.},\n  title  = {Network traffic classification via neural networks},\n  year   = {2017},\n  school = {University of Cambridge, Computer Laboratory},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Mind the Gap - A Comparison of Software Packet Generators.\n \n \n \n\n\n \n Emmerich, P.; Gallenmuller, S.; Antichi, G.; Moore, A. W.; and Carle, G.\n\n\n \n\n\n\n In Proceedings - 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2017, pages 191–203, Jun 2017. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Emmerich2017Mind,\n  author            = {Emmerich, P. and Gallenmuller, S. and Antichi, G. and Moore, A. W. and Carle, G.},\n  booktitle         = {Proceedings - 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2017},\n  title             = {{Mind the Gap - A Comparison of Software Packet Generators}},\n  year              = {2017},\n  month             = {Jun},\n  organization      = {IEEE},\n  pages             = {191--203},\n  abstract          = {© 2017 IEEE. Network research relies on packet generators to assess performance and correctness of new ideas. Software-based generators in particular are widely used by academic researchers because of their flexibility, affordability, and open-source nature. The rise of new frameworks for fast IO on commodity hardware is making them even more attractive. Longstanding performance differences of software generation versus hardware in terms of throughput are no longer as big of a concern as they used to be few years ago. This paper investigates the properties of several high-per-formance software packet generators and the implications on their precision when a given traffic pattern needs to be generated. We believe that the evaluation strategy presented in this paper helps understanding the actual limitations in high-performance software packet generation, thus helping the research community to build better tools.},\n  day               = {30},\n  doi               = {10.1109/ANCS.2017.32},\n  isbn              = {9781509063864},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n © 2017 IEEE. Network research relies on packet generators to assess performance and correctness of new ideas. Software-based generators in particular are widely used by academic researchers because of their flexibility, affordability, and open-source nature. The rise of new frameworks for fast IO on commodity hardware is making them even more attractive. Longstanding performance differences of software generation versus hardware in terms of throughput are no longer as big of a concern as they used to be few years ago. This paper investigates the properties of several high-per-formance software packet generators and the implications on their precision when a given traffic pattern needs to be generated. We believe that the evaluation strategy presented in this paper helps understanding the actual limitations in high-performance software packet generation, thus helping the research community to build better tools.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Emu: Rapid Prototyping of Networking Services.\n \n \n \n\n\n \n Sultana, N.; Galea, S.; Greaves, D.; Wojcik, M.; Shipton, J.; Clegg, R.; Mai, L.; Bressana, P.; Soule, R.; Mortier, R.; and others\n\n\n \n\n\n\n In 2017 USENIX Annual Technical Conference (USENIX ATC ’17), pages 459–471, Jan 2017. USENIX Association\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Sultana2017Emu,\n  author            = {Sultana, Nik and Galea, Salvator and Greaves, David and Wojcik, Marcin and Shipton, Jonny and Clegg, Richard and Mai, Luo and Bressana, Pietro and Soule, Robert and Mortier, Richard and others},\n  booktitle         = {2017 USENIX Annual Technical Conference (USENIX ATC ’17)},\n  title             = {{Emu: Rapid Prototyping of Networking Services}},\n  year              = {2017},\n  month             = {Jan},\n  organization      = {USENIX Association},\n  pages             = {459--471},\n  abstract          = {© USENIX Annual Technical Conference, USENIX ATC 2017. All rights reserved. Due to their performance and flexibility, FPGAs are an attractive platform for the execution of network functions. It has been a challenge for a long time though to make FPGA programming accessible to a large audience of developers. An appealing solution is to compile code from a general-purpose language to hardware using high-level synthesis. Unfortunately, current approaches to implement rich network functionality are insufficient because they lack: (i) libraries with abstractions for common network operations and data structures, (ii) bindings to the underlying “substrate” on the FPGA, and (iii) debugging and profiling support. This paper describes Emu, a new standard library for an FPGA hardware compiler that enables developers to rapidly create and deploy network functionality. Emu allows for high-performance designs without being bound to particular packet processing paradigms. Furthermore, it supports running the same programs on CPUs, in Mininet, and on FPGAs, providing a better development environment that includes advanced debugging capabilities. We demonstrate that network functions implemented using Emu have only negligible resource and performance overheads compared with natively-written hardware versions.},\n  day               = {1},\n  isbn              = {9781931971386},\n  journal           = {Proceedings of the 2017 USENIX Annual Technical Conference, USENIX ATC 2017},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n © USENIX Annual Technical Conference, USENIX ATC 2017. All rights reserved. Due to their performance and flexibility, FPGAs are an attractive platform for the execution of network functions. It has been a challenge for a long time though to make FPGA programming accessible to a large audience of developers. An appealing solution is to compile code from a general-purpose language to hardware using high-level synthesis. Unfortunately, current approaches to implement rich network functionality are insufficient because they lack: (i) libraries with abstractions for common network operations and data structures, (ii) bindings to the underlying “substrate” on the FPGA, and (iii) debugging and profiling support. This paper describes Emu, a new standard library for an FPGA hardware compiler that enables developers to rapidly create and deploy network functionality. Emu allows for high-performance designs without being bound to particular packet processing paradigms. Furthermore, it supports running the same programs on CPUs, in Mininet, and on FPGAs, providing a better development environment that includes advanced debugging capabilities. We demonstrate that network functions implemented using Emu have only negligible resource and performance overheads compared with natively-written hardware versions.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Exploration of FPGA-based packet switches for rack-scale computers on a board.\n \n \n \n\n\n \n Han, J. H.; Manihatty-Bojan, N.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings - IEEE 25th Annual International Symposium on Field-Programmable Custom Computing Machines, FCCM 2017, pages 133, Jun 2017. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Han2017Exploration,\n  author            = {Han, J. H. and Manihatty-Bojan, N. and Moore, A. W.},\n  booktitle         = {Proceedings - IEEE 25th Annual International Symposium on Field-Programmable Custom Computing Machines, FCCM 2017},\n  title             = {{Exploration of FPGA-based packet switches for rack-scale computers on a board}},\n  year              = {2017},\n  month             = {Jun},\n  organization      = {IEEE},\n  pages             = {133},\n  abstract          = {© 2017 IEEE. This work explores the design space (bandwidthand port configuration) for an FPGA-based top-of-rack switchand, use our implementation, to provide an insight on which ofthese options is the best. We also propose an architecture fora rack-scale computer built on a printed circuit board (PCB) exploiting the FPGA-based switch.},\n  day               = {30},\n  doi               = {10.1109/FCCM.2017.35},\n  isbn              = {9781538640364},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n © 2017 IEEE. This work explores the design space (bandwidthand port configuration) for an FPGA-based top-of-rack switchand, use our implementation, to provide an insight on which ofthese options is the best. We also propose an architecture fora rack-scale computer built on a printed circuit board (PCB) exploiting the FPGA-based switch.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Classbench-ng: Recasting classbench after a decade of network evolution.\n \n \n \n\n\n \n Matoušek, J.; Antichi, G.; Lučanskỳ, Adam; Moore, A. W.; and Kořenek, J.\n\n\n \n\n\n\n In 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), pages 204–216, Beijing, 2017. IEEE, IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Matousek2017Classbench,\n  author          = {Matou{\\v{s}}ek, Ji{\\v{r}}{\\'\\i} and Antichi, Gianni and Lu{\\v{c}}ansk{\\`y}, Adam and Moore, Andrew W. and Ko{\\v{r}}enek, Jan},\n  booktitle       = {2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},\n  title           = {{Classbench-ng: Recasting classbench after a decade of network evolution}},\n  year            = {2017},\n  address         = {Beijing},\n  organization    = {IEEE},\n  pages           = {204--216},\n  publisher       = {IEEE},\n  abstract        = {Internet evolution is driven by a continuous stream of new applications and users driving the demand for services. To keep up with this, a never-stopping research has been transforming the Internet ecosystem over the time. Technological changes on both protocols (the uptake of IPv6) and network architectures (the adoption of Software Defined Networking) introduced new challenges for ASIC designers. In particular, IPv6 and OpenFlow increased the complexity of the rule matching problem, pushing researchers to build new packet classiffication algorithms capable to keep pace with a steady growth of link speed. A lot of research effort identifies better lookup techniques capitalizing on the characteristics of rule sets. So far, the availability of small numbers of real rule sets and synthetic ones, generated with tools such as ClassBench, has boosted research in the IPv4 world. Starting from an analysis of rule sets taken from operational environments, we present ClassBench-ng, a new open source tool for the generation of synthetic IPv4, IPv6, and OpenFlow 1.0 rule sets exposing the same properties of real ones. We feel this tool can meet the requirements of nowadays researchers, boosting the rule matching research as ClassBench has done since ten years ago.},\n  date            = {18-19 May 2017},\n  doi             = {10.1109/ANCS.2017.33},\n  eventdate       = {18-19 May 2017},\n  eventtitleaddon = {Beijing},\n  file            = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7966918:PDF},\n  isbn            = {978-1-5090-6387-1},\n  journal         = {2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},\n  keywords        = {Tools, Internet, Protocols, IP networks, Hardware, Probability distribution, Ecosystems, ClassBench, OpenFlow, packet classification},\n}\n\n
\n
\n\n\n
\n Internet evolution is driven by a continuous stream of new applications and users driving the demand for services. To keep up with this, a never-stopping research has been transforming the Internet ecosystem over the time. Technological changes on both protocols (the uptake of IPv6) and network architectures (the adoption of Software Defined Networking) introduced new challenges for ASIC designers. In particular, IPv6 and OpenFlow increased the complexity of the rule matching problem, pushing researchers to build new packet classiffication algorithms capable to keep pace with a steady growth of link speed. A lot of research effort identifies better lookup techniques capitalizing on the characteristics of rule sets. So far, the availability of small numbers of real rule sets and synthetic ones, generated with tools such as ClassBench, has boosted research in the IPv4 world. Starting from an analysis of rule sets taken from operational environments, we present ClassBench-ng, a new open source tool for the generation of synthetic IPv4, IPv6, and OpenFlow 1.0 rule sets exposing the same properties of real ones. We feel this tool can meet the requirements of nowadays researchers, boosting the rule matching research as ClassBench has done since ten years ago.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Research data and software supporting PTPmesh: Data Center Network Latency Measurements Using PTP.\n \n \n \n\n\n \n Popescu, D.; and Moore, A.\n\n\n \n\n\n\n 2017.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Misc{Popescu2017Research,\n  author   = {Popescu, Diana and Moore, Andrew},\n  title    = {{Research data and software supporting PTPmesh: Data Center Network Latency Measurements Using PTP}},\n  year     = {2017},\n  abstract = {Dataset collected for the publication PTPmesh: Data Center Network Latency\nMeasurements Using PTP},\n  keyword  = {Network Latency Measurements},\n}\n\n
\n
\n\n\n
\n Dataset collected for the publication PTPmesh: Data Center Network Latency Measurements Using PTP\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Extending programs with debug-related features, with application to hardware development.\n \n \n \n\n\n \n Sultana, N.; Galea, S.; Greaves, D.; Wójcik, M.; Zilberman, N.; Clegg, R.; Mai, L.; Mortier, R.; Pietzuch, P.; Crowcroft, J.; and others\n\n\n \n\n\n\n arXiv preprint arXiv:1705.09902. 2017.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Sultana2017Extending,\n  author        = {Sultana, Nik and Galea, Salvator and Greaves, David and W{\\'o}jcik, Marcin and Zilberman, Noa and Clegg, Richard and Mai, Luo and Mortier, Richard and Pietzuch, Peter and Crowcroft, Jon and others},\n  journal       = {arXiv preprint arXiv:1705.09902},\n  title         = {Extending programs with debug-related features, with application to hardware development},\n  year          = {2017},\n  abstract      = {The capacity and programmability of reconfigurable hardware such as FPGAs has\nimproved steadily over the years, but they do not readily provide any\nmechanisms for monitoring or debugging running programs. Such mechanisms need\nto be written into the program itself. This is done using ad hoc methods and\nprimitive tools when compared to CPU programming. This complicates the\nprogramming and debugging of reconfigurable hardware. We introduce\nProgram-hosted Directability (PhD), the extension of programs to interpret\ndirection commands at runtime to enable debugging, monitoring and profiling.\nNormally in hardware development such features are fixed at compile time. We\npresent a language of directing commands, specify its semantics in terms of a\nsimple controller that is embedded with programs, and implement a prototype for\ndirecting network programs running in hardware. We show that this approach\naffords significant flexibility with low impact on hardware utilisation and\nperformance.},\n  archiveprefix = {arxiv},\n  eprint        = {1705.09902v1},\n  keyword       = {cs.PL},\n}\n\n
\n
\n\n\n
\n The capacity and programmability of reconfigurable hardware such as FPGAs has improved steadily over the years, but they do not readily provide any mechanisms for monitoring or debugging running programs. Such mechanisms need to be written into the program itself. This is done using ad hoc methods and primitive tools when compared to CPU programming. This complicates the programming and debugging of reconfigurable hardware. We introduce Program-hosted Directability (PhD), the extension of programs to interpret direction commands at runtime to enable debugging, monitoring and profiling. Normally in hardware development such features are fixed at compile time. We present a language of directing commands, specify its semantics in terms of a simple controller that is embedded with programs, and implement a prototype for directing network programs running in hardware. We show that this approach affords significant flexibility with low impact on hardware utilisation and performance.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Where Has My Time Gone? Reproduction Environment and Dataset.\n \n \n \n\n\n \n Zilberman, N.; Grosvenor, M.; Popescu, D.; Manihatty Bojan, N; Antichi, G.; Wojcik, M.; and Moore, A.\n\n\n \n\n\n\n 2017.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Misc{Zilberman2017Where,\n  author   = {Zilberman, Noa and Grosvenor, MP and Popescu, Diana and Manihatty Bojan, N and Antichi, Gianni and Wojcik, Marcin and Moore, Andrew},\n  title    = {Where Has My Time Gone? Reproduction Environment and Dataset},\n  year     = {2017},\n  abstract = {A dataset accompanying the PAM 2017 paper "Where Has My Time Gone?". This dataset includes both the scripts used for the measurements, and the results files.},\n  doi      = {10.17863/CAM.7418},\n  keyword  = {computer networks},\n}\n\n
\n
\n\n\n
\n A dataset accompanying the PAM 2017 paper \"Where Has My Time Gone?\". This dataset includes both the scripts used for the measurements, and the results files.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n ENDEAVOUR: A scalable SDN architecture for real-world IXPs.\n \n \n \n\n\n \n Antichi, G.; Castro, I.; Chiesa, M.; Fernandes, E. L.; Lapeyrade, R.; Kopp, D.; Han, J. H.; Bruyere, M.; Dietzel, C.; Gusat, M.; and others\n\n\n \n\n\n\n IEEE Journal on Selected Areas in Communications, 35(11): 2553–2562. 2017.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Antichi2017ENDEAVOUR,\n  author       = {Antichi, Gianni and Castro, Ignacio and Chiesa, Marco and Fernandes, Eder L. and Lapeyrade, Remy and Kopp, Daniel and Han, Jong Hun and Bruyere, Marc and Dietzel, Christoph and Gusat, Mitchell and others},\n  journal      = {IEEE Journal on Selected Areas in Communications},\n  title        = {{ENDEAVOUR: A scalable SDN architecture for real-world IXPs}},\n  year         = {2017},\n  issn         = {1558-0008},\n  number       = {11},\n  pages        = {2553--2562},\n  volume       = {35},\n  abstract     = {Innovation in interdomain routing has remained stagnant for over a decade. Recently, Internet eXchange Points (IXPs) have emerged as economically-advantageous interconnection points for reducing path latencies and exchanging ever increasing traffic volumes among, possibly, hundreds of networks. Given their far-reaching implications on interdomain routing, IXPs are the ideal place to foster network innovation and extend the benefits of software defined networking (SDN) to the interdomain level. In this paper, we present, evaluate, and demonstrate ENDEAVOUR, an SDN platform for IXPs. ENDEAVOUR can be deployed on a multi-hop IXP fabric, supports a large number of use cases, and is highly scalable, while avoiding broadcast storms. Our evaluation with real data from one of the largest IXPs, demonstrates the benefits and scalability of our solution: ENDEAVOUR requires around 70% fewer rules than alternative SDN solutions thanks to our rule partitioning mechanism. In addition, by providing an open source solution, we invite everyone from the community to experiment (and improve) our implementation as well as adapt it to new use cases.},\n  date         = {Nov. 2017},\n  doi          = {10.1109/JSAC.2017.2760398},\n  file         = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8068192:PDF},\n  issue        = {11},\n  journaltitle = {IEEE Journal on Selected Areas in Communications},\n  keywords     = {Software defined networking, Routing, Topology, Internet, Ports (Computers), Scalability, Servers, Internet eXchange points, inter-domain routing, peering},\n  publisher    = {IEEE},\n}\n\n
\n
\n\n\n
\n Innovation in interdomain routing has remained stagnant for over a decade. Recently, Internet eXchange Points (IXPs) have emerged as economically-advantageous interconnection points for reducing path latencies and exchanging ever increasing traffic volumes among, possibly, hundreds of networks. Given their far-reaching implications on interdomain routing, IXPs are the ideal place to foster network innovation and extend the benefits of software defined networking (SDN) to the interdomain level. In this paper, we present, evaluate, and demonstrate ENDEAVOUR, an SDN platform for IXPs. ENDEAVOUR can be deployed on a multi-hop IXP fabric, supports a large number of use cases, and is highly scalable, while avoiding broadcast storms. Our evaluation with real data from one of the largest IXPs, demonstrates the benefits and scalability of our solution: ENDEAVOUR requires around 70% fewer rules than alternative SDN solutions thanks to our rule partitioning mechanism. In addition, by providing an open source solution, we invite everyone from the community to experiment (and improve) our implementation as well as adapt it to new use cases.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Characterizing the impact of network latency on cloud-based applications’ performance.\n \n \n \n\n\n \n Popescu, D.; Zilberman, N.; and Moore, A.\n\n\n \n\n\n\n , (UCAM-CL-TR-914). Nov 2017.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Popescu2017Characterizing,\n  author       = {Popescu, Diana and Zilberman, Noa and Moore, Andrew},\n  title        = {Characterizing the impact of network latency on cloud-based applications’ performance},\n  year         = {2017},\n  issn         = {1476-2986},\n  month        = {Nov},\n  number       = {UCAM-CL-TR-914},\n  abstract     = {Businesses and individuals run increasing numbers of applications in the cloud. The performance of an application running in the cloud depends on the data center conditions and upon the resources committed to an application. Small network delays may lead to a significant performance degradation, which affects both the user’s cost and the service provider’s resource usage, power consumption and data center efficiency. In this work, we quantify the effect of network latency on several typical cloud workloads, varying in complexity and use cases. Our results show that different applications are affected by network latency to differing amounts. These insights into the effect of network latency on different applications have ramifications for workload placement and physical host sharing when trying to reach performance targets.},\n  confidential = {False},\n  day          = {30},\n  keyword      = {Application Performance},\n  publisher    = {Computer Laboratory technical reports},\n}\n\n
\n
\n\n\n
\n Businesses and individuals run increasing numbers of applications in the cloud. The performance of an application running in the cloud depends on the data center conditions and upon the resources committed to an application. Small network delays may lead to a significant performance degradation, which affects both the user’s cost and the service provider’s resource usage, power consumption and data center efficiency. In this work, we quantify the effect of network latency on several typical cloud workloads, varying in complexity and use cases. Our results show that different applications are affected by network latency to differing amounts. These insights into the effect of network latency on different applications have ramifications for workload placement and physical host sharing when trying to reach performance targets.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n From photons to big-data applications: terminating terabits.\n \n \n \n\n\n \n Zilberman, N.; Moore, A. W.; and Crowcroft, J. A.\n\n\n \n\n\n\n Phil. Trans. R. Soc. A, 374(2062). 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Zilberman2016photons,\n  author    = {Zilberman, Noa and Moore, Andrew W. and Crowcroft, Jon A.},\n  journal   = {Phil. Trans. R. Soc. A},\n  title     = {From photons to big-data applications: terminating terabits},\n  year      = {2016},\n  number    = {2062},\n  volume    = {374},\n  publisher = {ROYAL SOCIETY PUBLISHING},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Emu: Rapid FPGA prototyping of network services in c.\n \n \n \n\n\n \n Galea, S.; Sultana, N.; Bressana, P.; Greaves, D.; Soulé, R.; Moore, A. W.; and Zilberman, N.\n\n\n \n\n\n\n . 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Galea2016Emu,\n  author = {Galea, Salvator and Sultana, Nik and Bressana, Pietro and Greaves, David and Soul{\\'e}, Robert and Moore, Andrew W. and Zilberman, Noa},\n  title  = {{Emu: Rapid FPGA prototyping of network services in c}},\n  year   = {2016},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Modular Research-Based Composably Trustworthy Mission-Oriented Resilient Clouds (MRC2).\n \n \n \n\n\n \n Neumann, P. G.; Moore, S. W.; Watson, R. N.; Anderson, J.; Dave, N.; Davis, B.; Han, J. H.; Hand, S. M.; Horsman, A.; Huxtable, M.; and others\n\n\n \n\n\n\n Technical Report 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Neumann2016Modular,\n  author = {Neumann, Peter G. and Moore, Simon W. and Watson, Robert N. and Anderson, Jonathan and Dave, Nirav and Davis, Brooks and Han, Jong H. and Hand, Steven M. and Horsman, Alex and Huxtable, Matt and others},\n  title  = {{Modular Research-Based Composably Trustworthy Mission-Oriented Resilient Clouds (MRC2)}},\n  year   = {2016},\n  school = {SRI INTERNATIONAL Menlo Park United States},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Inter-domain networking innovation on steroids: empowering ixps with SDN capabilities.\n \n \n \n\n\n \n Chiesa, M.; Dietzel, C.; Antichi, G.; Bruyere, M.; Castro, I.; Gusat, M.; King, T.; Moore, A. W.; Nguyen, T. D.; Owezarski, P.; and others\n\n\n \n\n\n\n IEEE Communications Magazine, 54(10): 102–108. 2016.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Chiesa2016Inter,\n  author       = {Chiesa, Marco and Dietzel, Christoph and Antichi, Gianni and Bruyere, Marc and Castro, Ignacio and Gusat, Mitch and King, Thomas and Moore, Andrew W. and Nguyen, Thanh Dang and Owezarski, Philippe and others},\n  journal      = {IEEE Communications Magazine},\n  title        = {{Inter-domain networking innovation on steroids: empowering ixps with SDN capabilities}},\n  year         = {2016},\n  issn         = {1558-1896},\n  number       = {10},\n  pages        = {102--108},\n  volume       = {54},\n  abstract     = {While innovation in inter-domain routing has remained stagnant for over a decade, Internet exchange points (IXPs) are consolidating their role as economically advantageous interconnection points for reducing path latencies and exchanging ever increasing amounts of traffic. As such, IXPs appear as a natural place to foster network innovation and assess the benefits of SDN, a recent technological trend that has already boosted innovation within data center networks. In this article, we give a comprehensive overview of use cases for SDN at IXPs, which leverage the superior vantage point of an IXP to introduce advanced features like load balancing and DDoS mitigation. We discuss the benefits of SDN solutions by analyzing real-world data from one of the largest IXPs. We also leverage insights into IXP operations to shape benefits not only for members but also for operators.},\n  date         = {October 2016},\n  doi          = {10.1109/MCOM.2016.7588277},\n  file         = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7588277:PDF},\n  issue        = {10},\n  journaltitle = {IEEE Communications Magazine},\n  keywords     = {Ports (Computers), Routing, IP networks, Technological innovation, Computer crime, Software radio, Information exchange, Internet},\n  publisher    = {IEEE},\n}\n\n
\n
\n\n\n
\n While innovation in inter-domain routing has remained stagnant for over a decade, Internet exchange points (IXPs) are consolidating their role as economically advantageous interconnection points for reducing path latencies and exchanging ever increasing amounts of traffic. As such, IXPs appear as a natural place to foster network innovation and assess the benefits of SDN, a recent technological trend that has already boosted innovation within data center networks. In this article, we give a comprehensive overview of use cases for SDN at IXPs, which leverage the superior vantage point of an IXP to introduce advanced features like load balancing and DDoS mitigation. We discuss the benefits of SDN solutions by analyzing real-world data from one of the largest IXPs. We also leverage insights into IXP operations to shape benefits not only for members but also for operators.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n HyPaFilter: A versatile hybrid FPGA packet filter.\n \n \n \n\n\n \n Fiessler, A.; Hager, S.; Scheuermann, B.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems, pages 25–36, Santa Clara, CA, 2016. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Fiessler2016HyPaFilter,\n  author          = {Fiessler, Andreas and Hager, Sven and Scheuermann, Bjoen and Moore, Andrew W.},\n  booktitle       = {Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems},\n  title           = {{HyPaFilter: A versatile hybrid FPGA packet filter}},\n  year            = {2016},\n  address         = {Santa Clara, CA},\n  pages           = {25--36},\n  publisher       = {IEEE},\n  abstract        = {With network traffic rates continuously growing, security systems like firewalls are facing increasing challenges to process incoming packets at line speed without sacrificing protection. Accordingly, specialized hardware firewalls are increasingly used in high-speed environments. Hardware solutions, though, are inherently limited in terms of the complexity of the policies they can implement, often forcing users to choose between throughput and comprehensive analysis. On the contrary, complex rules typically constitute only a small fraction of the rule set. This motivates the combination of massively parallel, yet complexity-limited specialized circuitry with a slower, but semantically powerful software firewall. The key challenge in such a design arises from the dependencies between classification rules due to their relative priorities within the rule set: complex rules requiring software-based processing may be interleaved at arbitrary positions between those where hardware processing is feasible. We therefore discuss approaches for partitioning and transforming rule sets for hybrid packet processing, and propose HyPaFilter, a hybrid classification system based on tailored circuitry on an FPGA as an accelerator for a Linux net-filter firewall. Our evaluation demonstrates 30-fold performance gains in comparison to software-only processing.},\n  date            = {17-18 March 2016},\n  doi             = {10.1145/2881025.2881033},\n  eventdate       = {17-18 March 2016},\n  eventtitleaddon = {Santa Clara, CA},\n  file            = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7856556:PDF},\n  isbn            = {978-1-5090-6606-3},\n  journal         = {2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},\n  keywords        = {Hardware, Software, Throughput, Semantics, Field programmable gate arrays, Inspection, Software algorithms, Packet classification, FPGA hardware accelerator, Firewall},\n}\n\n
\n
\n\n\n
\n With network traffic rates continuously growing, security systems like firewalls are facing increasing challenges to process incoming packets at line speed without sacrificing protection. Accordingly, specialized hardware firewalls are increasingly used in high-speed environments. Hardware solutions, though, are inherently limited in terms of the complexity of the policies they can implement, often forcing users to choose between throughput and comprehensive analysis. On the contrary, complex rules typically constitute only a small fraction of the rule set. This motivates the combination of massively parallel, yet complexity-limited specialized circuitry with a slower, but semantically powerful software firewall. The key challenge in such a design arises from the dependencies between classification rules due to their relative priorities within the rule set: complex rules requiring software-based processing may be interleaved at arbitrary positions between those where hardware processing is feasible. We therefore discuss approaches for partitioning and transforming rule sets for hybrid packet processing, and propose HyPaFilter, a hybrid classification system based on tailored circuitry on an FPGA as an accelerator for a Linux net-filter firewall. Our evaluation demonstrates 30-fold performance gains in comparison to software-only processing.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Prototyping RISC based, reconfigurable networking applications in open source.\n \n \n \n\n\n \n Han, J. H.; Zilberman, N.; Zeeb, B. A.; Fiessler, A.; and Moore, A. W.\n\n\n \n\n\n\n arXiv preprint arXiv:1612.05547. 2016.\n 7 pages, 6 figures\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Han2016Prototyping,\n  author        = {Han, Jong Hun and Zilberman, Noa and Zeeb, Bjoern A. and Fiessler, Andreas and Moore, Andrew W.},\n  journal       = {arXiv preprint arXiv:1612.05547},\n  title         = {{Prototyping RISC based, reconfigurable networking applications in open source}},\n  year          = {2016},\n  note          = {7 pages, 6 figures},\n  abstract      = {In the last decade we have witnessed a rapid growth in data center systems,\nrequiring new and highly complex networking devices. The need to refresh\nnetworking infrastructure whenever new protocols or functions are introduced,\nand the increasing costs that this entails, are of a concern to all data center\nproviders. New generations of Systems on Chip (SoC), integrating\nmicroprocessors and higher bandwidth interfaces, are an emerging solution to\nthis problem. These devices permit entirely new systems and architectures that\ncan obviate the replacement of existing networking devices while enabling\nseamless functionality change. In this work, we explore open source, RISC\nbased, SoC architectures with high performance networking capabilities. The\nprototype architectures are implemented on the NetFPGA-SUME platform. Beyond\ndetails of the architecture, we also describe the hardware implementation and\nthe porting of operating systems to the platform. The platform can be exploited\nfor the development of practical networking appliances, and we provide use case\nexamples.},\n  archiveprefix = {arxiv},\n  eprint        = {1612.05547v1},\n  keyword       = {cs.AR},\n}\n\n
\n
\n\n\n
\n In the last decade we have witnessed a rapid growth in data center systems, requiring new and highly complex networking devices. The need to refresh networking infrastructure whenever new protocols or functions are introduced, and the increasing costs that this entails, are of a concern to all data center providers. New generations of Systems on Chip (SoC), integrating microprocessors and higher bandwidth interfaces, are an emerging solution to this problem. These devices permit entirely new systems and architectures that can obviate the replacement of existing networking devices while enabling seamless functionality change. In this work, we explore open source, RISC based, SoC architectures with high performance networking capabilities. The prototype architectures are implemented on the NetFPGA-SUME platform. Beyond details of the architecture, we also describe the hardware implementation and the porting of operating systems to the platform. The platform can be exploited for the development of practical networking appliances, and we provide use case examples.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Technical Perspective: Jupiter rising.\n \n \n \n\n\n \n Moore, A. W.\n\n\n \n\n\n\n Communications of the ACM, 59(9): 87–87. Sep 2016.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Moore2016Technical,\n  author            = {Moore, Andrew W.},\n  journal           = {Communications of the ACM},\n  title             = {{Technical Perspective: Jupiter rising}},\n  year              = {2016},\n  issn              = {0001-0782},\n  month             = {Sep},\n  number            = {9},\n  pages             = {87--87},\n  volume            = {59},\n  day               = {1},\n  doi               = {10.1145/2975000},\n  eissn             = {1557-7317},\n  publicationstatus = {published},\n  publisher         = {ACM New York, NY, USA},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reproducing Network Experiments in a Time-controlled Emulation Environment.\n \n \n \n \n\n\n \n Popescu, D. A.; and Moore, A. W.\n\n\n \n\n\n\n In http://dl.ifip.org/db/conf/tma/tma2016/index.html, 2016. Louvain la Neuve, Belgium, IFIP\n \n\n\n\n
\n\n\n\n \n \n \"ReproducingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{Popescu2016Reproducing,\n  author       = {Popescu, D. A. and Moore, A. W.},\n  booktitle    = {http://dl.ifip.org/db/conf/tma/tma2016/index.html},\n  title        = {{Reproducing Network Experiments in a Time-controlled Emulation Environment}},\n  year         = {2016},\n  organization = {Louvain la Neuve, Belgium},\n  publisher    = {IFIP},\n  abstract     = {Network emulation environments are a valuable\nresearch tool that offer the possibility of conducting complex\nnetwork experiments and can be seen as an enabler of experimental\nreproducibility. Keen to quantify this approach, we\nreproduce experiments presented in QJump in the time-controlled\nnetwork emulation framework, called SELENA.\nWe first describe in detail how we built the experimental setup.\nNext, we evaluate the SELENA emulation framework using real\nworld applications, Hadoop MapReduce, memcached and PTPd.\nWe demonstrate our findings, presenting the differences between\nthe results obtained on a hardware testbed and in the emulation\nenvironment.},\n  conference   = {Traffic Monitoring and Analysis - 8th International Workshop, TMA 2016},\n  finishday    = {8},\n  finishmonth  = {Apr},\n  finishyear   = {2016},\n  keyword      = {Network Experiments},\n  startday     = {7},\n  startmonth   = {Apr},\n  startyear    = {2016},\n  url          = {http://www.ifip.org/},\n}\n\n
\n
\n\n\n
\n Network emulation environments are a valuable research tool that offer the possibility of conducting complex network experiments and can be seen as an enabler of experimental reproducibility. Keen to quantify this approach, we reproduce experiments presented in QJump in the time-controlled network emulation framework, called SELENA. We first describe in detail how we built the experimental setup. Next, we evaluate the SELENA emulation framework using real world applications, Hadoop MapReduce, memcached and PTPd. We demonstrate our findings, presenting the differences between the results obtained on a hardware testbed and in the emulation environment.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Light at the middle of the tunnel: Middleboxes for selective disclosure of network monitoring to distrusted parties.\n \n \n \n\n\n \n Sultana, N.; Kohlweiss, M.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 2016 workshop on Hot topics in Middleboxes and Network Function Virtualization, pages 1–6, Aug 2016. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Sultana2016Light,\n  author            = {Sultana, Nik and Kohlweiss, Markulf and Moore, Andrew W.},\n  booktitle         = {Proceedings of the 2016 workshop on Hot topics in Middleboxes and Network Function Virtualization},\n  title             = {{Light at the middle of the tunnel: Middleboxes for selective disclosure of network monitoring to distrusted parties}},\n  year              = {2016},\n  month             = {Aug},\n  pages             = {1--6},\n  abstract          = {© 2016 ACM. Network monitoring is vital to the administration and operation of networks, but it requires privileged ac-cess that only highly trusted parties are granted. This severely limits opportunities for external parties, such as service or equipment providers, auditors, or even clients, to measure the health or operation of a net-work in which they are stakeholders, but do not have access to its internal structure. In this position paper we propose the use of mid-dleboxes to open up network monitoring to external parties using techniques from privacy-preservation re-search. This would allow distrusted parties to make more inferences about the network state than currently possible, without learning any precise information about the network or data that crosses it. Thus the state of the network would be more trans-parent to external stakeholders, who would be empow-ered to verify claims made by network operators. Net-work operators would be able to provide more informa-tion about their network without compromising security or privacy.},\n  day               = {22},\n  doi               = {10.1145/2940147.2940151},\n  isbn              = {9781450344241},\n  journal           = {HotMiddlebox 2016 - Proceedings of the 2016 ACM SIGCOMM Workshop on Hot Topics in Middleboxes and Network Function Virtualization, Part of SIGCOMM 2016},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n © 2016 ACM. Network monitoring is vital to the administration and operation of networks, but it requires privileged ac-cess that only highly trusted parties are granted. This severely limits opportunities for external parties, such as service or equipment providers, auditors, or even clients, to measure the health or operation of a net-work in which they are stakeholders, but do not have access to its internal structure. In this position paper we propose the use of mid-dleboxes to open up network monitoring to external parties using techniques from privacy-preservation re-search. This would allow distrusted parties to make more inferences about the network state than currently possible, without learning any precise information about the network or data that crosses it. Thus the state of the network would be more trans-parent to external stakeholders, who would be empow-ered to verify claims made by network operators. Net-work operators would be able to provide more informa-tion about their network without compromising security or privacy.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (20)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n An integrated environment for open-source network softwarization.\n \n \n \n\n\n \n Han, J. H.; Antichi, G.; Zilberman, N.; Rotsos, C.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft), pages 1–2, 2015. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Han2015integrated,\n  author       = {Han, Jong Hun and Antichi, Gianni and Zilberman, Noa and Rotsos, Charalampos and Moore, Andrew W.},\n  booktitle    = {Proceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft)},\n  title        = {An integrated environment for open-source network softwarization},\n  year         = {2015},\n  organization = {IEEE},\n  pages        = {1--2},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Challenge: Resolving data center power bill disputes: The energy-performance trade-offs of consolidation.\n \n \n \n\n\n \n Chatzipapas, A.; Pediaditakis, D.; Rotsos, C.; Mancuso, V.; Crowcroft, J.; and Moore, A.\n\n\n \n\n\n\n In Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, pages 89–94, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Chatzipapas2015Challenge,\n  author    = {Chatzipapas, Angelos and Pediaditakis, Dimosthenis and Rotsos, Charalampos and Mancuso, Vincenzo and Crowcroft, Jon and Moore, Andrew},\n  booktitle = {Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems},\n  title     = {{Challenge: Resolving data center power bill disputes: The energy-performance trade-offs of consolidation}},\n  year      = {2015},\n  pages     = {89--94},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Queues Don’t Matter When You Can JUMP Them!.\n \n \n \n\n\n \n Grosvenor, M. P.; Schwarzkopf, M.; Gog, I.; Watson, R. N. M.; Moore, A. W.; Hand, S.; and Crowcroft, J.\n\n\n \n\n\n\n In Proc. NSDI, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Grosvenor2015Queues,\n  author    = {Grosvenor, Matthew P. and Schwarzkopf, Malte and Gog, Ionel and Watson, Robert N. M. and Moore, Andrew W. and Hand, Steven and Crowcroft, Jon},\n  booktitle = {Proc. NSDI},\n  title     = {{Queues Don’t Matter When You Can JUMP Them!}},\n  year      = {2015},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Blueswitch: Enabling Provably Consistent Configuration of Network Switches.\n \n \n \n\n\n \n Han, J. H.; Mundkur, P.; Rotsos, C.; Antichi, G.; Dave, N. H.; Moore, A. W.; and Neumann, P. G.\n\n\n \n\n\n\n In Proceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systems (ANCS '15), pages 17–27, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Han2015Blueswitch,\n  author    = {Han, Jong Hun and Mundkur, Prashanth and Rotsos, Charalampos and Antichi, Gianni and Dave, Nirav H. and Moore, Andrew William and Neumann, Peter G.},\n  booktitle = {Proceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systems (ANCS '15)},\n  title     = {{Blueswitch: Enabling Provably Consistent Configuration of Network Switches}},\n  year      = {2015},\n  pages     = {17--27},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Towards an SDN network control application for differentiated traffic routing.\n \n \n \n\n\n \n Adami, D.; Antichi, G.; Garroppo, R. G.; Giordano, S.; and Moore, A. W.\n\n\n \n\n\n\n In 2015 IEEE International Conference on Communications (ICC), pages 5827–5832, 2015. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Adami2015Towards,\n  author       = {Adami, Davide and Antichi, Gianni and Garroppo, Rosario G. and Giordano, Stefano and Moore, Andrew W.},\n  booktitle    = {2015 IEEE International Conference on Communications (ICC)},\n  title        = {{Towards an SDN network control application for differentiated traffic routing}},\n  year         = {2015},\n  organization = {IEEE},\n  pages        = {5827--5832},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A PCIe DMA engine to support the virtualization of 40 Gbps FPGA-accelerated network appliances.\n \n \n \n\n\n \n Zazo, J. F.; Lopez-Buedo, S.; Audzevich, Y.; and Moore, A. W.\n\n\n \n\n\n\n In 2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig), pages 1–6, 2015. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Zazo2015PCIe,\n  author       = {Zazo, Jose Fernando and Lopez-Buedo, Sergio and Audzevich, Yury and Moore, Andrew W.},\n  booktitle    = {2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)},\n  title        = {{A PCIe DMA engine to support the virtualization of 40 Gbps FPGA-accelerated network appliances}},\n  year         = {2015},\n  organization = {IEEE},\n  pages        = {1--6},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Extreme data-rate scheduling for the data center.\n \n \n \n\n\n \n Manihatty-Bojan, N.; Zilberman, N.; Antichi, G.; and Moore, A. W.\n\n\n \n\n\n\n ACM SIGCOMM Computer Communication Review, 45(4): 351–352. 2015.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{ManihattyBojan2015Extreme,\n  author    = {Manihatty-Bojan, Neelakandan and Zilberman, Noa and Antichi, Gianni and Moore, Andrew W.},\n  journal   = {ACM SIGCOMM Computer Communication Review},\n  title     = {Extreme data-rate scheduling for the data center},\n  year      = {2015},\n  number    = {4},\n  pages     = {351--352},\n  volume    = {45},\n  publisher = {ACM New York, NY, USA},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Research data supporting\" From photons to big-data applications: terminating terabits\".\n \n \n \n\n\n \n Zilberman, N.; Moore, A. W.; and Crowcroft, J.\n\n\n \n\n\n\n 2015.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Zilberman2015Research,\n  author    = {Zilberman, Noa and Moore, Andrew W. and Crowcroft, Jon},\n  title     = {{Research data supporting" From photons to big-data applications: terminating terabits"}},\n  year      = {2015},\n  publisher = {University of Cambridge},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Extreme Data-rate Scheduling for the Data Center.\n \n \n \n\n\n \n Manihatty-Bojan, N.; Zilberman, N.; Antichi, G.; and Moore, A.\n\n\n \n\n\n\n . 2015.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{ManihattyBojan2015Extremea,\n  author    = {Manihatty-Bojan, Neelakandan and Zilberman, Noa and Antichi, Gianni and Moore, Andrew},\n  title     = {{Extreme Data-rate Scheduling for the Data Center}},\n  year      = {2015},\n  publisher = {ACM},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Security of ICs from Hardware Trojans.\n \n \n \n\n\n \n Kalogeridou, G.; Sklavos, N.; Moore, A. W.; and Koufopavlou, O.\n\n\n \n\n\n\n In Proceedings of the Workshop on Trustworthy Manufacturing and Utilization of Secure Devices, Grenoble, France, volume 13, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Kalogeridou2015Security,\n  author    = {Kalogeridou, Georgina and Sklavos, Nicolas and Moore, Andrew W. and Koufopavlou, Odysseas},\n  booktitle = {Proceedings of the Workshop on Trustworthy Manufacturing and Utilization of Secure Devices, Grenoble, France},\n  title     = {{Security of ICs from Hardware Trojans}},\n  year      = {2015},\n  volume    = {13},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Jump the queue to lower latency.\n \n \n \n\n\n \n Grosvenor, M. P.; Schwarzkopf, M.; Gog, I.; and Moore, A. W.\n\n\n \n\n\n\n ; login:: the magazine of USENIX & SAGE, 40(2): 6–10. 2015.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Grosvenor2015Jump,\n  author    = {Grosvenor, Matthew P. and Schwarzkopf, Malte and Gog, Ionel and Moore, Andrew W.},\n  journal   = {; login:: the magazine of USENIX \\& SAGE},\n  title     = {Jump the queue to lower latency},\n  year      = {2015},\n  number    = {2},\n  pages     = {6--10},\n  volume    = {40},\n  publisher = {USENIX Association},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n OFLOPS-Turbo: Testing the next-generation OpenFlow switch.\n \n \n \n\n\n \n Rotsos, C.; Antichi, G.; Bruyere, M.; Owezarski, P.; and Moore, A. W.\n\n\n \n\n\n\n In IEEE International Conference on Communications, volume 2015-September, pages 5571–5576, Sep 2015. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Rotsos2015OFLOPS,\n  author            = {Rotsos, C. and Antichi, G. and Bruyere, M. and Owezarski, P. and Moore, A. W.},\n  booktitle         = {IEEE International Conference on Communications},\n  title             = {{OFLOPS-Turbo: Testing the next-generation OpenFlow switch}},\n  year              = {2015},\n  month             = {Sep},\n  pages             = {5571--5576},\n  volume            = {2015-September},\n  abstract          = {© 2015 IEEE. The heterogeneity barrier breakthrough achieved by the OpenFlow protocol is currently paced by the variability in performance semantics among network devices, which reduces the ability of applications to take complete advantage of programmable control. As a result, control applications remain conservative on performance requirements in order to be generalizable and trade performance for explicit state consistency in order to support varying performance behaviours. In this paper we argue that network control must be optimized towards network device capabilities and network managers and application developers must perform informed design decision using accurate switch performance profiles. This becomes highly critical for modern OpenFlow-enabled 10 GbE optical switches which significantly elevate switch performance requirements. We present OFLOPS-Turbo, the integration of the OFLOPS switch evaluation platform, with the OSNT platform, a hardware-accelerated traffic generation and capture system supporting lossless 10 GbE functionality. Using OFLOPS-Turbo, we conduct an evaluation of flow table manipulation capabilities in a representative collection of 10 GbE production OpenFlow switch devices and interpret the evolution of OpenFlow support by comparison with historical data.},\n  day               = {9},\n  doi               = {10.1109/ICC.2015.7249210},\n  isbn              = {9781467364324},\n  issn              = {1550-3607},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n © 2015 IEEE. The heterogeneity barrier breakthrough achieved by the OpenFlow protocol is currently paced by the variability in performance semantics among network devices, which reduces the ability of applications to take complete advantage of programmable control. As a result, control applications remain conservative on performance requirements in order to be generalizable and trade performance for explicit state consistency in order to support varying performance behaviours. In this paper we argue that network control must be optimized towards network device capabilities and network managers and application developers must perform informed design decision using accurate switch performance profiles. This becomes highly critical for modern OpenFlow-enabled 10 GbE optical switches which significantly elevate switch performance requirements. We present OFLOPS-Turbo, the integration of the OFLOPS switch evaluation platform, with the OSNT platform, a hardware-accelerated traffic generation and capture system supporting lossless 10 GbE functionality. Using OFLOPS-Turbo, we conduct an evaluation of flow table manipulation capabilities in a representative collection of 10 GbE production OpenFlow switch devices and interpret the evolution of OpenFlow support by comparison with historical data.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Extreme data-rate scheduling for the data center.\n \n \n \n\n\n \n Bojan, N. M.; Zilberman, N.; Antichi, G.; and Moore, A. W.\n\n\n \n\n\n\n In SIGCOMM 2015 - Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, pages 351–352, Aug 2015. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Bojan2015Extreme,\n  author            = {Bojan, N. M. and Zilberman, N. and Antichi, G. and Moore, A. W.},\n  booktitle         = {SIGCOMM 2015 - Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication},\n  title             = {Extreme data-rate scheduling for the data center},\n  year              = {2015},\n  month             = {Aug},\n  pages             = {351--352},\n  day               = {17},\n  doi               = {10.1145/2785956.2790019},\n  isbn              = {9781450335423},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Future SDN-reconfiguration heartland, challenge and revolution.\n \n \n \n \n\n\n \n Moore, A.\n\n\n \n\n\n\n In 2015 12th International Joint Conference on e-Business and Telecommunications (ICETE), volume 3, pages IS–9, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"FuturePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Moore2015Future,\n  author            = {Moore, Andrew},\n  booktitle         = {2015 12th International Joint Conference on e-Business and Telecommunications (ICETE)},\n  title             = {{Future SDN-reconfiguration heartland, challenge and revolution}},\n  year              = {2015},\n  pages             = {IS--9},\n  volume            = {3},\n  publicationstatus = {published},\n  url               = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2\\&SrcApp=PARTNER_APP\\&SrcAuth=LinksAMR\\&KeyUT=WOS:000454679000003\\&DestLinkType=FullRecord\\&DestApp=ALL_WOS\\&UsrCustomerID=940c5db9f6a527ba8e12659dac275555},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Omniscient: Towards realizing near real-time data center network traffic maps.\n \n \n \n \n\n\n \n Popescu, D.; and Moore, A.\n\n\n \n\n\n\n . Dec 2015.\n This is the author's version of the work. It is posted here by permission of ACM for personal use only.\n\n\n\n
\n\n\n\n \n \n \"Omniscient:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Popescu2015Omniscient,\n  author            = {Popescu, Diana and Moore, Andrew},\n  title             = {{Omniscient: Towards realizing near real-time data center network traffic maps}},\n  year              = {2015},\n  month             = {Dec},\n  note              = {This is the author's version of the work. It is posted here by permission of ACM for personal use only.},\n  abstract          = {In order to make measurement-based placement, an optimiser\nmust make informed decisions. Currently, it is\ndifficult to assign routes or assign resource commitments\nto network paths in data centers, as applications do not\ndeclare what is carried within each flow. We propose to\nprovide insight into the traffic that traverses each network\nlink, realizing a near real-time map of a data center’s\nnetwork traffic. We present Omniscient, a system\nthat aims to increase the visibility into the data center\nnetwork traffic by computing link utilization broken\ndown by application instance using OpenFlow stats in\nan SDN-enabled data center. The goal of the system is\nto inform application instance placement and redundant\nnetwork path assignment in order to improve application\nperformance and resource utilization.},\n  conference        = {ACM CoNEXT Student Workshop 2015},\n  day               = {4},\n  finishday         = {4},\n  finishmonth       = {Dec},\n  finishyear        = {2015},\n  language          = {English},\n  organization      = {Heidelberg, Germany},\n  publicationstatus = {accepted},\n  publisher         = {Association for Computing Machinery},\n  startday          = {1},\n  startmonth        = {Dec},\n  startyear         = {2015},\n  url               = {http://www.cl.cam.ac.uk/~dap53/},\n}\n\n
\n
\n\n\n
\n In order to make measurement-based placement, an optimiser must make informed decisions. Currently, it is difficult to assign routes or assign resource commitments to network paths in data centers, as applications do not declare what is carried within each flow. We propose to provide insight into the traffic that traverses each network link, realizing a near real-time map of a data center’s network traffic. We present Omniscient, a system that aims to increase the visibility into the data center network traffic by computing link utilization broken down by application instance using OpenFlow stats in an SDN-enabled data center. The goal of the system is to inform application instance placement and redundant network path assignment in order to improve application performance and resource utilization.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Reconfigurable network systems and software-defined networking.\n \n \n \n\n\n \n Zilberman, N.; Watts, P. M.; Rotsos, C.; and Moore, A. W.\n\n\n \n\n\n\n Proceedings of the IEEE, 103(7): 1102–1124. 2015.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Zilberman2015Reconfigurable,\n  author       = {Zilberman, Noa and Watts, Philip M. and Rotsos, Charalampos and Moore, Andrew W.},\n  journal      = {Proceedings of the IEEE},\n  title        = {Reconfigurable network systems and software-defined networking},\n  year         = {2015},\n  issn         = {1558-2256},\n  number       = {7},\n  pages        = {1102--1124},\n  volume       = {103},\n  abstract     = {Modern high-speed networks have evolved from relatively static networks to highly adaptive networks facilitating dynamic reconfiguration. This evolution has influenced all levels of network design and management, introducing increased programmability and configuration flexibility. This influence has extended from the lowest level of physical hardware interfaces to the highest level of network management by software. A key representative of this evolution is the emergence of software-defined networking (SDN). In this paper, we review the current state of the art in reconfigurable network systems, covering hardware reconfiguration, SDN, and the interplay between them. We take a top-down approach, starting with a tutorial on software-defined networks. We then continue to discuss programming languages as the linking element between different levels of software and hardware in the network. We review electronic switching systems, highlighting programmability and reconfiguration aspects, and describe the trends in reconfigurable network elements. Finally, we describe the state of the art in the integration of photonic transceiver and switching elements with electronic technologies, and consider the implications for SDN and reconfigurable network systems.},\n  date         = {July 2015},\n  doi          = {10.1109/JPROC.2015.2435732},\n  file         = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7122247:PDF},\n  issue        = {7},\n  journaltitle = {Proceedings of the IEEE},\n  keywords     = {Technological innovation, Reconfigurable architectures, High speed networks, Internet, Field programmable gate arrays, Routing protocols, Field-programmable gate array (FPGA), reconfigurable devices, software-defined networks, switching fabrics},\n  publisher    = {IEEE},\n}\n\n
\n
\n\n\n
\n Modern high-speed networks have evolved from relatively static networks to highly adaptive networks facilitating dynamic reconfiguration. This evolution has influenced all levels of network design and management, introducing increased programmability and configuration flexibility. This influence has extended from the lowest level of physical hardware interfaces to the highest level of network management by software. A key representative of this evolution is the emergence of software-defined networking (SDN). In this paper, we review the current state of the art in reconfigurable network systems, covering hardware reconfiguration, SDN, and the interplay between them. We take a top-down approach, starting with a tutorial on software-defined networks. We then continue to discuss programming languages as the linking element between different levels of software and hardware in the network. We review electronic switching systems, highlighting programmability and reconfiguration aspects, and describe the trends in reconfigurable network elements. Finally, we describe the state of the art in the integration of photonic transceiver and switching elements with electronic technologies, and consider the implications for SDN and reconfigurable network systems.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n NetFPGA: Rapid prototyping of networking devices in open source.\n \n \n \n \n\n\n \n Zilberman, N.; Audzevich, Y.; Kalogeridou, G.; Manihatty-Bojan, N.; Zhang, J.; and Moore, A.\n\n\n \n\n\n\n In SIGCOMM 2015 - Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, volume 45, pages 363–364, Aug 2015. ACM New York, NY, USA\n \n\n\n\n
\n\n\n\n \n \n \"NetFPGA:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Zilberman2015NetFPGAa,\n  author            = {Zilberman, Noa and Audzevich, Yury and Kalogeridou, Georgina and Manihatty-Bojan, Neelakandan and Zhang, Jingyun and Moore, Andrew},\n  booktitle         = {SIGCOMM 2015 - Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication},\n  title             = {{NetFPGA: Rapid prototyping of networking devices in open source}},\n  year              = {2015},\n  month             = {Aug},\n  number            = {4},\n  pages             = {363--364},\n  publisher         = {ACM New York, NY, USA},\n  volume            = {45},\n  abstract          = {© 2015 ACM. The demand-led growth of datacenter networks has meant that many constituent technologies are beyond the budget of the wider community. In order to make and validate timely and relevant new contributions, the wider community requires accessible evaluation, experimentation and demonstration environments with specification comparable to the subsystems of the most massive datacenter networks. We demonstrate NetFPGA, an open-source platform for rapid prototyping of networking devices with I/O capabilities up to 100Gbps. NetFPGA offers an integrated environment that enables networking research by users from a wide range of disciplines: from hardware-centric research to formal methods.},\n  day               = {17},\n  doi               = {10.1145/2785956.2790029},\n  eissn             = {1943-5819},\n  isbn              = {9781450335423},\n  issn              = {0146-4833},\n  journal           = {ACM SIGCOMM Computer Communication Review},\n  language          = {en},\n  publicationstatus = {published},\n  url               = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2\\&SrcApp=PARTNER_APP\\&SrcAuth=LinksAMR\\&KeyUT=WOS:000370556200053\\&DestLinkType=FullRecord\\&DestApp=ALL_WOS\\&UsrCustomerID=940c5db9f6a527ba8e12659dac275555},\n}\n\n
\n
\n\n\n
\n © 2015 ACM. The demand-led growth of datacenter networks has meant that many constituent technologies are beyond the budget of the wider community. In order to make and validate timely and relevant new contributions, the wider community requires accessible evaluation, experimentation and demonstration environments with specification comparable to the subsystems of the most massive datacenter networks. We demonstrate NetFPGA, an open-source platform for rapid prototyping of networking devices with I/O capabilities up to 100Gbps. NetFPGA offers an integrated environment that enables networking research by users from a wide range of disciplines: from hardware-centric research to formal methods.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n NetFPGA - rapid prototyping of high bandwidth devices in open source.\n \n \n \n\n\n \n Zilberman, N.; Audzevich, Y.; Kalogeridou, G.; Bojan, N. M.; Zhang, J.; and Moore, A. W.\n\n\n \n\n\n\n In 2015 25th International Conference on Field Programmable Logic and Applications (FPL), pages 1–1, London, 2015. IEEE, IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Zilberman2015NetFPGA,\n  author          = {Noa Zilberman and Yury Audzevich and Georgina Kalogeridou and Neelakandan Manihatty Bojan and Jingyun Zhang and Andrew W. Moore},\n  booktitle       = {2015 25th International Conference on Field Programmable Logic and Applications (FPL)},\n  title           = {{NetFPGA - rapid prototyping of high bandwidth devices in open source}},\n  year            = {2015},\n  address         = {London},\n  organization    = {IEEE},\n  pages           = {1--1},\n  publisher       = {IEEE},\n  abstract        = {The demand-led growth of datacenter networks has meant that many constituent technologies are beyond the budget of the wider community. In order to make and validate timely and relevant new contributions, the wider community requires accessible evaluation, experimentation and demonstration environments with specification comparable to the subsystems of the most massive datacenter networks. We demonstrate NetFPGA SUME, an open-source FPGA-based PCIe board for rapid prototyping of high bandwidth devices. NetFPGA SUME has I/O capabilities for 100Gbps operation as a networking device, computing unit, or for test and measurement.},\n  date            = {2-4 Sept. 2015},\n  doi             = {10.1109/FPL.2015.7293966},\n  eventdate       = {2-4 Sept. 2015},\n  eventtitleaddon = {London},\n  file            = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7293966:PDF},\n  isbn            = {978-0-9934-2800-5},\n  issn            = {1946-1488},\n  journal         = {2015 25th International Conference on Field Programmable Logic and Applications (FPL)},\n  keywords        = {Open source software, Field programmable gate arrays, Random access memory, Hardware, Bandwidth, Connectors, Electronic mail},\n}\n\n
\n
\n\n\n
\n The demand-led growth of datacenter networks has meant that many constituent technologies are beyond the budget of the wider community. In order to make and validate timely and relevant new contributions, the wider community requires accessible evaluation, experimentation and demonstration environments with specification comparable to the subsystems of the most massive datacenter networks. We demonstrate NetFPGA SUME, an open-source FPGA-based PCIe board for rapid prototyping of high bandwidth devices. NetFPGA SUME has I/O capabilities for 100Gbps operation as a networking device, computing unit, or for test and measurement.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enabling performance evaluation beyond 10 gbps.\n \n \n \n \n\n\n \n Antichi, G.; Rotsos, C.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, volume 45, pages 369–370, Aug 2015. Association for Computing Machinery (ACM)\n \n\n\n\n
\n\n\n\n \n \n \"EnablingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{Antichi2015Enabling,\n  author            = {Antichi, Gianni and Rotsos, Charalampos and Moore, Andrew W.},\n  booktitle         = {Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication},\n  title             = {Enabling performance evaluation beyond 10 gbps},\n  year              = {2015},\n  month             = {Aug},\n  number            = {4},\n  pages             = {369--370},\n  publisher         = {Association for Computing Machinery (ACM)},\n  volume            = {45},\n  day               = {17},\n  doi               = {10.1145/2829988.2790036},\n  eissn             = {1943-5819},\n  issn              = {0146-4833},\n  journal           = {ACM SIGCOMM Computer Communication Review},\n  keyword           = {Network Testing},\n  language          = {en},\n  publicationstatus = {published},\n  url               = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2\\&SrcApp=PARTNER_APP\\&SrcAuth=LinksAMR\\&KeyUT=WOS:000370556200056\\&DestLinkType=FullRecord\\&DestApp=ALL_WOS\\&UsrCustomerID=940c5db9f6a527ba8e12659dac275555},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Graph metrics as summary statistics for Approximate Bayesian Computation with application to network model parameter estimation.\n \n \n \n\n\n \n Fay, D.; Moore, A. W.; Brown, K.; Filosi, M.; and Jurman, G.\n\n\n \n\n\n\n Journal of Complex Networks, 3(1): 52–83. 04 2015.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Fay2015Graph,\n  author    = {Fay, Damien and Moore, Andrew W. and Brown, Ken and Filosi, Michele and Jurman, Giuseppe},\n  journal   = {Journal of Complex Networks},\n  title     = {{Graph metrics as summary statistics for Approximate Bayesian Computation with application to network model parameter estimation}},\n  year      = {2015},\n  issn      = {2051-1310},\n  month     = {04},\n  number    = {1},\n  pages     = {52--83},\n  volume    = {3},\n  abstract  = {{In this paper, we investigate Approximate Bayes Computation as a technique for estimating the parameters of graph generators relative to an observed graph. Specifically, we investigate six spectral graph metrics with a view to evaluating their suitability as summary statistics. The overall findings are that Approximate Bayesian Computation can result in reasonable estimates of the parameter posteriors, if the rank of the metrics is sufficiently high. For some graph metrics, biases can exist in the estimated parameters though these appear, empirically, to be small. We demonstrate that combining metrics to form a new summary statistic provides more robust estimates. Given these results, the authors then create two, somewhat arbitrary, graph generators and show how the parameters for these may be estimated with ease. In addition, we show how to apply model selection to determine which generator best explains the observed graph.}},\n  doi       = {10.1093/comnet/cnu009},\n  eprint    = {https://academic.oup.com/comnet/article-pdf/3/1/52/1322749/cnu009.pdf},\n  publisher = {Oxford University Press},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate Approximate Bayes Computation as a technique for estimating the parameters of graph generators relative to an observed graph. Specifically, we investigate six spectral graph metrics with a view to evaluating their suitability as summary statistics. The overall findings are that Approximate Bayesian Computation can result in reasonable estimates of the parameter posteriors, if the rank of the metrics is sufficiently high. For some graph metrics, biases can exist in the estimated parameters though these appear, empirically, to be small. We demonstrate that combining metrics to form a new summary statistic provides more robust estimates. Given these results, the authors then create two, somewhat arbitrary, graph generators and show how the parameters for these may be estimated with ease. In addition, we show how to apply model selection to determine which generator best explains the observed graph.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (15)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Faithful Reproduction of Network Experiments.\n \n \n \n\n\n \n Pediaditakis, D.; Rotsos, C.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 10th ACM/IEEE Symposium on Architectures for networking and communications systems (ANCS), 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Pediaditakis2014Faithful,\n  author    = {Pediaditakis, Dimosthenis and Rotsos, Charalampos and Moore, Andrew W.},\n  booktitle = {Proceedings of the 10th ACM/IEEE Symposium on Architectures for networking and communications systems (ANCS)},\n  title     = {{Faithful Reproduction of Network Experiments}},\n  year      = {2014},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Interconnect for commodity FPGA clusters: standardized or customized?.\n \n \n \n\n\n \n Markettos, A. T.; Fox, P. J.; Moore, S. W.; and Moore, A. W.\n\n\n \n\n\n\n In 24th International Conference on Field Programmable Logic and Applications (FPL), 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Markettos2014Interconnect,\n  author    = {Markettos, A. Theodore and Fox, Paul J. and Moore, Simon W. and Moore, Andrew W.},\n  booktitle = {24th International Conference on Field Programmable Logic and Applications (FPL)},\n  title     = {{Interconnect for commodity FPGA clusters: standardized or customized?}},\n  year      = {2014},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n OSNT: Open Source Network Tester.\n \n \n \n\n\n \n Antichi, G.; Shahbaz, M.; Geng, Y.; Zilberman, N.; Covington, A.; Bruyere, M.; McKeown, N.; Feamster, N.; Felderman, B.; Blott, M.; and others\n\n\n \n\n\n\n IEEE Network Magazine. 2014.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Antichi2014OSNT,\n  author  = {Antichi, Gianni and Shahbaz, Muhammad and Geng, Yilong and Zilberman, Noa and Covington, Adam and Bruyere, Marc and McKeown, Nick and Feamster, Nick and Felderman, Bob and Blott, Michaela and others},\n  journal = {IEEE Network Magazine},\n  title   = {{OSNT: Open Source Network Tester}},\n  year    = {2014},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n JA-trie: Entropy-based packet classification.\n \n \n \n\n\n \n Antichi, G.; Callegari, C.; Moore, A. W.; Giordano, S.; and Anastasi, E.\n\n\n \n\n\n\n In 2014 IEEE 15th International Conference on High Performance Switching and Routing (HPSR), 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Antichi2014JA,\n  author    = {Antichi, Gianni and Callegari, Christian and Moore, Andrew W. and Giordano, Stefano and Anastasi, Enrico},\n  booktitle = {2014 IEEE 15th International Conference on High Performance Switching and Routing (HPSR)},\n  title     = {{JA-trie: Entropy-based packet classification}},\n  year      = {2014},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Hardware Trojan Detection Framework.\n \n \n \n\n\n \n Kalogeridou, G.; Sklavos, N.; and Moore, A. W.\n\n\n \n\n\n\n In Designing with Uncertainty - Opportunities & Challenges, 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Kalogeridou2014Hardware,\n  author    = {Kalogeridou, Georgina and Sklavos, Nicolas and Moore, Andrew W.},\n  booktitle = {Designing with Uncertainty - Opportunities \\& Challenges},\n  title     = {{A Hardware Trojan Detection Framework}},\n  year      = {2014},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Detecting Hardware Trojans in Wireless Communications.\n \n \n \n\n\n \n Kalogeridou, G.; Sklavos, N.; Moore, A. W.; Koufopaulou; and Odysseas\n\n\n \n\n\n\n In HiPEAC Computing Systems Week,, 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Kalogeridou2014Detecting,\n  author    = {Kalogeridou, Georgina and Sklavos, Nicolas and Moore, Andrew W. and Koufopaulou and Odysseas},\n  booktitle = {HiPEAC Computing Systems Week,},\n  title     = {{Detecting Hardware Trojans in Wireless Communications}},\n  year      = {2014},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n OFLOPS-Turbo: Testing the Next-Generation OpenFlow switch.\n \n \n \n\n\n \n Rotsos, C.; Antichi, G.; Bruyère, M.; Owezarski, P.; and Moore, A. W.\n\n\n \n\n\n\n In European Workshop on Software Defined Networks (EWSDN), 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Rotsos2014OFLOPSa,\n  author    = {Rotsos, Charalampos and Antichi, Gianni and Bruy{\\`e}re, Marc and Owezarski, Philippe and Moore, Andrew W.},\n  booktitle = {European Workshop on Software Defined Networks (EWSDN)},\n  title     = {{OFLOPS-Turbo: Testing the Next-Generation OpenFlow switch}},\n  year      = {2014},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n OFLOPS-Turbo: An open testing framework for next-generation OpenFlow switches.\n \n \n \n\n\n \n Rotsos, C.; Antichi, G.; Bruyere, M.; Owezarski, P.; and Moore, A. W.\n\n\n \n\n\n\n In Software Defined Networks (EWSDN), 2014 Third European Workshop on, pages 127–128, 2014. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Rotsos2014OFLOPS,\n  author       = {Rotsos, Charalampos and Antichi, Gianni and Bruyere, Marc and Owezarski, Philippe and Moore, Andrew W.},\n  booktitle    = {Software Defined Networks (EWSDN), 2014 Third European Workshop on},\n  title        = {{OFLOPS-Turbo: An open testing framework for next-generation OpenFlow switches}},\n  year         = {2014},\n  organization = {IEEE},\n  pages        = {127--128},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Future networking: reconfiguration heartland, challenge and revolution.\n \n \n \n\n\n \n Moore, A. W.\n\n\n \n\n\n\n In ANCS, pages 1–2, 2014. ACM Press\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{Moore2014Future,\n  author    = {Moore, Andrew William},\n  booktitle = {ANCS},\n  title     = {Future networking: reconfiguration heartland, challenge and revolution.},\n  year      = {2014},\n  pages     = {1--2},\n  publisher = {{ACM} Press},\n  doi       = {10.1145/2658260.2661779},\n  keywords  = {keynote},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n An Open-Source Hardware Approach for High Performance Low-Cost QoS Monitoring of VoIP Traffic.\n \n \n \n\n\n \n Antichi, G.; Donatini, L.; Garroppo, R. G.; Giordano, S.; and Moore, A. W.\n\n\n \n\n\n\n In International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, pages 1–15, 2014. Springer, Cham\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Antichi2014Open,\n  author       = {Antichi, Gianni and Donatini, Lisa and Garroppo, Rosario G. and Giordano, Stefano and Moore, Andrew W.},\n  booktitle    = {International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science},\n  title        = {{An Open-Source Hardware Approach for High Performance Low-Cost QoS Monitoring of VoIP Traffic}},\n  year         = {2014},\n  organization = {Springer, Cham},\n  pages        = {1--15},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Security: a Killer App for SDN?.\n \n \n \n\n\n \n Yu, D.; Moore, A. W.; Hall, C.; and Anderson, R.\n\n\n \n\n\n\n Technical Report 2014.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Yu2014Security,\n  author = {Yu, Dongting and Moore, Andrew W. and Hall, Chris and Anderson, Ross},\n  title  = {{Security: a Killer App for SDN?}},\n  year   = {2014},\n  school = {INDIANA UNIV AT BLOOMINGTON},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n An Open Testing Framework for Next-Generation Openflow Switches.\n \n \n \n\n\n \n Rotsos, C.; Antichi, G.; Bruyere, M.; Owezarski, P.; and Moore, A. W.\n\n\n \n\n\n\n In pages 127–128, London, 2014. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Rotsos2014Open,\n  author          = {Charalampos Rotsos and Gianni Antichi and Marc Bruyere and Philippe Owezarski and Andrew W. Moore},\n  title           = {{An Open Testing Framework for Next-Generation Openflow Switches}},\n  year            = {2014},\n  address         = {London},\n  pages           = {127--128},\n  publisher       = {IEEE},\n  abstract        = {The deployment experience of OpenFlow support in production networks has highlighted variable limitations between network devices and vendors, while the recent integration of OpenFlow control abstractions in 10 GbE switches, increases further the performance requirements to support the switch control plane. This paper presents OFLOPS-Turbo, an effort to integrate OFLOPS, the OpenFlow switch evaluation platform, with OSNT, a hardware-accelerated traffic generation and capture system.},\n  date            = {1-3 Sept. 2014},\n  doi             = {10.1109/EWSDN.2014.12},\n  eventdate       = {1-3 Sept. 2014},\n  eventtitleaddon = {London},\n  file            = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6984068:PDF},\n  isbn            = {978-1-4799-6919-7},\n  issn            = {2379-0369},\n  journal         = {2014 Third European Workshop on Software Defined Networks},\n  keywords        = {Testing, Control systems, Protocols, Hardware, Production, Performance evaluation, Computer architecture, SDN, OpenFlow, OpenSource, High Performance, NetFPGA},\n}\n\n
\n
\n\n\n
\n The deployment experience of OpenFlow support in production networks has highlighted variable limitations between network devices and vendors, while the recent integration of OpenFlow control abstractions in 10 GbE switches, increases further the performance requirements to support the switch control plane. This paper presents OFLOPS-Turbo, an effort to integrate OFLOPS, the OpenFlow switch evaluation platform, with OSNT, a hardware-accelerated traffic generation and capture system.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Time structure analysis of the LHCb DAQ network.\n \n \n \n\n\n \n Antichi, G.; Bruyere, M.; Campora Perez, D. H.; Liu, G.; Neufeld, N.; Giordano, S.; Owezarski, P.; and Moore, A.\n\n\n \n\n\n\n Journal of Physics: Conference Series, 513(TRACK 6): 062009. Jan 2014.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Antichi2014Time,\n  author            = {Antichi, G. and Bruyere, M. and Campora Perez, D. H. and Liu, G. and Neufeld, N. and Giordano, S. and Owezarski, P. and Moore, A.},\n  journal           = {Journal of Physics: Conference Series},\n  title             = {{Time structure analysis of the LHCb DAQ network}},\n  year              = {2014},\n  issn              = {1742-6588},\n  month             = {Jan},\n  number            = {TRACK 6},\n  pages             = {062009},\n  volume            = {513},\n  abstract          = {The LHCb DAQ Network is a real time high performance network, in which 350 data sources send data over a Gigabit Ethernet LAN to more than 1500 receiving nodes. The aggregated throughput of the application, called Event Building, is more than 60 Gbps. The protocol employed by LHCb makes the sending nodes transmit simultaneously portions of events to one receiving node at a time, which is selected using a credit-token scheme. The resulting traffic is very bursty and sensitive to irregularities in the temporal distribution of packet-bursts to the same destination or region of the network. In order to study the relevant properties of such a dataflow, a non-disruptive monitoring setup based on a networking capable FPGA (Netfpga) has been deployed. The Netfpga allows order of hundred nano-second precise time-stamping of packets. We study in detail the timing structure of the Event Building communication, and we identify potential effects of micro-bursts like buffer packet drops or jitter. © Published under licence by IOP Publishing Ltd.},\n  booktitle         = {Journal of Physics: Conference Series},\n  day               = {1},\n  doi               = {10.1088/1742-6596/513/6/062009},\n  eissn             = {1742-6596},\n  organization      = {IOP Publishing},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n The LHCb DAQ Network is a real time high performance network, in which 350 data sources send data over a Gigabit Ethernet LAN to more than 1500 receiving nodes. The aggregated throughput of the application, called Event Building, is more than 60 Gbps. The protocol employed by LHCb makes the sending nodes transmit simultaneously portions of events to one receiving node at a time, which is selected using a credit-token scheme. The resulting traffic is very bursty and sensitive to irregularities in the temporal distribution of packet-bursts to the same destination or region of the network. In order to study the relevant properties of such a dataflow, a non-disruptive monitoring setup based on a networking capable FPGA (Netfpga) has been deployed. The Netfpga allows order of hundred nano-second precise time-stamping of packets. We study in detail the timing structure of the Event Building communication, and we identify potential effects of micro-bursts like buffer packet drops or jitter. © Published under licence by IOP Publishing Ltd.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Collaborating with the enemy on network management.\n \n \n \n\n\n \n Hall, C.; Yu, D.; Zhang, Z.; Stout, J.; Odlyzko, A.; Moore, A. W.; Camp, J.; Benton, K.; and Anderson, R.\n\n\n \n\n\n\n In Cambridge International Workshop on Security Protocols, volume 8809, pages 154–162, Jan 2014. Springer, Cham\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Hall2014Collaborating,\n  author            = {Hall, Chris and Yu, Dongting and Zhang, Zhi-li and Stout, Jonathan and Odlyzko, Andrew and Moore, Andrew W. and Camp, Jean and Benton, Kevin and Anderson, Ross},\n  booktitle         = {Cambridge International Workshop on Security Protocols},\n  title             = {Collaborating with the enemy on network management},\n  year              = {2014},\n  month             = {Jan},\n  organization      = {Springer, Cham},\n  pages             = {154--162},\n  volume            = {8809},\n  abstract          = {© Springer International Publishing Switzerland. Software Defined Networking (SDN) deconstructs the current routing infrastructure into a small number of controllers, which are general purpose computers, and a large number of switches which are programmable forwarding engines. It is already deployed in data centres, where it offers considerable advantages of both cost and flexibility over a switching fabric of traditional routers. Such applications have a single controlling organisation and issues of trust between subdomains do not really arise. However for SDN to fulfil its potential, it is necessary to design and develop mechanisms for smart networks with mutually mistrustful principals. In an earlier paper, we used as an example an airport where we might have 100,000 staff working for 3,000 different firms which include not just competitors but also organisations in a state of conflict (for example, El Al and Iran Air). That paper discussed using hierarchical control structures to delegate trust with mechanisms focussed on preventing denialof- service attacks, with the assumption that confidentiality and integrity would be provided by the principals at higher layers. But this turns out to be a quagmire. Can you run your app and your enemy’s app on the same controllers of the same fabric, and get a passable separation of behaviour on private networks that run over the same switches? And can all this be done without a trusted root anywhere? This paper reports a project to build a test environment that adapts Quagga so that a software defined network can be automatically configured using information learned from BGP. Our Quagga for SDN Module, “QuaSM”, is designed to support the use of SDN in three further use cases: in a network exchange point, in an organisation seeking to join up two or more SDN islands using an existing BGP fabric; and in security research on virtual networking.},\n  day               = {1},\n  doi               = {10.1007/978-3-319-12400-1_15},\n  eissn             = {1611-3349},\n  isbn              = {9783319123998},\n  issn              = {0302-9743},\n  journal           = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n © Springer International Publishing Switzerland. Software Defined Networking (SDN) deconstructs the current routing infrastructure into a small number of controllers, which are general purpose computers, and a large number of switches which are programmable forwarding engines. It is already deployed in data centres, where it offers considerable advantages of both cost and flexibility over a switching fabric of traditional routers. Such applications have a single controlling organisation and issues of trust between subdomains do not really arise. However for SDN to fulfil its potential, it is necessary to design and develop mechanisms for smart networks with mutually mistrustful principals. In an earlier paper, we used as an example an airport where we might have 100,000 staff working for 3,000 different firms which include not just competitors but also organisations in a state of conflict (for example, El Al and Iran Air). That paper discussed using hierarchical control structures to delegate trust with mechanisms focussed on preventing denialof- service attacks, with the assumption that confidentiality and integrity would be provided by the principals at higher layers. But this turns out to be a quagmire. Can you run your app and your enemy’s app on the same controllers of the same fabric, and get a passable separation of behaviour on private networks that run over the same switches? And can all this be done without a trusted root anywhere? This paper reports a project to build a test environment that adapts Quagga so that a software defined network can be automatically configured using information learned from BGP. Our Quagga for SDN Module, “QuaSM”, is designed to support the use of SDN in three further use cases: in a network exchange point, in an organisation seeking to join up two or more SDN islands using an existing BGP fabric; and in security research on virtual networking.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n NetFPGA SUME: Toward 100 Gbps as Research Commodity.\n \n \n \n\n\n \n Zilberman, N.; Audzevich, Y.; Covington, G. A.; and Moore, A. W.\n\n\n \n\n\n\n IEEE Micro, 34(5): 32–41. 2014.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Zilberman2014NetFPGA,\n  author       = {Noa Zilberman and Yury Audzevich and G. Adam Covington and Andrew W. Moore},\n  journal      = {IEEE Micro},\n  title        = {{NetFPGA SUME: Toward 100 Gbps as Research Commodity}},\n  year         = {2014},\n  issn         = {1937-4143},\n  number       = {5},\n  pages        = {32--41},\n  volume       = {34},\n  abstract     = {The demand-led growth of datacenter networks has meant that many constituent technologies are beyond the research community's budget. NetFPGA SUME is an FPGA-based PCI Express board with I/O capabilities for 100 Gbps operation as a network interface card, multiport switch, firewall, or test and measurement environment. NetFPGA SUME provides an accessible development environment that both reuses existing codebases and enables new designs.},\n  date         = {Sept.-Oct. 2014},\n  doi          = {10.1109/MM.2014.61},\n  file         = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6866035:PDF},\n  issue        = {5},\n  journaltitle = {IEEE Micro},\n  keywords     = {Field programmable gate arrays, Optical fiber networks, Random access memory, Data centers, Bandwidth, Ports (Computers), Transceivers, programmable hardware, high speed computing, NetFPGA, networking},\n  publisher    = {IEEE},\n}\n\n
\n
\n\n\n
\n The demand-led growth of datacenter networks has meant that many constituent technologies are beyond the research community's budget. NetFPGA SUME is an FPGA-based PCI Express board with I/O capabilities for 100 Gbps operation as a network interface card, multiport switch, firewall, or test and measurement environment. NetFPGA SUME provides an accessible development environment that both reuses existing codebases and enables new designs.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n CamIO: declaring flexible and performant application I/O.\n \n \n \n\n\n \n Grosvenor, M. P.; Schwarzkopf, M.; Moore, A. W.; Watson, R. N. M.; and Hand, S.\n\n\n \n\n\n\n In Demo abstract at the 4th Asia-Pacific Workshop on Systems (APSYS), 2013. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Grosvenor2013CamIO,\n  author    = {Grosvenor, Matthew P. and Schwarzkopf, Malte and Moore, Andrew W. and Watson, Robert N. M. and Hand, Steven},\n  booktitle = {Demo abstract at the 4th Asia-Pacific Workshop on Systems (APSYS)},\n  title     = {{CamIO: declaring flexible and performant application I/O}},\n  year      = {2013},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n LHCb: Time structure analysis of the LHCb Online network.\n \n \n \n\n\n \n Antichi, G.; Bruyere, M.; Campora Perez, D. H.; Liu, G.; Neufeld, N.; Giordano, S.; Owezarski, P.; and Moore, A.\n\n\n \n\n\n\n In CHEP 2013 - 20th International Conference on Computing in High Energy and Nuclear Physics, 2013. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Antichi2013LHCb,\n  author    = {Antichi, G. and Bruyere, M. and Campora Perez, D. H. and Liu, G. and Neufeld, N. and Giordano, S. and Owezarski, P. and Moore, A.},\n  booktitle = {CHEP 2013 - 20th International Conference on Computing in High Energy and Nuclear Physics},\n  title     = {{LHCb: Time structure analysis of the LHCb Online network}},\n  year      = {2013},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Approaching real-time network traffic classification.\n \n \n \n\n\n \n Li, W.; Abdin, K.; Dann, R.; and Moore, A.\n\n\n \n\n\n\n Technical Report 2013.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Li2013Approaching,\n  author = {Li, Wei and Abdin, Kaysar and Dann, Robert and Moore, Andrew},\n  title  = {Approaching real-time network traffic classification},\n  year   = {2013},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Low power optical transceivers for switched interconnect networks.\n \n \n \n\n\n \n Audzevich, Y.; Watts, P. M.; West, A.; Mujumdar, A.; Crowcroft, J.; and Moore, A. W.\n\n\n \n\n\n\n In 2013 International Conference on Advanced Technologies for Communications (ATC 2013), pages 301–306, Dec 2013. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Audzevich2013Low,\n  author            = {Audzevich, Yury and Watts, Philip M. and West, Andrew and Mujumdar, Alan and Crowcroft, Jon and Moore, Andrew W.},\n  booktitle         = {2013 International Conference on Advanced Technologies for Communications (ATC 2013)},\n  title             = {Low power optical transceivers for switched interconnect networks},\n  year              = {2013},\n  month             = {Dec},\n  organization      = {IEEE},\n  pages             = {301--306},\n  abstract          = {The power-consumption of network equipment is under ever-increasing scrutiny. As part of an ensemble project seeking to reduce power-consumption within data-centers1, this work focuses on reducing the power consumption of photonic transceivers for future fast power gated and/or optical switching networks. Utilising an open-source toolkit, we show that Serializer/Deserializer (SERDES) dominates power consumption of traditional optical transceivers. This result has particular implications for the modulation format of future interconnects. At 25 Gb/s line rate, SERDES blocks of PAM-16 and 4-wavelength WDM are shown to have 53\\% and 79\\% lower power respectively compared with SERDES of serial NRZ as well as reduced power gating restoration time and energy. © 2013 IEEE.},\n  day               = {1},\n  doi               = {10.1109/ATC.2013.6698126},\n  eissn             = {2162-1020},\n  isbn              = {9781479910861},\n  issn              = {2162-1039},\n  journal           = {International Conference on Advanced Technologies for Communications},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n The power-consumption of network equipment is under ever-increasing scrutiny. As part of an ensemble project seeking to reduce power-consumption within data-centers1, this work focuses on reducing the power consumption of photonic transceivers for future fast power gated and/or optical switching networks. Utilising an open-source toolkit, we show that Serializer/Deserializer (SERDES) dominates power consumption of traditional optical transceivers. This result has particular implications for the modulation format of future interconnects. At 25 Gb/s line rate, SERDES blocks of PAM-16 and 4-wavelength WDM are shown to have 53% and 79% lower power respectively compared with SERDES of serial NRZ as well as reduced power gating restoration time and energy. © 2013 IEEE.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Power optimized transceivers for future switched networks.\n \n \n \n\n\n \n Audzevich, Y.; Watts, P. M.; West, A.; Mujumdar, A.; Moore, S. W.; and Moore, A. W.\n\n\n \n\n\n\n IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 22(10): 2081–2092. 2013.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Audzevich2013Power,\n  author       = {Audzevich, Yury and Watts, Philip M. and West, Andrew and Mujumdar, Alan and Moore, Simon W. and Moore, Andrew W.},\n  journal      = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},\n  title        = {Power optimized transceivers for future switched networks},\n  year         = {2013},\n  issn         = {1557-9999},\n  number       = {10},\n  pages        = {2081--2092},\n  volume       = {22},\n  abstract     = {Network equipment power consumption is under increased scrutiny. To understand and decompose transceiver power consumption, we have created a toolkit incorporating a library of transceiver circuits in 45-nm CMOS and MOS current mode logic (MCML) and characterize power consumption using representative network traffic traces with digital synthesis and SPICE tools. Our toolkit includes all the components required to construct a library of different transceivers: line coding, frame alignment, channel bonding, serialization and deserialization, clock-data recovery, and clock generation. For optical transceivers, we show that photonic components and front end drivers only consume a small fraction (<;22%) of total serial transceiver power. This implies that major reductions in optical transceiver power can only be obtained by paying attention to the physical layer circuits such as clock recovery and serial-parallel conversions. We propose a burst-mode physical layer protocol suitable for optically switched links that retains the beneficial transmission characteristics of 8b/10b, but, even without power gating and voltage controlled oscillator power optimization, reduces the power consumption during idle periods by 29% compared with a conventional 8b/10b transceiver. We have made the toolkit available to the community at large in the hope of stimulating work in this field.},\n  date         = {Oct. 2014},\n  doi          = {10.1109/TVLSI.2013.2283300},\n  file         = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6632982:PDF},\n  issue        = {10},\n  journaltitle = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},\n  keywords     = {Transceivers, Encoding, Power demand, CMOS integrated circuits, Libraries, Optical transmitters, Optical packet switching, Energy efficiency, open source, physical line coding, toolkit., toolkit},\n  publisher    = {IEEE},\n}\n\n
\n
\n\n\n
\n Network equipment power consumption is under increased scrutiny. To understand and decompose transceiver power consumption, we have created a toolkit incorporating a library of transceiver circuits in 45-nm CMOS and MOS current mode logic (MCML) and characterize power consumption using representative network traffic traces with digital synthesis and SPICE tools. Our toolkit includes all the components required to construct a library of different transceivers: line coding, frame alignment, channel bonding, serialization and deserialization, clock-data recovery, and clock generation. For optical transceivers, we show that photonic components and front end drivers only consume a small fraction (<;22%) of total serial transceiver power. This implies that major reductions in optical transceiver power can only be obtained by paying attention to the physical layer circuits such as clock recovery and serial-parallel conversions. We propose a burst-mode physical layer protocol suitable for optically switched links that retains the beneficial transmission characteristics of 8b/10b, but, even without power gating and voltage controlled oscillator power optimization, reduces the power consumption during idle periods by 29% compared with a conventional 8b/10b transceiver. We have made the toolkit available to the community at large in the hope of stimulating work in this field.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n R2D2: Bufferless, switchless data center networks using commodity Ethernet hardware.\n \n \n \n\n\n \n Grosvenor, M. P.; Schwarzkopf, M.; and Moore, A. W.\n\n\n \n\n\n\n Computer Communication Review, 43(4): 507–508. Dec 2013.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Grosvenor2013R2D2,\n  author            = {Grosvenor, Matthew P. and Schwarzkopf, Malte and Moore, Andrew W.},\n  journal           = {Computer Communication Review},\n  title             = {{R2D2: Bufferless, switchless data center networks using commodity Ethernet hardware}},\n  year              = {2013},\n  issn              = {0146-4833},\n  month             = {Dec},\n  number            = {4},\n  pages             = {507--508},\n  volume            = {43},\n  abstract          = {Modern data centers commonly run distributed applications that require low-latency communication, and whose performance is critical to service revenue. If as little as one machine in 10,000 is a latency outlier, around 18\\% of requests will experience high latency. The sacrifice of latency determinism for bandwidth, however, is not an inevitable one. In our R2D2 architecture, we conceptually split the data centre network into an unbuffered, unswitched low-latency network (LLNet) and a deeply buffered bandwidth centric network (BBNet). Through explicitly scheduling network multiplexing in software, our prototype implementation achieves 99.995\\% and 99.999\\% messaging latencies of 35us and 75us respectively for 1514-byte packets on a fully loaded network. Furthermore, we show that it is possible to merge the conceptually separate LLNet and BBNet networks onto the same physical infrastructure using commodity switched Ethernet hardware. © 2013 Authors.},\n  booktitle         = {Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM - SIGCOMM '13},\n  conference        = {the ACM SIGCOMM 2013 conference},\n  day               = {1},\n  doi               = {10.1145/2534169.2491722},\n  eissn             = {1943-5819},\n  finishday         = {16},\n  finishmonth       = {Aug},\n  finishyear        = {2013},\n  isbn              = {9781450320566},\n  publicationstatus = {published},\n  publisher         = {ACM Press},\n  startday          = {12},\n  startmonth        = {Aug},\n  startyear         = {2013},\n}\n\n
\n
\n\n\n
\n Modern data centers commonly run distributed applications that require low-latency communication, and whose performance is critical to service revenue. If as little as one machine in 10,000 is a latency outlier, around 18% of requests will experience high latency. The sacrifice of latency determinism for bandwidth, however, is not an inevitable one. In our R2D2 architecture, we conceptually split the data centre network into an unbuffered, unswitched low-latency network (LLNet) and a deeply buffered bandwidth centric network (BBNet). Through explicitly scheduling network multiplexing in software, our prototype implementation achieves 99.995% and 99.999% messaging latencies of 35us and 75us respectively for 1514-byte packets on a fully loaded network. Furthermore, we show that it is possible to merge the conceptually separate LLNet and BBNet networks onto the same physical infrastructure using commodity switched Ethernet hardware. © 2013 Authors.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Architecture for an open source network tester.\n \n \n \n\n\n \n Shahbaz, M.; Antichi, G.; Geng, Y.; Zilberman, N.; Covington, A.; Bruyere, M.; Feamster, N.; McKeown, N.; Felderman, B.; Blott, M.; and others\n\n\n \n\n\n\n In Architectures for Networking and Communications Systems, pages 123–124, Jan 2013. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Shahbaz2013Architecture,\n  author            = {Shahbaz, Muhammad and Antichi, Gianni and Geng, Yilong and Zilberman, Noa and Covington, Adam and Bruyere, Marc and Feamster, Nick and McKeown, Nick and Felderman, Bob and Blott, Michaela and others},\n  booktitle         = {Architectures for Networking and Communications Systems},\n  title             = {Architecture for an open source network tester},\n  year              = {2013},\n  month             = {Jan},\n  organization      = {IEEE},\n  pages             = {123--124},\n  abstract          = {To make networks more reliable, enormous resources are poured into all phases of the network-equipment lifecycle. The process starts early in the design phase when simulation is used to verify the correctness of a design, and continues through manufacturing and perhaps months of rigorously trials. With over 7,000 Internet RFCs and hundreds of IEEE standards, a typical piece of networking equipment undergoes hundreds of conformance tests before being deployed. Finally, when deployed in a production network, the equipment is tested regularly. Throughout the process, a relentless battery of tests and measurement help ensure the correct operation of the equipment. © 2013 IEEE.},\n  day               = {1},\n  doi               = {10.1109/ANCS.2013.6665194},\n  isbn              = {9781479916405},\n  journal           = {ANCS 2013 - Proceedings of the 9th ACM/IEEE Symposium on Architectures for Networking and Communications Systems},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n To make networks more reliable, enormous resources are poured into all phases of the network-equipment lifecycle. The process starts early in the design phase when simulation is used to verify the correctness of a design, and continues through manufacturing and perhaps months of rigorously trials. With over 7,000 Internet RFCs and hundreds of IEEE standards, a typical piece of networking equipment undergoes hundreds of conformance tests before being deployed. Finally, when deployed in a production network, the equipment is tested regularly. Throughout the process, a relentless battery of tests and measurement help ensure the correct operation of the equipment. © 2013 IEEE.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Authentication for resilience: the case of SDN.\n \n \n \n\n\n \n Yu, D.; Moore, A. W.; Hall, C.; and Anderson, R.\n\n\n \n\n\n\n In Cambridge International Workshop on Security Protocols, volume 8263 LNCS, pages 39–44, Jan 2013. Springer\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Yu2013Authentication,\n  author            = {Yu, Dongting and Moore, Andrew W. and Hall, Chris and Anderson, Ross},\n  booktitle         = {Cambridge International Workshop on Security Protocols},\n  title             = {{Authentication for resilience: the case of SDN}},\n  year              = {2013},\n  month             = {Jan},\n  organization      = {Springer},\n  pages             = {39--44},\n  volume            = {8263 LNCS},\n  abstract          = {Software Defined Networks (SDN) aim to deconstruct current routers into a small number of controllers, which are general purpose machines, and a large number of switches that contain programmable forwarding engines. The vision is that, instead of the ad-hoc mechanisms used in current routers, we can build programmable networks using proper computer science abstractions. This technology is now at the startup stage, and is being deployed in the data centres of large web service firms. We are interested in protecting a future SDN. The current designs follow traditional security assumptions and do not consider many likely deployment scenarios. We discuss how SDN architecture can be structured to offer more security, the auxiliary services that such a network will require and the advantages that it can offer. © Springer-Verlag 2013.},\n  day               = {1},\n  doi               = {10.1007/978-3-642-41717-7_6},\n  eissn             = {1611-3349},\n  isbn              = {9783642417160},\n  issn              = {0302-9743},\n  journal           = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Software Defined Networks (SDN) aim to deconstruct current routers into a small number of controllers, which are general purpose machines, and a large number of switches that contain programmable forwarding engines. The vision is that, instead of the ad-hoc mechanisms used in current routers, we can build programmable networks using proper computer science abstractions. This technology is now at the startup stage, and is being deployed in the data centres of large web service firms. We are interested in protecting a future SDN. The current designs follow traditional security assumptions and do not consider many likely deployment scenarios. We discuss how SDN architecture can be structured to offer more security, the auxiliary services that such a network will require and the advantages that it can offer. © Springer-Verlag 2013.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n From 1G to 10G: code reuse in action.\n \n \n \n\n\n \n Antichi, G.; Shahbaz, M.; Giordano, S.; and Moore, A.\n\n\n \n\n\n\n In Proceedings of the first edition workshop on High performance and programmable networking, pages 31–38, Jul 2013. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Antichi20131G,\n  author            = {Antichi, Gianni and Shahbaz, Muhammad and Giordano, Stefano and Moore, Andrew},\n  booktitle         = {Proceedings of the first edition workshop on High performance and programmable networking},\n  title             = {{From 1G to 10G: code reuse in action}},\n  year              = {2013},\n  month             = {Jul},\n  pages             = {31--38},\n  abstract          = {Ever increasing traffic quantities and link-bandwidths force network devices to meet ever-increasing demands; the march to 100G is well under way. The high-speed networking of today is no longer that of five years ago: Unfortunately, such growth contrasts with current financial forces and this leads organisations to find ways to save money. As a result many developers face the common problem: how to make existing, systems reusable in this new, higher-speed scenario? To attack this problem, we propose new, flexible, legacy support mechanics for designs built using System on a Chip (SoC) and System on FPGA (SoFPGA). We illustrate our approach using the widely used, open-source, NetFPGA platform presenting a migration path for existing 1G designs to plugin into the new NetFPGA 10G board without alteration to code structure. © 2013 ACM.},\n  day               = {17},\n  doi               = {10.1145/2465839.2465844},\n  journal           = {HPPN 2013 - Proceedings of the 2013 ACM Workshop on High Performance and Programmable Networking},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Ever increasing traffic quantities and link-bandwidths force network devices to meet ever-increasing demands; the march to 100G is well under way. The high-speed networking of today is no longer that of five years ago: Unfortunately, such growth contrasts with current financial forces and this leads organisations to find ways to save money. As a result many developers face the common problem: how to make existing, systems reusable in this new, higher-speed scenario? To attack this problem, we propose new, flexible, legacy support mechanics for designs built using System on a Chip (SoC) and System on FPGA (SoFPGA). We illustrate our approach using the widely used, open-source, NetFPGA platform presenting a migration path for existing 1G designs to plugin into the new NetFPGA 10G board without alteration to code structure. © 2013 ACM.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Cost, performance & flexibility in openflow: Pick three.\n \n \n \n\n\n \n Rotsos, C.; Mortier, R.; Madhavapeddy, A.; Singh, B.; and Moore, A. W.\n\n\n \n\n\n\n In 2012 IEEE International Conference on Communications (ICC), pages 6601–6605, 2012. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Rotsos2012Cost,\n  author       = {Rotsos, Charalampos and Mortier, Richard and Madhavapeddy, Anil and Singh, Balraj and Moore, Andrew W.},\n  booktitle    = {2012 IEEE International Conference on Communications (ICC)},\n  title        = {{Cost, performance \\& flexibility in openflow: Pick three}},\n  year         = {2012},\n  organization = {IEEE},\n  pages        = {6601--6605},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Managing network traffic for improved availability of network services.\n \n \n \n\n\n \n Wang, J.; Ge, Z.; Jiang, H.; Jin, S.; and Moore, A. W.\n\n\n \n\n\n\n January~10 2012.\n US Patent 8,095,635\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Wang2012Managing,\n  author = {Wang, Jia and Ge, Zihui and Jiang, Hongbo and Jin, Shudong and Moore, Andrew W.},\n  month  = jan #{~10},\n  note   = {US Patent 8,095,635},\n  title  = {Managing network traffic for improved availability of network services},\n  year   = {2012},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Signposts: End-to-End Networking in a World of Middleboxes.\n \n \n \n\n\n \n Mortier, R.; Aucinas, A.; Chaudhry, A.; Crowcroft, J.; Eide, S.; Hand, S.; Madhavapeddy, A.; Moore, A.; Rotsos, C.; and Rodriguez, N.\n\n\n \n\n\n\n ACM SIGCOMM, Helsinki, 10(2342356.2342371). 2012.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Mortier2012Signposts,\n  author  = {Mortier, Richard and Aucinas, Andrius and Chaudhry, Amir and Crowcroft, Jon and Eide, S. and Hand, Steve and Madhavapeddy, Anil and Moore, A. and Rotsos, Charalampos and Rodriguez, N.},\n  journal = {ACM SIGCOMM, Helsinki},\n  title   = {{Signposts: End-to-End Networking in a World of Middleboxes}},\n  year    = {2012},\n  number  = {2342356.2342371},\n  volume  = {10},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Signposts: End-to-end networking in a world of middleboxes.\n \n \n \n\n\n \n Aucinas, A.; Chaudhry, A.; Crowcroft, J.; Eide, S. P.; Hand, S.; Madhavapeddy, A.; Moore, A. W.; Rotsos, C.; Vallina-Rodriguez, N.; and Mortier, R.\n\n\n \n\n\n\n In Computer Communication Review, volume 42, pages 83–84, Dec 2012. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Aucinas2012Signposts,\n  author            = {Aucinas, A. and Chaudhry, A. and Crowcroft, J. and Eide, S. P. and Hand, S. and Madhavapeddy, A. and Moore, A. W. and Rotsos, C. and Vallina-Rodriguez, N. and Mortier, R.},\n  booktitle         = {Computer Communication Review},\n  title             = {{Signposts: End-to-end networking in a world of middleboxes}},\n  year              = {2012},\n  month             = {Dec},\n  number            = {4},\n  pages             = {83--84},\n  volume            = {42},\n  abstract          = {I his demo presents Signposts, a system to provide users with a secure, simple mechanism to establish and maintain conununicat ion channels between their personal cloud of named devices. Signpost names exist in the DNSSEC('hierarchy. and resolve to secure end-points when accessed by existing DNS clients. Signpost clients intercept user connection ilit cut ions while adding privacy and multipath support. Signpost sit vers co-ordinate clients lo dynamically discover routes and overcome the middleboxes thai pervade modern edge networks. The demo will show a simple scenario where an individual's personal devices (phone, laptop) are interconnected via Signposts while silting on dili'erent networks behind various middleboxes. As a result 11 lev will be able lo let eh and push data between each other, demonstrated by, e.g. simple web browsing, even as the network configuration changes. Copyright 2012 ACM.},\n  day               = {1},\n  doi               = {10.1145/2377677.2377692},\n  eissn             = {1943-5819},\n  isbn              = {9781450314190},\n  issn              = {0146-4833},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n I his demo presents Signposts, a system to provide users with a secure, simple mechanism to establish and maintain conununicat ion channels between their personal cloud of named devices. Signpost names exist in the DNSSEC('hierarchy. and resolve to secure end-points when accessed by existing DNS clients. Signpost clients intercept user connection ilit cut ions while adding privacy and multipath support. Signpost sit vers co-ordinate clients lo dynamically discover routes and overcome the middleboxes thai pervade modern edge networks. The demo will show a simple scenario where an individual's personal devices (phone, laptop) are interconnected via Signposts while silting on dili'erent networks behind various middleboxes. As a result 11 lev will be able lo let eh and push data between each other, demonstrated by, e.g. simple web browsing, even as the network configuration changes. Copyright 2012 ACM.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Message from the program co-chairs.\n \n \n \n\n\n \n Moore, A. W.; and Prasanna, V. K.\n\n\n \n\n\n\n ANCS 2012 - Proceedings of the 8th ACM/IEEE Symposium on Architectures for Networking and Communications Systems. Dec 2012.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Moore2012Message,\n  author            = {Moore, A. W. and Prasanna, V. K.},\n  journal           = {ANCS 2012 - Proceedings of the 8th ACM/IEEE Symposium on Architectures for Networking and Communications Systems},\n  title             = {Message from the program co-chairs},\n  year              = {2012},\n  month             = {Dec},\n  day               = {24},\n  isbn              = {9781450316859},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Enabling open-source high speed network monitoring on NetFPGA.\n \n \n \n\n\n \n Antichi, G.; Giordano, S.; Miller, D. J.; and Moore, A. W.\n\n\n \n\n\n\n In 2012 IEEE Network Operations and Management Symposium, pages 1029–1035, Jul 2012. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Antichi2012Enabling,\n  author            = {Antichi, Gianni and Giordano, Stefano and Miller, David J. and Moore, Andrew W.},\n  booktitle         = {2012 IEEE Network Operations and Management Symposium},\n  title             = {{Enabling open-source high speed network monitoring on NetFPGA}},\n  year              = {2012},\n  month             = {Jul},\n  organization      = {IEEE},\n  pages             = {1029--1035},\n  abstract          = {Network measurement both as diagnostic and within measurement-based techniques of traffic engineering and management, alongside network measurement for security has maintained the needs of researchers and network operators for the ongoing development of measurement tools for traffic monitoring/ characterisation and to support Intrusion Detection Systems (IDSs). Many such tools capitalise on the pricing of commodity hardware by operating on general purpose architectures. Many are based on the well known libpcap API, a de facto standard in this area. Despite the many improvements that have been applied to packet capturing, packet-monitoring implementations still suffer from either: performance flaws on commodity hardware due mainly to unresolvable hardware bottlenecks, or costly and inflexible niche systems. To address such issues, the paper proposes a system architecture based on the cooperation of NetFPGA and a general purpose host PC. The NetFPGA is an open networking platform accelerator that enables rapid development of hardware-accelerated packet processing applications. The objective is to combine the high performance of a hardware-oriented solution with the flexibility of general purpose PCs. © 2012 IEEE.},\n  day               = {30},\n  doi               = {10.1109/NOMS.2012.6212025},\n  isbn              = {9781467302685},\n  journal           = {Proceedings of the 2012 IEEE Network Operations and Management Symposium, NOMS 2012},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Network measurement both as diagnostic and within measurement-based techniques of traffic engineering and management, alongside network measurement for security has maintained the needs of researchers and network operators for the ongoing development of measurement tools for traffic monitoring/ characterisation and to support Intrusion Detection Systems (IDSs). Many such tools capitalise on the pricing of commodity hardware by operating on general purpose architectures. Many are based on the well known libpcap API, a de facto standard in this area. Despite the many improvements that have been applied to packet capturing, packet-monitoring implementations still suffer from either: performance flaws on commodity hardware due mainly to unresolvable hardware bottlenecks, or costly and inflexible niche systems. To address such issues, the paper proposes a system architecture based on the cooperation of NetFPGA and a general purpose host PC. The NetFPGA is an open networking platform accelerator that enables rapid development of hardware-accelerated packet processing applications. The objective is to combine the high performance of a hardware-oriented solution with the flexibility of general purpose PCs. © 2012 IEEE.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Energy-aware networks.\n \n \n \n \n\n\n \n Audzevich, Y.; Moore, A.; Rice, A.; Sohan, R.; Timotheou, S.; Crowcroft, J.; Akoush, S.; Hopper, A.; Wonfor, A.; and Wang, H.\n\n\n \n\n\n\n Handbook of Energy-aware and Green Computing, 1: 239–282. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"Energy-awarePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Audzevich2012Energy,\n  author    = {Audzevich, Y. and Moore, A. and Rice, A. and Sohan, R. and Timotheou, S. and Crowcroft, J. and Akoush, S. and Hopper, A. and Wonfor, A. and Wang, H.},\n  journal   = {Handbook of Energy-aware and Green Computing},\n  title     = {Energy-aware networks},\n  year      = {2012},\n  pages     = {239--282},\n  volume    = {1},\n  booktitle = {Handbook of Energy-Aware and Green Computing},\n  editor    = {Ahmad, I and Ranka, S},\n  isbn      = {978-1-4665-0116-4},\n  publisher = {CRC Press},\n  url       = {http://www.crcnetbase.com/isbn/978-1-4665-0116-4},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Signposts: End-to-End Networking in a World of Middleboxes.\n \n \n \n\n\n \n Chaudhry, A.; Vallina-Rodriguez, N.; Madhavapeddy, A.; Rotsos, C.; Mortier, R.; Aucinas, A.; Crowcroft, J.; Eide, S. P.; Hand, S.; and Moore, A. W.\n\n\n \n\n\n\n Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '12, 42(4): 83–84. 2012.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Chaudhry2012Signposts,\n  author            = {Chaudhry, A. and Vallina-Rodriguez, N. and Madhavapeddy, A. and Rotsos, C. and Mortier, R. and Aucinas, A. and Crowcroft, J. and Eide, S. P. and Hand, S. and Moore, A. W.},\n  journal           = {Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '12},\n  title             = {{Signposts: End-to-End Networking in a World of Middleboxes}},\n  year              = {2012},\n  number            = {4},\n  pages             = {83--84},\n  volume            = {42},\n  conference        = {the ACM SIGCOMM 2012 conference},\n  doi               = {10.1145/2342356.2342371},\n  finishday         = {17},\n  finishmonth       = {Aug},\n  finishyear        = {2012},\n  isbn              = {9781450314190},\n  publicationstatus = {published},\n  publisher         = {ACM Press},\n  startday          = {13},\n  startmonth        = {Aug},\n  startyear         = {2012},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Weighted Spectral Distribution: A Metric for Structural Analysis of Networks.\n \n \n \n\n\n \n Fay, D.; Haddadi, H.; Moore, A. W.; Mortier, R.; Thomason, A. G.; and Uhlig, S.\n\n\n \n\n\n\n Statistical and Machine Learning Approaches for Network Analysis,153–189. Jun 2012.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Fay2012Weighted,\n  author            = {Fay, Damien and Haddadi, Hamed and Moore, Andrew W. and Mortier, Richard and Thomason, Andrew G. and Uhlig, Steve},\n  journal           = {Statistical and Machine Learning Approaches for Network Analysis},\n  title             = {{Weighted Spectral Distribution: A Metric for Structural Analysis of Networks}},\n  year              = {2012},\n  month             = {Jun},\n  pages             = {153--189},\n  day               = {21},\n  doi               = {10.1002/9781118346990.ch6},\n  isbn              = {9780470195154},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Control and understanding: Owning your home network.\n \n \n \n\n\n \n Mortier, R.; Rodden, T.; Lodge, T.; McAuley, D.; Rotsos, C.; Moore, A. W.; Koliousis, A.; and Sventek, J.\n\n\n \n\n\n\n In Communication Systems and Networks (COMSNETS), 2012 Fourth International Conference on, pages 1–10, Mar 2012. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Mortier2012Control,\n  author            = {Mortier, R. and Rodden, T. and Lodge, T. and McAuley, D. and Rotsos, C. and Moore, A. W. and Koliousis, A. and Sventek, J.},\n  booktitle         = {{Communication Systems and Networks (COMSNETS), 2012 Fourth International Conference on}},\n  title             = {{Control and understanding: Owning your home network}},\n  year              = {2012},\n  month             = {Mar},\n  organization      = {IEEE},\n  pages             = {1--10},\n  abstract          = {Wireless home networks are increasingly deployed in people's homes worldwide. Unfortunately, home networks have evolved using protocols designed for backbone and enterprise networks, which are quite different in scale and character to home networks. We believe this evolution is at the heart of widely observed problems experienced by users managing and using their home networks. In this paper we investigate redesign of the home router to exploit the distinct social and physical characteristics of the home. We extract two key requirements from a range of ethnographic studies: users desire greater understanding of and control over their networks' behaviour. We present our design for a home router that focuses on monitoring and controlling network traffic flows, and so provides a platform for building user interfaces that satisfy these two user requirements. We describe and evaluate our prototype which uses NOX and OpenFlow to provide per-flow control, and a custom DHCP implementation to enable traffic isolation and accurate measurement from the IP layer. It also provides finer-grained per-flow control through interception of wireless association and DNS resolution. We evaluate the impact of these modifications, and thus the applicability of flow-based network management in the home. © 2012 IEEE.},\n  day               = {15},\n  doi               = {10.1109/COMSNETS.2012.6151322},\n  isbn              = {9781467302982},\n  journal           = {2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Wireless home networks are increasingly deployed in people's homes worldwide. Unfortunately, home networks have evolved using protocols designed for backbone and enterprise networks, which are quite different in scale and character to home networks. We believe this evolution is at the heart of widely observed problems experienced by users managing and using their home networks. In this paper we investigate redesign of the home router to exploit the distinct social and physical characteristics of the home. We extract two key requirements from a range of ethnographic studies: users desire greater understanding of and control over their networks' behaviour. We present our design for a home router that focuses on monitoring and controlling network traffic flows, and so provides a platform for building user interfaces that satisfy these two user requirements. We describe and evaluate our prototype which uses NOX and OpenFlow to provide per-flow control, and a custom DHCP implementation to enable traffic isolation and accurate measurement from the IP layer. It also provides finer-grained per-flow control through interception of wireless association and DNS resolution. We evaluate the impact of these modifications, and thus the applicability of flow-based network management in the home. © 2012 IEEE.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n OFLOPS: An open framework for OpenFlow switch evaluation.\n \n \n \n\n\n \n Rotsos, C.; Sarrar, N.; Uhlig, S.; Sherwood, R.; and Moore, A. W.\n\n\n \n\n\n\n In International Conference on Passive and Active Network Measurement, volume 7192 LNCS, pages 85–95, Apr 2012. Springer, Berlin, Heidelberg\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Rotsos2012OFLOPS,\n  author            = {Rotsos, Charalampos and Sarrar, Nadi and Uhlig, Steve and Sherwood, Rob and Moore, Andrew W.},\n  booktitle         = {International Conference on Passive and Active Network Measurement},\n  title             = {{OFLOPS: An open framework for OpenFlow switch evaluation}},\n  year              = {2012},\n  month             = {Apr},\n  organization      = {Springer, Berlin, Heidelberg},\n  pages             = {85--95},\n  volume            = {7192 LNCS},\n  abstract          = {Recent efforts in software-defined networks, such as OpenFlow, give unprecedented access into the forwarding plane of networking equipment. When building a network based on OpenFlow however, one must take into account the performance characteristics of particular OpenFlow switch implementations. In this paper, we present OFLOPS, an open and generic software framework that permits the development of tests for OpenFlow-enabled switches, that measure the capabilities and bottlenecks between the forwarding engine of the switch and the remote control application. OFLOPS combines hardware instrumentation with an extensible software framework. We use OFLOPS to evaluate current OpenFlow switch implementations and make the following observations: (i) The switching performance of flows depends on applied actions and firmware. (ii) Current OpenFlow implementations differ substantially in flow updating rates as well as traffic monitoring capabilities. (iii) Accurate OpenFlow command completion can be observed only through the data plane. These observations are crucial for understanding the applicability of Open- Flow in the context of specific use-cases, which have requirements in terms of forwarding table consistency, flow setup latency, flow space granularity, packet modification types, and/or traffic monitoring abilities. © 2012 Springer-Verlag Berlin Heidelberg.},\n  day               = {2},\n  doi               = {10.1007/978-3-642-28537-0_9},\n  eissn             = {1611-3349},\n  isbn              = {9783642285363},\n  issn              = {0302-9743},\n  journal           = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Recent efforts in software-defined networks, such as OpenFlow, give unprecedented access into the forwarding plane of networking equipment. When building a network based on OpenFlow however, one must take into account the performance characteristics of particular OpenFlow switch implementations. In this paper, we present OFLOPS, an open and generic software framework that permits the development of tests for OpenFlow-enabled switches, that measure the capabilities and bottlenecks between the forwarding engine of the switch and the remote control application. OFLOPS combines hardware instrumentation with an extensible software framework. We use OFLOPS to evaluate current OpenFlow switch implementations and make the following observations: (i) The switching performance of flows depends on applied actions and firmware. (ii) Current OpenFlow implementations differ substantially in flow updating rates as well as traffic monitoring capabilities. (iii) Accurate OpenFlow command completion can be observed only through the data plane. These observations are crucial for understanding the applicability of Open- Flow in the context of specific use-cases, which have requirements in terms of forwarding table consistency, flow setup latency, flow space granularity, packet modification types, and/or traffic monitoring abilities. © 2012 Springer-Verlag Berlin Heidelberg.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Energy implications of photonic networks with speculative transmission.\n \n \n \n\n\n \n Watts, P. M.; Moore, S. W.; and Moore, A. W.\n\n\n \n\n\n\n IEEE/OSA Journal of Optical Communications and Networking, 4(6): 503–513. 2012.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Watts2012Energy,\n  author       = {Watts, Philip M. and Moore, Simon W. and Moore, Andrew W.},\n  journal      = {IEEE/OSA Journal of Optical Communications and Networking},\n  title        = {Energy implications of photonic networks with speculative transmission},\n  year         = {2012},\n  issn         = {1943-0639},\n  number       = {6},\n  pages        = {503--513},\n  volume       = {4},\n  abstract     = {Speculative transmission has been proposed to overcome the high latency of setting up end-to-end paths through photonic networks for computer systems. However, speculative transmission has implications for the energy efficiency of the network, in particular, control circuits are more complex and power hungry and failed speculative transmissions must be repeated. Moreover, in future chip multiprocessors (CMPs) with integrated photonic network end points, a large proportion of the additional energy will be dissipated on the CMP. This paper compares the energy characteristics of scheduled and speculative chip-to-chip networks for shared memory computer systems on the scale of a rack. For this comparison, we use a novel speculative control plane which reduces energy consumption by eliminating duplicate packets from the allocation process. In addition, we consider photonic power gating to reduce processor chip energy dissipation and the energy impact of the choice between semiconductor optical amplifier and ring resonator switching technologies. We model photonic network elements using values from the published literature as well as determine the power consumption of the allocator and network adapter circuits, implemented in a commercial low leakage 45 nm CMOS process. The power dissipated on the CMP using speculative networks is shown to be roughly double that of scheduled networks at saturation load and an order of magnitude higher at low loads.},\n  date         = {June 2012},\n  doi          = {10.1364/JOCN.4.000503},\n  file         = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6226977:PDF},\n  issue        = {6},\n  journaltitle = {IEEE/OSA Journal of Optical Communications and Networking},\n  keywords     = {Optical switches, Photonics, Resource management, Optical waveguides, Optical ring resonators, Optical transmitters, Assignment and routing algorithms, Networks, Optical interconnects},\n  publisher    = {IEEE},\n}\n\n
\n
\n\n\n
\n Speculative transmission has been proposed to overcome the high latency of setting up end-to-end paths through photonic networks for computer systems. However, speculative transmission has implications for the energy efficiency of the network, in particular, control circuits are more complex and power hungry and failed speculative transmissions must be repeated. Moreover, in future chip multiprocessors (CMPs) with integrated photonic network end points, a large proportion of the additional energy will be dissipated on the CMP. This paper compares the energy characteristics of scheduled and speculative chip-to-chip networks for shared memory computer systems on the scale of a rack. For this comparison, we use a novel speculative control plane which reduces energy consumption by eliminating duplicate packets from the allocation process. In addition, we consider photonic power gating to reduce processor chip energy dissipation and the energy impact of the choice between semiconductor optical amplifier and ring resonator switching technologies. We model photonic network elements using values from the published literature as well as determine the power consumption of the allocator and network adapter circuits, implemented in a commercial low leakage 45 nm CMOS process. The power dissipated on the CMP using speculative networks is shown to be roughly double that of scheduled networks at saturation load and an order of magnitude higher at low loads.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Free Lunch: Exploiting Renewable Energy for Computing.\n \n \n \n\n\n \n Akoush, S.; Sohan, R.; Rice, A. C.; Moore, A. W.; and Hopper, A.\n\n\n \n\n\n\n In HotOS, volume 13, pages 17–17, 2011. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Akoush2011Free,\n  author    = {Akoush, Sherif and Sohan, Ripduman and Rice, Andrew C. and Moore, Andrew W. and Hopper, Andy},\n  booktitle = {HotOS},\n  title     = {{Free Lunch: Exploiting Renewable Energy for Computing.}},\n  year      = {2011},\n  pages     = {17--17},\n  volume    = {13},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Scaling the practical education experience.\n \n \n \n\n\n \n Sommers, J.; and Moore, A.\n\n\n \n\n\n\n In Proceedings of the ACM SIGCOMM Education Workshop, 2011. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Sommers2011Scaling,\n  author    = {Sommers, Joel and Moore, Andrew},\n  booktitle = {Proceedings of the ACM SIGCOMM Education Workshop},\n  title     = {Scaling the practical education experience},\n  year      = {2011},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Free Lunch: Exploiting Renewable Energy For Computing.\n \n \n \n \n\n\n \n Sohan, R. S.; Akoush, S. A.; Rice, A. C.; Moore, A. W.; and Hopper, A.\n\n\n \n\n\n\n In May 2011. Napa, California, USA, USENIX Association\n \n\n\n\n
\n\n\n\n \n \n \"FreePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Sohan2011Free,\n  author       = {Sohan, R. S. and Akoush, S. A. and Rice, A. C. and Moore, A. W. and Hopper, A.},\n  title        = {{Free Lunch: Exploiting Renewable Energy For Computing}},\n  year         = {2011},\n  month        = {May},\n  organization = {Napa, California, USA},\n  publisher    = {USENIX Association},\n  abstract     = {This paper argues for “Free Lunch”, a computation architecture\nthat exploits otherwise wasted renewable energy\nby (i) colocating datacentres with these remote energy\nsources, (ii) connecting them over a dedicated network,\nand (iii) providing a software framework that supports the\nseamless execution and migration of virtual machines in\nthe platform according to power availability. This work\nmotivates and outlines the architecture and demonstrates\nits viability with a case study. Additionally, we discuss the\nmajor technical challenges facing the successful deployment\nof Free Lunch and the limiting factors inherent in its\ndesign.},\n  conference   = {The 13th Workshop on Hot Topics in Operating Systems (HOTOS'XIII)},\n  day          = {11},\n  finishday    = {11},\n  finishmonth  = {May},\n  finishyear   = {2011},\n  startday     = {9},\n  startmonth   = {May},\n  startyear    = {2011},\n  url          = {http://static.usenix.org/event/hotos11/tech/final_files/Akoush.pdf},\n}\n\n
\n
\n\n\n
\n This paper argues for “Free Lunch”, a computation architecture that exploits otherwise wasted renewable energy by (i) colocating datacentres with these remote energy sources, (ii) connecting them over a dedicated network, and (iii) providing a software framework that supports the seamless execution and migration of virtual machines in the platform according to power availability. This work motivates and outlines the architecture and demonstrates its viability with a case study. Additionally, we discuss the major technical challenges facing the successful deployment of Free Lunch and the limiting factors inherent in its design.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Efficient photonic coding: A considered revision.\n \n \n \n\n\n \n Audzevich, Y.; Watts, P.; Kilmurray, S.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 2nd ACM SIGCOMM workshop on Green networking, pages 13–18, Sep 2011. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Audzevich2011Efficient,\n  author            = {Audzevich, Yury and Watts, Philip and Kilmurray, Sean and Moore, Andrew W.},\n  booktitle         = {Proceedings of the 2nd ACM SIGCOMM workshop on Green networking},\n  title             = {{Efficient photonic coding: A considered revision}},\n  year              = {2011},\n  month             = {Sep},\n  pages             = {13--18},\n  abstract          = {In this paper we reconsider the energy consumption of traditional DC-balanced physical line coding schemes applied to optical communication. We demonstrate that not only does an implementation of the popular 8B10B coding scheme have higher power consumption than the optical power requirement, but actually has higher power consumption when transmitting idle sequences than for real data packets. Furthermore, we show that simple codes retain the DC balance performance of 8B10B and hence do not increase the optical power requirement. We propose the use of a coding scheme that permits a default-off transmission system through the addition of a preamble. By analysis of trace data taken from a network covering a 24 hour period, we show that the power saving is up to 93\\%. The proposed approach not only enables energy proportional links but is fully compatible with future low power optical switched networks. © 2011 ACM.},\n  day               = {26},\n  doi               = {10.1145/2018536.2018540},\n  isbn              = {9781450307994},\n  journal           = {Proceedings of the 2nd ACM SIGCOMM Workshop on Green Networking, GreenNets'11},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n In this paper we reconsider the energy consumption of traditional DC-balanced physical line coding schemes applied to optical communication. We demonstrate that not only does an implementation of the popular 8B10B coding scheme have higher power consumption than the optical power requirement, but actually has higher power consumption when transmitting idle sequences than for real data packets. Furthermore, we show that simple codes retain the DC balance performance of 8B10B and hence do not increase the optical power requirement. We propose the use of a coding scheme that permits a default-off transmission system through the addition of a preamble. By analysis of trace data taken from a network covering a 24 hour period, we show that the power saving is up to 93%. The proposed approach not only enables energy proportional links but is fully compatible with future low power optical switched networks. © 2011 ACM.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Supporting novel home network management interfaces with openflow and NOX.\n \n \n \n\n\n \n Mortier, R.; Bedwell, B.; Glover, K.; Lodge, T.; Rodden, T.; Rotsos, C.; Moore, A. W.; Koliousis, A.; and Sventek, J.\n\n\n \n\n\n\n Proceedings of the ACM SIGCOMM 2011 Conference, SIGCOMM'11, 41(4): 464–465. Sep 2011.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Mortier2011Supporting,\n  author            = {Mortier, R. and Bedwell, B. and Glover, K. and Lodge, T. and Rodden, T. and Rotsos, C. and Moore, A. W. and Koliousis, A. and Sventek, J.},\n  journal           = {Proceedings of the ACM SIGCOMM 2011 Conference, SIGCOMM'11},\n  title             = {{Supporting novel home network management interfaces with openflow and NOX}},\n  year              = {2011},\n  month             = {Sep},\n  number            = {4},\n  pages             = {464--465},\n  volume            = {41},\n  abstract          = {The Homework project1 has examined redesign of existing home network infrastructures to better support the needs and requirements of actual home users. Integrating results from several ethnographic studies, we have designed and built a home networking platform providing detailed per- ow measurement and management capabilities supporting several novel management interfaces. This demo specifically shows these new visualization and control interfaces (§1), and describes the broader benefits of taking an integrated view of the networking infrastructure, realised through our router's augmented measurement and control APIs (§2). Aspects of this work have been published: the Homework Database in Internet Management (IM) 2011 [3] and im- plications of the ethnographic results are to appear at the SIGCOMM W-MUST workshop 2011 [2]. Separate, more detailed expositions of the interface elements and system performance and implications are currently under submis- sion at other venues. A partial code release is already available2 and we anticipate fuller public beta release by Q4 2011.},\n  day               = {29},\n  doi               = {10.1145/2018436.2018523},\n  isbn              = {9781450307970},\n  publicationstatus = {published},\n  publisher         = {ACM New York, NY, USA},\n}\n\n
\n
\n\n\n
\n The Homework project1 has examined redesign of existing home network infrastructures to better support the needs and requirements of actual home users. Integrating results from several ethnographic studies, we have designed and built a home networking platform providing detailed per- ow measurement and management capabilities supporting several novel management interfaces. This demo specifically shows these new visualization and control interfaces (§1), and describes the broader benefits of taking an integrated view of the networking infrastructure, realised through our router's augmented measurement and control APIs (§2). Aspects of this work have been published: the Homework Database in Internet Management (IM) 2011 [3] and im- plications of the ethnographic results are to appear at the SIGCOMM W-MUST workshop 2011 [2]. Separate, more detailed expositions of the interface elements and system performance and implications are currently under submis- sion at other venues. A partial code release is already available2 and we anticipate fuller public beta release by Q4 2011.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Discriminating graphs through spectral projections.\n \n \n \n\n\n \n Fay, D.; Haddadi, H.; Uhlig, S.; Kilmartin, L.; Moore, A. W.; Kunegis, J.; and Iliofotou, M.\n\n\n \n\n\n\n Computer Networks, 55(15): 3458–3468. Oct 2011.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Fay2011Discriminating,\n  author    = {Fay, Damien and Haddadi, Hamed and Uhlig, Steve and Kilmartin, Liam and Moore, Andrew W. and Kunegis, J{\\'e}r{\\^o}me and Iliofotou, Marios},\n  journal   = {Computer Networks},\n  title     = {Discriminating graphs through spectral projections},\n  year      = {2011},\n  issn      = {1389-1286},\n  month     = {Oct},\n  number    = {15},\n  pages     = {3458--3468},\n  volume    = {55},\n  day       = {27},\n  doi       = {10.1016/j.comnet.2011.06.024},\n  keyword   = {Internet topology},\n  publisher = {Elsevier},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Predicting the performance of virtual machine migration.\n \n \n \n\n\n \n Akoush, S.; Sohan, R.; Rice, A.; Moore, A. W.; and Hopper, A.\n\n\n \n\n\n\n In 2010 IEEE international symposium on modeling, analysis and simulation of computer and telecommunication systems, pages 37–46, 2010. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Akoush2010Predicting,\n  author       = {Akoush, Sherif and Sohan, Ripduman and Rice, Andrew and Moore, Andrew W. and Hopper, Andy},\n  booktitle    = {2010 IEEE international symposium on modeling, analysis and simulation of computer and telecommunication systems},\n  title        = {Predicting the performance of virtual machine migration},\n  year         = {2010},\n  organization = {IEEE},\n  pages        = {37--46},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Lightweight Application Classification for Network Management.\n \n \n \n\n\n \n Wang, J.; Ge, Z.; Jiang, H.; Jin, S.; and Moore, A. W.\n\n\n \n\n\n\n January~21 2010.\n US Patent App. 12/176,539\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Wang2010Lightweight,\n  author = {Wang, Jia and Ge, Zihui and Jiang, Hongbo and Jin, Shudong and Moore, Andrew W.},\n  month  = jan #{~21},\n  note   = {US Patent App. 12/176,539},\n  title  = {{Lightweight Application Classification for Network Management}},\n  year   = {2010},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n C and C++.\n \n \n \n\n\n \n Moore, A. W.; and Beresford, A.\n\n\n \n\n\n\n 2010.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Moore2010C,\n  author  = {Moore, Andrew W. and Beresford, Alistair},\n  title   = {{C and C++}},\n  year    = {2010},\n  comment = {Teaching Material for UoC course: C and C++},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Garch-based adaptive playout delay algorithm for VoIP.\n \n \n \n\n\n \n Zhang, Y.; Fay, D.; Kilmartin, L.; and Moore, A. W.\n\n\n \n\n\n\n Computer Networks, 54(17): 3108–3122. 2010.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Zhang2010Garch,\n  author    = {Zhang, Ying and Fay, Damien and Kilmartin, Liam and Moore, Andrew W.},\n  journal   = {Computer Networks},\n  title     = {{A Garch-based adaptive playout delay algorithm for VoIP}},\n  year      = {2010},\n  number    = {17},\n  pages     = {3108--3122},\n  volume    = {54},\n  publisher = {Elsevier},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Probabilistic graphical models for semi-supervised traffic classification.\n \n \n \n\n\n \n Rotsos, C.; Van Gael, J.; Moore, A. W.; and Ghahramani, Z.\n\n\n \n\n\n\n In Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, pages 752–757, 2010. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Rotsos2010Probabilistic,\n  author    = {Rotsos, Charalampos and Van Gael, Jurgen and Moore, Andrew W. and Ghahramani, Zoubin},\n  booktitle = {Proceedings of the 6th International Wireless Communications and Mobile Computing Conference},\n  title     = {Probabilistic graphical models for semi-supervised traffic classification},\n  year      = {2010},\n  pages     = {752--757},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n An Open Source Hardware Module for High-Speed Network Monitoring on NetFPGA.\n \n \n \n\n\n \n Gianni, A.; David, M.; Andrew W., M.; and Giordano, S.\n\n\n \n\n\n\n In European NetFPGA Developers Workshop 2010, 2010. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Gianni2010Open,\n  author    = {Gianni, Antichi and David, Miller and Andrew W., Moore and Giordano, S.},\n  booktitle = {European NetFPGA Developers Workshop 2010},\n  title     = {{An Open Source Hardware Module for High-Speed Network Monitoring on NetFPGA}},\n  year      = {2010},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A weighted spectrum metric for comparison of internet topologies.\n \n \n \n\n\n \n Fay, D.; Haddadi, H.; Moore, A. W.; Mortier, R.; Uhlig, S.; and Jamakovic, A.\n\n\n \n\n\n\n ACM SIGMETRICS Performance Evaluation Review, 37(3): 67–72. Aug 2010.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Fay2010weighted,\n  author            = {Fay, Damien and Haddadi, Hamed and Moore, Andrew W. and Mortier, Richard and Uhlig, Steve and Jamakovic, Almerima},\n  journal           = {ACM SIGMETRICS Performance Evaluation Review},\n  title             = {A weighted spectrum metric for comparison of internet topologies},\n  year              = {2010},\n  issn              = {0163-5999},\n  month             = {Aug},\n  number            = {3},\n  pages             = {67--72},\n  volume            = {37},\n  abstract          = {Comparison of graph structures is a frequently encountered problem across a number of problem domains. Comparing graphs requires a metric to discriminate which features of the graphs are considered important. The spectrum of a graph is often claimed to contain all the information within a graph, but the raw spectrum contains too much information to be directly used as a useful metric. In this paper we introduce a metric, the weighted spectral distribution, that improves on the raw spectrum by discounting those eigenvalues believed to be unimportant and emphasizing the contribution of those believed to be important. We use this metric to optimize the selection of parameter values for generating Internet topologies. Our metric leads to parameter choices that appear sensible given prior knowledge of the problem domain: the resulting choices are close to the default values of the topology generators and, in the case of some generators, fall within the expected region. This metric provides a means for meaningfully optimizing parameter selection when generating topologies intended to share structure with, but not match exactly, measured graphs.},\n  day               = {6},\n  doi               = {10.1145/1710115.1710129},\n  publicationstatus = {published},\n  publisher         = {ACM},\n}\n\n
\n
\n\n\n
\n Comparison of graph structures is a frequently encountered problem across a number of problem domains. Comparing graphs requires a metric to discriminate which features of the graphs are considered important. The spectrum of a graph is often claimed to contain all the information within a graph, but the raw spectrum contains too much information to be directly used as a useful metric. In this paper we introduce a metric, the weighted spectral distribution, that improves on the raw spectrum by discounting those eigenvalues believed to be unimportant and emphasizing the contribution of those believed to be important. We use this metric to optimize the selection of parameter values for generating Internet topologies. Our metric leads to parameter choices that appear sensible given prior knowledge of the problem domain: the resulting choices are close to the default values of the topology generators and, in the case of some generators, fall within the expected region. This metric provides a means for meaningfully optimizing parameter selection when generating topologies intended to share structure with, but not match exactly, measured graphs.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Mixing biases: Structural changes in the AS topology evolution.\n \n \n \n\n\n \n Haddadi, H.; Fay, D.; Uhlig, S.; Moore, A.; Mortier, R.; and Jamakovic, A.\n\n\n \n\n\n\n In International Workshop on Traffic Monitoring and Analysis, volume 6003 LNCS, pages 32–45, May 2010. Springer, Berlin, Heidelberg\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Haddadi2010Mixing,\n  author            = {Haddadi, Hamed and Fay, Damien and Uhlig, Steve and Moore, Andrew and Mortier, Richard and Jamakovic, Almerima},\n  booktitle         = {International Workshop on Traffic Monitoring and Analysis},\n  title             = {{Mixing biases: Structural changes in the AS topology evolution}},\n  year              = {2010},\n  month             = {May},\n  organization      = {Springer, Berlin, Heidelberg},\n  pages             = {32--45},\n  volume            = {6003 LNCS},\n  abstract          = {In this paper we study the structural evolution of the AS topology as inferred from two different datasets over a period of seven years. We use a variety of topological metrics to analyze the structural differences revealed in the AS topologies inferred from the two different datasets. In particular, to focus on the evolution of the relationship between the core and the periphery, we make use of a recently introduced topological metric, the weighted spectral distribution. We find that the traceroute dataset has increasing difficulty in sampling the periphery of the AS topology, largely due to limitations inherent to active probing. Such a dataset has too limited a view to properly observe topological changes at the AS-level compared to a dataset largely based on BGP data. We also highlight limitations in current measurements that require a better sampling of particular topological properties of the Internet. Our results indicate that the Internet is changing from a core-centered, strongly customer-provider oriented, disassortative network, to a soft-hierarchical, peering-oriented, assortative network. © 2010 Springer-Verlag.},\n  day               = {14},\n  doi               = {10.1007/978-3-642-12365-8_3},\n  eissn             = {1611-3349},\n  isbn              = {3642123643},\n  issn              = {0302-9743},\n  journal           = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n In this paper we study the structural evolution of the AS topology as inferred from two different datasets over a period of seven years. We use a variety of topological metrics to analyze the structural differences revealed in the AS topologies inferred from the two different datasets. In particular, to focus on the evolution of the relationship between the core and the periphery, we make use of a recently introduced topological metric, the weighted spectral distribution. We find that the traceroute dataset has increasing difficulty in sampling the periphery of the AS topology, largely due to limitations inherent to active probing. Such a dataset has too limited a view to properly observe topological changes at the AS-level compared to a dataset largely based on BGP data. We also highlight limitations in current measurements that require a better sampling of particular topological properties of the Internet. Our results indicate that the Internet is changing from a core-centered, strongly customer-provider oriented, disassortative network, to a soft-hierarchical, peering-oriented, assortative network. © 2010 Springer-Verlag.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Characterizing 10 Gbps network interface energy consumption.\n \n \n \n\n\n \n Sohan, R.; Rice, A.; Andrew, W. M.; and Mansley, K.\n\n\n \n\n\n\n In IEEE Local Computer Network Conference, pages 268–271, Dec 2010. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Sohan2010Characterizing,\n  author            = {Sohan, Ripduman and Rice, Andrew and Andrew, W. Moore and Mansley, Kieran},\n  booktitle         = {IEEE Local Computer Network Conference},\n  title             = {{Characterizing 10 Gbps network interface energy consumption}},\n  year              = {2010},\n  month             = {Dec},\n  organization      = {IEEE},\n  pages             = {268--271},\n  abstract          = {This paper quantifies the energy consumption in six 10 Gbps and four 1 Gbps interconnects at a fine-grained level, introducing two metrics for calculating the energy efficiency of a network interface from the perspective of network throughput and host CPU usage. It further compares the energy efficiency of multiport 1 Gbps to 10 Gbps interconnects. © 2010 IEEE.},\n  day               = {1},\n  doi               = {10.1109/LCN.2010.5735719},\n  isbn              = {9781424483877},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n This paper quantifies the energy consumption in six 10 Gbps and four 1 Gbps interconnects at a fine-grained level, introducing two metrics for calculating the energy efficiency of a network interface from the perspective of network throughput and host CPU usage. It further compares the energy efficiency of multiport 1 Gbps to 10 Gbps interconnects. © 2010 IEEE.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (16)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Addressing the Scalability of Ethernet with MOOSE.\n \n \n \n\n\n \n Scott, M.; Moore, A.; and Crowcroft, J.\n\n\n \n\n\n\n In Proc. DC CAVES Workshop, 2009. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Scott2009Addressing,\n  author    = {Scott, Malcolm and Moore, Andrew and Crowcroft, Jon},\n  booktitle = {Proc. DC CAVES Workshop},\n  title     = {{Addressing the Scalability of Ethernet with MOOSE}},\n  year      = {2009},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Tracking elephant flows in internet backbone traffic with an fpga-based cache.\n \n \n \n\n\n \n Zadnik, M.; Canini, M.; Moore, A. W.; Miller, D. J.; and Li, W.\n\n\n \n\n\n\n In 2009 International Conference on Field Programmable Logic and Applications, pages 640–644, 2009. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Zadnik2009Tracking,\n  author       = {Zadnik, Martin and Canini, Marco and Moore, Andrew W. and Miller, David J. and Li, Wei},\n  booktitle    = {2009 International Conference on Field Programmable Logic and Applications},\n  title        = {Tracking elephant flows in internet backbone traffic with an fpga-based cache},\n  year         = {2009},\n  organization = {IEEE},\n  pages        = {640--644},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Experience with high-speed automated application-identification for network-management.\n \n \n \n\n\n \n Canini, M.; Li, W.; Zadnik, M.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, pages 209–218, 2009. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Canini2009Experience,\n  author    = {Canini, Marco and Li, Wei and Zadnik, Martin and Moore, Andrew W.},\n  booktitle = {Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems},\n  title     = {Experience with high-speed automated application-identification for network-management},\n  year      = {2009},\n  pages     = {209--218},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Motivating future interconnects: a differential measurement analysis of PCI latency.\n \n \n \n\n\n \n Miller, D. J.; Watts, P. M.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, pages 94–103, 2009. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Miller2009Motivating,\n  author    = {Miller, David J. and Watts, Philip M. and Moore, Andrew W.},\n  booktitle = {Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems},\n  title     = {{Motivating future interconnects: a differential measurement analysis of PCI latency}},\n  year      = {2009},\n  pages     = {94--103},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Toward the identification of anonymous web proxies.\n \n \n \n\n\n \n Canini, M.; Li, W.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of Passive and Active Network Measurement 10th International Conference, PAM, pages 1–3, 2009. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Canini2009identification,\n  author    = {Canini, Marco and Li, Wei and Moore, Andrew W.},\n  booktitle = {Proceedings of Passive and Active Network Measurement 10th International Conference, PAM},\n  title     = {Toward the identification of anonymous web proxies},\n  year      = {2009},\n  pages     = {1--3},\n  priority  = {prio1},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Analysis of the Internet’s structural evolution.\n \n \n \n\n\n \n Haddadi, H.; Fay, D.; Uhlig, S.; Moore, A. W.; Mortier, R.; and Jamakovic, A.\n\n\n \n\n\n\n Technical Report 2009.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Haddadi2009Analysis,\n  author = {Haddadi, Hamed and Fay, Damien and Uhlig, Steve and Moore, Andrew W. and Mortier, Richard and Jamakovic, Almerima},\n  title  = {{Analysis of the Internet’s structural evolution}},\n  year   = {2009},\n  school = {University of Cambridge, Computer Laboratory},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n GTVS: boosting the collection of application traffic.\n \n \n \n\n\n \n Canini, M.; Li, W.; and Moore, A. W.\n\n\n \n\n\n\n Technical Report UCAM-CL-TR-748, 2009.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Canini2009GTVS,\n  author    = {Canini, Marco and Li, Wei and Moore, Andrew W.},\n  title     = {{GTVS: boosting the collection of application traffic}},\n  year      = {2009},\n  number    = {UCAM-CL-TR-748},\n  journal   = {University of Cambridge, Computer Laboratory Technical Report},\n  publisher = {University of Cambridge, Computer Laboratory},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n AtoZ: an automatic traffic organizer using NetFPGA.\n \n \n \n\n\n \n Canini, M.; Li, W.; Zadnik, M.; and Moore, A. W.\n\n\n \n\n\n\n Technical Report 2009.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Canini2009AtoZ,\n  author = {Canini, Marco and Li, Wei and Zadnik, Martin and Moore, Andrew W.},\n  title  = {{AtoZ: an automatic traffic organizer using NetFPGA}},\n  year   = {2009},\n  school = {University of Cambridge, Computer Laboratory},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Simulation, analysis and measurement of broadband network traffic.\n \n \n \n\n\n \n Clegg, R. G.; Withall, M. S.; Moore, A. W.; Phillips, I. W.; Parish, D. J.; Rio, M.; Landa, R.; Haddadi, H.; Kyriakopoulos, K.; Auge, J.; and Clayton, R.\n\n\n \n\n\n\n IET communications, 3(6): 957–966. 2009.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Clegg2009Simulation,\n  author    = {Clegg, Richard G. and Withall, Mark S. and Moore, Andrew W. and Phillips, Iain W. and Parish, David J. and Rio, Miguel and Landa, Raul and Haddadi, Hamed and Kyriakopoulos, Konstantinos and Auge, Jordan and Clayton, Richard},\n  journal   = {IET communications},\n  title     = {Simulation, analysis and measurement of broadband network traffic},\n  year      = {2009},\n  number    = {6},\n  pages     = {957--966},\n  volume    = {3},\n  publisher = {Institution of Engineering and Technology},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n GTVS: Boosting the collection of application traffic ground truth.\n \n \n \n\n\n \n Canini, M.; Li, W.; Moore, A. W.; and Bolla, R.\n\n\n \n\n\n\n In International Workshop on Traffic Monitoring and Analysis, volume 5537 LNCS, pages 54–63, Jul 2009. Springer, Berlin, Heidelberg\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Canini2009GTVSa,\n  author            = {Canini, Marco and Li, Wei and Moore, Andrew W. and Bolla, Raffaele},\n  booktitle         = {International Workshop on Traffic Monitoring and Analysis},\n  title             = {{GTVS: Boosting the collection of application traffic ground truth}},\n  year              = {2009},\n  month             = {Jul},\n  organization      = {Springer, Berlin, Heidelberg},\n  pages             = {54--63},\n  volume            = {5537 LNCS},\n  abstract          = {Interesting research in the areas of traffic classification, network monitoring, and application-oriented analysis can not proceed without real traffic traces, labeled with actual application information. However, hand-labeled traces are an extremely valuable but scarce resource in the traffic monitoring and analysis community, as a result of both privacy concerns and technical difficulties. Hardly any possibility exists for payloaded data to be released, while the impossibility of obtaining certain ground-truth application information from non-payloaded data has severely constrained the value of anonymized public traces. The usual way to obtain the ground truth is fragile, inefficient and not directly comparable from one,s work to another. This paper proposes a methodology and details the design of a technical framework that significantly boosts the efficiency in compiling the application traffic ground truth. Further, a case study on a 30 minute real data trace is presented. In contrast with past work, this is an easy hands-on tool suite dedicated to save user,s time and labor and is freely available to the public. © Springer-Verlag Berlin Heidelberg 2009.},\n  day               = {17},\n  doi               = {10.1007/978-3-642-01645-5_7},\n  eissn             = {1611-3349},\n  isbn              = {9783642016448},\n  issn              = {0302-9743},\n  journal           = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Interesting research in the areas of traffic classification, network monitoring, and application-oriented analysis can not proceed without real traffic traces, labeled with actual application information. However, hand-labeled traces are an extremely valuable but scarce resource in the traffic monitoring and analysis community, as a result of both privacy concerns and technical difficulties. Hardly any possibility exists for payloaded data to be released, while the impossibility of obtaining certain ground-truth application information from non-payloaded data has severely constrained the value of anonymized public traces. The usual way to obtain the ground truth is fragile, inefficient and not directly comparable from one,s work to another. This paper proposes a methodology and details the design of a technical framework that significantly boosts the efficiency in compiling the application traffic ground truth. Further, a case study on a 30 minute real data trace is presented. In contrast with past work, this is an easy hands-on tool suite dedicated to save user,s time and labor and is freely available to the public. © Springer-Verlag Berlin Heidelberg 2009.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Per flow packet sampling for high-speed network monitoring.\n \n \n \n \n\n\n \n Canini, M.; Fay, D.; Miller, D. J.; Moore, A. W.; and Bolla, R.\n\n\n \n\n\n\n In 2009 First International Communication Systems and Networks and Workshops, pages 1–10, 2009. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"PerPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Canini2009Per,\n  author            = {Canini, Marco and Fay, Damien and Miller, David J. and Moore, Andrew W. and Bolla, Raffaele},\n  booktitle         = {2009 First International Communication Systems and Networks and Workshops},\n  title             = {Per flow packet sampling for high-speed network monitoring},\n  year              = {2009},\n  organization      = {IEEE},\n  pages             = {1--10},\n  isbn              = {978-1-4244-2912-7},\n  publicationstatus = {published},\n  url               = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2\\&SrcApp=PARTNER_APP\\&SrcAuth=LinksAMR\\&KeyUT=WOS:000268180500059\\&DestLinkType=FullRecord\\&DestApp=ALL_WOS\\&UsrCustomerID=940c5db9f6a527ba8e12659dac275555},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Challenges in the capture and dissemination of measurements from high-speed networks.\n \n \n \n\n\n \n Clegg, R. G.; Withall, M. S.; Moore, A. W.; Phillips, I. W.; Parish, D. J.; Rio, M.; Landa, R.; Haddadi, H.; Kyriakopoulos, K.; Auge, J.; and others\n\n\n \n\n\n\n IET communications, 3(6): 957–966. Jun 2009.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Clegg2009Challenges,\n  author    = {Clegg, Richard G. and Withall, Mark S. and Moore, Andrew W. and Phillips, Iain W. and Parish, David J. and Rio, Miguel and Landa, Raul and Haddadi, Hamed and Kyriakopoulos, Konstantinos and Auge, Jordan and others},\n  journal   = {IET communications},\n  title     = {Challenges in the capture and dissemination of measurements from high-speed networks},\n  year      = {2009},\n  issn      = {1751-8628},\n  month     = {Jun},\n  number    = {6},\n  pages     = {957--966},\n  volume    = {3},\n  doi       = {10.1049/iet-com.2008.0068},\n  publisher = {IET Digital Library},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Weighted spectral distribution for internet topology analysis: theory and applications.\n \n \n \n\n\n \n Fay, D.; Haddadi, H.; Thomason, A.; Moore, A. W.; Mortier, R.; Jamakovic, A.; Uhlig, S.; and Rio, M.\n\n\n \n\n\n\n IEEE/ACM Transactions on networking, 18(1): 164–176. 2009.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Fay2009Weighted,\n  author       = {Fay, Damien and Haddadi, Hamed and Thomason, Andrew and Moore, Andrew W. and Mortier, Richard and Jamakovic, Almerima and Uhlig, Steve and Rio, Miguel},\n  journal      = {IEEE/ACM Transactions on networking},\n  title        = {Weighted spectral distribution for internet topology analysis: theory and applications},\n  year         = {2009},\n  issn         = {1558-2566},\n  number       = {1},\n  pages        = {164--176},\n  volume       = {18},\n  abstract     = {Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant to the study of Internet topologies, such as the generation of synthetic topologies to represent the Internet's AS topology. We derive a new metric that enables exactly such a structural comparison: the weighted spectral distribution. We then apply this metric to three aspects of the study of the Internet's AS topology. i) We use it to quantify the effect of changing the mixing properties of a simple synthetic network generator. ii) We use this quantitative understanding to examine the evolution of the Internet's AS topology over approximately seven years, finding that the distinction between the Internet core and periphery has blurred over time. iii) We use the metric to derive optimal parameterizations of several widely used AS topology generators with respect to a large-scale measurement of the real AS topology.},\n  date         = {Feb. 2010},\n  doi          = {10.1109/TNET.2009.2022369},\n  file         = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5233839:PDF},\n  issue        = {1},\n  journaltitle = {IEEE/ACM Transactions on Networking},\n  keywords     = {Internet, Network topology, IP networks, Laboratories, Application software, Computer science, Large-scale systems, Graph theory, Computer vision, Speech processing, Graph metrics, Internet topology, spectral graph theory, topology generation},\n  publisher    = {IEEE},\n}\n\n
\n
\n\n\n
\n Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant to the study of Internet topologies, such as the generation of synthetic topologies to represent the Internet's AS topology. We derive a new metric that enables exactly such a structural comparison: the weighted spectral distribution. We then apply this metric to three aspects of the study of the Internet's AS topology. i) We use it to quantify the effect of changing the mixing properties of a simple synthetic network generator. ii) We use this quantitative understanding to examine the evolution of the Internet's AS topology over approximately seven years, finding that the distinction between the Internet core and periphery has blurred over time. iii) We use the metric to derive optimal parameterizations of several widely used AS topology generators with respect to a large-scale measurement of the real AS topology.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the importance of local connectivity for Internet topology models.\n \n \n \n \n\n\n \n Haddadi, H.; Fay, D.; Jamakovic, A.; Maennel, O.; Moore, A. W.; Mortier, R.; and Uhlig, S.\n\n\n \n\n\n\n In 2009 21st International Teletraffic Congress, pages 1–8, 2009. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Haddadi2009importance,\n  author            = {Haddadi, Hamed and Fay, Damien and Jamakovic, Almerima and Maennel, Olaf and Moore, Andrew W. and Mortier, Richard and Uhlig, Steve},\n  booktitle         = {2009 21st International Teletraffic Congress},\n  title             = {{On the importance of local connectivity for Internet topology models}},\n  year              = {2009},\n  organization      = {IEEE},\n  pages             = {1--8},\n  isbn              = {978-1-4244-4744-2},\n  publicationstatus = {published},\n  url               = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2\\&SrcApp=PARTNER_APP\\&SrcAuth=LinksAMR\\&KeyUT=WOS:000276120900023\\&DestLinkType=FullRecord\\&DestApp=ALL_WOS\\&UsrCustomerID=940c5db9f6a527ba8e12659dac275555},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Efficient application identification and the temporal and spatial stability of classification schema.\n \n \n \n\n\n \n Li, W.; Canini, M.; Moore, A. W.; and Bolla, R.\n\n\n \n\n\n\n Computer Networks, 53(6): 790–809. Apr 2009.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Li2009Efficient,\n  author    = {Li, Wei and Canini, Marco and Moore, Andrew W. and Bolla, Raffaele},\n  journal   = {Computer Networks},\n  title     = {Efficient application identification and the temporal and spatial stability of classification schema},\n  year      = {2009},\n  issn      = {1389-1286},\n  month     = {Apr},\n  number    = {6},\n  pages     = {790--809},\n  volume    = {53},\n  day       = {23},\n  doi       = {10.1016/j.comnet.2008.11.016},\n  keyword   = {Traffic classification},\n  publisher = {Elsevier},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Analysis, simulation and measurement in large-scale packet networks.\n \n \n \n\n\n \n Mondragon, R.; Moore, A.; Pitts, J.; and Schormans, J.\n\n\n \n\n\n\n IET communications, 3(6): 887–905. Jun 2009.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Mondragon2009Analysis,\n  author    = {Mondragon, R. and Moore, A. and Pitts, J. and Schormans, J.},\n  journal   = {IET communications},\n  title     = {Analysis, simulation and measurement in large-scale packet networks},\n  year      = {2009},\n  issn      = {1751-8628},\n  month     = {Jun},\n  number    = {6},\n  pages     = {887--905},\n  volume    = {3},\n  doi       = {10.1049/iet-com.2008.0111},\n  keyword   = {ACCELERATED SIMULATION},\n  publisher = {IET Digital Library},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Classifying HTTP traffic in the new age.\n \n \n \n\n\n \n Li, W.; Moore, A. W.; and Canini, M.\n\n\n \n\n\n\n In ACM SIGCOMM, volume 8, pages 17–22, 2008. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Li2008Classifying,\n  author    = {Li, Wei and Moore, Andrew W. and Canini, Marco},\n  booktitle = {ACM SIGCOMM},\n  title     = {{Classifying HTTP traffic in the new age}},\n  year      = {2008},\n  pages     = {17--22},\n  volume    = {8},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Weighted spectral distribution.\n \n \n \n\n\n \n Fay, D.; Haddadi, H.; Uhlig, S.; Moore, A. W.; Mortier, R.; and Jamakovic, A.\n\n\n \n\n\n\n Technical Report 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Fay2008Weighted,\n  author = {Fay, Damien and Haddadi, Hamed and Uhlig, Steve and Moore, Andrew W. and Mortier, Richard and Jamakovic, Almerima},\n  title  = {Weighted spectral distribution},\n  year   = {2008},\n  school = {University of Cambridge, Computer Laboratory},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Techniques for flow inversion on sampled data.\n \n \n \n\n\n \n Clegg, R. G.; Landa, R.; Haddadi, H.; Rio, M.; and Moore, A. W.\n\n\n \n\n\n\n In IEEE INFOCOM Workshops 2008, pages 1–6, 2008. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Clegg2008Techniques,\n  author       = {Clegg, Richard G. and Landa, Raul and Haddadi, Hamed and Rio, Miguel and Moore, Andrew W.},\n  booktitle    = {IEEE INFOCOM Workshops 2008},\n  title        = {Techniques for flow inversion on sampled data},\n  year         = {2008},\n  organization = {IEEE},\n  pages        = {1--6},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Towards optical PCI.\n \n \n \n\n\n \n Miller, D. J.; and Moore, A. W.\n\n\n \n\n\n\n 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Miller2008Towards,\n  author = {Miller, David J. and Moore, Andrew W.},\n  title  = {{Towards optical PCI}},\n  year   = {2008},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Beyond node degree: evaluating AS topology models.\n \n \n \n\n\n \n Haddadi, H.; Fay, D.; Jamakovic, A.; Maennel, O.; Moore, A. W.; Mortier, R.; Rio, M.; and Uhlig, S.\n\n\n \n\n\n\n arXiv preprint arXiv:0807.2023. 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Haddadi2008node,\n  author        = {Haddadi, Hamed and Fay, Damien and Jamakovic, Almerima and Maennel, Olaf and Moore, Andrew W. and Mortier, Richard and Rio, Miguel and Uhlig, Steve},\n  journal       = {arXiv preprint arXiv:0807.2023},\n  title         = {{Beyond node degree: evaluating AS topology models}},\n  year          = {2008},\n  abstract      = {Many models have been proposed to generate Internet Autonomous System (AS)\ntopologies, most of which make structural assumptions about the AS graph. In\nthis paper we compare AS topology generation models with several observed AS\ntopologies. In contrast to most previous works, we avoid making assumptions\nabout which topological properties are important to characterize the AS\ntopology. Our analysis shows that, although matching degree-based properties,\nthe existing AS topology generation models fail to capture the complexity of\nthe local interconnection structure between ASs. Furthermore, we use BGP data\nfrom multiple vantage points to show that additional measurement locations\nsignificantly affect local structure properties, such as clustering and node\ncentrality. Degree-based properties, however, are not notably affected by\nadditional measurements locations. These observations are particularly valid in\nthe core. The shortcomings of AS topology generation models stems from an\nunderestimation of the complexity of the connectivity in the core caused by\ninappropriate use of BGP data.},\n  archiveprefix = {arxiv},\n  eprint        = {0807.2023v1},\n  keyword       = {cs.NI},\n}\n\n
\n
\n\n\n
\n Many models have been proposed to generate Internet Autonomous System (AS) topologies, most of which make structural assumptions about the AS graph. In this paper we compare AS topology generation models with several observed AS topologies. In contrast to most previous works, we avoid making assumptions about which topological properties are important to characterize the AS topology. Our analysis shows that, although matching degree-based properties, the existing AS topology generation models fail to capture the complexity of the local interconnection structure between ASs. Furthermore, we use BGP data from multiple vantage points to show that additional measurement locations significantly affect local structure properties, such as clustering and node centrality. Degree-based properties, however, are not notably affected by additional measurements locations. These observations are particularly valid in the core. The shortcomings of AS topology generation models stems from an underestimation of the complexity of the connectivity in the core caused by inappropriate use of BGP data.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Modeling Internet topology dynamics.\n \n \n \n\n\n \n Haddadi, H.; Uhlig, S.; Moore, A.; Mortier, R.; and Rio, M.\n\n\n \n\n\n\n ACM SIGCOMM Computer Communication Review, 38(2): 65–68. Apr 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Haddadi2008Modeling,\n  author    = {Haddadi, Hamed and Uhlig, Steve and Moore, Andrew and Mortier, Richard and Rio, Miguel},\n  journal   = {ACM SIGCOMM Computer Communication Review},\n  title     = {{Modeling Internet topology dynamics}},\n  year      = {2008},\n  issn      = {0146-4833},\n  month     = {Apr},\n  number    = {2},\n  pages     = {65--68},\n  volume    = {38},\n  keyword   = {topology},\n  publisher = {ACM},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Network topologies: inference, modeling, and generation.\n \n \n \n\n\n \n Haddadi, H.; Rio, M.; Iannaccone, G.; Moore, A.; and Mortier, R.\n\n\n \n\n\n\n IEEE Communications Surveys and Tutorials, 10(2): 48–69. 2008.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Haddadi2008Network,\n  author    = {Haddadi, Hamed and Rio, Miguel and Iannaccone, Gianluca and Moore, Andrew and Mortier, Richard},\n  journal   = {IEEE Communications Surveys and Tutorials},\n  title     = {Network topologies: inference, modeling, and generation},\n  year      = {2008},\n  issn      = {1553-877X},\n  number    = {2},\n  pages     = {48--69},\n  volume    = {10},\n  doi       = {10.1109/COMST.2008.4564479},\n  publisher = {IEEE},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Revisiting the issues on netflow sample and export performance.\n \n \n \n \n\n\n \n Haddadi, H.; Landa, R.; Moore, A. W.; Bhatti, S.; Rio, M.; and Che, X.\n\n\n \n\n\n\n In 2008 Third International Conference on Communications and Networking in China, pages 442–446, 2008. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Haddadi2008Revisiting,\n  author            = {Haddadi, Hamed and Landa, Raul and Moore, Andrew W. and Bhatti, Saleem and Rio, Miguel and Che, Xianhui},\n  booktitle         = {2008 Third International Conference on Communications and Networking in China},\n  title             = {Revisiting the issues on netflow sample and export performance},\n  year              = {2008},\n  organization      = {IEEE},\n  pages             = {442--446},\n  isbn              = {978-1-4244-2373-6},\n  publicationstatus = {published},\n  url               = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2\\&SrcApp=PARTNER_APP\\&SrcAuth=LinksAMR\\&KeyUT=WOS:000263416500084\\&DestLinkType=FullRecord\\&DestApp=ALL_WOS\\&UsrCustomerID=940c5db9f6a527ba8e12659dac275555},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n IMRG workshop on application classification and identification report.\n \n \n \n\n\n \n Strayer, T.; Allman, M.; Armitage, G.; Bellovin, S.; Jin, S.; and Moore, A. W.\n\n\n \n\n\n\n ACM SIGCOMM Computer Communication Review, 38(3): 87–90. Jul 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Strayer2008IMRG,\n  author    = {Strayer, Tim and Allman, Mark and Armitage, Grenville and Bellovin, Steve and Jin, Shudong and Moore, Andrew W.},\n  journal   = {ACM SIGCOMM Computer Communication Review},\n  title     = {{IMRG workshop on application classification and identification report}},\n  year      = {2008},\n  issn      = {0146-4833},\n  month     = {Jul},\n  number    = {3},\n  pages     = {87--90},\n  volume    = {38},\n  keyword   = {documentation},\n  publisher = {ACM},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Tuning topology generators using spectral distributions.\n \n \n \n\n\n \n Haddadi, H.; Fay, D.; Uhlig, S.; Moore, A.; Mortier, R.; Jamakovic, A.; and Rio, M.\n\n\n \n\n\n\n In SPEC International Performance Evaluation Workshop, volume 5119 LNCS, pages 154–173, Dec 2008. Springer, Berlin, Heidelberg, Springer Berlin Heidelberg\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Haddadi2008Tuning,\n  author            = {Haddadi, Hamed and Fay, Damien and Uhlig, Steve and Moore, Andrew and Mortier, Richard and Jamakovic, Almerima and Rio, Miguel},\n  booktitle         = {SPEC International Performance Evaluation Workshop},\n  title             = {Tuning topology generators using spectral distributions},\n  year              = {2008},\n  month             = {Dec},\n  organization      = {Springer, Berlin, Heidelberg},\n  pages             = {154--173},\n  publisher         = {Springer Berlin Heidelberg},\n  volume            = {5119 LNCS},\n  abstract          = {An increasing number of synthetic topology generators are available, each claiming to produce representative Internet topologies. Every generator has its own parameters, allowing the user to generate topologies with different characteristics. However, there exist no clear guidelines on tuning the value of these parameters in order to obtain a topology with specific characteristics. In this paper we optimize the parameters of several topology generators to match a given Internet topology. The optimization is performed either with respect to the link density, or to the spectrum of the normalized Laplacian matrix. Contrary to approaches in the literature that rely only on the largest eigenvalues, we take into account the set of all eigenvalues. However, we show that on their own the eigenvalues cannot be used to construct a metric for optimizing parameters. Instead we present a weighted spectral method which simultaneously takes into account all the properties of the graph. © 2008 Springer-Verlag Berlin Heidelberg.},\n  day               = {1},\n  doi               = {10.1007/978-3-540-69814-2-11},\n  eissn             = {1611-3349},\n  isbn              = {3540698132},\n  issn              = {0302-9743},\n  journal           = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n An increasing number of synthetic topology generators are available, each claiming to produce representative Internet topologies. Every generator has its own parameters, allowing the user to generate topologies with different characteristics. However, there exist no clear guidelines on tuning the value of these parameters in order to obtain a topology with specific characteristics. In this paper we optimize the parameters of several topology generators to match a given Internet topology. The optimization is performed either with respect to the link density, or to the spectrum of the normalized Laplacian matrix. Contrary to approaches in the literature that rely only on the largest eigenvalues, we take into account the set of all eigenvalues. However, we show that on their own the eigenvalues cannot be used to construct a metric for optimizing parameters. Instead we present a weighted spectral method which simultaneously takes into account all the properties of the graph. © 2008 Springer-Verlag Berlin Heidelberg.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A machine learning approach for efficient traffic classification.\n \n \n \n\n\n \n Li, W.; and Moore, A. W.\n\n\n \n\n\n\n In 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pages 310–317, 2007. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Li2007machine,\n  author       = {Li, Wei and Moore, Andrew W.},\n  booktitle    = {2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems},\n  title        = {A machine learning approach for efficient traffic classification},\n  year         = {2007},\n  organization = {IEEE},\n  pages        = {310--317},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n End-to-end network topology generation.\n \n \n \n\n\n \n Haddadi, H.; Moore, A.; Mortier, R.; Rio, M.; and Iannaccone, G.\n\n\n \n\n\n\n ACM SIGCOMM poster Session. 2007.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Haddadi2007End,\n  author  = {Haddadi, Hamed and Moore, Andrew and Mortier, Richard and Rio, Miguel and Iannaccone, Gianluca},\n  journal = {ACM SIGCOMM poster Session},\n  title   = {End-to-end network topology generation},\n  year    = {2007},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Traffic trace artifacts due to monitoring via port mirroring.\n \n \n \n\n\n \n Jian, Z.; and Moore, A.\n\n\n \n\n\n\n In Fifth IEEE/IFIP Workshop on End-to-End Monitoring Techniques and Services, E2EMON'07, Oct 2007. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Jian2007Traffic,\n  author            = {Jian, Z. and Moore, A.},\n  booktitle         = {Fifth IEEE/IFIP Workshop on End-to-End Monitoring Techniques and Services, E2EMON'07},\n  title             = {Traffic trace artifacts due to monitoring via port mirroring},\n  year              = {2007},\n  month             = {Oct},\n  abstract          = {Port-mirroring techniques are supported by many of today's medium and high-end Ethernet switches. The ubiquity and low-cost of port mirroring has made it a popular method for collecting packet traces. Despite its wide-spread use little work has been reported on the impacts of this monitoring method upon the measured network traffic. In particular, we focus upon each of delay and jitter (timing difference), packet-reordering, and packet-loss statistics. We compare the port-mirroring method with inserting a passive TAP (Test Access Point), such as a fibre splitter, into a monitored link. Despite a passive TAP being transparent to monitored traffic, port-mirroring popularity arises from its limited set-up disruption, and (potentially) easier management. This paper documents experimental comparison of traffic using the passive TAP and port-mirroring functionality, and shows that port-mirroring will introduce significant changes to the inter-packet timing, packet-reordering, and packet-loss - even at very low levels of utilisation. © 2007 IEEE.},\n  day               = {1},\n  doi               = {10.1109/E2EMON.2007.375317},\n  isbn              = {1424412897},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Port-mirroring techniques are supported by many of today's medium and high-end Ethernet switches. The ubiquity and low-cost of port mirroring has made it a popular method for collecting packet traces. Despite its wide-spread use little work has been reported on the impacts of this monitoring method upon the measured network traffic. In particular, we focus upon each of delay and jitter (timing difference), packet-reordering, and packet-loss statistics. We compare the port-mirroring method with inserting a passive TAP (Test Access Point), such as a fibre splitter, into a monitored link. Despite a passive TAP being transparent to monitored traffic, port-mirroring popularity arises from its limited set-up disruption, and (potentially) easier management. This paper documents experimental comparison of traffic using the passive TAP and port-mirroring functionality, and shows that port-mirroring will introduce significant changes to the inter-packet timing, packet-reordering, and packet-loss - even at very low levels of utilisation. © 2007 IEEE.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Bayesian neural networks for internet traffic classification.\n \n \n \n\n\n \n Auld, T.; Moore, A. W.; and Gull, S. F.\n\n\n \n\n\n\n IEEE Transactions on neural networks, 18(1): 223–239. 2007.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Auld2007Bayesian,\n  author       = {Auld, Tom and Moore, Andrew W. and Gull, Stephen F.},\n  journal      = {IEEE Transactions on neural networks},\n  title        = {Bayesian neural networks for internet traffic classification},\n  year         = {2007},\n  issn         = {1941-0093},\n  number       = {1},\n  pages        = {223--239},\n  volume       = {18},\n  abstract     = {Internet traffic identification is an important tool for network management. It allows operators to better predict future traffic matrices and demands, security personnel to detect anomalous behavior, and researchers to develop more realistic traffic models. We present here a traffic classifier that can achieve a high accuracy across a range of application types without any source or destination host-address or port information. We use supervised machine learning based on a Bayesian trained neural network. Though our technique uses training data with categories derived from packet content, training and testing were done using features derived from packet streams consisting of one or more packet headers. By providing classification without access to the contents of packets, our technique offers wider application than methods that require full packet/payloads for classification. This is a powerful advantage, using samples of classified traffic to permit the categorization of traffic based only upon commonly available information},\n  date         = {Jan. 2007},\n  doi          = {10.1109/TNN.2006.883010},\n  file         = {:https\\://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4049810:PDF},\n  issue        = {1},\n  journaltitle = {IEEE Transactions on Neural Networks},\n  keywords     = {Bayesian methods, Neural networks, IP networks, Telecommunication traffic, Traffic control, Information security, Personnel, Predictive models, Machine learning, Training data, Internet traffic, network operations, neural network applications, pattern recognition, traffic identification},\n  publisher    = {IEEE},\n}\n\n
\n
\n\n\n
\n Internet traffic identification is an important tool for network management. It allows operators to better predict future traffic matrices and demands, security personnel to detect anomalous behavior, and researchers to develop more realistic traffic models. We present here a traffic classifier that can achieve a high accuracy across a range of application types without any source or destination host-address or port information. We use supervised machine learning based on a Bayesian trained neural network. Though our technique uses training data with categories derived from packet content, training and testing were done using features derived from packet streams consisting of one or more packet headers. By providing classification without access to the contents of packets, our technique offers wider application than methods that require full packet/payloads for classification. This is a powerful advantage, using samples of classified traffic to permit the categorization of traffic based only upon commonly available information\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Lightweight application classification for network management.\n \n \n \n\n\n \n Jiang, H.; Moore, A. W.; Ge, Z.; Jin, S.; and Wang, J.\n\n\n \n\n\n\n In Proceedings of the 2007 SIGCOMM workshop on Internet network management, pages 299–304, Dec 2007. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Jiang2007Lightweight,\n  author            = {Jiang, Hongbo and Moore, Andrew W. and Ge, Zihui and Jin, Shudong and Wang, Jia},\n  booktitle         = {Proceedings of the 2007 SIGCOMM workshop on Internet network management},\n  title             = {Lightweight application classification for network management},\n  year              = {2007},\n  month             = {Dec},\n  pages             = {299--304},\n  abstract          = {Traffic application classification is an essential step in the network management process to provide high availability of network services. However, network management has seen limited use of traffic classification because of the significant overheads of existing techniques. In this context we explore the feasibility and performance of lightweight traffic classification based on NetFlow records. In our experiments, the NetFlow records are created from packettrace data and pre-tagged based upon packet content. This provides us with NetFlow records that are tagged with a high accuracy for ground-truth. Our experiments show that NetFlow records can be usefully employed for application classification. We demonstrate that our machine learning technique is able to provide an identification accuracy (≈ 91\\%) that, while a little lower than that based upon previous packet-based machine learning work (> 95\\%), is significantly higher than the commonly used port-based approach (50 - 70\\%). Trade-offs such as the complexity of feature selection and packet sampling are also studied. We conclude that a lightweight mechanism of classification can provide application information with a considerably high accuracy, and can be a useful practice towards more effective network management. Copyright 2007 INM'07.},\n  day               = {1},\n  doi               = {10.1145/1321753.1321771},\n  isbn              = {9781595937889},\n  journal           = {Proceedings of the 2007 SIGCOMM Workshop on Internet Network Management, INM '07},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Traffic application classification is an essential step in the network management process to provide high availability of network services. However, network management has seen limited use of traffic classification because of the significant overheads of existing techniques. In this context we explore the feasibility and performance of lightweight traffic classification based on NetFlow records. In our experiments, the NetFlow records are created from packettrace data and pre-tagged based upon packet content. This provides us with NetFlow records that are tagged with a high accuracy for ground-truth. Our experiments show that NetFlow records can be usefully employed for application classification. We demonstrate that our machine learning technique is able to provide an identification accuracy (≈ 91%) that, while a little lower than that based upon previous packet-based machine learning work (> 95%), is significantly higher than the commonly used port-based approach (50 - 70%). Trade-offs such as the complexity of feature selection and packet sampling are also studied. We conclude that a lightweight mechanism of classification can provide application information with a considerably high accuracy, and can be a useful practice towards more effective network management. Copyright 2007 INM'07.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Traffic trace artifacts due to monitoring via port mirroring.\n \n \n \n \n\n\n \n Zhang, J.; and Moore, A.\n\n\n \n\n\n\n In 2007 Workshop on End-to-End Monitoring Techniques and Services, pages 1–8, 2007. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"TrafficPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Zhang2007Traffic,\n  author            = {Zhang, Jian and Moore, Andrew},\n  booktitle         = {2007 Workshop on End-to-End Monitoring Techniques and Services},\n  title             = {Traffic trace artifacts due to monitoring via port mirroring},\n  year              = {2007},\n  organization      = {IEEE},\n  pages             = {1--8},\n  isbn              = {978-1-4244-1289-1},\n  publicationstatus = {published},\n  url               = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2\\&SrcApp=PARTNER_APP\\&SrcAuth=LinksAMR\\&KeyUT=WOS:000248079000002\\&DestLinkType=FullRecord\\&DestApp=ALL_WOS\\&UsrCustomerID=940c5db9f6a527ba8e12659dac275555},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Physical layer impact upon packet errors.\n \n \n \n\n\n \n James, L.; Moore, A.; Glick, M.; and Bulpin, J.\n\n\n \n\n\n\n In Passive and Active Measurement Workshop (PAM 2006), 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{James2006Physical,\n  author    = {James, L. and Moore, A. and Glick, Madeleine and Bulpin, James},\n  booktitle = {Passive and Active Measurement Workshop (PAM 2006)},\n  title     = {Physical layer impact upon packet errors},\n  year      = {2006},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Learning for accurate classification of real-time traffic.\n \n \n \n\n\n \n Li, W.; and Moore, A. W.\n\n\n \n\n\n\n In Proceedings of the 2006 ACM CoNEXT conference, pages 1–2, 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Li2006Learning,\n  author    = {Li, Wei and Moore, Andrew W.},\n  booktitle = {Proceedings of the 2006 ACM CoNEXT conference},\n  title     = {Learning for accurate classification of real-time traffic},\n  year      = {2006},\n  pages     = {1--2},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n BER implication for TCP/IP network throughput over a 10$×$ 10 Gbps Wavelength-Striping Cascaded SOA-Switch.\n \n \n \n\n\n \n Rodriguez-Colina, E.; Moore, A. W.; Glick, M.; Wonfor, A.; White, I. H.; and Penty, R. V.\n\n\n \n\n\n\n In Proceedings of the London Communications Symposium, 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{RodriguezColina2006BER,\n  author    = {Rodriguez-Colina, E. and Moore, A. W. and Glick, M. and Wonfor, A. and White, I. H. and Penty, R. V.},\n  booktitle = {Proceedings of the London Communications Symposium},\n  title     = {{BER implication for TCP/IP network throughput over a 10$\\times$ 10 Gbps Wavelength-Striping Cascaded SOA-Switch}},\n  year      = {2006},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Synergy: blending heterogeneous measurement elements for effective network monitoring.\n \n \n \n\n\n \n Awan, A. A.; and Moore, A.\n\n\n \n\n\n\n In Proceedings of the 2006 ACM CoNEXT conference, pages 1–2, 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Awan2006Synergy,\n  author    = {Awan, Awais Ahmed and Moore, Andrew},\n  booktitle = {Proceedings of the 2006 ACM CoNEXT conference},\n  title     = {Synergy: blending heterogeneous measurement elements for effective network monitoring},\n  year      = {2006},\n  pages     = {1--2},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n TCP sending rate control at Terabits per second.\n \n \n \n\n\n \n Rodriguez De La Colina, E.; Williams, K. A.; Moore, A. W.; James, L. B.; Penty, R. V.; and White, I. H.\n\n\n \n\n\n\n . 2006.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{RodriguezDeLaColina2006TCP,\n  author = {Rodriguez De La Colina, E. and Williams, K. A. and Moore, A. W. and James, L. B. and Penty, R. V. and White, I. H.},\n  title  = {{TCP sending rate control at Terabits per second}},\n  year   = {2006},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n TCP sending rate control at Terabits per second.\n \n \n \n\n\n \n Rodriguez-Colina, E.; James, L. B.; Penty, R. V.; White, I. H.; Williams, K. A.; and Moore, A. W.\n\n\n \n\n\n\n In 25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006, pages 3017–3021, 2006. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{RodriguezColina2006TCP,\n  author       = {Rodriguez-Colina, E. and James, L. B. and Penty, R. V. and White, I. H. and Williams, K. A. and Moore, A. W.},\n  booktitle    = {25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006},\n  title        = {{TCP sending rate control at Terabits per second}},\n  year         = {2006},\n  organization = {IEEE},\n  pages        = {3017--3021},\n  issn         = {0743-166X},\n  keyword      = {TCP/IP performance over high bandwidth links},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Toward the accurate identification of network applications.\n \n \n \n\n\n \n Moore, A. W.; and Papagiannaki, K.\n\n\n \n\n\n\n In International Workshop on Passive and Active Network Measurement, pages 41–54, 2005. Springer, Berlin, Heidelberg\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Moore2005accurate,\n  author       = {Moore, Andrew W. and Papagiannaki, Konstantina},\n  booktitle    = {International Workshop on Passive and Active Network Measurement},\n  title        = {Toward the accurate identification of network applications},\n  year         = {2005},\n  organization = {Springer, Berlin, Heidelberg},\n  pages        = {41--54},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Discriminators for use in flow-based classification.\n \n \n \n\n\n \n Moore, A.; Zuev, D.; and Crogan, M.\n\n\n \n\n\n\n Technical Report RR-05-13, August 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Moore2005Discriminators,\n  author = {Moore, Andrew and Zuev, Denis and Crogan, Michael},\n  title  = {Discriminators for use in flow-based classification},\n  year   = {2005},\n  month  = aug,\n  number = {RR-05-13},\n  school = {Queen Mary, University of London},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Traffic classification using a statistical approach.\n \n \n \n\n\n \n Zuev, D.; and Moore, A. W.\n\n\n \n\n\n\n In International workshop on passive and active network measurement, pages 321–324, 2005. Springer, Berlin, Heidelberg\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Zuev2005Traffic,\n  author       = {Zuev, Denis and Moore, Andrew W.},\n  booktitle    = {International workshop on passive and active network measurement},\n  title        = {Traffic classification using a statistical approach},\n  year         = {2005},\n  organization = {Springer, Berlin, Heidelberg},\n  pages        = {321--324},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Packet error rate and bit error rate non-deterministic relationship in optical network applications.\n \n \n \n\n\n \n James, L. B.; Moore, A. W.; Wonfor, A.; Plumb, R.; White, I. H.; Penty, R. V.; Glick, M.; and McAuley, D.\n\n\n \n\n\n\n In Optical fiber communication conference, pages OThS5, 2005. Optical Society of America\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{James2005Packet,\n  author       = {James, Laura B. and Moore, Andrew W. and Wonfor, Adrian and Plumb, Richard and White, Ian H. and Penty, Richard V. and Glick, Madeleine and McAuley, Derek},\n  booktitle    = {Optical fiber communication conference},\n  title        = {Packet error rate and bit error rate non-deterministic relationship in optical network applications},\n  year         = {2005},\n  organization = {Optical Society of America},\n  pages        = {OThS5},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Chasing errors through the network stack: a testbed for investigating errors in real traffic on optical networks.\n \n \n \n\n\n \n Moore, A. W.; James, L. B.; Wonfor, A.; White, I. H.; and Penty, R. V.\n\n\n \n\n\n\n IEEE Communications Magazine, 43(8): S34–S39. 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Moore2005Chasing,\n  author    = {Moore, Andrew W. and James, Laura B. and Wonfor, Adrian and White, Ian H. and Penty, Richard V.},\n  journal   = {IEEE Communications Magazine},\n  title     = {Chasing errors through the network stack: a testbed for investigating errors in real traffic on optical networks},\n  year      = {2005},\n  number    = {8},\n  pages     = {S34--S39},\n  volume    = {43},\n  publisher = {IEEE},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Explaining Structured Errors in Gigabit Ethernet.\n \n \n \n\n\n \n Moore, A. W.; James, L. B.; Plumb, R.; and Glick, M.\n\n\n \n\n\n\n Technical Report 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Moore2005Explaining,\n  author = {Moore, Andrew W. and James, Laura B. and Plumb, Richard and Glick, Madeleine},\n  title  = {{Explaining Structured Errors in Gigabit Ethernet}},\n  year   = {2005},\n  school = {Intel Research Report},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A testbed for investigating errors in real traffic on optical networks.\n \n \n \n\n\n \n Moore, A. W.; James, L. B.; Wonfor, A.; White, I. H.; Penty, R. V.; Glick, M.; and McAuley, D.\n\n\n \n\n\n\n IEEE Communications Magazine,S34–S39. Aug 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Moore2005testbed,\n  author  = {Moore, A. W. and James, L. B. and Wonfor, A. and White, I. H. and Penty, R. V. and Glick, M. and McAuley, D.},\n  journal = {IEEE Communications Magazine},\n  title   = {A testbed for investigating errors in real traffic on optical networks},\n  year    = {2005},\n  issn    = {0163-6804},\n  month   = {Aug},\n  pages   = {S34--S39},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Internet traffic classification using bayesian analysis techniques.\n \n \n \n\n\n \n Moore, A. W.; and Zuev, D.\n\n\n \n\n\n\n In Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, volume 33, pages 50–60, Jan 2005. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Moore2005Internet,\n  author            = {Moore, Andrew W. and Zuev, Denis},\n  booktitle         = {Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems},\n  title             = {Internet traffic classification using bayesian analysis techniques},\n  year              = {2005},\n  month             = {Jan},\n  number            = {1},\n  pages             = {50--60},\n  volume            = {33},\n  abstract          = {Accurate traffic classification is of fundamental importance to numerous other network activities, from security monitoring to accounting, and from Quality of Service to providing operators with useful forecasts for long-term provisioning. We apply a Naïve Bayes estimator to categorize traffic by application. Uniquely, our work capitalizes on hand-classified network data, using it as input to a supervised Naïve Bayes estimator. In this paper we illustrate the high level of accuracy achievable with the Naïve Bayes estimator. We further illustrate the improved accuracy of refined variants of this estimator. Our results indicate that with the simplest of Naïve Bayes estimator we are able to achieve about 65\\% accuracy on per-flow classification and with two powerful refinements we can improve this value to better than 95\\%; this is a vast improvement over traditional techniques that achieve 50-70\\%. While our technique uses training data, with categories derived from packet-content, all of our training and testing was done using header-derived discriminators. We emphasize this as a powerful aspect of our approach: using samples of well-known traffic to allow the categorization of traffic using commonly-available information alone. Copyright 2005 ACM.},\n  day               = {1},\n  doi               = {10.1145/1071690.1064220},\n  eissn             = {0163-5999},\n  issn              = {0163-5999},\n  journal           = {Performance Evaluation Review},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n Accurate traffic classification is of fundamental importance to numerous other network activities, from security monitoring to accounting, and from Quality of Service to providing operators with useful forecasts for long-term provisioning. We apply a Naïve Bayes estimator to categorize traffic by application. Uniquely, our work capitalizes on hand-classified network data, using it as input to a supervised Naïve Bayes estimator. In this paper we illustrate the high level of accuracy achievable with the Naïve Bayes estimator. We further illustrate the improved accuracy of refined variants of this estimator. Our results indicate that with the simplest of Naïve Bayes estimator we are able to achieve about 65% accuracy on per-flow classification and with two powerful refinements we can improve this value to better than 95%; this is a vast improvement over traditional techniques that achieve 50-70%. While our technique uses training data, with categories derived from packet-content, all of our training and testing was done using header-derived discriminators. We emphasize this as a powerful aspect of our approach: using samples of well-known traffic to allow the categorization of traffic using commonly-available information alone. Copyright 2005 ACM.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Optical network packet error rate due to physical layer coding.\n \n \n \n\n\n \n Moore, A. W.; James, L. B.; Glick, M.; Wonfor, A.; Plumb, R. G.; White, I. H.; McAuley, D.; and Penty, R. V.\n\n\n \n\n\n\n Journal of lightwave technology, 23(10): 3056–3065. Oct 2005.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{Moore2005Optical,\n  author    = {Moore, Andrew W. and James, Laura B. and Glick, Madeleine and Wonfor, Adrian and Plumb, Richard G. and White, Ian H. and McAuley, Derek and Penty, Richard V.},\n  journal   = {Journal of lightwave technology},\n  title     = {Optical network packet error rate due to physical layer coding},\n  year      = {2005},\n  issn      = {0733-8724},\n  month     = {Oct},\n  number    = {10},\n  pages     = {3056--3065},\n  volume    = {23},\n  doi       = {10.1109/JLT.2005.856275},\n  keyword   = {codecs},\n  publisher = {IEEE},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n An implementation-based comparison of Measurement-Based Admission Control algorithms.\n \n \n \n\n\n \n Moore, A. W.\n\n\n \n\n\n\n Journal of High Speed Networks, 13(2): 87–102. 2004.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Moore2004implementation,\n  author    = {Moore, Andrew W.},\n  journal   = {Journal of High Speed Networks},\n  title     = {{An implementation-based comparison of Measurement-Based Admission Control algorithms}},\n  year      = {2004},\n  number    = {2},\n  pages     = {87--102},\n  volume    = {13},\n  publisher = {IOS Press},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Structured errors in optical Gigabit Ethernet packets.\n \n \n \n\n\n \n James, L.; Moore, A.; and Glick, M.\n\n\n \n\n\n\n In International Workshop on Passive and Active Network Measurement, pages 195–204, 2004. Springer, Berlin, Heidelberg\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{James2004Structured,\n  author       = {James, Laura and Moore, Andrew and Glick, Madeleine},\n  booktitle    = {International Workshop on Passive and Active Network Measurement},\n  title        = {{Structured errors in optical Gigabit Ethernet packets}},\n  year         = {2004},\n  organization = {Springer, Berlin, Heidelberg},\n  pages        = {195--204},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Beyond gigabit ethernet: Physical layer issues in future optical networks.\n \n \n \n\n\n \n James, L. B.; Moore, A. W.; Plumb, R.; Glick, M.; Wonfor, A.; White, I. H.; McAuley, D.; and Penty, R. V.\n\n\n \n\n\n\n In Proceedings of London Communications Symposium, 2004. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{James2004gigabit,\n  author    = {James, L. B. and Moore, A. W. and Plumb, R. and Glick, M. and Wonfor, A. and White, I. H. and McAuley, D. and Penty, R. V.},\n  booktitle = {Proceedings of London Communications Symposium},\n  title     = {{Beyond gigabit ethernet: Physical layer issues in future optical networks}},\n  year      = {2004},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The CoMo white paper.\n \n \n \n\n\n \n Iannaccone, G.; Diot, C.; McAuley, D.; Moore, A.; Pratt, I.; and Rizzo, L.\n\n\n \n\n\n\n Technical Report 2004.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Iannaccone2004CoMo,\n  author = {Iannaccone, Gianluca and Diot, Christophe and McAuley, Derek and Moore, Andrew and Pratt, Ian and Rizzo, Luigi},\n  title  = {{The CoMo white paper}},\n  year   = {2004},\n  school = {Technical Report IRC-TR-04-17, Intel Research},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Architecture of a network monitor.\n \n \n \n\n\n \n Moore, A.; Hall, J.; Kreibich, C.; Harris, E.; and Pratt, I.\n\n\n \n\n\n\n In Passive & Active Measurement Workshop, volume 2003, 2003. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Moore2003Architecture,\n  author    = {Moore, Andrew and Hall, James and Kreibich, Christian and Harris, Euan and Pratt, Ian},\n  booktitle = {Passive \\& Active Measurement Workshop},\n  title     = {Architecture of a network monitor},\n  year      = {2003},\n  volume    = {2003},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The effect of early packet loss on web page download times.\n \n \n \n\n\n \n Hall, J.; Pratt, I.; Leslie, I.; and Moore, A.\n\n\n \n\n\n\n In Passive and Active Measurement Workshop, La Jolla, California USA, 2003. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Hall2003effect,\n  author    = {Hall, James and Pratt, Ian and Leslie, Ian and Moore, Andrew},\n  booktitle = {Passive and Active Measurement Workshop, La Jolla, California USA},\n  title     = {The effect of early packet loss on web page download times},\n  year      = {2003},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Multi-protocol visualization: a tool demonstration.\n \n \n \n\n\n \n Hall, J.; Moore, A.; Pratt, I.; and Leslie, I.\n\n\n \n\n\n\n In Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research, pages 13–22, Dec 2003. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Hall2003Multi,\n  author            = {Hall, James and Moore, Andrew and Pratt, Ian and Leslie, Ian},\n  booktitle         = {Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research},\n  title             = {Multi-protocol visualization: a tool demonstration},\n  year              = {2003},\n  month             = {Dec},\n  pages             = {13--22},\n  abstract          = {This paper describes a system for the visualization of multiple protocols. The visualizer makes possible the identification of both intra and inter-protocol behaviour. This tool has become a critical resource in the development of our multi-protocol monitoring system; allowing the verification of the monitoring system, identification of new modes of behaviour and the easy visualization of potentially overwhelming quantities of information. Copyright 2003 ACM.},\n  day               = {1},\n  doi               = {10.1145/944773.944776},\n  journal           = {Proceedings of the ACM SIGCOMM Workshop on Models, Methods and Tools for Reproducible Network Research, MoMeTools '03},\n  publicationstatus = {published},\n}\n\n
\n
\n\n\n
\n This paper describes a system for the visualization of multiple protocols. The visualizer makes possible the identification of both intra and inter-protocol behaviour. This tool has become a critical resource in the development of our multi-protocol monitoring system; allowing the verification of the monitoring system, identification of new modes of behaviour and the easy visualization of potentially overwhelming quantities of information. Copyright 2003 ACM.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Measurement-based management of network resources.\n \n \n \n\n\n \n Moore, A. W.\n\n\n \n\n\n\n Technical Report 2002.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Moore2002Measurement,\n  author = {Moore, Andrew William},\n  title  = {Measurement-based management of network resources},\n  year   = {2002},\n  school = {University of Cambridge, Computer Laboratory},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Network Monitoring with Nprobe.\n \n \n \n\n\n \n Moore, A. W.; Neugebauer, R.; Hall, J.; and Pratt, I.\n\n\n \n\n\n\n 2002.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Moore2002Network,\n  author = {Moore, Andrew W. and Neugebauer, Rolf and Hall, James and Pratt, Ian},\n  title  = {{Network Monitoring with Nprobe}},\n  year   = {2002},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1999\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n An experimental configuration for the evaluation of CAC algorithms.\n \n \n \n\n\n \n Moore, A.; and Crosby, S.\n\n\n \n\n\n\n ACM SIGMETRICS Performance Evaluation Review, 27(3): 43–54. 1999.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Moore1999experimental,\n  author    = {Moore, Andrew and Crosby, Simon},\n  journal   = {ACM SIGMETRICS Performance Evaluation Review},\n  title     = {{An experimental configuration for the evaluation of CAC algorithms}},\n  year      = {1999},\n  number    = {3},\n  pages     = {43--54},\n  volume    = {27},\n  publisher = {ACM},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1998\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Experimental Results from a Practical Implementation of a Measurement Based CAC Algorithm. Contract ML704589 Final report.\n \n \n \n\n\n \n Moore, A.; and Crosby, S.\n\n\n \n\n\n\n Technical Report 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Moore1998Experimental,\n  author    = {Moore, Andrew and Crosby, Simon},\n  title     = {{Experimental Results from a Practical Implementation of a Measurement Based CAC Algorithm. Contract ML704589 Final report}},\n  year      = {1998},\n  booktitle = {BTL Final Report Contract ML704589},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1996\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A comparison of system monitoring methods, passive network monitoring and kernel instrumentation.\n \n \n \n\n\n \n Moore, A. W.; McGregor, A. J.; and Breen, J. W.\n\n\n \n\n\n\n ACM SIGOPS Operating Systems Review, 30(1): 16–38. Jan 1996.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Moore1996comparison,\n  author            = {Moore, Andrew W. and McGregor, Anthony James and Breen, Jim W.},\n  journal           = {ACM SIGOPS Operating Systems Review},\n  title             = {A comparison of system monitoring methods, passive network monitoring and kernel instrumentation},\n  year              = {1996},\n  issn              = {0163-5980},\n  month             = {Jan},\n  number            = {1},\n  pages             = {16--38},\n  volume            = {30},\n  abstract          = {This paper presents the comparison of two methods of system monitoring, passive network monitoring and kernel instrumentation. The comparison is made on the basis of passive network monitoring being used as a replacement for kernel instrumentation in some situations. Despite the fact that the passive network monitoring technique is shown to perform poorly as a direct replacement for kernel instrumentation, this paper indicates the areas where passive network monitoring could be used to the greatest advantage and presents methods by which the discrepancies between results of the two techniques could be minimised.},\n  day               = {1},\n  doi               = {10.1145/218646.218648},\n  publicationstatus = {published},\n  publisher         = {ACM},\n}\n\n
\n
\n\n\n
\n This paper presents the comparison of two methods of system monitoring, passive network monitoring and kernel instrumentation. The comparison is made on the basis of passive network monitoring being used as a replacement for kernel instrumentation in some situations. Despite the fact that the passive network monitoring technique is shown to perform poorly as a direct replacement for kernel instrumentation, this paper indicates the areas where passive network monitoring could be used to the greatest advantage and presents methods by which the discrepancies between results of the two techniques could be minimised.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1995\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Operating system and file system monitoring: A comparison of passive network monitoring with full kernel instrumentation techniques.\n \n \n \n\n\n \n Moore, A. W.\n\n\n \n\n\n\n Ph.D. Thesis, Monash University, 1995.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@PhdThesis{Moore1995Operating,\n  author = {Moore, Andrew W.},\n  school = {Monash University},\n  title  = {{Operating system and file system monitoring: A comparison of passive network monitoring with full kernel instrumentation techniques}},\n  year   = {1995},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1993\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n The Theory of CCITT Recommendation H. 261,/Video Codec for Audiovisual Services at...\n \n \n \n\n\n \n Moore, A.\n\n\n \n\n\n\n Technical Report 1993.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Moore1993Theory,\n  author  = {Moore, Andrew},\n  title   = {{The Theory of CCITT Recommendation H. 261,/Video Codec for Audiovisual Services at...}},\n  year    = {1993},\n  journal = {Dec},\n  pages   = {37},\n  volume  = {16},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n undefined\n \n \n (15)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A scalable monitoring platform for the GRID (grid-probe).\n \n \n \n\n\n \n Pratt, I. A.; Leslie, I. M.; Crowcroft, J. A.; McAuley, D. R.; and Moore, A. W.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Prattscalable,\n  author = {Pratt, I. A. and Leslie, I. M. and Crowcroft, J. A. and McAuley, D. R. and Moore, A. W.},\n  title  = {{A scalable monitoring platform for the GRID (grid-probe)}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Optimal design of performance measurement experiments for complex, large-scale networks (DOENET).\n \n \n \n\n\n \n Schormans, J.; Moore, A.; Gilmour, S.; and Pitts, J.\n\n\n \n\n\n\n \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{SchormansOptimal,\n  author = {Schormans, John and Moore, Andrew and Gilmour, Steven and Pitts, Jonathan},\n  title  = {{Optimal design of performance measurement experiments for complex, large-scale networks (DOENET)}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Differential Measurement Analysis of PCI Interconnect Latency.\n \n \n \n\n\n \n Miller, D. J.; Watts, P. M.; and Moore, A. W.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{MillerDifferential,\n  author = {Miller, David J. and Watts, Philip M. and Moore, Andrew W.},\n  title  = {{A Differential Measurement Analysis of PCI Interconnect Latency}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Motivating NextGen Interconnects: A Differential Measurement Analysis of PCI Interconnect Latency.\n \n \n \n\n\n \n Miller, D. J.; Watts, P. M.; and Moore, A. W.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{MillerMotivating,\n  author = {Miller, David J. and Watts, Philip M. and Moore, Andrew W.},\n  title  = {{Motivating NextGen Interconnects: A Differential Measurement Analysis of PCI Interconnect Latency}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Graphical Exploration of Non-uniform Errors.\n \n \n \n\n\n \n James, L. B.; Moore, A. W.; Glick, M.; and Wonfor, A.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{JamesGraphical,\n  author = {James, Laura B. and Moore, Andrew W. and Glick, Madeleine and Wonfor, Adrian},\n  title  = {{A Graphical Exploration of Non-uniform Errors}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Analysis of latency in PCI Express and friends by differential measurement.\n \n \n \n\n\n \n Miller, D. J.; and Moore, A. W.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{MillerAnalysis,\n  author = {Miller, David J. and Moore, Andrew W.},\n  title  = {{Analysis of latency in PCI Express and friends by differential measurement}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Control and Understanding: Owning Your Home Network.\n \n \n \n\n\n \n Rotsos, C.; Moore, A. W.; Mortier, R.; Rodden, T.; Lodge, T.; McAuley, D.; Koliousis, A.; and Sventek, J.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{RotsosControl,\n  author = {Rotsos, C. and Moore, A. W. and Mortier, R. and Rodden, T. and Lodge, T. and McAuley, D. and Koliousis, A. and Sventek, J.},\n  title  = {{Control and Understanding: Owning Your Home Network}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Trojans Detection Approaches, using Mixed-Signal ICs.\n \n \n \n\n\n \n Kalogeridou, G.; Sklavos, N.; Moore, A. W.; and Koufopavlou, O.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{KalogeridouTrojans,\n  author = {Kalogeridou, Georgina and Sklavos, Nicolas and Moore, Andrew W. and Koufopavlou, Odysseas},\n  title  = {{Trojans Detection Approaches, using Mixed-Signal ICs}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n SELENA: Experimental Fidelity by Design.\n \n \n \n\n\n \n Pediaditakis, D.; Rotsos, C.; and Moore, A. W.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{PediaditakisSELENA,\n  author = {Pediaditakis, Dimosthenis and Rotsos, Charalampos and Moore, Andrew W.},\n  title  = {{SELENA: Experimental Fidelity by Design}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n .\n \n \n \n\n\n \n \n\n\n \n\n\n\n In . \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n HyNS: Simulating Hybrid Networks and Beyond.\n \n \n \n\n\n \n Manihatty-Bojan, N.; Zilberman, N.; and Moore, A. W.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{ManihattyBojanHyNS,\n  author = {Manihatty-Bojan, Neelakandan and Zilberman, Noa and Moore, Andrew W.},\n  title  = {{HyNS: Simulating Hybrid Networks and Beyond}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Forget about the storm, take your Umbrella.\n \n \n \n\n\n \n Bruyere, M.; Antichi, G.; Fernandes, E.; Uhlig, S.; Owezarski, P.; and Moore, A. W.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{BruyereForget,\n  author = {Bruyere, Marc and Antichi, Gianni and Fernandes, Eder and Uhlig, Steve and Owezarski, Philippe and Moore, Andrew W.},\n  title  = {{Forget about the storm, take your Umbrella}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Toward Improving Applications’ Performance Using Network Measurements.\n \n \n \n\n\n \n Zilberman, N.; Popescu, D. A.; and Moore, A. W.\n\n\n \n\n\n\n . .\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{ZilbermanImproving,\n  author = {Zilberman, Noa and Popescu, Diana Andreea and Moore, Andrew W.},\n  title  = {{Toward Improving Applications’ Performance Using Network Measurements}},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Emu: Rapid Prototyping of Networking Services, Library and Reproduction Environment.\n \n \n \n\n\n \n Sultana, N.; Galea, S.; Greaves, D. J.; Wojcik, M.; Shipton, J.; Clegg, R. G.; Mai, L.; Bressana, P.; Soule, R.; Mortier, R. M.; Costa, P.; Pietzuch, P.; Crowcroft, J. A.; Moore, A. W.; and Zilberman, N.\n\n\n \n\n\n\n \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Misc{SultanaEmu,\n  author   = {Sultana, N. and Galea, S. and Greaves, D. J. and Wojcik, M. and Shipton, J. and Clegg, R. G. and Mai, L. and Bressana, P. and Soule, R. and Mortier, R. M. and Costa, P. and Pietzuch, P. and Crowcroft, J. A. and Moore, A. W. and Zilberman, N.},\n  title    = {Emu: Rapid Prototyping of Networking Services, Library and Reproduction Environment},\n  abstract = {The Emu project standard library and reproduction environment, associated with "Emu: Rapid Prototyping of Networking Services" at Usenix ATC 2017},\n  keyword  = {Networks},\n}\n\n
\n
\n\n\n
\n The Emu project standard library and reproduction environment, associated with \"Emu: Rapid Prototyping of Networking Services\" at Usenix ATC 2017\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Exo: Atomic Broadcast for the Rack-Scale Computer.\n \n \n \n\n\n \n Grosvenor, M. P.; Fayed, M.; and Moore, A. W.\n\n\n \n\n\n\n In . \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{GrosvenorExo,\n  author = {Grosvenor, Matthew P. and Fayed, Marwan and Moore, Andrew W.},\n  title  = {{Exo: Atomic Broadcast for the Rack-Scale Computer}},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);