# Covert queueing problem with a Markovian statistic

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.

## Authors

• 4 publications
• 6 publications
• ### Covert Cycle Stealing in a Single FIFO Server

Consider a setting where Willie generates a Poisson stream of jobs and r...
03/11/2020 ∙ by Bo Jiang, et al. ∙ 0

• ### Full Version – Server Cloud Scheduling

Consider a set of jobs connected to a directed acyclic task graph with a...
08/04/2021 ∙ by Marten Maack, et al. ∙ 0

• ### 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...
01/16/2021 ∙ by Thirupathaiah Vasantam, et al. ∙ 0

• ### Characterization of the Gittins index for sequential multistage jobs

The optimal scheduling problem in single-server queueing systems is a cl...
03/19/2021 ∙ by Samuli Aalto, et al. ∙ 0

• ### 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 ...
09/28/2020 ∙ by Fabrice Guillemin, et al. ∙ 0

• ### On Optimal Pricing of Services in On-demand Labor Platforms

I consider the optimal pricing problem faced by a freelance worker on an...
03/19/2018 ∙ by Vijay Kamble, et al. ∙ 0

• ### Breaking hypothesis testing for failure rates

We describe the utility of point processes and failure rates and the mos...
01/13/2020 ∙ by Rohit Pandey, et al. ∙ 0

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## I Introduction

This work was done when the author was a faculty at IIT Dharwad.

In the problem of covert communication, one considers a setup where Alice is transmitting messages to Bob and intruder Willie is snooping over this communication. The aim of Willie is to determine if the communication between Alice and Bob is taking place or not [3, 4]. While this problem has been studied for a wide variety of system models [18, 17, 10, 19, 5, 8, 9, 7, 22, 1, 6, 12, 20, 2], in this paper we consider a novel setup of covert queueing problem first studied in [11]. In a covert queueing problem, there are three entities, namely Willie, Bob, and Nillie (for non-Willie). Bob is a server that processes incoming jobs that arrive to its queue. While Bob is obligated to serve only Willie jobs, he may allow some non-Willie or Nillie jobs (for his selfish motives). Willie wants to determine whether Bob is allowing such illegitimate Nillie traffic or not, while Bob wants to have as much Nillie traffic as possible without Willie being able to detect its presence, hence the name covert queueing

. Similar to the problem of covert communication, the aim in the covert queueing problem is to determine the asymptotic limit on the arrival rate of Nillie jobs such that Willie is not able to detect the presence of Nillie traffic with high probability.

This covert queueing problem was first introduced in [11] and a recent variant appeared in [21]. In both these models, Willie jobs arrive according the a Poisson process and Willie and Bob enter into an exclusive contract under which Bob should only serve Willie jobs. As proof of exclusive work, Bob periodically informs Willie of some usage statistic. The statistic that Bob uses is typically opaque so that Willie is not able to detect Nillie jobs in an obvious manner. For example, in [11], only the arrival and departure times of Willie jobs are used as the information statistic. Similarly in [21], either the length of successive busy periods or the number of jobs served in these busy periods is conveyed. Due to the opaqueness of such statistics, Willie must perform hypothesis testing to infer the presence or absence of Nillie jobs. In turn, Bob desires to admit Nillie jobs in such a way that the probability of error in the hypothesis testing is close to one. The strategy for admitting Nillie jobs is dependent on the information statistic conveyed. For example, [11] employs the probabilistic insert at the end of busy period (IEBP) strategy while in [21], Nillie jobs are admitted according to a Poisson process with rate and the upper bound of this rate that maintains covertness is determined.

A common feature of both the works described above is that the sequence of information statistic conveyed by Bob are independent and identically distributed (i.i.d.) random variables. In

[11], the arrival and departure time information is used to generate a sequence of reconstructed service times that are i.i.d. Similarly, in [21], the statistic includes successive busy period information which is again i.i.d. This i.i.d. nature of the statistic makes the hypothesis testing problem more amenable to analysis.

