| Providing QoS guarantees for self-similar traffic flows |
| |
| 引用本文： | Wen Jun 1,Zhang Rui 2 & Lu Xianliang 11. Computer Institute,University of Electronic Science and Technology of China,Chengdu 610054,P. R. China,2. Datacraft Corporation,Chengdu 610017,P. R. China. Providing QoS guarantees for self-similar traffic flows[J]. 系统工程与电子技术(英文版), 2005, 16(1) |
| |
| 作者姓名： | Wen Jun 1 Zhang Rui 2 & Lu Xianliang 11. Computer Institute University of Electronic Science and Technology of China Chengdu 610054 P. R. China 2. Datacraft Corporation Chengdu 610017 P. R. China |
| |
| 作者单位： | Wen Jun 1，Zhang Rui 2 & Lu Xianliang 11. Computer Institute，University of Electronic Science and Technology of China，Chengdu 610054，P. R. China;2. Datacraft Corporation，Chengdu 610017，P. R. China |
| |
| 基金项目： | ThisprojectwassupportedbytheYoungFundofUniversityofElectronicScience&TechnologyandChinaScholarship Council. |
| |
| 摘 要： | 1.INTRODUCTION Recentanalysesofvariouspacket basednetworking showthatnetworktraffichasvariabilityovermany timescales.Itsperformancedifferswithresultsof queuetheorythatisbasedonthePoissondistribu tion.Statisticalanalysesoflargetrafficdatasetshave revealedthatthestatisticalcharacteristicsofrealtraf ficmaybebestdescribedbyself similarity.Self simi larityimpliesthepresenceoflong rangedependence (LRD)inthetraffic.Thatis,thereexistnon negli giblepositivecorrelationintheburstbehaviorofthe …
|
Providing QoS guarantees for self-similar traffic flows |
| |
| Wen Jun,Zhang Rui,Lu Xianliang. Providing QoS guarantees for self-similar traffic flows[J]. Journal of Systems Engineering and Electronics, 2005, 16(1) |
| |
| Authors: | Wen Jun Zhang Rui Lu Xianliang |
| |
| Affiliation: | 1. Computer Institute, University of Electronic Science and Technology of China, Chengdu 610054, P. R. China
2. Datacraft Corporation, Chengdu 610017, P. R. China |
| |
| Abstract: | Provisioning network resource to meet the quality of Service (QoS) demand is a key issue for future network services. Such functions may be realized by an admission control algorithm, which determines whether or not a new traffic flow can be admitted into the network. It is widely accepted that many traffic flows have self-similar character that has detrimental influence on network performance. This characteristic has made old mathematical models invalid, and a new model must work with self-similar fractal instead. This paper applies Fractional Brownian Motion(FBM) model and integrates it into the comprehensive admission control scheme, which takes account of aggregated traffic behavior to get the statistical multiplexing performance gain. Experiment verifies that FBM model can be used to realistically describe packet traffic in modern packet networks and accurately predict their performance. |
| |
| Keywords: | self-similar traffic QoS call admission control fractional brownian motion. |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
