Delay analysis for packet trains over computer communication networks

A model for traffic arrival in a computer network is analyzed. This model is based on a train arrival process in which the traffic between each node pair consists of a certain number of trains, each having a random number of packets. With this scheme, the number of overhead bits per packet is reduced. The processing time at each node is reduced, because each node needs to make only one routing decision per train and does not need to make a separate routing decision for each packet. The scheme described can cope with the ever increasing amount of data being transferred over computer networks by decreasing processing times while maintaining maximum packet size restrictions. The model accurately describes the dependence suggested by observed correlation between successive arrivals of a train. The aggregate arrival process that results from multiplexing N sources to a multiplexer is characterized in detail. The relation of the proposed model to delay congestion and buffer sizes is described