EAI - Reinventing the governance and economy of research and innovation
The leading professional community for research career enhancement in the digital age

Keynotes

Johan van Leeuwaarden

Title: Load balancing algorithms

Abstract:

Cloud systems crucially depend on how imbalanced data can be smoothened. Load balancing algorithms (LBAs) dispatch jobs to one of N servers. Designing fast LBAs with good delay-communication tradeoffs is challenging, particularly for large N. Using coupling techniques, mean-field and diffusion limits we present universality classes of LBAs that achieve (almost) full resource pooling with minimal communication. We discuss algorithms that probe d(N) servers, Join-the-Idle Queue (JIQ) algorithms, and algorithms that operate on networks. Some results and many open problems.

Bio:

Johan van Leeuwaarden (1978) is professor of Mathematics at Eindhoven University of Technology. He chairs the group Stochastic Networks and investigates phenomena arising in complex networks, such as communication networks, social networks and biological networks. Johan received an ERC Starting Grant (2010) and the Erlang Prize (2012) for his contributions to applied probability. In 2014 he co-founded the 10-year multidisciplinary research program NETWORKS, funded by the Dutch Government (www.thenetworkcenter.nl). Johan is member of the Young Academy (part of The Royal Netherlands Academy of Arts and Sciences), a group of scientists with outspoken views and the ambition to popularize science. Johan promotes the role of mathematics and data in the networked society.

 

Debankur Mukherjee

Title: Load balancing algorithms

Abstract:

Cloud systems crucially depend on how imbalanced data can be smoothened. Load balancing algorithms (LBAs) dispatch jobs to one of N servers. Designing fast LBAs with good delay-communication tradeoffs is challenging, particularly for large N. Using coupling techniques, mean-field and diffusion limits we present universality classes of LBAs that achieve (almost) full resource pooling with minimal communication. We discuss algorithms that probe d(N) servers, Join-the-Idle Queue (JIQ) algorithms, and algorithms that operate on networks. Some results and many open problems.

Bio:

Debankur Mukherjee is currently a doctoral candidate at Eindhoven University of Technology, The Netherlands, working under the supervision of Professor Sem Borst and Professor Johan van Leeuwaarden. Before joining the doctoral program, Mukherjee obtained a masters degree from the Indian Statistical Institute, Kolkata, with mathematical statistics and probability specialization.

Mukherjee’s primary research spans the areas of probability theory and stochastic networks, at the interface of stochastic theory and computer science, with applications in queueing theory, stochastic modeling, performance analysis, random graphs, and randomized algorithms. His major contributions towards the field of load balancing and scheduling in large-scale stochastic networks include developing novel coupling techniques and establishing non-classical stochastic process limit theorems to study the delay-communication-energy trade-off in large networks viz. data centers and cloud networks. He also introduced a stochastic comparison framework to study mean-field limits of processes on networks and examined the impact of the network topology on the performance of load balancing schemes in large-scale systems.

 

Alessandro Panconesi

Title: The limits of recommendations, and the role of social ties

Abstract:

The internet has become one of the main platforms for buying and selling cultural items. Songs, movies, books, sport events and much more can now be acquired and enjoyed via the internet. In this context, recommender systems play a crucial role, for increasingly they are becoming the main cognitive gateway between people and products.

A fundamental and fascinating question arises naturally: to what extent can a recommender system alter a market in which it is operating?

We present some research inspired by this question. First, we discuss a mathematical model of a market in which a recommender system is operating, with the aim of predicting what will happen to such a market in the long run. Second, we present a couple of user studies of the types of user-feedback commonly deployed online, whose outcome is somewhat surprising.

Joint work with Marzia Antenore, Marco Bressan, Giovanna Leone, Stefano Leucci, Prabhakar Raghavan, and Erisa Terolli

Bio:

Alessandro Panconesi obtained a “Laurea” degree in Mathematics from Sapienza, University of Rome. Subsequently, he was awarded a Ph.D. degree in Computer Science from Cornell University.
In 1992 he received the ACM Danny Lewin award for his research on algorithms. He has been the recipient of faculty awards by Google, IBM, and Yahoo! More recently, he has been awarded a Google Focused Grant. He is a Fellow of the Alexander von Humboldt foundation and is also an editor of the Journal of Discrete Algorithms. He is Director of BiCi, the Bertinoro International Center for Informatics.
EAI Institutional Members