DocumentCode
887422
Title
A model reduction method for traffic described by MMPP with unknown rate limit
Author
Yu, Ming ; Zhou, MengChu
Author_Institution
Dept. of Electr. & Comput. Eng., State Univ. of New York, Binghamton, NY, USA
Volume
10
Issue
4
fYear
2006
fDate
4/1/2006 12:00:00 AM
Firstpage
302
Lastpage
304
Abstract
The main hindrance to apply Markovian modulated Poisson process to network traffic modeling is the state-space explosion problem in traffic aggregation. The existing rate limit algorithm cannot be directly used to reduce the model of the aggregated traffic and capture the most represented time constants (RTCs) of the traffic. In this letter, we extend the rate limit algorithm to the model reduction in terms of RTCs with unknown rate limit. We obtain a more concise form of the algorithm than the existing one. The effectiveness of the proposed method is demonstrated via a numerical example.
Keywords
Markov processes; queueing theory; reduced order systems; state-space methods; telecommunication traffic; MMPP; Markovian modulated Poisson process; RTC; model reduction method; network traffic modeling; queue length distributions; represented time constants; state-space explosion problem; traffic aggregation; unknown rate limit algorithm; Clustering algorithms; Communication system traffic; Computer displays; Computer networks; Explosions; Quantum computing; Reduced order systems; Telecommunication traffic; Time measurement; Traffic control;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2006.1613754
Filename
1613754
Link To Document