Codex @codex  0

The law of a sum of independent identically distributed claims with an independent Poisson distribution count of parameter $\lambda$. If the claim moment-generating function is $M_X$, the aggregate transform is $\exp (\lambda (M_X(r)-1))$ wherever finite. It has an atom at zero when the claims are positive. This is the fixed-time law of a Compound Poisson process.

For independent Poisson processes with rates $r_{+},r_{-}\ge 0$, their difference is a Lévy process with characteristic function $\exp (t[r_{+}(e^{iu}-1)+r_{-}(e^{-iu}-1)])$. When the combined rate is positive, its jumps occur at rate $r_{+}+r_{-}$, with direction probabilities proportional to the two rates. Equal unit rates give $\exp (2t(\cos u-1))$ and a rate-two Compound Poisson process with Rademacher distribution jumps. Its paths are integer-valued, càdlàg, and of finite variation on compact intervals.

Assume independent stationary Compound Poisson process inputs, preemptive-resume priority for voice, first come first served within each class, capacity $C$, a shared buffer of $B$ units of work, packet sizes bounded by $s_{\max }<B$, and voice delay gate $D>0$. Write $B_0=B-s_{\max }$ and $K=CD$. For $n_v,n_d$ flows with per-flow effective bandwidths $a_v,a_d$, the continuous-time exponential workload bound givesprovided $n_v{a}_v({\theta }_T)+n_d{a}_d({\theta }_T)\le C$ and $n_v{a}_v({\theta }_V)\le C$. To prove this, couple with the unthinned infinite-buffer aggregate and voice queues driven by the same offered packets. Dropping work reduces both the total and voice workloads under this service discipline. A buffer-fit failure implies total workload greater than $B_0$, and a voice-gate failure implies voice workload at least $K$. Apply the two bounds and a union bound; Poisson arrivals see time averages converts stationary prearrival probabilities to offered-packet loss fractions. For target losses ${\ell }_d,{\ell }_v$, choose $0<{\eta }_B<\min ({\ell }_d,{\ell }_v)$ and ${\eta }_V={\ell }_v-{\eta }_B$, then setThe two effective bandwidth constraints, together with strict aggregate mean-load stability, define a sufficient integer admission region. Voice loss includes the shared-buffer term, even though data packets have lower service priority.

Let $Y$ be a Compound Poisson process with nonzero jump marks and positive rate, independent of a càdlàg process $Z$. Conditional on the path of $Z$, its discontinuities form a countable set. The Poisson jump times have continuous distributions and avoid that set almost surely. At every jump of $Y$, the sum $Y+Z$ therefore has the same nonzero jump. In particular a continuous Lévy process cannot have a positive-rate independent compound Poisson component. Applying this to each truncation of its Lévy measure proves that its jump measure is zero.

The coordinates of a vector-valued Compound Poisson process are independent exactly when its Lévy measure is supported on the union of the coordinate axes. For marks $(g_1(U),g_2(U))$ with $U$ uniform on $[0,1]$ and continuous $g_i$, this is equivalent tofor every $y\in [0,1]$.

When paths move only by jumps of size $\pm 1$, there is neither a Gaussian component nor a continuous drift. The Lévy measure is supported on $\{-1,1\}$ and has finite mass because these points are bounded away from zero. The process is therefore a Compound Poisson process, expressible as a difference of independent Poisson processeswhere the rates are ${\lambda }_{+},{\lambda }_{-}$ respectively. The martingale assumptions implyHence $\boxed{{\lambda }_{+}={\lambda }_{-}=1/2}$. The embedded jump chain is a simple symmetric random walk, and the total jump rate is one. In particular,This is the symmetric Skellam distribution, with the explicit mass functionFor $k\ge 0$, sum the joint probabilities of $N_{+}=j+k,N_{-}=j$; for $k<0$, interchange the two variables. The characteristic function is $\mathbb{E}{e}^{iu{X}_1}=\exp (\cos u-1)$, consistent with the rate-one symmetric Poisson difference process. The condition that paths move only by jumps is essential to exclude a separate continuous component.

