Message Waiting Time in a Packet Switching System
- 1 January 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (1) , 30-41
- https://doi.org/10.1145/322169.322173
Abstract
The behavior of a buffer having an arbitrary number of common output channels in a packet switchmg system with an arbitrary number of priority classes of messages as studied Because of the random lengths of the messages and the fixed packet size, some messages must be split into several packets. Packets of the same message may not be sent immediately m sequence because of the packets of higher priority messages Therefore, the message wamng tame is defined as the wamng tame of the last packet carrying a part of the given message The hmmng probability dastnbution of thas delay is calculated for the case of mdependent packet amval processes wRh stataonary independent increments Some numerical results are also presented The results obtamed can be used m the analysis of message path delay in certain store-and-forward commumcatton systems, particularly loop communication systems.Keywords
This publication has 5 references indexed in Scilit:
- Priority Disciplines in a Loop SystemJournal of the ACM, 1974
- Batch Input to a Multiserver Queue with Constant Service TimesBell System Technical Journal, 1973
- On the Analysis and Modeling of a Class of Computer Communication SystemsIEEE Transactions on Communications, 1972
- Service in a Loop SystemJournal of the ACM, 1972
- An Elementary Queueing ProblemThe American Mathematical Monthly, 1962