DeepAI AI Chat
Log In Sign Up

Covert queueing problem with a Markovian statistic

by   Arti Yardi, et al.
IIIT Bangalore
Tata Consultancy Services

Based on the covert communication framework, we consider a covert queueing problem that has a Markovian statistic. Willie jobs arrive according to a Poisson process and require service from server Bob. Bob does not have a queue for jobs to wait and hence when the server is busy, arriving Willie jobs are lost. Willie and Bob enter a contract under which Bob should only serve Willie jobs. As part of the usage statistic, for a sequence of N consecutive jobs that arrived, Bob informs Willie whether each job was served or lost (this is the Markovian statistic). Bob is assumed to be violating the contract and admitting non-Willie (Nillie) jobs according to a Poisson process. For such a setting, we identify the hypothesis testing to be performed (given the Markovian data) by Willie to detect the presence or absence of Nillie jobs. We also characterize the upper bound on arrival rate of Nillie jobs such that the error in the hypothesis testing of Willie is arbitrarily large, ensuring covertness in admitting Nillie jobs.


page 1

page 2

page 3

page 4


Covert Cycle Stealing in a Single FIFO Server

Consider a setting where Willie generates a Poisson stream of jobs and r...

On the Performance of Large Loss Systems with Adaptive Multiserver Jobs

In this paper, we study systems where each job or request can be split i...

Full Version – Server Cloud Scheduling

Consider a set of jobs connected to a directed acyclic task graph with a...

Sensitivity of Mean-Field Fluctuations in Erlang loss models with randomized routing

In this paper, we study a large system of N servers each with capacity t...

Characterization of the Gittins index for sequential multistage jobs

The optimal scheduling problem in single-server queueing systems is a cl...

On Optimal Pricing of Services in On-demand Labor Platforms

I consider the optimal pricing problem faced by a freelance worker on an...

On the sojourn time of a batch in the M^[X]/M/1 Processor Sharing Queue

In this paper, we analyze the sojourn of an entire batch in a processor ...