Roch Guerin

Roch Guerin

Harold B. and Adelaide G. Welge Professor, Washington University in St. Louis

Posts by Collection

background

conferences

Choice-based pricing for user-provided connectivity

Published:

This paper proposes a pricing policy that seeks to realize an effective compromise between pricing complexity and maximizing system profit in a setting where users contribute resources towards building overall network connectivity

Recommended citation: M.H. Afrasiabi and R. Guerin, "Choice-based pricing for user-provided connectivity." Proc. NetEcon 2015, Portland, OR, June 2015 http://dl.acm.org/authorize?N20954

Why didnt my (great!) protocol get adopted?

Published:

This paper applies statistical analysis to features of Internet protocols to identify those most likely to contribute to their success or failure

Recommended citation: M. Nikkhah, C. Dovrolis, and R. Guerin, "Why didnt my (great!) protocol get adopted?" Proc. ACM HotNets, Philadelphia, PA, November 2015 http://dl.acm.org/authorize?N20965

Multipath and Rate Stability

Published:

This paper explores if and when the use of multipath solutions leads to more stable end-to-end transmission rates

Recommended citation: J. Liu and R. Guerin, "Multipath and Rate Stability." Proc. IEEE Globecom 2016 - CQRM: Communication QoS, Reliability & Modeling Symposium, Washington, D.C., December 2016 https://openscholarship.wustl.edu/cse_research/1166/

Minimizing network bandwidth under latency constraints: The single node case

Published:

This paper explores the trade-off between scheduler complexity and the amount of bandwidth required to meet latency constraints in a single node setting

Recommended citation: J. Song, R. Guerin, and H. Sariowan, "Minimizing network bandwidth under latency constraints: The single node case." Proc. 2021 International Teletraffic Congress (ITC 33), Avignon, France, August 2021 https://ieeexplore.ieee.org/document/9625625

Impact of Distributed Rate Limiting on Load Distribution in a Latency-sensitive Messaging Service

Published:

This paper investigates the trade-off between the better response time that load balancing affords from accessing more resources and the resulting increase in access delays when the resulting rate control function is also distributed

Recommended citation: C. Li, J. Liu, C. Lu, R. Guerin, and C.D. Gill, "Impact of Distributed Rate Limiting on Load Distribution in a Latency-sensitive Messaging Service." Proc. IEEE CLOUD 2021, online virtual congress https://arxiv.org/abs/2101.05865

Real-Time Edge Classification: Optimal Offloading under Token Bucket Constraints

Published:

This paper designs and validates efficient policies for distributing classification decisions between local devices and more powerful and accurate edge servers

Recommended citation: A. Chakrabarti, R. Guerin, C. Lu, and J. Liu, "Real-Time Edge Classification: Optimal Offloading under Token Bucket Constraints." Proc. The Sixth ACM/IEEE Symposium on Edge Computing (SEC), December 2021, San Jose CA https://arxiv.org/abs/2010.13737

Adaptive Edge Offloading for Image Classification Under Rate Limit

Published:

The paper investigates an edge computing scenario where weak and strong image classifiers located in local devices and an edge server, respectively, collaborate to make the most accurate image classification decisions possible, under the constraint that the number of images that can be offloaded to the strong classifier in the edge server is rate limited using a token bucket mechanism. The paper relies on a reinforcement learning approach to realize a simple policy that maximizes classification accuracy under general image arrival patterns and arbitrary sequences of classification decisions. The code for the system described in the paper is available on GitHub and an extended version of the EMSOFT paper is accessible on arXiv here

Recommended citation: J. Qiu, R. Wang, A. Chakrabarti, R. Guerin, and C. Lu, "Adaptive Edge Offloading for Image Classification Under Rate Limit." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022. The paper was presented at the ACM International Conference on Embedded Software (EMSOFT), October 2022, Hybrid+Shanghai+Phoenix. https://doi.org/10.1109/TCAD.2022.3197533

Progressive Neural Compression for Adaptive Image Offloading Under Timing Constraints

Published:

The paper leverages stochastic taildrop to train a rateless encoder that prioritizes transmissions of features of greater importance for inference tasks, e.g., classification. This ensures robust performance even in the presence of severe bandwidth fluctuations.