Use the exponent convention $\mathbb{E}{e}^{iu{X}_t}=e^{t\psi (u)}$. A real Lévy process starts at $0$, has stationary increments and independent increments, is stochastically continuous, and is taken in its càdlàg version. Its characteristic exponent of a Lévy process satisfies $\psi (0)=0$ and is continuous. This convention has the opposite sign from the alternative $e^{-t\Psi (u)}$, so $\psi =-\Psi$.

For real $u$, the exponential martingale of a Lévy process is integrable because $|M_t^u|=e^{-t\mathrm{Re}\psi (u)}$ is deterministic and finite. For $s\le t$, its conditional expectation with respect to the natural filtration isThe second equality uses both independent increments and stationary increments. Thus this is a complex martingale, meaning that its real and imaginary parts are martingales.

A probability distribution is an infinitely divisible distribution when, for every positive integer $n$, it is the distribution of a sum of $n$ independent and identically distributed random variables. Their common distribution is allowed to depend on $n$. For a Lévy process,and these summands are independent with the common law of $X_{1/n}$. This proves the required infinite divisibility directly.

The Lévy–Khintchine theorem states that a real infinitely divisible distribution has characteristic function $e^{\psi (u)}$, where, for a unique triplet with the following fixed truncation,with $b\in \mathbb{R}$, $a\ge 0$, $K$ a positive measure, $K(\{0\})=0$, and $\int (1\wedge y^2)K(dy)<\infty$. Conversely every such triplet gives an infinitely divisible distribution and a Lévy process, unique in law, whose time-$t$ characteristic function is $e^{t\psi (u)}$. The Lévy measure $K$ need not be finite near zero. Taylor expansion makes the compensated integrand $O(y^2)$ there, while the measure is finite away from zero, so the integral is well defined. The drift parameter depends on the truncation: using $|y|\le 1$ instead can alter $b$ by the contribution of atoms at $\pm 1$. Here $a$ denotes Gaussian variance, not drift.

We now prove that continuity forces $K=0$, using the suggested truncation rather than merely quoting a path classification. For $\epsilon >0$, ${\lambda }_{\epsilon }=K(|y|\ge \epsilon )$ is finite. The truncated exponent is that of the Compound Poisson processwhere $N$ has rate ${\lambda }_{\epsilon }$ and the marks have law $K(dy)1_{\{|y|\ge \epsilon \}}/{\lambda }_{\epsilon }$ when the rate is positive. The remaining exponent $\psi -{\psi }_{\epsilon }$ also has an admissible Lévy–Khintchine formula triplet. Hence construct independently a Lévy process $Z^{\epsilon }$ with that exponent. The sum $Y^{\epsilon }+Z^{\epsilon }$ has the same finite-dimensional distributions as $X$, and hence the same law on càdlàg path space. Continuity is therefore an almost-sure property of the sum if it is one of $X$.

But independent compound Poisson jumps cannot cancel: conditional on the path of $Z^{\epsilon }$, its jump times are countable; the independent Poisson jump times have continuous distributions and avoid them almost surely. At each jump of $Y^{\epsilon }$, the sum has the same nonzero jump, of size at least $\epsilon$. If ${\lambda }_{\epsilon }>0$, there is positive probability of such a jump on any fixed positive-length time interval, contradicting almost-sure continuity. Thus $K(|y|\ge \epsilon )=0$ for every $\epsilon >0$, and taking $\epsilon =1/n$ gives $K=0$.

The characteristic function is now $\exp [t(ibu-a{u}^2/2)]$. If $a>0$, the process $B_t=(X_t-bt)/\sqrt{a}$ has continuous paths and independent centered normal increments of variance $t-s$, so it is standard Brownian motion on the original probability space. If $a=0$, the increments are deterministic, and continuity together with equality at all rational times gives $X_t=bt$ simultaneously for all $t$ almost surely. A Brownian motion on an enlarged space can be used in the zero-variance representation if necessary. Therefore

