Waiting Times at Very Fast, Constant Service Time Merger Nodes

The paper concerns the study of waiting times at a packet-switched merger node for which the outgoing capacity exceeds or is equal to the sum of the capacities of the incoming channels. The case of constant service times, fixed-length packets, and general independent inputs is considered. A trivial upper bound on the waiting time is derived. Exact results on waiting time are obtained for certain specific network configurations.