Reduced complexity in <mml:math altimg="si89.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>M</mml:mi><mml:mo>/</mml:mo><mml:mi>P</mml:mi><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mi>c</mml:mi><mml:mo>/</mml:mo><mml:mi>N</mml:mi></mml:math> queues-Reference-Cited by-同舟云学术

Reduced complexity in M/Ph/c/N queues

Author:

Brandwajn Alexandre,Begin Thomas

Publisher

Elsevier BV

Subject

Computer Networks and Communications,Hardware and Architecture,Modeling and Simulation,Software

Reference28 articles.

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

1. Mathematical Model of Information Processing with Relative Priority and Different Service Intensity;2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS);2023-08-14