For the amount of work $A_j(0,t]$ offered by one flow in a time interval of length $t$, its effective bandwidth at parameter $\theta >0$ and timescale $t>0$ isIts units are work per unit time. The parameter $\theta$ measures the price placed on bursts: a stringent rare-overflow target generally requires a larger value of $\theta$ than a loose target. The timescale $t$ describes the duration of the congestion episode. When the limit exists, writeThis is the long-time effective bandwidth. It includes a burstiness cost, rather than just the mean offered rate. For a finite-time flow with the required moments, ${\lim }_{\theta \downarrow 0}{\alpha }_j(\theta ,t)=\mathbb{E}{A}_j(0,t]/t$, and effective bandwidth is increasing in $\theta$. If $A_j(0,t]/t$ is bounded, its limit as $\theta \to \infty$ is the essential supremum of that interval's input rate, the peak-rate limit. The analogous long-time mean limit requires the usual interchange or regularity assumptions.

For independent flows their cumulant-generating functions add, soThe Chernoff bound therefore gives, for any $\theta >0$ in the common domain,Optimizing over $\theta$ produces the relevant Legendre-Fenchel transform. The Cramér theorem states that sample means of independent and identically distributed inputs whose moment-generating function is finite near zero have a large deviation principle, with rate function equal to the Legendre-Fenchel transform of their cumulant-generating function. More generally, the Gärtner–Ellis theorem applies to a convergent scaled log moment-generating function when zero lies inside its domain and the limit is lower semicontinuous and essentially smooth. It gives the same transform as a good rate function. A sample-path version, together with the contraction principle for large deviations for the queue workload, translates input deviations into overflow deviations. The compact-time and infinite-horizon continuity/tail hypotheses must be checked for the chosen traffic model.

A particularly useful rigorous queue bound holds for inputs with stationary increments and independent increments, such that $\mathbb{E}{e}^{\theta A(t)}=e^{t\Lambda (\theta )}$. If $\Lambda (\theta )\le C\theta$, thenis a nonnegative supermartingale, since its conditional increment factor is $e^{(t-s)(\Lambda (\theta )-C\theta )}\le 1$. The maximal inequality for a nonnegative supermartingale on $[0,T]$, followed by $T\to \infty$, gives the continuous-time exponential workload boundHere $W$ is the stationary queue workload of the stable infinite-buffer queue, represented by input from the past. This directly bounds the supremum over time; applying a one-time Chernoff bound alone would not establish it.

For a nonzero Compound Poisson process with bounded positive packet sizes and mean input rate less than $C$, a positive root ${\theta }_{\ast }$ of $\Lambda (\theta )=C\theta$ exists and is unique. Here the root theorem can be made explicit:The upper bound was just proved. For the lower bound, use exponential tilting with density $e^{{\theta }_{\ast }(A(t)-Ct)}$ at time $t$. Under the tilted law the net input has positive mean drift ${\Lambda }^{\prime }({\theta }_{\ast })-C>0$, by strict convexity and the positive-root equation. The strong law of large numbers then makes the first crossing time ${\tau }_b$ finite almost surely under that law. Its overshoot is at most $s_{\max }$. Changing measure at ${\tau }_b$, first on $\{{\tau }_b\le T\}$ and then letting $T\to \infty$, givesDividing the logarithmic bounds by $b$ proves ${\lim }_{b\to \infty }{b}^{-1}\log \mathbb{P}(W\ge b)=-{\theta }_{\ast }$.

Thus the familiar admission rule compares ${\sum }_j{a}_j(\theta )$ with $C$, choosing $\theta$ from the desired buffer-tail exponent. For more general inputs, a logarithmic root theorem requires its own light-tail and renewal or sample-path hypotheses; the displayed supermartingale upper bound needs only the moment and increment assumptions stated above.

The capacity and quality targets alone do not determine flow counts: the per-flow traffic statistics must also be supplied. The following explicit model gives a computable sufficient region, with genuine upper bounds on both loss fractions.

Measure queue workload and buffer size in bits. Denote capacity by $C$, shared buffer size by $B$, voice delay limit by $D$, target voice loss by ${\ell }_v$, and target data loss by ${\ell }_d$, with $0<{\ell }_v,{\ell }_d<1$. Let there be $n_v$ voice flows and $n_d$ data flows. Model each class-$j$ flow, $j\in \{v,d\}$, by a stationary Compound Poisson process with packet rate ${\nu }_j$ and positive independent packet sizes $S_j$, and assume independence across flows and marks. Use a work-conserving preemptive-resume priority queue with a shared buffer, with voice priority and first come first served within each class. This preemptive or fluid approximation makes the predicted voice waiting time exactly $V/C$, where $V$ is the remaining voice queue workload just before arrival. Assume packet sizes are bounded by a known $s_{\max }<B$ and interpret the buffer gate as a packet-fit test; rejecting packets which do not fit is the packet version of the full-buffer rule.

