By Topic

A model reduction method for traffic described by MMPP with unknown rate limit

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ming Yu ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Binghamton, NY, USA ; MengChu Zhou

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.

Published in:

Communications Letters, IEEE  (Volume:10 ,  Issue: 4 )