Tráfico Autosimilar. Algoritmo algebráico para asignación dinámica del búffer

Article Sidebar

PDF (Spanish)
Published: Mar 30, 2008
DOI: https://doi.org/10.17163/ings.n2.2008.02

Main Article Content

Jack Bravo
Luis Marrone

Abstract

Los modelos de tráfico realísticos son un requerimiento fundamental para comprender el diseño del hardware y software de red en campos como en el comportamiento de las colas, manejo de la congestión y ancho de los buffers. Se ha determinado que muchas trazas de tráfico en el mundo real son estadísticamente consistentes con modelos de tráfico autosimilares. Esto impone nuevos requerimientos en lo que a diseño de switch se refiere, especialmente en lo que respecta a las estrategias de bufferiado. En este trabajo se propone un modelo de asignación dinámica del espacio de buffer para condiciones de tráfico autosimilar y lo comparamos en términos de probabilidad de bloqueo, mediante simulación, con la política de Umbral dinámico proporcional y Umbral Estático. El Umbral de Control Dinámico propuesto ha demostrado ser más robusto para las condiciones cambiantes del tráfico autosimilar que las otras dos.

Article Details

Issue
No. 2 (2008)
Section
Scientific Paper

 

The Universidad Politécnica Salesiana of Ecuador preserves the copyrights of the published works and will favor the reuse of the works. The works are published in the electronic edition of the journal under a Creative Commons Attribution/Noncommercial-No Derivative Works 4.0 Ecuador license: they can be copied, used, disseminated, transmitted and publicly displayed.

The undersigned author partially transfers the copyrights of this work to the Universidad Politécnica Salesiana of Ecuador for printed editions.

It is also stated that they have respected the ethical principles of research and are free from any conflict of interest. The author(s) certify that this work has not been published, nor is it under consideration for publication in any other journal or editorial work.

The author (s) are responsible for their content and have contributed to the conception, design and completion of the work, analysis and interpretation of data, and to have participated in the writing of the text and its revisions, as well as in the approval of the version which is finally referred to as an attachment.

References

W. Leland, M. Taqqu, W. Willinger and D. Wilson. On the self-similar nature of Ethernet Traffic,IEEE/ACM Trans, Networking, 2:1-15, 1994.

K. Park y W. Willinger. Self-Similar Network Traffic and Performance Evaluation, John Wiley and Sons, New York, 2000.

K. Park y W. Willinger. Self-Similar Network Traffic: An Overview, John Wiley and Sons, New York, 2000.

I. Norros. A Storage model with self-similar input. VTT Telecommunications Otakaari 7B, FI-02150 Espoo, Finland, 1994.

Abhijit K. Choudhury y Ellen L. Hahne. Dynamic Queue Length Thresholds for Shared-Memory Packet Switches, Bell Laboratories Holmdel, NJ, USA, 1998.

A. Kesselman, Y. Mansour. Harmonic Buffer Management Policy for Shared Memory Switch, School of Computer Science, TelAviv University, Tel-Aviv, Israel, diciembre 2002.

M Arpaci, J. Copeland. Buffer Management for Shared-Memory ATM Switches. Georgia Institute of Technology, 2000.

Y. Zhou, H. Sethu. Performance of Shared Output Queuing in ATM Switches under Self-Similar Traffic, Department of ECE, Drexel University, Philadelphia, 2000.

Homayoun Yousefi’zadeh y Edmond A. Jonckheere, Dynamic Neural-Based Buffer Management for Queuing Systems with Self-Similar Characteristics, IEEE Trans. Neural Network, Special Issue on Adaptive Learning Systems in Communication Networks, 2005.

Lau W. C., Erramilli A., Wang J. L. y Willinger W. Self Similar Traffic Generation: The Random Midpoint Displacement Algorithm and Its Properties, Proceedings of IEEE ICC- 95, 1995.

M. Irland, Buffer Management in a Packet Switch. IEEE Trans. Commun., vol. COM-26, No. 3, marzo. 1978, pp. 328-37.

A. K. Thareja y A. K. Agrawala, On the Design of Optimal Policy for Sharing Finite Buffers, IEEE Trans. Común., vol. COM-32, No. 6, junio 1984, pp. 737-40.

S. X. Wei, E. J. Coyle y M. T. Hsiao, An Optimal Buffer Management Policy for High-Performance Packet Switching, Proc. IEEE GLOBECOM 91, vol., diciembre 1991, pp. 924-28.

G. L. Wu y J. W. Mark, A Buffer Allocation Écheme for ATM Networks: Complete Sharing Based on Virtual Partition, IEEE/ACM Trans. Networking, vol. 3, No. 6, diciembre 1995, pp. 660-70.

I. Cidon et al. Optimal Buffer Sharing, IEEE JSAC, vol. 13, No. 7, septiembre 1995, pp. 1229-39.

D. Veitch y P. Abry, A Wavelet-Based Joint Estimator of the Parameters of Long-Range Dependence, IEEE Trans. Informations, vol. 45, No. 3, pp. 878-879, 1998.

M. Arpaci y J. Copeland, Buffer Management for Shared-Memory ATM Switches, IEEE Communications Surveys, 2000.

Paxon V. y Floyd S. Wide Area Traffic: The Failure of Poisson Modeling, Proceedings of ACM SIGCOMM’94, 1994.

Crovella M.E. y Bestarvros A. Explaining World Wide Web traffic Self-Similarity, Technical Reports: TR-95- 015, Computer Science Department, Boston University, 1995.

Duffy D.E., McIntosh A. A. Rosenstein M. y Willinger, W., Statical Analysus of CCSN/SS7 Traffic Data from Working Subnetworks, IEEE Journal on Selected Areas in Communications, vol.12, No. 3, 1994.

Vecchio, Ricardo. Modelización de Tráfico Auto Similar y Evaluación de sus Efectos en el Tamaño de las Colas, Tesis de Maestría en Ingeniería de Telecomunicaciones, Instituto Tecnológico de Buenos Aires, 2003.