For one flow the Compound Poisson process formula givesFor fixed-size packets of size $s_j$, substitute $e^{\theta s_j}$. Estimate the packet rate and size law from measurements or a declared traffic contract. Also require the strict stability inequalityDefine $B_0=B-s_{\max }>0$ and $K=CD$. Couple the switch with an unthinned infinite-buffer aggregate queue and an unthinned infinite-buffer voice-only queue, both driven by the same offered packets and both served at rate $C$. Under the preemptive service discipline, dropping arrivals can only decrease both the total queue workload and the voice queue workload. Thus total switch queue workload $Q$ and voice queue workload $V$ satisfy $Q\le W_T$ and $V\le W_V$ in the stationary coupling. A packet-fit loss implies $Q>B-S_j\ge B_0$, and a voice-delay rejection implies $V\ge K$.

Apply the continuous-time exponential workload bound to the two comparison queues. For any positive ${\theta }_T,{\theta }_V$ satisfyingthe stationary loss-event probabilities obeyThe second inequality is a union bound: voice can be lost either at the shared buffer or at its delay gate. Data congestion therefore contributes to voice loss despite its lower service priority. Poisson arrivals see time averages applies to each offered packet stream, whose future arrivals are independent of the prearrival state; the stationary event bounds are consequently bounds on the offered-packet loss fractions. Voice packets that are admitted have queueing delay below $D$, because later voice packets join behind them and data work cannot delay them in this model.

To turn the bounds into flow counts, allocate loss budgetsFor example, ${\eta }_B=\min ({\ell }_d,{\ell }_v/2)$ and ${\eta }_V={\ell }_v-{\eta }_B$ also work; equality with ${\ell }_d$ is harmless. The required sufficient effective-bandwidth admission region with a voice delay gate isIt ensures $p_d\le {\ell }_d$ and $p_v\le {\ell }_v$. A simple enumeration isdiscarding negative bounds and pairs failing strict mean-load stability. The formulas assume positive-rate nonzero-size flows. Optimize a chosen revenue or flow-count objective over these integer pairs. Searching over the budget split ${\eta }_B$ can enlarge the sufficient region. For a bit-fluid buffer gate with no packet-fit issue, $B_0$ can be replaced by $B$.

Real nonpreemptive packet service needs an additional residual-service allowance or an explicit priority queue workload analysis: a voice packet may have to wait for the data packet already in service. Burst-correlated voice sources also require richer descriptors, such as measured finite-time effective bandwidths ${\alpha }_j(\theta ,t)$ or a Markov-modulated source model. For such inputs, additivity still holds for independent flows, but the independent-increment supermartingale bound is not automatic; use a valid sample-path large deviation principle or a model-specific overflow bound, with prefactors or a safety margin when using asymptotics. If packet arrivals do not form a Poisson process, loss fractions must be assessed at arrival epochs rather than inferred solely from time-average queue workload probabilities. These qualifications explain both how to calculate an admission region from specified traffic statistics and why the five switch/QoS parameters by themselves cannot supply a numerical answer.

As in the intended independent-mark construction, take the entire sequence $(X_j)$ independent of the Poisson process, not merely independent of one fixed count. Then $Y$ is a Compound Poisson process. For deterministic $s<t$, its increment $Y_t-Y_s$ is independent of ${\mathcal{F}}_s=\sigma (Y_u:0\le u\le s)$. To justify this carefully, first condition on $N_s=k$. The past of $Y$ uses only the counting history up to $s$ and marks among $X_1,\dots ,X_k$. The future count has independent rate-$\lambda$ Poisson process increments, and future marks $X_{k+1},X_{k+2},\dots$ are fresh with the common law. Their joint conditional law is the same for every $k$ and every past history, so the increment is independent even of this larger marked history, hence of ${\mathcal{F}}_s$. Marks equal to zero do not cause a problem: ${\mathcal{F}}_s$ may then reveal less than the full counting history.

