Time division multiple-access (TDMA) protocols have been designed to operate primarily under uniform traffic patterns. However, real traffic measurements have proven to be rather self-similar. In this article, the authors examine the performance and behavior of TDMA family protocols (TDMA, RTDMA, LTDMA) under self-similar traffic. The comparison of the simulation results of the above protocols showed the superiority of LTDMA, which exhibits remarkably high throughput-delay performance.
[1] Paxson, V., and S. Floyd. 1995. Wide area traffic: The failure of Poisson modeling. IEEE Transactions on Networking3:226-244.
2.
[2] Leland, W., M.Taqqu M., W. Willinger, and D. V. Wilson. 1994. On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Transactions on Networking2 (1): 1-15.
[4] Mandelbrot, B. B.1969. Long-run linearity, locally Gaussian processes, H-spectra and infinite variances. International Economic Review10:82-113.
5.
[5] Mandelbrot, B. B.1982. The fractal geometry of nature. New York: W. H. Freeman.
6.
[6] Park, K., G. Kim, and C. Crovella. 1997. On the effect of traffic self-similarity on network performance. Proceedings of the SPIE International Conference on Performance and Control of Network Systems, pp. 296-310.
7.
[7] Huang, C., M. Devetsikiotis, I. Lambadaris, and A. R. Kaye. 1995. Modelling and simulation of self-similar variable bit rate compressed video: A unified approach. Proceedings of the ACM SIGCOMM '95, pp. 114-255.
8.
[8] Leland, W. E., M. S. Taqqu, W. Willinger, and D. V. Wilson. 1993. On the self-similar nature of Ethernet traffic. Proceedings of the ACM SIGCOMM '93.
9.
[9] Crovella, M., and A. Bestavros. 1997. Self-similarity in World Wide Web traffic: Evidence and possible causes. IEEE/ACM Transactions on Networking5 (6): 835-846.
10.
[10] Adas, A., and A. Mukherjee. 1995. On resource management and QoS guarantees for long range dependent traffic. Proceedings of IEEE INFOCOM '95, pp. 779-787.
11.
[11] Addie, R., M. Zukerman, and T. Neame. 1995. Fractal traffic measurements, modelling and performance evaluation. Proceedings of IEEE INFOCOM '95, pp. 977-984.
12.
[12] Erramilli, A., R. P. Singh, and P. Pruthi. 1995. An application of deterministic chaotic maps to model packet traffic. Queueing Systems20:171-206.
13.
[13] Pruthi, P., and A. Erramilli. 1995. Heavy-tailed on/off source behavior and self-similarity. Proceedings of the ICC, Seattle, WA.
14.
[14] Garret, M., and W. Willinger. 1994. Analysis, modelling and generation of self-similar VBR video traffic. Proceedings of the ACM SIGCOMM '94, pp. 269-280.
15.
[15] Norros, I.1994. A storage model with self-similar input. Queueing Systems16:387-396.
16.
[16] Norros, I.1995. On the use of fractional Browinan motion in the theory of connectionless networks. IEEE JSAC13:953-962.
17.
[17] Adas, A. 1996. Traffic models in broadband telecommunication networks. Technical Rep. GIT-CC-96-01, Georgia Tech.
18.
[18] Krishnamurthy, N. 1998. Fractional ARIMA processes and its applications in network traffic modelling. Qualifying examination report for the Degree of Doctor of Philosophy in Electrical Engineering, Georgia Institute of Technology, August.
19.
[19] Willinger, W., M. Taqqu, R. Sherman, and D. Wilson. 1997. Self-similarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level. IEEE/ACM Transactions on Networking5 (1): 71-86.
20.
[20] Ryo, B., and S. Lowen. 1998. Point process models for self-similar network traffic, with applications. Stochastic Models14 (3): 735-761.
21.
[21] Rubin, I.1979. Access control disciplines for multiaccess communications channels: Reservation and TDMA schemes. IEEE Transactions on Information Theory25:516-526.
22.
[22] De Moraes, L. F. M., and I. Rubin. 1984. Message delays for a TDMA scheme under a nonpreemptive priority discipline. IEEE Transactions on Communications32 (5): 583-588.
23.
[23] Narendra, K. S., and M. L. Thathachar. 1989. Learning automata: An introduction. Englewood Cliffs, NJ: Prentice Hall.
24.
[24] Najim, K., and A. S. Poznyak. 1994. Learning automata: Theory and applications. New York: Pergamon, 1994.
25.
[25] Papadimitriou, G. I., and A. S. Pomportsis. 1998. Learning-automata-based TDMA protocols for broadcast communication systems with bursty traffic. IEEE Communications Letters69 (1): 59-79.
26.
[26] Papadimitriou, G. I., and A. S. Pomportsis. 1999. Self-adaptive TDMA protocols: A learning-automata-based approach. Paper presented at the IEEE International Conference on Networks (IEEE ICON'99), September-October, Brisbane, Queensland, Australia.
27.
[27] Papadimitriou, G. I., and D. G. Maritsas. 1996. Learning automata-based receiver conflict avoidance algorithms for WDM broadcast-and-select star networks. IEEE/ACM Transactions on Networking4:407-412.
28.
[28] Kleinrock, L., and Y. Yemini. 1978. An optimal adaptive scheme for multiple access broadcast communication. Proceedings of IEEE ICC '78, Toronto, Canada, pp. 7.2.1-7.2.5.
29.
[29] Popescu, A.1999. Traffic self-similarity. Karlskrona, Sweden: University of Karlskrona/Ronneby.
30.
[30] Park, K., and W. Willinger. 2000. Self-similar network traffic and performance evaluation. New York: John Wiley.
