<p>A queueing loss system with <i>N</i> independent sources, without buffer, and <i>n</i> servers, is considered here (<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11009_2025_10141_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="52" /> </InlineMediaObject> <EquationSource Format="TEX">\(N&gt;n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>N</mi> <mo>&gt;</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>). Arrivals and service times are Poisson and exponentially distributed, respectively. We present averaging and diffusion approximation results as the number of sources and service facilities becomes together large.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Diffusion Approximation of Loss Queueing Systems

  • Nikolaos Limnios,
  • Bei Wu

摘要

A queueing loss system with N independent sources, without buffer, and n servers, is considered here ( \(N>n\) N > n ). Arrivals and service times are Poisson and exponentially distributed, respectively. We present averaging and diffusion approximation results as the number of sources and service facilities becomes together large.