The stochastic point process representing some aspect of customers actually entering a queueing system (or nodal part of one) or some aspect of the state of the node at the instant of input, with points representing the instants of entrance. For example, in finite capacity queues, and (Xva, Tva) process has the Xva process as a sequence of 1s and 0s representing whether the queue is full or not at an arrival and the Tva process represents the times of arrivals. The subset of the Tva process for which Xva = 0 represents the set of arrival epochs at which a customer actually enters the node, while the Tva for which Xva = 1 represents the set of arrival times at which customers do not gain access to the node but overflow. Arrival process; Networks of queues; Queueing theory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Input process . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_462
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_462
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive