DocumentCode
1689421
Title
An Aggregation Technique for Network Traffic Described by MMBP Models
Author
Yu, Ming
Author_Institution
Dept. of Electr. & Comput. Eng., Florida A&M Univ., FL
fYear
2008
Firstpage
1
Lastpage
6
Abstract
In this paper, an efficient technique is presented to model the aggregation of traffic described by Markov Modulated Bernoulli Processes (MMBP), which has been used to describe the burstiness of network traffic. For the aggregation of multiple MMBP traffic, a recursive algorithm is derived to find the parameters of the aggregated traffic models based on the buffer sizes and the number of inputs. By aggregating multiple traffic inputs into one, the complexity of network performance modeling is significantly reduced. Compared to methods by simulations, the proposed technique results in satisfied accuracy with much less computations, which are demonstrated by simulation examples.
Keywords
Markov processes; data communication; telecommunication traffic; Markov modulated Bernoulli processes; buffer size; network traffic aggregation technique; network traffic burstiness; recursive algorithm; Computational modeling; Computer networks; Educational institutions; Mathematical model; Packet switching; Routing; Switches; Telecommunication traffic; Time measurement; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE
Conference_Location
New Orleans, LO
ISSN
1930-529X
Print_ISBN
978-1-4244-2324-8
Type
conf
DOI
10.1109/GLOCOM.2008.ECP.960
Filename
4698735
Link To Document