“Communication-efficient k-Means” accepted to ICDCS 2020

Hanlin’s paper on “Communication-efficient k-Means for Edge-based Machine Learning” is accepted to ICDCS’20. It continues our line of investigation on robust and efficient distributed machine learning via the approach of “sharing data summaries”. Congratulations, Hanlin!

“NFV Looking Glass” paper accepted to ToN

Yilei’s paper on “Looking Glass of NFV: Inferring the Structure and State of NFV Network from External Observations” is accepted to IEEE/ACM Transactions on Networking. Congratulations, Yilei! This is the full version of her INFOCOM’19 paper under the same title.

Proposal on SDN security funded by NSF

The project, titled “SaTC: CORE: Small: Adversarial Network Reconnaissance in Software Defined Networking“, will provide a vehicle for us to investigate various intriguing security-related questions about an SDN under insider/outsider attacks. I am working closely with Dr. Patrick McDaniel and a group of talented PhD/MS students on this project. First result coming out in INFOCOM […]

Waypoint-based Topology Inference paper accepted to ICC’20

Yilei’s third paper, Waypoint-based Topology Inference, was accepted to IEEE ICC’20! This is our third paper in a series of works on topology inference from end-to-end measurements (a.k.a. network topology tomography), targeting at next-generation networks that allow generalized (non-tree-based) forwarding. Congratulations, Yilei!

Two papers accepted to INFOCOM’20

Daniel’s paper on Stealthy DGoS Attack: DeGrading of Service under the Watch of Network Tomography  and Mingli’s paper on Flow Table Security in SDN: Adversarial Reconnaissance and Intelligent Attacks have been accepted to IEEE INFOCOM 2020! Congratulations to both of you on your first paper (with me)!

Coreset paper accepted to Globecom

Coresets are small, weighted datasets that can be used as proxies of the original dataset in performing machine learning tasks. While previous coreset construction algorithms are tailor-made for specific machine learning tasks, we proved that k-clustering based coreset provides guaranteed performance for all machine learning tasks with sufficiently continuous cost functions. This is the first […]

Dynamic Service Placement paper accepted to TON

Our first work on using Markov Decision Process (MDP) to model dynamic service placement in mobile edge computing systems was finally accepted to IEEE/ACM Trans. Networking! The work was done in 2015, when Dr. Shiqiang Wang was still Mr. Shiqiang Wang and an intern at IBM. I am debating whether the lesson is to be […]

Powered by WordPress. Designed by WooThemes

Skip to toolbar