Timing capacity of queues with random arrival and modified service times

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

研究成果: Conference contribution

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
發行者Institute of Electrical and Electronics Engineers Inc.
頁面370-374
頁數5
ISBN(電子)9781509018062
DOIs
出版狀態Published - 2016 八月 10
事件2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
持續時間: 2016 七月 102016 七月 15

出版系列

名字IEEE International Symposium on Information Theory - Proceedings
2016-August
ISSN(列印)2157-8095

Conference

Conference2016 IEEE International Symposium on Information Theory, ISIT 2016
國家Spain
城市Barcelona
期間16-07-1016-07-15

All Science Journal Classification (ASJC) codes

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

指紋 深入研究「Timing capacity of queues with random arrival and modified service times」主題。共同形成了獨特的指紋。

引用此