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

See

Arrival Process

Networks of Queues

Queueing Theory