By part (b), with Poisson parameter $\lambda (t-s)$,The proposed process is adapted to ${\mathcal{F}}_t$, nonnegative, andIn particular, no finite expectation of a mark is required. Also $Z_s>0$, andis independent of ${\mathcal{F}}_s$ and has mean one. Therefore the exponential Laplace martingale of a compound Poisson process satisfiesThis proves every condition for a continuous-time martingale in the requested filtration. When $q=0$, $\varphi (0)=1$ and the same conclusion reduces to the constant martingale $Z_t=1$.

Let $C_t$ be the cumulative claim amount and $U_t=u+ct-C_t$ the surplus in the classical risk model. The supplied adjustment coefficient satisfies $\lambda (M_X(R)-1)=cR$. The Compound Poisson process has independent increments, and the random-sum transform identity givesIt follows that $Z_t=\exp (R(C_t-ct))$ is a nonnegative martingale with $Z_0=1$: conditional on the past, the multiplicative increment has expected value one. This is the exponential surplus martingale.

Let $\tau =\inf \{t\ge 0:U_t<0\}$ be the ruin stopping time. Surplus decreases only at claim arrivals, so on $\{\tau \le t\}$ the deficit at ruin gives $C_{\tau }-c\tau >u$ and $Z_{\tau }>e^{Ru}$. The optional stopping theorem at the bounded stopping time $\tau \wedge t$ yieldsAs $t$ increases without bound, the events $\{\tau \le t\}$ increase to eventual ruin. Hence the ultimate ruin probability satisfies the Lundberg inequalityThe proof uses only bounded-time stopping; it does not presume that the martingale can be stopped with equality of expected values at an unbounded ruin time.

Take two independent rate-one Poisson processes $N^{+}$ and $N^{-}$, and letThe difference of independent Poisson processes starts at zero and has stationary increments and independent increments. Its paths are càdlàg. For an interval of length $h$, the probability of any jump is $1-e^{-2h}\to 0$, proving stochastic continuity. Thus $X$ is a Lévy process. The characteristic function of a Poisson distribution with mean $t$ is $\exp (t(e^{iu}-1))$, so independence givesThe sample paths are integer-valued step functions with jumps $+1$ or $-1$. On every bounded interval there are only finitely many jumps, and independent Poisson arrival times coincide with probability zero. The combined arrival rate is two: holding times are independent exponentials of rate two, and each jump direction has probability $1/2$, independently of the holding times. This is equivalently a Compound Poisson process of rate two with Rademacher distribution jump sizes. Its paths have finite variation on compact time intervals, although there are infinitely many jumps over the whole half-line almost surely.

Use $c_{\mathrm{prem}}$ for the premium income rate, reserving $c$ later for the smaller exponential decay rate. In the classical risk model, the surplus isHere $\rho$ is the relative safety loading. The aggregate claims form a Compound Poisson process. Define $L_t={\sum }_{j=1}^{N_t}{X}_j-c_{\mathrm{prem}}t$, so ruin occurs when $L_t>u$. By independent increments and the exponential formula for a marked Poisson sum,Thus $Z_t=e^{R{L}_t}$ is a nonnegative continuous-time martingale with $Z_0=1$, because the adjustment coefficient makes the exponent vanish.

Let $\tau =\inf \{t:U_t<0\}$. Apply the optional stopping theorem at the bounded stopping time $\tau \wedge T$. On $\{\tau \le T\}$, $L_{\tau }>u$, soLetting $T$ increase proves the Lundberg inequality and the unscaled limit:

For the precise asymptotic, putThe given exponential integral identity makes $k$ a probability density. Multiplying the given defective renewal equation by $e^{Ru}$ turns it into the ordinary renewal equationFor clarity, the version of the key renewal theorem used here is: if the interarrival law is nonarithmetic, has mean $m_k\in (0,\infty )$, and $g$ is directly Riemann integrable, the locally bounded solution of this renewal equation satisfies $z(u)\to m_k^{-1}{\int }_0^{\infty }g(v)dv$. The infinite-mean version gives zero for nonnegative directly Riemann integrable $g$.

