Stability and bounds in aggregate scheduling networks

Related publications (29)

Page 3 of 3

About
Privacy
Disclaimer

Graph Chatbot

A Measure of Dynamical Efficiency for Multimodal Interconnected Urban Systems

Nikolaos Geroliminis, Leonardo Bellocchi

Complex network theory describes network performance mostly based on topological characteristics, like betweenness centrality. This work integrates concepts from complex networks and traffic engineering. We propose a new measure for spatial networks and, i ...

2020

Local Vulnerabilities and Global Robustness of Coupled Dynamical Systems on Complex Networks

Melvyn Sandy Tyloo

Coupled dynamical systems are omnipresent in everyday life. In general, interactions between individual elements composing the system are captured by complex networks. The latter greatly impact the way coupled systems are functioning and evolving in time. ...

EPFL2020

Destination buffer analysis for packets rejection obliteration in multi-channel networks

Georgia Fragkouli

In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronou ...

2019

Retroactive Packet Sampling for Traffic Receipts

Pavlos Nikolopoulos, Adrian Perrig, Christos Pappas

Is it possible to design a packet-sampling algorithm that prevents the network node that performs the sampling from treating the sampled packets preferentially? We study this problem in the context of designing a "network transparency" system. In this syst ...

ACM2019

Global robustness versus local vulnerabilities in complex synchronous networks

Philippe René Joseph Jacquod

In complex network-coupled dynamical systems, two questions of central importance are how to identify the most vulnerable components and how to devise a network making the overall system more robust to external perturbations. To address these two questions ...

2019

The key player problem in complex oscillator networks and electric power grids: Resistance centralities identify local vulnerabilities

Philippe René Joseph Jacquod, Melvyn Sandy Tyloo

Identifying key players in coupled individual systems is a fundamental problem in network theory. We investigate synchronizable network-coupled dynamical systems such as high-voltage electric power grids and coupled oscillators on complex networks. We defi ...

2019

Mitigating Load Imbalance in Distributed Data Serving with Rack-Scale Memory Pooling

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic, Dmitrii Ustiugov

To provide low-latency and high-throughput guarantees, most large key-value stores keep the data in the memory of many servers. Despite the natural parallelism across lookups, the load imbalance, introduced by heavy skew in the popularity distribution of k ...

2019

Unsupervised Robust Nonparametric Learning Of Hidden Community Properties

Martin Jaggi, Akhilesh Deepak Gotmare, Mikhail Langovoy

We consider learning of fundamental properties of communities in large noisy networks, in the prototypical situation where the nodes or users are split into two classes according to a binary property, e.g., according to their opinions or preferences on a t ...

2019

Brain networks and their relevance for stroke rehabilitation

Friedhelm Christoph Hummel, Philipp Johannes Koch

Stroke has long been regarded as focal disease with circumscribed damage leading to neurological deficits. However, advances in methods for assessing the human brain and in statistics have enabled new tools for the examination of the consequences of stroke ...

2019

Page 3 of 3

The key player problem in complex oscillator networks and electric power grids: Resistance centralities identify local vulnerabilities

Philippe René Joseph Jacquod, Melvyn Sandy Tyloo

2019