.png){kind=icon}
返回
A Covert Queueing Problem With Busy Period Statistic
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.3038191.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, we consider a covert queueing problem where server Bob is in agreement with Willie to serve his jobs exclusively and yet would like to admit non-Willie jobs covertly. Willie jobs arrive according to a Poisson process and have an exponential service requirement. Bob desires to admit a Poisson stream of non-Willie jobs at a rate lambda(b). Bob schedules jobs according to an arbitrary work-conserving policy and as part of usage statistics informs Willie of either the lengths of n successive busy periods or the number of jobs served in each of them. Willie performs optimal hypothesis testing to detect the presence of non-Willie jobs. In this work, we identify sufficient conditions on lambda(b) such that Bob can allow non-Willie jobs without Willie knowing about it with high probability.
Keyword:
Covert communication
covert queueing
hypothesis testing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Contrast Sensitivity Is Enhanced by Expansive Nonlinear Processing in the Lateral Geniculate Nucleus
PREAI
分享收藏
Need for a consensus on the methods by which to measure joint mobility and the definition of norms for hypermobility that reflect age, gender and ethnic-dependent variation: is revision of criteria for joint hypermobility syndrome and Ehlers-Danlos syndrome hypermobility type indicated?.png)
Rheumatology
OAAI
RheumatologyIF0
OAAI分享收藏Modelling the outcomes of different silvicultural approaches in the private native forests of north-eastern New South Wales模拟新南威尔士州东北部私有原生林中不同森林培育方法的成效
PREAI
分享收藏
查看更多内容