Internet traffic modeling: Markovian approach to self-similar traffic and prediction of loss probability for finite queues

被引:0
|
作者
Kasahara, S. [1 ]
机构
[1] Graduate Sch. of Information Science, Nara Inst. of Science and Technology, Ikomashi, 630-0101, Japan
关键词
Computer simulation - Markov processes - Packet switching - Poisson distribution - Probability - Queueing networks - Statistical methods - Telecommunication traffic;
D O I
暂无
中图分类号
学科分类号
摘要
It has been reported that IP packet traffic exhibits the self-similar nature and causes the degradation of network performance. Therefore it is crucial for the appropriate buffer design of routers and switches to predict the queueing behavior with self-similar input. It is well known that the fitting methods based on the second-order statistics of counts for the arrival process are not sufficient for predicting the performance of the queueing system with self-similar input. However recent studies have revealed that the loss probability of finite queuing system can be well approximated by the Markovian input models. This paper studies the time-scale impact on the loss probability of MMPP/D/1/K system where the MMPP is generated so as to match the variance of the self-similar process over specified time-scales. We investigate the loss probability in terms of system size, Hurst parameters and time-scales. We also compare the loss probability of resulting MMPP/D/1/K with simulation. Numerical results show that the loss probability of MMPP/D/1/K are not significantly affected by time-scale and that the loss probability is well approximated with resulting MMPP/D/1/K.
引用
收藏
相关论文
共 50 条
  • [41] Modeling and Simulation of Self-Similar Wireless IP Network Traffic
    Radev, Dimitar
    Lokshina, Izabella
    WTS: 2009 WIRELESS TELECOMMUNICATIONS SYMPOSIUM, 2009, : 10 - +
  • [42] Modeling and performance analysis of self-similar traffic based on FBM
    Tan, Xianhai
    Huang, Yuanhui
    Jin, Weidong
    2007 IFIP INTERNATIONAL CONFERENCE ON NETWORK AND PARALLEL COMPUTING WORKSHOPS, PROCEEDINGS, 2007, : 543 - +
  • [43] Consequences of ignoring self-similar data traffic in telecommunications modeling
    Fiorini, PM
    Lipsky, L
    INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 10TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 1997, : 322 - 327
  • [44] Bandwidth allocation bounds for α-stable self-similar internet traffic models
    Karasaridis, A
    Hatzinakos, D
    PROCEEDINGS OF THE IEEE SIGNAL PROCESSING WORKSHOP ON HIGHER-ORDER STATISTICS, 1999, : 214 - 218
  • [45] Is network traffic self-similar or multifractal?
    Taqqu, MS
    Teverovsky, V
    Willinger, W
    FRACTALS-AN INTERDISCIPLINARY JOURNAL ON THE COMPLEX GEOMETRY OF NATURE, 1997, 5 (01): : 63 - 73
  • [46] Fast simulation of self-similar traffic
    Li, JS
    Wolisz, A
    Popescu-Zeletin, R
    ICC 98 - 1998 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS VOLS 1-3, 1998, : 1829 - 1833
  • [47] On the self-similar nature of ethernet traffic
    Leland, Will E.
    Willinger, Walter
    Taqqu, Murad S.
    Wilson, Daniel V.
    Computer Communication Review, 1995, 25 (01): : 202 - 213
  • [48] Self-similar traffic and network dynamics
    Erramilli, A
    Roughan, M
    Veitch, D
    Willinger, W
    PROCEEDINGS OF THE IEEE, 2002, 90 (05) : 800 - 819
  • [49] Capacity allocation for self-similar traffic
    Liu, M
    2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS, 2003, : 178 - 182
  • [50] On burstiness of self-similar traffic models
    Chen, FHM
    Mellor, J
    Mars, P
    ATM, NETWORKS AND LANS - NOC '96-II, 1996, : 146 - 153