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

Roberto Pagliari, Y. W Peter Hong, Anna Scaglione

Research output: Contribution to journalArticle

48 Citations (Scopus)

Abstract

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 that are modeled as pulse-coupled oscillators (PCOs). By appropriately designing the dynamics of the PCO, the network of devices can converge to a desynchronous state where the nodes naturally separate their transmissions in time. Specifically, by following Peskin's PCO model with inhibitory coupling, we first show that round-robin scheduling can be achieved with weak convergence, where the nodes' transmissions are separated by a constant duration, but the differences of their local clocks continue to shift over time. Then, by having each node accept coupling only from the pulses emitted by a subset of neighboring nodes, we show that it is possible to achieve strict desynchronization, where the difference between local clocks remain fixed over time. More interestingly, by having each node maintain two local clocks, we show that it is possible to further achieve proportional fair scheduling, where the time alloted to each node is proportional to their demands. The convergence of these algorithms is studied both analytically and numerically.

Original languageEnglish (US)
Article number5452950
Pages (from-to)564-575
Number of pages12
JournalIEEE Journal on Selected Areas in Communications
Volume28
Issue number4
DOIs
StatePublished - May 2010
Externally publishedYes

Fingerprint

Clocks
Scheduling
Natural sciences

Keywords

  • Consensus
  • PCO
  • Scheduling
  • Wireless sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Bio-inspired algorithms for decentralized round-robin and proportional fair scheduling. / Pagliari, Roberto; Hong, Y. W Peter; Scaglione, Anna.

In: IEEE Journal on Selected Areas in Communications, Vol. 28, No. 4, 5452950, 05.2010, p. 564-575.

Research output: Contribution to journalArticle

@article{018be8f78554422f87ed482421acdde9,
title = "Bio-inspired algorithms for decentralized round-robin and proportional fair scheduling",
abstract = "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 that are modeled as pulse-coupled oscillators (PCOs). By appropriately designing the dynamics of the PCO, the network of devices can converge to a desynchronous state where the nodes naturally separate their transmissions in time. Specifically, by following Peskin's PCO model with inhibitory coupling, we first show that round-robin scheduling can be achieved with weak convergence, where the nodes' transmissions are separated by a constant duration, but the differences of their local clocks continue to shift over time. Then, by having each node accept coupling only from the pulses emitted by a subset of neighboring nodes, we show that it is possible to achieve strict desynchronization, where the difference between local clocks remain fixed over time. More interestingly, by having each node maintain two local clocks, we show that it is possible to further achieve proportional fair scheduling, where the time alloted to each node is proportional to their demands. The convergence of these algorithms is studied both analytically and numerically.",
keywords = "Consensus, PCO, Scheduling, Wireless sensor networks",
author = "Roberto Pagliari and Hong, {Y. W Peter} and Anna Scaglione",
year = "2010",
month = "5",
doi = "10.1109/JSAC.2010.100506",
language = "English (US)",
volume = "28",
pages = "564--575",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

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

AU - Pagliari, Roberto

AU - Hong, Y. W Peter

AU - Scaglione, Anna

PY - 2010/5

Y1 - 2010/5

N2 - 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 that are modeled as pulse-coupled oscillators (PCOs). By appropriately designing the dynamics of the PCO, the network of devices can converge to a desynchronous state where the nodes naturally separate their transmissions in time. Specifically, by following Peskin's PCO model with inhibitory coupling, we first show that round-robin scheduling can be achieved with weak convergence, where the nodes' transmissions are separated by a constant duration, but the differences of their local clocks continue to shift over time. Then, by having each node accept coupling only from the pulses emitted by a subset of neighboring nodes, we show that it is possible to achieve strict desynchronization, where the difference between local clocks remain fixed over time. More interestingly, by having each node maintain two local clocks, we show that it is possible to further achieve proportional fair scheduling, where the time alloted to each node is proportional to their demands. The convergence of these algorithms is studied both analytically and numerically.

AB - 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 that are modeled as pulse-coupled oscillators (PCOs). By appropriately designing the dynamics of the PCO, the network of devices can converge to a desynchronous state where the nodes naturally separate their transmissions in time. Specifically, by following Peskin's PCO model with inhibitory coupling, we first show that round-robin scheduling can be achieved with weak convergence, where the nodes' transmissions are separated by a constant duration, but the differences of their local clocks continue to shift over time. Then, by having each node accept coupling only from the pulses emitted by a subset of neighboring nodes, we show that it is possible to achieve strict desynchronization, where the difference between local clocks remain fixed over time. More interestingly, by having each node maintain two local clocks, we show that it is possible to further achieve proportional fair scheduling, where the time alloted to each node is proportional to their demands. The convergence of these algorithms is studied both analytically and numerically.

KW - Consensus

KW - PCO

KW - Scheduling

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=78751529043&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78751529043&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2010.100506

DO - 10.1109/JSAC.2010.100506

M3 - Article

AN - SCOPUS:78751529043

VL - 28

SP - 564

EP - 575

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 4

M1 - 5452950

ER -