In this work, we depart from i.i.d. statistics and instead consider a Markovian statistic. We assume that the server Bob does not have a buffer for arriving jobs to wait and the jobs that find server to be busy are lost. (Analysis for case with buffer is for future work.) We assume that Willie and Nillie jobs arrive according to a Poisson process with rates and

respectively and their service times are i.i.d. with exponential distribution of parameter

where . As part of usage statistics, Bob provides Willie with a sequence of random variables (associated with successive arrivals), where if the -th arrival finds the server to be busy and is lost and if the server is idle. Here the jobs may include Nillie jobs as well and since the arrival or departure time information is not conveyed, it is difficult for Willie to determine presence or absence of Nillie jobs by observing . This statistic is Markovian and therefore the hypothesis testing as performed by Willie is based on detection of Markov chains with known parameters [15, Ch. 12]. As part of our main result, we formulate this covert queueing setup as a hypothesis testing problem with the Markovian statistic and identify the upper bound on that ensures covertness. We first obtain a closed form expression for the error exponent associated with this hypothesis testing (see Proposition 1). Using this we then show that the arrival rate of Nillie jobs should be of order , where is a function of that decreases with at a sub-exponential rate (see Eq. 5, Theorem 1).

The rest of the paper is organized as follows. In Section II, we first provide details of our problem setup and then recall some of the basics of hypothesis testing between two Markov chains (for the sake of completeness). The main results of the paper are discussed in Section III, followed by some concluding remarks in Section IV.

## Ii System model

Bob is a server that Willie has contracted to serve its jobs. We assume that Willie and Nillie jobs arrive to Bob according to a Poisson process with rates and respectively. The server time for each job is exponentially distributed with rate . Bob does not have a queue or buffer to store arriving jobs in which case arriving jobs are lost when the server is busy serving a previous arrival. Consider a sequence of successive arrivals and let denote the state of the server (whether it is busy or idle) as seen by the -th job. More precisely, if the arrival found the server to be busy in which case the job is lost. When , the arriving job finds the server to be idle and starts receiving service.

As part of usage statistics, Bob provides Willie with the sequence of random variables , where the choice of is arbitrary. Note that Bob does not tell Willie any information about the arrival and departure time of each job. Since the arrivals and Poisson and the service times are exponential, the system can be represented by an queue and the sequence of random variables constitute a Markov chain [13]. Let be the realization of for . Given a sequence , the aim of Willie is to determine if Bob is inserting any non-Willie jobs or not using a binary hypothesis testing problem given by

 H0 :Bob is serving only Willie jobs (1) H1 :Bob is serving Willie as well as Nillie jobs.

Since the underlying system is an queue, one can see that the value for the -th job only depends on but not on any of the variables for  [13]. Since denotes the state of the server as seen by the -th arrival and the arrival process is Poisson, forms a two state discrete time Markov chain. denotes an N length realization or sample path of this Markov chain and the transition probability of this Markov chain is a function of the parameters and . Let and denote the state transition matrices under hypotheses and respectively.

We assume that both the hypotheses are equally likely. Let be the probability of rejecting under the condition it is true and is the probability of accepting under the condition is true. For the equally likely hypotheses, the total error is equal to  [14]. In order to achieve covertness, note that Bob wishes to have close to one. The covertness criteria is defined formally in Section II-B.

### Ii-a Preliminaries about hypothesis testing between two Markov chains [15, Ch. 12]

We shall now summarize some basics about hypothesis testing between two discrete-time, finite-state Markov chains with state transition matrices and . Details can be found in [15, Ch. 12] and references therein. For the given sequence , we wish to determine whether it corresponds to Markov chain with state transition matrix (hypothesis ) or (hypothesis ). Let be the probability of observing under the condition that hypothesis is true, for and consider the log-likelihood ratio 111We assume natural logarithm throughout the paper. given by

 logL(xN1)\coloneqqlogP[xN1|H0]P[xN1|H1]. (2)

The hypothesis testing consists of determining a threshold such that the decision is true if and is true otherwise. This is represented by

 logL(xN1)H0⋛H1γ. (3)

