HAP: A New Model for Packet Arrivals

Applications to be supported on broadband networks exhibit a wide range of traffic statistics and many of them are sensitive to delay and loss violations. To accurately estimate admissible workload and bandwidth requirement, a detailed traffic model, HAP (Hierarchical Arrival Process) is proposed in this paper. Packets generated from HAP are modulated by processes at user, application, and message levels. This model is a generalization of ON-OFF traffic models and is shown to be equivalent to a special class of MMPP (Markov Modulated Poisson Process). Three algorithmic methods along with simulations are applied to evaluate the queueing performance under H4P traffic. Delay under HAP traffic can be well over tens of times higher than Poisson traffic, depending on parameters and load. Congestion may persist for minutes. HAP's dramatic short-term behavior explains the occasional congestion in the real networks. Conventional traffic models, however, do not exhibit this behavior. With these results, we give implications for broadband network control.

[1]  H. Heffes,et al.  A class of data traffic processes — covariance function characterization and related queuing results , 1980, The Bell System Technical Journal.

[2]  John F. Shoch,et al.  Measured performance of an Ethernet local network , 1980, CACM.

[3]  Will E. Leland,et al.  High time-resolution measurement and analysis of LAN traffic: Implications for LAN interconnection , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[4]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[5]  Paul J. Kühn.  rom ISDN to IBCN (Integrated Broadband Communication Network) , 1989, IFIP Congress.

[6]  David M. Lucantoni,et al.  A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..

[7]  Marcel F Neuts,et al.  Further Results on the M/M/1 Queue with Randomly Varying Rates. , 1978 .

[8]  Marcel F Neuts,et al.  The M/M/1 Queue with Randomly Varying Arrival and Service Rates. , 1977 .

[9]  Raj Jain,et al.  Packet Trains-Measurements and a New Model for Computer Network Traffic , 1986, IEEE J. Sel. Areas Commun..

[10]  Ward Whitt,et al.  Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..

[11]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[12]  Joseph Y. Hui.  Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[13]  Riccardo Gusella,et al.  A measurement study of diskless workstation traffic on an Ethernet , 1990, IEEE Trans. Commun..

[14]  Steven A. Heimlich.  Traffic characterization of the NSFNET national backbone , 1990, SIGMETRICS '90.

[15]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[16]  Riccardo Gusella,et al.  Characterizing the Variability of Arrival Processes with Indexes of Dispersion , 1991, IEEE J. Sel. Areas Commun..

[17]  Henry J. Fowler,et al.  Local Area Network Traffic Characteristics, with Implications for Broadband Network Congestion Management , 1991, IEEE J. Sel. Areas Commun..

[18]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[19]  F Schoute.  SIMPLE DECISION RULES FOR ACCEPTANCE OF MIXED TRAFFIC STREAMS , 1988 .