Dynamic neural-based buffer management for queuing systems with self-similar characteristics

被引:17
|
作者
Yousefi'zadeh, H [1 ]
Jonckheere, EA
机构
[1] Univ Calif Irvine, Dept Elect Engn & Comp Sci, Irvine, CA 92717 USA
[2] Univ So Calif, Dept Elect Engn Syst, Los Angeles, CA 90007 USA
来源
IEEE TRANSACTIONS ON NEURAL NETWORKS | 2005年 / 16卷 / 05期
关键词
Buffer management; fairness; neural network teletraffic forecasting; packet loss; water-filling;
D O I
10.1109/TNN.2005.853417
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Buffer management in queuing systems plays an important role in addressing the tradeoff between efficiency measured in terms of overall packet loss and fairness measured in terms of individual source packet loss. Complete partitioning (CP) of a buffer with the best fairness characteristic and complete sharing (CS) of a buffer with the best efficiency characteristic are at the opposite ends of the spectrum of buffer management techniques. Dynamic partitioning buffer management techniques aim at addressing the tradeoff between efficiency and fairness. Ease of implementation is the key issue when determining the practicality of a dynamic buffer management technique. In this paper, two novel dynamic buffer management techniques for queuing systems accommodating self-similar traffic patterns are introduced. The techniques take advantage of the adaptive learning power of perceptron neural networks when applied to arriving traffic patterns of queuing systems. Relying on the water-filling approach, our proposed techniques are capable of coping with the tradeoff between packet loss and fairness issues. Computer simulations reveal that both of the proposed techniques enjoy great efficiency and fairness characteristics as well as ease of implementation.
引用
收藏
页码:1163 / 1173
页数:11
相关论文
共 50 条
  • [1] Buffer overflow simulation in self-similar queuing networks with finite buffer capacity
    [J]. Lokshina, Izabella V., 1600, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (05):
  • [2] A neural-based technique for estimating self-similar traffic average queueing delay
    Yousefi'zadeh, H
    [J]. IEEE COMMUNICATIONS LETTERS, 2002, 6 (10) : 419 - 421
  • [3] Buffer Management for Self-Similar Network Traffic
    Amin, Faranz
    Mizanian, Kiarash
    [J]. 2012 SIXTH INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS (IST), 2012, : 737 - 742
  • [4] Buffer Overflow Simulation in Self-Similar Queuing Networks with Finite Buffer Capacity Accelerated Using RESTART/LRE
    Lokshina, Izabella
    Schiele, Evan
    [J]. 2015 WIRELESS TELECOMMUNICATIONS SYMPOSIUM (WTS), 2015,
  • [5] Neural-based identification for nonlinear dynamic systems
    Stegmayer, G
    [J]. PROCEEDINGS OF THE 2005 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE FOR MEASUREMENT SYSTEMS AND APPLICATIONS, 2005, : 290 - 294
  • [6] Self-similar characteristics of neural networks based on Fokker-Planck equation
    Kamitani, Y
    Matsuba, I
    [J]. CHAOS SOLITONS & FRACTALS, 2004, 20 (02) : 329 - 335
  • [7] Accelerated Buffer Overflow Simulation in Self-Similar Queuing Networks with Long-Range Dependent Processes and Finite Buffer Capacity
    Lokshina, Izabella
    Wendt, Thomas
    Lanting, Cees
    [J]. 2016 3RD INTERNATIONAL SYMPOSIUM ON WIRELESS SYSTEMS WITHIN THE CONFERENCES ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS (IDAACS-SWS), 2016, : 5 - 10
  • [8] Self-similar pattern formation and continuous mechanics of self-similar systems
    Dyskin, A. V.
    [J]. HYDROLOGY AND EARTH SYSTEM SCIENCES, 2007, 11 (02) : 665 - 676
  • [9] Efficient estimation of buffer occupancy in ATM systems loaded by self-similar traffic
    Giordano, S
    Pagano, M
    Russo, F
    Tartarelli, S
    [J]. IEEE ATM '97 WORKSHOP, PROCEEDINGS, 1997, : 595 - 602
  • [10] Queuing Analysis of Self-similar Traffic in Rayleigh Fading Channel
    Liu Chang
    Qin Xiaowei
    Zhang Sihai
    Zhou Wuyang
    [J]. NSWCTC 2009: INTERNATIONAL CONFERENCE ON NETWORKS SECURITY, WIRELESS COMMUNICATIONS AND TRUSTED COMPUTING, VOL 1, PROCEEDINGS, 2009, : 287 - 291