Timing capacity of queues with random arrival and modified service times

Guido C. Ferrante, Tony Q.S. Quek, Moe Z. Win

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

1 Citation (Scopus)

Abstract

A queue timing channel with random arrival and service times is investigated. The message is encoded into a sequence of additional delays that packets are subject to before they depart from the queue. We derive upper and lower bounds of the channel capacity for general arrival and service processes, and general load. We establish the channel capacity for the queue with exponential server and no load constraint by keeping the queue stable. We discuss the consequences of this result and describe a possible application where the timing channel is used to send covert information.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages370-374
Number of pages5
ISBN (Electronic)9781509018062
DOIs
Publication statusPublished - 2016 Aug 10
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: 2016 Jul 102016 Jul 15

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2016-August
ISSN (Print)2157-8095

Conference

Conference2016 IEEE International Symposium on Information Theory, ISIT 2016
CountrySpain
CityBarcelona
Period16-07-1016-07-15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Timing capacity of queues with random arrival and modified service times'. Together they form a unique fingerprint.

Cite this