Bio-inspired algorithms for decentralized round-robin and proportional fair scheduling


In recent years, several models introduced in mathematical biology and natural science have been used as the foundation of networking algorithms. These bio-inspired algorithms often solve complex problems by means of simple and local interactions of individuals. In this work, we consider the development of decentralized scheduling in a small network of self-organizing devices using the model of pulse-coupled oscillators (PCO). Firstly, by following Peskin’s PCO model with inhibitory coupling, we show that round-robin scheduling can be achieved with weak convergence, i.e., the nodes transmission times remain separated by a constant of equal amount, but their clocks continue to drift at unison. Then, we introduce two ways to achieve strict desynchronization: one by restricting the pulse coupling to only a subset of neighboring nodes and the other by imposing a more deliberate coupling rule where a node’s pulsing time is only affected by its immediate neighbors. More interestingly, by having each node maintaining two local clocks, we show that it is possible to achieve a proportional fair schedule in a decentralized way. The convergence of these algorithms is studied both analytically and numerically.

DOI: 10.1109/JSAC.2010.100506

Extracted Key Phrases

10 Figures and Tables


Citations per Year

68 Citations

Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Pagliari2010BioinspiredAF, title={Bio-inspired algorithms for decentralized round-robin and proportional fair scheduling}, author={Roberto Pagliari and Yao-Win Peter Hong and Anna Scaglione}, journal={IEEE Journal on Selected Areas in Communications}, year={2010}, volume={28}, pages={564-575} }