In the asymptotic setting, when tends to infinity, one can apply the Gärtner-Ellis theorem to obtain the asymptotic values of and which is given by (see Eq. (12.50) of [15])

 limN→∞1NlogPF(N) =−I0(γ) (4) limN→∞1NlogPM(N) =−I1(γ)=γ−I0(γ),

where is termed as the error exponent. It is also called as rate of decay error since it is the rate with which the error in the hypothesis testing goes to zero as tends to . Let and be some functions of that go to zero as tends to infinity at a sub-exponential rate, i.e.,

 limN→∞1NlogKF(N)=0 \& limN→∞1NlogKM(N)=0. (5)

From Eq. 4 and Eq. 5, and can be approximated as (see Eq. (12.53) of [15])

 PF(N) ≈KF(N)exp(−I0(γ)N) (6) PM(N) ≈KM(N)exp(−I1(γ)N). (7)

For our problem since both the hypotheses are assumed to be equally likely, we choose the threshold that maximizes the rate of decay of the total error and this can be achieved by setting . From Eq. 4, this implies that . In this case, the functions and can also be chosen to be equal. Suppose and and using this can be approximated as

 PE(N)≈K(N)exp(−IerrN). (8)

Having outlined the expression for the error in the hypothesis testing, we now define the covertness criteria for our problem. See [3, 18, 8, 21] for a similar definition.

### Ii-B Covertness criterion

###### Definition 1.

We say that server Bob is able to insert Nillie jobs with -covertness if the error in the hypothesis testing satisfies where .

Note that while the covertness criteria can be defined for arbitrarily chosen values of , typically in the literature is chosen to be close to zero. The results provided in our work are however applicable for arbitrary choice of . In this paper, we are interested in the asymptotic regime, where tends to infinity, and hence is close to (see Eq. 8). Thus for our problem, for -covertness we need

 K(N)exp(−IerrN)≥1−ϵ. (9)

## Iii Main results

In order to characterize the error in the hypothesis testing of Eq. 1, the key step is to obtain an expression for the error exponent (see Eq. 8). In this section, we first provide a closed form expression for this error exponent in Proposition 1. Using this we then study the asymptotic performance of the hypothesis testing, satisfying the given -covertness in Section III-B.

### Iii-a Characterizing the error exponent

Recall that in our setup, the usage statistic provided by Bob is a sequence of random variables , where each can either be zero or one. Further, form a two state Markov chain either with state transition matrix (hypothesis ) or (hypothesis ). The error exponent associated with these two Markov chain hypothesis testing is characterized in the following proposition.

###### Proposition 1.

When the bufferless server Bob provides Willie with the sequence of server states for successive arrivals, the error exponent (see Eq. 8) for the hypothesis testing of Eq. 1 is given by

 Ierr =−log(pvq1−v+(1−p)v(1−q)1−v) with v =log(alogbclog(1/c))/logb,

where and .

###### Proof.

We first obtain the state transition matrix under hypothesis . Note that the state of the Markov chain (an arrival finds the server either busy or idle), can either be zero or one. Suppose both -th and -th arrivals find the server states to be idle, i.e., and . This happens when the service time for the -th job is less than the interarrival time between the two jobs. Since the inter-arrival times and service times are exponential random variables with parameters and respectively, we have . The remaining state transition probabilities can be calculated in a similar fashion and matrix is given by

 P=⎡⎢⎣μλw+μλwλw+μμλw+μλwλw+μ⎤⎥⎦=[p1−pp1−p]. (10)

Under hypothesis , the arrival rate of the jobs is and hence the state transition matrix is given by

 Q=⎡⎢⎣μλw+λb+μλw+λbλw+λb+μμλw+λb+μλw+λbλw+λb+μ⎤⎥⎦=[q1−qq1−q]. (11)

Corresponding to matrices and and for a constant we now define a matrix as follows

 M(u)=[puq1−u(1−p)u(1−q)1−upuq1−u(1−p)u(1−q)1−u]. (12)

Let be the spectral radius of . For the hypothesis testing between Markov chains with state transition matrices and , the error exponent of Eq. 8 is given by [15, Sec.12.2.3]

 Ierr=−min0≤u≤1logr(u). (13)

