• Publications
  • Influence
Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks
The efficiency of MSDA against state-of-the-art methods for two problems: least-squares regression and classification by logistic regression is verified.
Impact of fairness on Internet performance
It is proved that for a broad class of fair bandwidth allocations, the total number of flows in progress remains finite if the load of every link is less than one.
We address the problem of the convergence to equilibrium of a general class of point processes, containing, in particular, the nonlinear mutually exciting point processes, an extension of the linear
The effect of network topology on the spread of epidemics
This paper identifies topological properties of the graph that determine the persistence of epidemics and shows that if the ratio of cure to infection rates is larger than the spectral radius of thegraph, then the mean epidemic lifetime is of order log n, where n is the number of nodes.
Bandwidth sharing and admission control for elastic traffic
This work considers the performance of a network like the Internet handling so‐called elastic traffic where the rate of flows adjusts to fill available bandwidth and finds that weighted sharing has limited impact on perceived quality of service and discrimination in favour of short documents leads to considerably better performance than fair sharing.
Community detection thresholds and the weak Ramanujan property
This work proves that for logarithmic length ℓ, the leading eigenvectors of this modified matrix B provide a non-trivial reconstruction of the underlying structure, thereby settling the conjecture of a sharp threshold on model parameters for community detection in sparse random graphs drawn from the stochastic block model.
Peer-to-Peer Membership Management for Gossip-Based Protocols
This paper presents SCAMP (Scalable Membership protocol), a novel peer-to-peer membership protocol which operates in a fully decentralized manner and provides each member with a partial view of the group membership and proposes additional mechanisms to achieve balanced view sizes even with highly unbalanced subscription patterns.
Bandwidth sharing: objectives and algorithms
It is proved that fixed-size window control can achieve fair bandwidth sharing according to any of these criteria, provided scheduling at each link is performed in an appropriate manner.
Probabilistic Reliable Dissemination in Large-Scale Systems
This paper provides a theoretical analysis of gossip-based protocols which relates their reliability to key system parameters (the system size, failure rates, and number of gossip targets) and shows how reliability can be maintained while alleviating drawback.
Greening the internet with nano data centers
An energy consumption model for VoD in traditional and in NaDa data centers is developed and it is found that even under the most pessimistic scenarios, NaDa saves at least 20% to 30% of the energy compared to traditional data centers.