Recommended citation: R. Wang, H. Liu, J. Qiu, M. Xu, R. Guerin, and C. Lu, "Progressive Neural Compression for Adaptive Image Offloading Under Timing Constraints." 2023 IEEE Real-Time Systems Symposium (RTSS), December 2023, Taipei, Taiwan https://doi.ieeecomputersociety.org/10.1109/RTSS59052.2023.00020

journals

Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks

Published:

This paper introduced the concept of equivalent capacity or bandwidth and explored its use for call admission in packet networks

Recommended citation: R. Guerin, H. Ahmadi, and M. Naghshineh, "Equivalent Bandwidth and Its Application to Bandwidth Allocation in High-Speed Networks." IEEE Journal on Selected Areas in Communications, Vol. 9, No. 7, September 1991 https://repository.upenn.edu/ese_papers/107/

On Protective Buffer Policies

Published:

This paper investigates different buffer management policies for protecting flows from each other in packet networks

Recommended citation: I. Cidon, R. Guerin, and A. Khamisy, "On Protective Buffer Policies." IEEE/ACM Transactions on Networking, Vol. 2, No. 3, June 1994 http://dl.acm.org/authorize?N22596

Computing Shortest Paths for Any Number of Hops

Published:

This paper explores algorithms for computing shortest paths under the added constraint that they also need to satisfy a hop count constraint

Recommended citation: R. Guerin and A. Orda, "Computing Shortest Paths for Any Number of Hops." IEEE/ACM Transactions on Networking, Vol. 10, No. 5, October 2002 http://dl.acm.org/authorize?N22581

Can Bluetooth Succeed as a Large-Scale Ad Hoc Networking Technology?

Published:

This paper explored the extent to which the limitations of the Bluetooth protocol might prevent it from widespread use as a networking vs. link technology

Recommended citation: E. Vergetis, R. Guerin and S. Sarkar, "Can Bluetooth Succeed as a Large-Scale Ad Hoc Networking Technology?" IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Ad-Hoc Networks, Vol. 23, No. 5, March, 2005 https://repository.upenn.edu/ese_papers/75/

Always Acyclic Distributed Path Computation

Published:

This paper formulates an algorithm that guarantees that cycles are never creating during distributed path computations

Recommended citation: S. Ray, R. Guerin, K.-W. Kwong, and R. Sofia, "Always Acyclic Distributed Path Computation." IEEE/ACM Transactions on Networking, Vol. 18, No. 1, February 2010 http://dl.acm.org/authorize?N22586

Modeling the Dynamics of Network Technology Adoption and the Role of Converters

Published:

This paper investigates the adoption dynamics of competing and incompatible technologies, when converters are present that allow them to inter-operate

Recommended citation: Soumya Sen, Youngmi Jin, Roch Guerin, and Kartik Hosanagar, "Modeling the Dynamics of Network Technology Adoption and the Role of Converters." IEEE/ACM Transactions on Networking, Vol. 18, No. 6, December 2010 http://dl.acm.org/authorize?N22585

On the Feasibility and Efficacy of Protection Routing in IP Networks

Published:

This paper develops routing solutions that offer efficient backup protection in case of single link or node failures. The conference version of the paper received the IEEE 2010 INFOCOM Best Paper Award

Recommended citation: K.-W. Kwong, L. Gao, R. Guerin, and Z.-L. Zhang, "On the Feasibility and Efficacy of Protection Routing in IP Networks." IEEE/ACM Transactions on Networking, Vol. 19, No. 5, October 2011 http://dl.acm.org/authorize?N22573

Adoption of Bundled Services With Network Externalities and Correlated Affinities

Published:

This paper explores when bundling services can be of benefit when the value of the services are correlated and exhibit externalities

Recommended citation: R. Guerin, J. C. de Oliveira, and S. Weber, "Adoption of Bundled Services With Network Externalities and Correlated Affinities." Special issue of the ACM Transactions on Internet Technologies on Pricing and Incentives in Networks and Systems, Vol. 14, No. 2-3, October 2014 http://dl.acm.org/authorize?N83254

Exploring User-Provided Connectivity

Published:

This paper explores pricing and incentives to entice users to contribute their resources in lieu of acquiring infrastructure towards building network connectivity

Recommended citation: M. H. Afrasiabi and R. Guerin, "Exploring User-Provided Connectivity." IEEE/ACM Transactions on Networking, Vol. 24, No. 1, February 2016 http://dl.acm.org/authorize?N21662

