An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas-Reference-Cited by-同舟云学术

An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas

Published:1989-01 Issue:3 Volume:16 Page:217-233
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Bondi AndréB.

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference18 articles.

1. Analysis of finite storage in a computer network node environment under general traffic conditions;Kamoun;IEEE Trans. Commun.,1980

2. Solution of queueing problems by a recursive technique;Herzog;IBM J. Res. Dev.,1975

3. Flow control: a comparative survey;Gerla;IEEE Trans. Commun. COM-28,1980

4. Buffer management in a packet switch;Irland;IEEE Trans. Commun. COM-26,1978

5. Servicing two flows with relative priority in a fully accessible system with a restricted number of places for waiting;Basharin;Engng Cybernet.,1967

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

1. Performance analysis of space–time priority queues;Performance Evaluation;2019-09

2. Randomized pushing-out in the priority queueing with a finite buffer size;Journal of Mathematical Sciences;2006-10

3. Priority queueing with finite buffer size and randomized push-out mechanism;Performance Evaluation;2005-06

4. Bandwidth reservation on a commercial router;Computer Networks and ISDN Systems;1996-01

5. Performance modeling of an FMS with finite input and output buffers;International Journal of Production Economics;1994-12