To find we thus need to first find the spectral radius of . Since , is a positive square matrix [16, Definition 2.1] and from Proposition 2.4 of [16], is upper and lower bounded by the maximum and minimum row sum of . Observe that all rows of are the same and hence . We now substitute the values of and in to obtain

 r(u) =(μλb+λw+μ)(λb+λw+μλw+μ)u+ (14) ~{}~{}~{}~{}~{}~{}~{}(λb+λwλb+λw+μ)(λwλb+λwλb+λw+μλw+μ)u.

Suppose and . Substituting the values of and in Eq. 14 we get

 r(u)=ABu+CDu. (15)

To complete the proof, from Eq. 13 we now need to find the value of that minimizes . Let be this minimizer. Since log is concave function, is given by the solution of and hence using Eq. 15, the minimizer should satisfy the following equation

 ABvlogB+CDvlogD=0 (16) ⇒(BD)v=Clog(1/D)AlogB (17) ⇒v=log(CAlog(1/D)log(B))log(B/D). (18)

The required expression of is obtained by simplifying Eq. 18 and this completes the proof. ∎

### Iii-B Asymptotic performance of hypothesis testing

For ease of exposition and without loss of generality, we will assume for the remainder of this paper that the service rate is set to . We now have the following main theorem that characterizes the asymptotic performance of the underlying hypothesis testing problem, while ensuring -covertness.

###### Theorem 1.

Suppose as the usage statistic, server Bob provides Willie with a sequence of server states for successive arrivals. Then Bob can insert Nillie packets covertly if , where is a function of that decreases with at a sub-exponential rate (see Eq. 5). Further, should be of order .

###### Proof.

For -covertness we need (see Eq. 9)

 K(N)exp(−IerrN)≥1−ϵ, (19)

where the expression of is provided in Proposition 1

. We observe that for the asymptotic analysis, the expression of

provided in Proposition 1 is not amenable for further analysis. In the literature, typically such situations are resolved with the aid of Taylor series approximation (for example see [3, 18, 11] and references therein). Along similar lines, we consider the second order Taylor series approximation of with respect to around . We denote by to indicate that it is a function of (since is now treated as a constant). We have observed that, the Taylor series expansion of is very close to its true value in the asymptotic regime (when ).

The remainder of this proof is now sub-divided into two parts. We first find the Taylor series expansion of and then use it to obtain required asymptotic result for satisfying -covertness criteria. In what follows, all the derivatives are taken with respect to and denotes the derivative of a function .

Part-I: Obtaining Taylor series expansion of

Note that the calculations towards finding the Taylor series expansion are not straightforward (not amenable via MATLAB/Mathematica) and hence we provide these steps in detail. Suppose is approximated via the second order Taylor series approximation around as follows

 Ierr(λb)≈Ierr(0)+I′err(0)λb+I′′err(0)2λ2b, (20)

where and are the first and second derivative of , evaluated at . We have observed numerically that considering terms upto provide a good approximation. In the expression of , observe that while and are functions of , is not. To indicate this dependence explicitly we denote and by and respectively. Suppose , and . Using this we have . First and second derivatives of are now given by

 I′err(λb)=−F′(λb)F(λb),I′′err(λb)=(F′(λb))2−F(λb)F′′(λb)(F(λb))2. (21)

To obtain the Taylor series expansion, we thus need to evaluate and as . Towards this we first note that (the proof for this involves repeated application of L’Hopital’s rule and we skip this due to space constraints). Further, it can be easily verified that , and . We now evaluate , and as .

(1) Evaluating : is given by

 F(λb)=pv(λb)q(λb)1−v(λb)+¯pv(λb)¯q(λb)1−v(λb). (22)

For any arbitrary functions and , it is known that , where and . It can be seen that and since in Eq. 22 we get

 limλb→0F(λb)=p0.5p(1−0.5)+¯p0.5¯p(1−0.5)=1. (23)

