Carey Williamson

Carey Williamson

Positions

Contact information

Web presence

Background

Educational Background

Doctor of Philosophy Computer Science, Stanford University, 1992

B.S. Computer Science, University of Saskatchewan, 1985

Research

Areas of Research

Network performance, Internet protocols, Wireless networks, Network simulation

Awards

  • Award Nominee, Faculty of Science.
  • Keynote Speaker, SCS SPECTS 2017 Conference. 2017
  • U Make a Difference, 2014
  • Best Paper Award, 2012
  • Outstanding Achievement in Supervision Award, 2005

Publications

  • DYNABYTE: A Dynamic Sampling Algorithm for Redundant Content Detection. (2011)
  • A Campus-Level View of Outlook Email Traffic. (2018)
  • DYNABYTE: A Dynamic Sampling Algorithm for Redundant Content Detection. (2011)
  • An Application-level Solution to the TCP-incast Problem in Data Center Networks. (2011)
  • Modeling, Analysis, and Characterization of Periodic Network Traffic. 170-182. (2018)
  • Control and Optimization of the SRPT Service Policy by Frequency Scaling. 18 pp.. (2018)
  • On Saturation Effects in Coupled Speed Scaling. 21 pp.. (2018)
  • Why is my LMS so slow? A Case Study of D2L Performance Issues. 34-39. (2018)
  • Exploring Growing Information Spaces. (2011)
  • Experimental Evaluation of Two OpenFlow Controllers. (2017)
  • Experimental Evaluation of Asymmetric QoS in IEEE 802.11g Wireless Networks. (2011)
  • A Campus-Level View of Netflix and Twitch: Characterization and Performance Implications. 1-8. (2017)
  • Fluid Views: A Zoomable Search Interface. 233-240. (2012)
  • Simulation Modeling for Speed Scaling Designs. 1-8. (2016)
  • Delta-Graphs: Flexible Topology Control in Wireless Ad Hoc Networks. (2012)
  • Passive Crowd-based Monitoring of World Wide Web Infrastructure and Its Performance. (2012)
  • On the Performance of Redundant Traffic Elimination in WLANs. (2012)
  • Solving the TCP-incast Problem with Application-Level Scheduling. 96-106. (2012)
  • Barrier Counting in Mixed Wireless Sensor Networks. 359-368. (2012)
  • Buddy Routing: A Routing Paradigm for NanoNets based on Physical Layer Network Coding. (2012)
  • Content Sharing Dynamics in the Global File Hosting Landscape. 219-228. (2012)
  • Decoupled Speed Scaling: Analysis and Evaluation. (2012)
  • An Application-level Solution to the TCP-incast Problem in Data Center Networks. (2011)
  • The Edge of Smartness. (2011)
  • The Edge of Smartness. (2011)
  • The Information Flaneur: A Fresh Look at Information Seeking. (2011)
  • The Information Flaneur: A Fresh Look at Information Seeking. (2011)
  • EdgeMaps: Visualizing Explicit and Implicit Relations. (2011)
  • EdgeMaps: Visualizing Explicit and Implicit Relations. (2011)
  • On Zipf Models for Probabilistic Piece Selection in On-Demand Stored Media Streaming. 10. (2013)
  • Turbo-charged Speed Scaling: Analysis and Evaluation. 41-50. (2014)
  • Deduping the Internet: An Email Case Study. 1345-1350. (2015)
  • Workload Analysis of a Media-rich Educational Web Site. (2016)
  • A Simulator for Distributed Cache Management in Friend-to-Friend Networks. (2016)
  • Experimental Calibration and Validation of a Speed Scaling Simulator. 105-114. (2016)
  • Autoscaling Effects in Dynamic Speed Scaling Systems. 307-312. (2016)
  • Delta-Graphs: Flexible Topology Control in Wireless Ad Hoc Networks. 75. (2011)
  • A Campus-Level View of Netflix and Twitch: Characterization and Performance Implications. Martin Arlitt; Carey L Williamson; Michel Laterman. Proceedings of SCS (Society for Computer Simulation) Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS), Seattle, WA, USA, 8 pages, July 2017. (<b>C</b>). (2017)
  • Experimental Evaluation of Two OpenFlow Controllers. Carey L Williamson; Israat Haque; Mohamad Darianian. Proceedings of Workshop on Performance Evaluation of Software-Defined Networks (PVE-SDN), Toronto, ON, Canada, 8 pages, October 2017. (<b>unranked</b>). (2017)
  • Why is my LMS so slow? A Case Study of D2L Performance issues. Sourish Roy; Carey L Williamson. Proceedings of ISCA (International Society for Computers and their Applications) Conference on Computers and Their Applications (CATA), Las Vegas, NV, USA, 8 pages, March 2018. (<b>C</b>). (2018)
  • Control and Optimization of the SRPT Service Policy by Frequency Scaling. Isi Mitrani; Maryam Elahi; Carey L Williamson; Andrea Marin. Proceedings of Quantitative Evaluation of SysTems (QEST), Beijing, China, 16 pages (A4 format), September 2018. (<b>B</b>). (2018)
  • On Saturation Effects in Coupled Speed Scaling. Maryam Elahi; Carey L Williamson. Proceedings of Quantitative Evaluation of SysTems (QEST), Beijing, China, 16 pages (A4 format), September 2018. (<b>B</b>). (2018)
  • Modeling, Analysis, and Characterization of Periodic Network Traffic. Mackenzie Haffey; Martin Arlitt; Carey L Williamson. Proceedings of IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), 12 pages, September 2018. (<b>A/B</b>). (2018)
  • A Campus-Level View of Outlook Email Traffic. Carey L Williamson; Zhengping Zhang. Proceedings of 7th International Conference on Network, Communication, and Computing (ICNCC), Taipei, Taiwan, 8 pages, December 2018. (<b>unranked</b>). (2018)
  • Fair and Efficient Dynamic Bandwidth Allocation Using OpenFlow. 36-37. (2020)
  • An Empirical Measurement Study of Free Live Streaming Services. 16 pages. (2020)
  • Measurement and Modeling of Tumblr Network Traffic. 16 pages. (2020)
  • Traffic Characterization of Instant Messaging Applications: A Campus-Level View. 8 pages. (2020)
  • Speed Scaling in Fork-Join Queues: A Comparative Study. 11 pp.. (2020)
  • MoVIE: A Measurement Tool for Mobile Video Streaming on Smartphones. 230-237. (2020)
  • Characterization of IMAPS Email Traffic. 214-220. (2020)
  • Campus-Level Instagram Traffic: A Case Study. 228-234. (2019)
  • On Capacity Maximization in Wireless Relay Networks. 76. (2011)
  • Physical-Layer Network Coding with Signal Alignment for MIMO Wireless Networks. (2011)
  • Exploiting Routing Tree Construction in CTP. 256-270. (2011)
  • Exploiting Routing Tree Construction in CTP. 256-270. (2011)