A modified MAP in performance evaluation of asynchronous packet traffic

Markov arrival process (MAP) is the most widely used traffic model to analyze performance of a node of an asynchronous packet traffic. Recent literatures make transition between overload and underload states of a node without arrival but sometimes transition may take place from underload to overload...

Full description

Saved in:
Bibliographic Details
Main Authors: Roy, A., Hossain, M.J., Islam, M.I.
Format: Conference Proceeding
Language:English
Subjects:
Computer science
DH-HEMTs
Generator matrix
Information technology
Markov processes
MMPP
PH distribution
Probability density function
sojourn time and transition probability matrix
State-space methods
Stochastic processes
Switching circuits
Telecommunication traffic
Traffic control
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Markov arrival process (MAP) is the most widely used traffic model to analyze performance of a node of an asynchronous packet traffic. Recent literatures make transition between overload and underload states of a node without arrival but sometimes transition may take place from underload to overload with an arrival which deviates our analysis from the present literature of Markov modulated Poisson process (MMPP) traffic model. In this paper two different rates of packet `arrival' and `non arrival' is incorporated in state transition of underload to overload and a comparison is made with previous literatures.
DOI:10.1109/ICCIT.2009.5407163