(2) Evaluating : Let us first find . With some simple calculations it can be shown that

 F′1(λb) =pv(λb)q(λb)1−v(λb)[v′(λb)(logp−logq(x)) ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{% }~{}~{}~{}~{}~{}~{}+(1−v(λb))q′(λb)q(λb)]. \coloneqqF1(λb)T1(λb), (24)

where . Substituting and in Eq. 24, it can be verified that and hence . Using similar steps it can be shown that and hence

 limλb→0F′(λb)=limλb→0F′1(λb)+F′2(λb)=−p22+p22=0. (25)

(3) Evaluating : Let us first find . From Eq. 24 we have,

 F′′1(λb)=F1(λb)T′1(λb)+F′1(λb)T1(λb) (26)

where, with some calculations is obtained as

 T′1(λb) =−2v′(λb)q′(λb)q(λb)+v′′(λb)(logp−logq(λb))+ ~{}~{}~{}~{}~{}~{}(1−v(λb))[q(λb)q′′(λb)−(q′(λb))2q(λb)]. (27)

Substituting and in Eq. 27 we get

 limλb→0T′1(λb)=2pv′(0)+p22, (28)

where . In the above discussion we showed that, , and . Substituting these limits in Eq. 26 and from Eq. 28 we get

 limλb→0F′′1(λb)=2p2v′(0)+p32+p34. (29)

Using similar steps, can be evaluated. We skip the details due to space constraints. The limit of is given by

 limλb→0F′′2(λb)=−2p2v′(0)+p3(p−2)2(1−p)+p44(1−p). (30)

Simplifying Eq. 29 and Eq. 30 we get

 limλb→0F′′(λb)=−p34(1−p)=−14λw(λw+1)2, (31)

where in the last step we have substituted the value of (since ). Using Eq. 23, Eq. 25, and Eq. 31 in Eq. 21 we get and . Substituting this in Eq. 20 we get

 Ierr(λb)≈λ2b8λw(λw+1)2. (32)

Part-II: Covertness criteria

From Eq. 9, for -covertness we need

 Ierr≤1NlogK(N)1−ϵ, (33)

Substituting Eq. 32 in Eq. 33, we get

 λb≤√8λw(λw+1)2NlogK(N)1−ϵ (34)

and this proves the required upper bound on . Note that in Eq. 34, and are constants and is a function of that decreases with at a sub-exponential rate (see Eq. 5). Thus should be order and this completes the proof of the theorem. ∎

## Iv Conclusion

Departing from the usual i.i.d. statistics, in this work we consider a covert queueing problem with a Markovian statistic. We assume that Bob is a bufferless server who informs Willie about the server states (busy or idle) as seen by N successive arrivals. We formulate this covert queueing setup as a hypothesis testing problem between two Markov Chains and and identify the upper bound on that ensures covertness in admitting Nillie jobs.

As part of future work, it would be interesting to extend this work for the setting where Bob has a queue for the arriving jobs to wait. In this case, the information metric that Bob could use is the sequence of queue lengths as seen by the arriving customers. Relaxing the service times from exponential to general distributions and considering a multi-server setting of the problem is also for future work.

## Acknowledgments

This work is supported by the DST-INSPIRE faculty program of Government of India.

## References

