Author
This is a blog/website for our Time-Critical Clouds (TCC) project. More details are avaiable in the Mission and Publications pages. You can also visit the TCC project blog at SICS.
Author
Our TNSM 2022 journal article is the final publication funded by this project. The full title is “Machine Learning at the Mobile Edge: The Case of Dynamic Adaptive Streaming over HTTP (DASH)”. This is joint work done in collaboration with FBK between Rasoul Behravesh (FBK), Akhila Rao (RISE), Daniel F Perez-Ramirez (RISE), Davit Harutyunyan (Corporate Research, Robert Bosch GmbH, work done at FBK), Roberto Riggio (Universita Politecnica delle Marche, work done at FBK), and Magnus Boman (KTH).
Here is the abstract and a link to the paper. The code and dataset links are in the Releases page.
“Dynamic Adaptive Streaming over HTTP (DASH) is a standard for delivering video in segments and adapting each segment’s bitrate (quality), to adjust to changing and limited network bandwidth. We study segment prefetching, informed by machine learning predictions of bitrates of client segment requests, implemented at the network edge. We formulate this client segment request prediction problem as a supervised learning problem of predicting the bitrate of a client’s next segment request, in order to prefetch it at the mobile edge, with the objective of jointly improving the video streaming experience for the users and network bandwidth utilization for the service provider. The results of extensive evaluations showed a segment request prediction accuracy of close to 90% and reduced video segment access delay with a cache hit ratio of 58%, and reduced transport network load by lowering the backhaul link utilization by 60.91%.”
Link to the paper: https://ieeexplore.ieee.org/document/9841468
Author
Congratulations on Alexandros for defending his licentiate thesis titled “Understanding the Capabilities of Route Collectors to Observe Stealthy Hijacks”! The supervisors are Marco Chiesa and Dejan Kostic. Thanks to the advanced reviewer Prof. Gerald Q. Maguire Jr., the special reviewer Prof. Alberto Dainotti, and the examiner Prof. Roberto Guanciale for their thorough work.
You can find more about Alexandros’ work by reading this thesis here.
Author
Author
ASPLOS ’21 will feature Alireza’s presentation of our paper titled “PacketMill: Toward Per-Core 100-Gbps Networking”. This is joint work with Alireza Farshin, Tom Barbette, Amir Roozbeh, Gerald Q. Maguire Jr., and Dejan Kostić.
The full abstract (with the video and more resources below):
We present PacketMill , a system for optimizing software packet processing, which (i) introduces a new model to effjciently manage packet metadata and (ii) employs code-optimization techniques to better utilize commodity hardware. PacketMill grinds the whole packet processing stack, from the high-level network function confjguration fjle to the low-level userspace network (specifjcally DPDK) drivers, to mitigate ineffjciencies and produce a customized binary for a given network function. Our evaluation results show that PacketMill increases throughput (up to 36.4Gbps – 70%) & reduces latency (up to 101µs – 28%) and enables nontrivial packet processing (e.g., router) at ≈100Gbps , when new packets arrive > 10 × faster than main memory access times, while using only one processing core
PacketMill Webpage: https://packetmill.io/
PacketMill Paper: https://packetmill.io/docs/packetmill-asplos21.pdf
PacketMill source code: https://github.com/aliireza/packetmill
PacketMill Slides with English transcripts: https://people.kth.se/~farshin/documents/packetmill-asplos21-slides.pdf
Author
Effective use of networked resources requires the ability to solve complex large-scale optimization problems fast while accounting for many input variables and performance requirements, such as end-to-end latency. Advancing beyond heuristic approaches, we begin with surveying the current state of applied machine learning to solve complex combinatorial optimization problems over networks. In our IEEE Access article titled “Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networking”, we qualitatively analyse existing learning approaches and applications in the networking domain. Full abstract is as follows:
“Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer science, such as computational complexity, then needs to be addressed. Relevant developments in machine learning research on graphs are surveyed for this purpose. We organize and compare the structures involved with learning to solve combinatorial optimization problems, with a special eye on the telecommunications domain and its continuous development of live and research networks.”
This work was done by Natalia Vesselinova (RISE), Rebecca Steinert (RISE), Daniel Felipe Perez-Ramirez (RISE) and Magnus Boman (KTH).
