• Title/Summary/Keyword: MAP Inter-arrival Time

Search Result 3, Processing Time 0.019 seconds

Performance Evaluation according to MAP Inter-arrival Time for DOCSIS 3.0 based HFC network (DOCSIS 3.0 프로토콜에서 MAP 주기에 따른 성능평가)

  • Song, Jae-Jun;Kim, Young-Sung;Roh, Sun-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.65-68
    • /
    • 2007
  • DOCSIS 3.0 MAC protocol regulate CM and CMTS Channel transfer times through MAP message. Standards does not include the details of MAP Inter-arrival Time affecting the performance of MAC protocols for DOCSIS 3.0. In this paper, we evaluationed the performance of protocol follow in MAP Inter-arrival Time on DOCSIS 3.0. Based on the evaluation results, we propose the optimal MAP Inter-arrival Time. We found that the protocol shows best performance when the MAP Inter-arrival Time is 0.05sec. The research results can apply to performance element which important for the construction of DOCSIS 3.0 base cable networks.

  • PDF

Performance Evaluation according to MAP Inter-arrival Time for DOCSIS 3.0 based Cable Network (DOCSIS3.0 기반 케이블망에서 MAP 주기에 따른 성능평가)

  • Roh, Sun-Sik;Song, Jae-Jun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1069-1076
    • /
    • 2007
  • DOCSIS 3.0 protocol are proposed to support high-speed cable network DOCSIS 3.0 MAC protocol regulates CM and CMTS channel transfer times through MAP message. So MAP Inter-arrival time is primary factor of network performance. However, standards does not include the details of MAP Inter-arrival Time affecting the performance of MAC protocols for DOCSIS 3.0. In this paper, we evaluated the performance of DOCSIS 3.0 protocol follow in MAP Inter-arrival Time. Based on the evaluation results, we propose the optimal MAP Inter-arrival Time. We found that the protocol shows best performance when the MAP Inter-arrival Time is 0.05sec. The research results can apply to performance element which important for the construction of DOCSIS 3.0 base cable networks.

Application of GTH-like algorithm to Markov modulated Brownian motion with jumps

  • Hong, Sung-Chul;Ahn, Soohan
    • Communications for Statistical Applications and Methods
    • /
    • v.28 no.5
    • /
    • pp.477-491
    • /
    • 2021
  • The Markov modulated Brownian motion is a substantial generalization of the classical Brownian Motion. On the other hand, the Markovian arrival process (MAP) is a point process whose family is dense for any stochastic point process and is used to approximate complex stochastic counting processes. In this paper, we consider a superposition of the Markov modulated Brownian motion (MMBM) and the Markovian arrival process of jumps which are distributed as the bilateral ph-type distribution, the class of which is also dense in the space of distribution functions defined on the whole real line. In the model, we assume that the inter-arrival times of the MAP depend on the underlying Markov process of the MMBM. One of the subjects of this paper is introducing how to obtain the first passage probabilities of the superposed process using a stochastic doubling algorithm designed for getting the minimal solution of a nonsymmetric algebraic Riccatti equation. The other is to provide eigenvalue and eigenvector results on the superposed process to make it possible to apply the GTH-like algorithm, which improves the accuracy of the doubling algorithm.