COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Computer Laboratory Wednesday Seminars > Randomised Load Balancing For Networks

## Randomised Load Balancing For NetworksAdd to your list(s) Download to your calendar using vCal - Thomas Sauerwald - University of Cambridge, Computer Laboratory
- Wednesday 29 January 2014, 14:00-15:00
- Lecture Theatre 1, Computer Laboratory.
If you have a question about this talk, please contact David Greaves. We consider the problem of balancing load items (tokens) on networks. Starting with an arbitrary load distribution, we allow in each round nodes to exchange tokens with their neighbours. The goal is to obtain a load distribution where all nodes have the same number of tokens. For the continuous case where tokens are arbitrarily divisible, most load balancing schemes correspond to Markov chains whose convergence is fairly well-understood. However, in many applications load items cannot be divided arbitrarily often and we need to deal with the discrete case where load is composed of indivisible tokens. In this talk we investigate a natural randomised protocol and demonstrate that there is almost no difference between the discrete and continuous case. Specifically we show that for any regular network all nodes have the same number of tokens up to an additive constant in the same number of rounds as in the continuous case. This talk is part of the Computer Laboratory Wednesday Seminars series. ## This talk is included in these lists:- All Talks (aka the CURE list)
- Computer Laboratory Wednesday Seminars
- Computer Laboratory talks
- Guy Emerson's list
- Lecture Theatre 1, Computer Laboratory
- School of Technology
- computer science
Note that ex-directory lists are not shown. |
## Other listsWolfson College talks Cambridge University Railway Club Euroscicon## Other talksGiant response of weakly driven systems Malaria’s Time Keeping New micro-machines, new materials Neural Networks and Natural Language Processing Bayesian optimal design for Gaussian process model 'Alas, poor Yorick!': Laurence Sterne's "A Sentimental Journey" after 250 years' |