Shared or Dedicated Infrastructures: On the Impact of Reprovisioning Ability

Published:

This paper explores how the ability to quickly reprovision resources affect whether shared or dedicated (for a given service/application) infrastuctures are more efficient

Recommended citation: Roch Guerin, Kartik Hosanagar, Xinxin Li, and Soumya Sen, "Shared or Dedicated Infrastructures: On the Impact of Reprovisioning Ability." MIS Quarterly, Vol. 43, No. 4, December 2019 https://misq.org/shared-or-dedicated-infrastructures-on-the-impact-of-reprovisioning-ability.html

Adaptive Edge Offloading for Image Classification Under Rate Limit

Published:

The paper investigates an edge computing scenario where weak and strong image classifiers located in local devices and an edge server, respectively, collaborate to make the most accurate image classification decisions possible, under the constraint that the number of images that can be offloaded to the strong classifier in the edge server is rate limited using a token bucket mechanism. The paper relies on a reinforcement learning approach to realize a simple policy that maximizes classification accuracy under general image arrival patterns and arbitrary sequences of classification decisions. The code for the system described in the paper is available on GitHub and an extended version of the EMSOFT paper is accessible on arXiv here

Recommended citation: J. Qiu, R. Wang, A. Chakrabarti, R. Guerin, and C. Lu, "Adaptive Edge Offloading for Image Classification Under Rate Limit." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 41, No.11, November 2022. The paper was presented at the ACM International Conference on Embedded Software (EMSOFT), October 2022, Hybrid+Shanghai+Phoenix. https://doi.org/10.1109/TCAD.2022.3197533

On the Benefits of Traffic `Reprofiling’ The Single Hop Case

Published:

The paper investigates the potential benefits of proactively changing user-specified traffic profiles, potentially incurring a reprofiling delay, to help a scheduler provide hard delay bounds to flows with less bandwidth. While reprofiling is of no benefit with an optimal EDF scheduler, the paper demonstrates that reprofiling can allow simple static priority and FIFO schedulers to significantly improve their performance, in some cases closely matching that of an EDF scheduler.

Recommended citation: J. Song, J. Qiu, R. Guerin, and H. Sariowan, "On the Benefits of Traffic `Reprofiling’ The Single Hop Case." IEEE/ACM Transactions on Networking (ToN), Vol. 32, No. 3, June 2024 https://doi.org/10.1109/TNET.2024.3356863

On the Benefits of Traffic `Reprofiling’ - The Multiple Hops Case – Part I

Published:

The paper investigates the potential benefits of proactively changing user-specified traffic profiles, potentially incurring an added (ingress) reprofiling delay, to help a network offer hard delay bounds with less bandwidth. The paper demonstrates that, while in the single hop case reprofiling is of no benefit when using an optimal EDF scheduler, this is not so in the multiple hops setting. This is because, while reprofiling imposes an added delay, it makes flows smoother, and when those benefits accrue over multiple hops, they can yield a more efficient solution. The paper illustrates the existence of this trade-off and develops an approach for devising near optimal reprofiling solutions.

Recommended citation: J. Qiu, J. Song, R. Guerin, and H. Sariowan, "On the Benefits of Traffic `Reprofiling’ - The Multiple Hops Case -- Part I." IEEE/ACM Transactions on Networking (ToN), Vol. 32, No. 4, Aug. 2024 https://doi.org/10.1109/TNET.2024.3392030

news

old-project

portfolio

Edge Computing

Published:

This is a recent and still evolving project exploring various problems that arise when deploying edge computing solutions

talks

To Overlay Or Not To Overlay?

Published:

Presentation at the NGN’2001 panel: The Internet at a Crossroads - Controlled IP or Overlay Networks?

What Is Network Science?

Published:

Panel presentation on Network Science at the ACM CoNEXT 2008 Conference

teaching

Other WashU Courses

Undergraduate course, Washington University in St. Louis, Dept. Computer Science and Engineering, 2019

CSE 473S: Introduction to Computer Networks

Fall 2024 teaching

Graduate course, Washington University in St. Louis, Dept. Computer Science and Engineering, 2024

CSE 538T: Modeling and Performance Evaluation of Computer Systems