Input process

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 (Xv^a, Tv^a) process has the Xv^a process as a sequence of 1s and 0s representing whether the queue is full or not at an arrival and the Tv^a process represents the times of arrivals. The subset of the Tv^a process for which Xv^a = 0 represents the set of arrival epochs at which a customer actually enters the node, while the Tv^a for which Xv^a = 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.