A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results

Published:1987 Issue: Volume:27 Page:261-277
ISSN:0304-4149
Container-title:Stochastic Processes and their Applications
language:en
Short-container-title:Stochastic Processes and their Applications

Author:

van Dijk Nico

Publisher

Elsevier BV

Subject

Applied Mathematics,Modelling and Simulation,Statistics and Probability

Reference20 articles.

1. Monotonicity of the throughput of a closed queueing network in the number of jobs;Adan,1987

2. Monotonicity of the throughput of an open queueing network in the interarrival and service times;Adan,1987

3. Simple bounds for queueing systems with breakdowns;van Dijk,1986

4. Another and general proof for simple bounds for overflow systems;van Dijk,1986

5. Bounds for the call congestion of finite single-server exponential tandem queues;van Dijk,1985

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS;Probability in the Engineering and Informational Sciences;2019-06-26

2. Erlang loss bounds for OT–ICU systems;Queueing Systems;2009-11-26

3. Analytic comparison results for communication networks;Computer Communications;1998-11

4. The M/M/c with critical jobs;Mathematical Methods of Operations Research;1998-10

5. Bounds for performance characteristics: a systematic approach via cost structures;Communications in Statistics. Stochastic Models;1998-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP