Optimal scheduling of real-time messages in peer-to-peer wireless networks

Juan José Jaramillo; Shihuan Liu; Lei Ying

doi:10.1109/ACSSC.2011.6190291

Optimal scheduling of real-time messages in peer-to-peer wireless networks

Juan José Jaramillo
, Shihuan Liu
, Lei Ying

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper studies the problem of service allocation and scheduling of real-time messages in peer-to-peer wireless networks. Using stochastic network theory and optimization we propose a model that allows us to design a dynamic service allocation algorithm that maximizes the total network utility while meeting deadline constraints, by appealing to connections between Lagrange multipliers and deficits in service. The model allows for general interference constraints and arrival models. Using simulations we compare our algorithm against an optimal solution proposed for scheduling persistent real-time traffic and show the limitations of that approach to handle real-time messages for providing fairness.

Original language	English (US)
Title of host publication	Conference Record of the 45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011
Publisher	IEEE Computer Society
Pages	1610-1616
Number of pages	7
ISBN (Print)	9781467303231
DOIs	https://doi.org/10.1109/ACSSC.2011.6190291
State	Published - 2011
Externally published	Yes
Event	45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011 - Pacific Grove, CA, United States Duration: Nov 6 2011 → Nov 9 2011

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)	1058-6393

Conference

Conference	45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011
Country/Territory	United States
City	Pacific Grove, CA
Period	11/6/11 → 11/9/11

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Access to Document

10.1109/ACSSC.2011.6190291

Cite this

Jaramillo, J. J., Liu, S., & Ying, L. (2011). Optimal scheduling of real-time messages in peer-to-peer wireless networks. In Conference Record of the 45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011 (pp. 1610-1616). Article 6190291 (Conference Record - Asilomar Conference on Signals, Systems and Computers). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2011.6190291

Optimal scheduling of real-time messages in peer-to-peer wireless networks. / Jaramillo, Juan José; Liu, Shihuan; Ying, Lei.
Conference Record of the 45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011. IEEE Computer Society, 2011. p. 1610-1616 6190291 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Jaramillo, JJ, Liu, S & Ying, L 2011, Optimal scheduling of real-time messages in peer-to-peer wireless networks. in Conference Record of the 45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011., 6190291, Conference Record - Asilomar Conference on Signals, Systems and Computers, IEEE Computer Society, pp. 1610-1616, 45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011, Pacific Grove, CA, United States, 11/6/11. https://doi.org/10.1109/ACSSC.2011.6190291

@inproceedings{ea09c318f920466396a3c0cf14a68609,

title = "Optimal scheduling of real-time messages in peer-to-peer wireless networks",

abstract = "This paper studies the problem of service allocation and scheduling of real-time messages in peer-to-peer wireless networks. Using stochastic network theory and optimization we propose a model that allows us to design a dynamic service allocation algorithm that maximizes the total network utility while meeting deadline constraints, by appealing to connections between Lagrange multipliers and deficits in service. The model allows for general interference constraints and arrival models. Using simulations we compare our algorithm against an optimal solution proposed for scheduling persistent real-time traffic and show the limitations of that approach to handle real-time messages for providing fairness.",

author = "Jaramillo, \{Juan Jos{\'e}\} and Shihuan Liu and Lei Ying",

year = "2011",

doi = "10.1109/ACSSC.2011.6190291",

language = "English (US)",

isbn = "9781467303231",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society",

pages = "1610--1616",

booktitle = "Conference Record of the 45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011",

note = "45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011 ; Conference date: 06-11-2011 Through 09-11-2011",

}

TY - GEN

T1 - Optimal scheduling of real-time messages in peer-to-peer wireless networks

AU - Jaramillo, Juan José

AU - Liu, Shihuan

AU - Ying, Lei

PY - 2011

Y1 - 2011

N2 - This paper studies the problem of service allocation and scheduling of real-time messages in peer-to-peer wireless networks. Using stochastic network theory and optimization we propose a model that allows us to design a dynamic service allocation algorithm that maximizes the total network utility while meeting deadline constraints, by appealing to connections between Lagrange multipliers and deficits in service. The model allows for general interference constraints and arrival models. Using simulations we compare our algorithm against an optimal solution proposed for scheduling persistent real-time traffic and show the limitations of that approach to handle real-time messages for providing fairness.

AB - This paper studies the problem of service allocation and scheduling of real-time messages in peer-to-peer wireless networks. Using stochastic network theory and optimization we propose a model that allows us to design a dynamic service allocation algorithm that maximizes the total network utility while meeting deadline constraints, by appealing to connections between Lagrange multipliers and deficits in service. The model allows for general interference constraints and arrival models. Using simulations we compare our algorithm against an optimal solution proposed for scheduling persistent real-time traffic and show the limitations of that approach to handle real-time messages for providing fairness.

UR - https://www.scopus.com/pages/publications/84861306920

UR - https://www.scopus.com/pages/publications/84861306920#tab=citedBy

U2 - 10.1109/ACSSC.2011.6190291

DO - 10.1109/ACSSC.2011.6190291

M3 - Conference contribution

AN - SCOPUS:84861306920

SN - 9781467303231

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 1610

EP - 1616

BT - Conference Record of the 45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011

PB - IEEE Computer Society

T2 - 45th Asilomar Conference on Signals, Systems and Computers, ACSSC 2011

Y2 - 6 November 2011 through 9 November 2011

ER -

Optimal scheduling of real-time messages in peer-to-peer wireless networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this