Bits through bufferless queues

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes achievable rates for the case of bufferless M/M/1 and M/G/1 queues. In particular, it is shown that a bufferless M/M/1 queue at worst suffers less than 10% reduction in capacity when compared to an M/M/1 work-conserving queue.

Original languageEnglish (US)
Title of host publication2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
PublisherIEEE Computer Society
Pages755-762
Number of pages8
ISBN (Print)9781479934096
DOIs
StatePublished - Jan 1 2013
Event51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 - Monticello, IL, United States
Duration: Oct 2 2013Oct 4 2013

Publication series

Name2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

Other

Other51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
CountryUnited States
CityMonticello, IL
Period10/2/1310/4/13

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Networks and Communications

Cite this

Tavan, M., Yates, R. D., & Bajwa, W. U. (2013). Bits through bufferless queues. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 (pp. 755-762). [6736600] (2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013). IEEE Computer Society. https://doi.org/10.1109/Allerton.2013.6736600
Tavan, Mehrnaz ; Yates, Roy D. ; Bajwa, Waheed U. / Bits through bufferless queues. 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society, 2013. pp. 755-762 (2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013).
@inproceedings{2530a30c2cd542c3a37d129ae519b863,
title = "Bits through bufferless queues",
abstract = "This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes achievable rates for the case of bufferless M/M/1 and M/G/1 queues. In particular, it is shown that a bufferless M/M/1 queue at worst suffers less than 10{\%} reduction in capacity when compared to an M/M/1 work-conserving queue.",
author = "Mehrnaz Tavan and Yates, {Roy D.} and Bajwa, {Waheed U.}",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/Allerton.2013.6736600",
language = "English (US)",
isbn = "9781479934096",
series = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
publisher = "IEEE Computer Society",
pages = "755--762",
booktitle = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
address = "United States",

}

Tavan, M, Yates, RD & Bajwa, WU 2013, Bits through bufferless queues. in 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013., 6736600, 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, IEEE Computer Society, pp. 755-762, 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, Monticello, IL, United States, 10/2/13. https://doi.org/10.1109/Allerton.2013.6736600

Bits through bufferless queues. / Tavan, Mehrnaz; Yates, Roy D.; Bajwa, Waheed U.

2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society, 2013. p. 755-762 6736600 (2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Bits through bufferless queues

AU - Tavan, Mehrnaz

AU - Yates, Roy D.

AU - Bajwa, Waheed U.

PY - 2013/1/1

Y1 - 2013/1/1

N2 - This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes achievable rates for the case of bufferless M/M/1 and M/G/1 queues. In particular, it is shown that a bufferless M/M/1 queue at worst suffers less than 10% reduction in capacity when compared to an M/M/1 work-conserving queue.

AB - This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes achievable rates for the case of bufferless M/M/1 and M/G/1 queues. In particular, it is shown that a bufferless M/M/1 queue at worst suffers less than 10% reduction in capacity when compared to an M/M/1 work-conserving queue.

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

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

U2 - 10.1109/Allerton.2013.6736600

DO - 10.1109/Allerton.2013.6736600

M3 - Conference contribution

AN - SCOPUS:84897732019

SN - 9781479934096

T3 - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

SP - 755

EP - 762

BT - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

PB - IEEE Computer Society

ER -

Tavan M, Yates RD, Bajwa WU. Bits through bufferless queues. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society. 2013. p. 755-762. 6736600. (2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013). https://doi.org/10.1109/Allerton.2013.6736600