未找到相关数据
A SIMPLE AND QUICK APPROXIMATION ALGORITHM FOR TANDEM, SPLIT-AND-MERGE QUEUING-NETWORKS WITH BLOCKING
被引：0
作者：
YANNOPOULOS, E
ALFA, AS
机构：
来源：
关键词：
APPROXIMATIONS;
BLOCKING;
QUEUES IN TANDEM;
SPLIT ND MERGE CONFIGURATIONS;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A simple and quick approximation algorithm for the analysis of tandem, split and merge queueing networks with general arrival and service processes with blocking is presented. The algorithm gives good estimates of the average sojourn time through the network for moderate and heavy traffic. This approximation is a very valuable tool for cases where computational time is very important, especially in optimization procedures. It is also very useful for the analysis of general split and merge systems consisting of more than three nodes.
引用
收藏
页码：288 / 308
页数：21
相关论文