Optimizing bulk data transfer performance: a packet train model
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The Analysis of Diskless Workstation Traffic on an Ethernet
The Analysis of Diskless Workstation Traffic on an Ethernet
Analyzing stability in wide-area network performance
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Measurements and characterization of traffic in a university environment
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
SEATTLE: A Scalable Ethernet Architecture for Large Enterprises
ACM Transactions on Computer Systems (TOCS)
| Hi-index | 0.00 |
Traditionally, models of packet arrival in communication networks have assumed either Poisson or compound Poisson arrival patterns. A study of a token ring local area network (LAN) at MIT [5] found that packet arrival followed neither of these models. Instead, traffic followed a more general model dubbed the “packet train,” which describes network traffic as a collection of packet streams traveling between pairs of nodes. A packet train consists of a number of packets travelling between a particular node pair.This study examines the existence of packet trains on NSFNET, a high speed national backbone network. Train characteristics on NSFNET are not as striking as those found on the MIT local network; however, certain protocols exhibit quite strong train behavior given the great number of hosts communicating through the backbone.Descriptions of the packet train model can be found in [3] and [5].