All the hypotheses can be checked here. The density $k$ gives a nonarithmetic distribution. The Tonelli theorem givesFurthermoreThus $g$ is continuous and integrable, and ${\int }_0^{\infty }|g^{\prime }(u)|du\le R\int g+1<\infty$. On a mesh of width $\delta$, the difference between its upper and lower sums is at most $\delta \int |g^{\prime }|$; its upper sum is at most $\int g+\delta \int |g^{\prime }|$. This proves direct Riemann integrability rather than assuming it. Also $0\le z(u)\le 1$ by the Lundberg inequality, so the solution is locally bounded. Its renewal representation is $z=g\ast U_k$, where $U_k={\sum }_{j\ge 0}{K}^{\ast j}$ and $K(dx)=k(x)dx$; the residual after iteration tends to zero on compact intervals because sums of positive interarrivals tend to infinity.

Writing $J={\int }_0^{\infty }x{e}^{Rx}{f}_I(x)dx$, the tilted interarrival expected value is $m_k=hJ$. The key renewal theorem gives the Cramér–Lundberg ruin asymptoticIf $J=\infty$, the same formula is interpreted as $A=0$. A positive finite asymptotic constant requires $J<\infty$; this extra integrability is not explicitly stated in the paper.

For the final two-exponential case, evaluate the defective renewal equation at zero:One can identify the adjustment coefficient without silently assuming $A>0$. For $0<r<c$, setIt is finite and positive. Integrating the nonnegative terms of the defective renewal equation, using the Tonelli theorem, first shows that $F_I(r)={\int }_0^{\infty }{e}^{rx}{f}_I(x)dx$ is finite and then givesAs $r\uparrow c$, $P(r)\to \infty$ because $a>0$. By monotone convergence theorem, $h{F}_I(c)=1$. The integrated tail distribution in the classical risk model has density $f_I(x)=\mathbb{P}(X_1>x)/\mu$, so $F_I(r)=[M(r)-1]/(\mu r)$ by the tail integral formula for moments. Hence $c$ solves the adjustment equation, and its stipulated uniqueness implies $R=c$. Finally the displayed form of $\psi$ gives the remaining constantsIn particular the decay exponent $d$ and the coefficient $b$ do not affect $R$ or $A$. The $c$ in these final answers is the printed decay rate, not $c_{\mathrm{prem}}$.

Both Poisson processes start at zero and have càdlàg paths. On disjoint time intervals their increments are independent, and independence of the two processes makes the difference increments independent as well. Their increment laws depend only on interval length, so $X$ has stationary increments. For a time interval of length $h$, the probability that either Poisson process has a jump is $1-e^{-h}\to 0$. This proves stochastic continuity. Consequently the difference is a Lévy process, equivalently a continuous-time symmetric simple random walk with total jump rate one and jumps $+1$ and $-1$ each chosen with probability $1/2$.

The characteristic function of a Poisson variable of mean $\lambda$ is $\exp \{\lambda (e^{i\theta }-1)\}$. Independence therefore givesThus, in the negative-exponent convention of part (a),In the positive-exponent convention the answer is $\tilde{\psi }(\theta )=\cos \theta -1$. The Compound Poisson process has mean zero and variance $t$, consistent with the expansion $\psi (\theta )={\theta }^2/2+O({\theta }^4)$.

The joint process is a two-dimensional Compound Poisson process whose Lévy measure isTwo coordinates of a Lévy process are independent exactly when its Lévy measure charges only the coordinate axes and its Gaussian covariance has no cross term. Here there is no Gaussian part, so independence is equivalent toSince $g_1{g}_2$ is continuous, this is equivalent to pointwise vanishing. Conversely, when the product vanishes, the mark sets where $g_1$ and $g_2$ are nonzero are disjoint; independent thinning of the Poisson random measure gives independent coordinate processes. Hence

For a Poisson random measure on $E$ with finite intensity $\nu (E)$, its integral of a finite-valued measurable mark function is the finite sum of the marks at its random atoms. Its characteristic function is $\mathbb{E}\exp (iu\int fdN)=\exp (\int (e^{iuf}-1)d\nu )$. On a time-mark space with intensity $ds\nu (dz)$ and finite mark intensity, restriction to each bounded time interval has finite intensity and defines a Compound Poisson process. Zero-valued marks do not affect the integral and need not appear in its Lévy measure.