• [1] K. Arumugam and M. Bloch (2016-09) Keyless asynchronous covert communication. In 2014 IEEE Information Theory Workshop, Vol. , Cambridge, United Kingdom, pp. 191–195. Cited by: §I.
• [2] K. Arumugam and M. Bloch (2019) Embedding covert information in broadcast communications. IEEE Transactions on Information Forensics and Security 14 (10), pp. 2787–2801. Cited by: §I.
• [3] B. Bash, D. Goeckel, and D. Towsley (2012-07) Square root law for communication with low probability of detection on AWGN channels. In Proc. of ISIT, Vol. , Cambridge, USA, pp. 448–452. Cited by: §I, §II-A, §III-B.
• [4] B. Bash, D. Goeckel, and D. Towsley (2013-09) Limits of reliable communication with low probability of detection on AWGN channels. IEEE Journal on Sel. areas in commun.  31 (9), pp. 1921–1930. Cited by: §I.
• [5] B. Bash, D. Goeckel, and D. Towsley (2016) Covert communication gains from adversary’s ignorance of transmission time. IEEE Transactions on Wireless Communications 15 (12), pp. 8394–8405. Cited by: §I.
• [6] M. Bloch (2016-05) Covert communication over noisy channels: a resolvability perspective. IEEE Trans. on Info. Theory 62 (5), pp. 2334–2354. Cited by: §I.
• [7] P. Che, M. Bakshi, C. Chan, and S. Jaggi (2014-11) Reliable deniable communication with channel uncertainty. In 2014 IEEE Information Theory Workshop, Vol. , Hobart, Tasmania, Australia, pp. 30–34. Cited by: §I.
• [8] P. Che, M. Bakshi, and S. Jaggi (2013-07) Reliable deniable communication:hiding messages in noise. In Proc. of ISIT, Vol. , Istanbul, Turkey, pp. 2945–2949. Cited by: §I, §II-A.
• [9] P. Che, S. Kadhe, M. Bakshi, C. Chan, S. Jaggi, and A. Sprintson (2014-11) Reliable, deniable and hidable communication: a quick survey. In 2014 IEEE Information Theory Workshop, Vol. , Hobart, Tasmania, Australia, pp. 227–231. Cited by: §I.
• [10] K. Huang, H. Wang, D. Towsley, and V. Poor (2020) LPD communication: a sequential change-point detection perspective. IEEE Transactions on Communications 68 (4), pp. 2474–2490. External Links: Document Cited by: §I.
• [11] B. Jiang, P. Nain, and D. Towsley (2021-06) Covert cycle stealing in a single FIFO server. ACM Transactions on Modeling and Performance Evaluation of Computing Systems 6 (2), pp. . Cited by: §I, §I, §I, §III-B.
• [12] I. Kadampot, M. Tahmasbi, and M. Bloch (2020) Multilevel-coded pulse-position modulation for covert communications over binary-input discrete memoryless channels. IEEE Transactions on Information Theory 66 (10), pp. 6001–6023. Cited by: §I.
• [13] L. Kleinrock (2018) Queueing systems: volume 1-theory. 5th edition, John Wiley & Sons, . Cited by: §II, §II.
• [14] E. Lehmann and J. Romano (2005) Testing statistical hypotheses. 3rd edition, Springer, . Cited by: §II.
• [15] B. Levy (2008)

Principles of signal detection and parameter estimation

.
edition, Springer, New York, USA. Cited by: §I, §II-A, §II-A, §III-A.
• [16] H. Schaefer (1975) Banach lattices and positive operators. edition, Springer-Verlag, Berlin Heidelberg. Cited by: §III-A.
• [17] T. Sobers, B. Bash, S. Guha, D. Towsley, and D. Goeckel (2017) Covert communication in the presence of an uninformed jammer. IEEE Transactions on Wireless Communications 16 (9), pp. 6193–6206. External Links: Document Cited by: §I.
• [18] R. Soltani, D. Goeckel, D. Towsley, and A. Houmansadr (2015-10) Covert communications on poisson packet channels. In Proc. of Allerton, Vol. , UIUC, Illinois, USA, pp. 1046–1052. Cited by: §I, §II-A, §III-B.
• [19] R. Soltani, D. Goeckel, D. Towsley, and A. Houmansadr (2020-06) Fundamental limits of covert packet insertion. IEEE Trans. on Commun.  68 (6), pp. 3401–3414. Cited by: §I.
• [20] M. Tahmasbi, A. Savard, and M. Bloch (2020) Covert capacity of non-coherent rayleigh-fading channels. IEEE Transactions on Information Theory 66 (4), pp. 1979–2005. External Links: Document Cited by: §I.
• [21] A. Yardi and T. Bodas (2021) A covert queueing problem with busy period statistic. IEEE Communication letters 25 (3), pp. 726–729. Cited by: §I, §I, §II-A.
• [22] Q. Zhang, M. Bakshi, and S. Jaggi (2020) Covert communication with polynomial computational complexity. IEEE Transactions on Information Theory 66 (3), pp. 1354–1384. External Links: Document Cited by: §I.