منابع مشابه
An asymptotic approximation for TCP compound
In this paper, we derive an expression for throughput of TCP Compound connections with random losses. We consider the case of a single TCP connection with random losses and negligible queuing, i.e., constant round trip time. For this case, an approximation of throughput has been derived earlier using a deterministic loss model. We provide a theoretical justification for this approximation. Furt...
متن کاملA Markovian Approximation of TCP CUBIC
In this paper, we derive an expression for computing average window size of a single TCP CUBIC connection under random losses. Throughput expression for TCP CUBIC has been computed earlier under deterministic periodic packet losses. We validate this expression theoretically. We then use insights from the deterministic loss based model to derive an expression for computing average window size of...
متن کاملWeak Approximation for Cubic Hypersurfaces
We prove weak approximation for smooth cubic hypersurfaces of dimension at least 2 defined over the function field of a complex curve.
متن کاملAn analysis of cubic approximation schemes for conic sections
In this paper a piece of a conic section is approximated by a cubic or piecewise cubic polynomial. The main tool is to define the two inner control points of the cubic as an affine combination, defined by λ ∈ [0, 1], of two control points of the conic. If λ is taken to depend on the weight w of the latter, a function λ(w) results which is used to distinguish between different algorithms and to ...
متن کاملAsymptotic solvability of an imaginary cubic oscillator with spikes
For complex potentials V (x) = −(ix)3 − β(ix) − 2 β δ (ix) which are PT symmetric we show that in the β ≫ 1 strong coupling regime the low lying bound states almost coincide with harmonic oscillators whenever the spectrum remains real (this means, at all δ < δcritical(β) ≈ 1). PACS 03.65.Fd 03.65.Ca 03.65.Ge 03.65.Bz
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2018
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-018-9594-x