Packet Delay in Models of Data Networks

ACM Transactions on Modeling and Computer Simulation

Volumn 11, Issue 3, 2001, Pages 233-250

  Fukś, Henryk ^a,d   Lawniczak, Anna T ^b,d   Volkov, Stanislav ^c  

^a BROCK UNIVERSITY   (Canada)

^b UNIVERSITY OF GUELPH   (Canada)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d Flds Inst for Res in Math Sci   (Canada)

Author keywords

Hitting time; Packet delay; Packet switching; Random walk; Routing table

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DECISION TABLES; LINEAR SYSTEMS; PACKET SWITCHING; RANDOM PROCESSES;

NETWORK SCALABILITY; PACKET DELAY;

PACKET NETWORKS;

EID: 0141834551     PISSN: 10493301     EISSN: None     Source Type: Journal    
DOI: 10.1145/502109.502110     Document Type: Article

References (20)

1. BASS, R. F. 1995. Probabilistic Techniques in Analysis. Springer-Verlag, New York.
2. BERTESKAS, D., AND GALLAGHER, R. 1987. Data Networks. Prentice-Hall, Englewood Cliffs, N.J.
3. BOLOT, J. C. 1993. Characterizing end-to-end packet delay and loss in the internet. J. High Speed Computing 2, 305.
4. BORELLA, M. S., AND BREWSTER, G. B. 1998. Measurement and analysis of long-range dependent behavior of internet packet delay. In Proceedings of IEEE INFOCOM, vol. 2 (Piscataway, N.J.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 497-504.
5. CAMPOS, I., TARANCÓN, E., CLÉROT, F., AND FERNÁNDEZ, L. A. 1995. Thermal and repulsive traffic flow. Phys. Rev. A 52, 6, 5946-5954.
6. CHOW, Y. S., AND TEICHER, H. 1988. Probability Theory. Springer-Verlag, New York.
7. DEANE, J. H. B., SMYTHE, C., AND JEFFERIES, D. J. 1996. Self-similarity in a deterministic model of data transfer. Int. J. Elect. 80, 5, 677-691.
8. DHAR, P., AND RAMASWAMY, R. 1982. Design of a computer communication network with special reference to throughput and delay considerations. J. Inst. Elect. Telecommun. Eng. 28, 391-397.
9. DYNKIN, E. B. AND YUSHKEVICH, A. A. 1969. Markov Processes: Theorems and Problems. Plenum Press, New York.
10. FAYOLLE, G., MALYSHEV, V., AND MENSHIKOV, M. 1995. Topics in the Constructive Theory of Countable Markov Chains. Press Syndicate of the University of Cambridge, Cambridge, England.
11. FELLER, W. 1968. An Introduction to Probability Theory and Its Applications. Wiley, New York.
12. FREEDMAN, D. 1971. Brownian Motion and Diffusion. Holden-Day, San Francisco, Calif.
13. FUKŚ, H., AND LAWNICZAK, A. T. 1999. Performance of data networks with random links. Math. Comput. Simul. 51, 103-119.
14. KADIRIRE, J. 1994. Minimising packet copies in multicast routing by exploiting geographical spread. Comput. Commun. Rev. 24, 3, 47-62.
15. MACII, A., MACII, E., AND WOLF, T. 1997. Throughput, delay and packet loss analyzes of input buffered ATM switch architectures. Syst. Anal. Modell. Sim. 28, 69-75.
16. OHIRA, T., AND SAWATARI, R. 1998. Phase transition in a computer network traffic model. Phys. Rev. E 58, 1, 193-195.
17. SAADAWI, T. N., AMMAR, M. H., AND HAKEEM, A. E. 1994. Fundamentals of Telecommunication Networks. Wiley, New York.
18. SELIGMAN, D. R. 1984. Traffic routing in a computer network. Comput. Commun. 7, 59-64.
19. STALLINGS, W. 1998. High-Speed Networks: TCP/IP and ATM Design Principles. Prentice-Hall, Englewood Cliffs, N.J.
20. TRETYAKOV, A. Y., TAKAYASU, H., AND TAKAYASU, M. 1998. Phase transition in a computer network model. Physica A 253, 315-322.