[1]LELAND W E, TAQQU M S, WILLINGER W, et al. On the self-similar nature of Ethernet traffic[J]. ACM SIGCOMM Computer Communication Review, 1993,23(4):202-213.[2]高波,张钦宇,梁永生,等.基于EMD及ARMA的自相似网络流量预测[J].通信学报,2011,32(4):47-56.[3]徐兴,岳学军,林涛.基于超爱尔兰分布的自相似网络排队模型研究[J].计算机工程与应用,2012,48(18):71-75.[4]GRASSMANN W K, LUO J X. Simulating Markov-reward processes with rare events[J]. ACM Transactions on Modeling and Computer Simulation, 2005,15(2):138-154.[5]NOGUEIRA A, SALVADOR P, VALADAS R, et al. Markovian modeling of Internet traffic[C]// Network Performance Engineering, LNCS 5223. Berlin: Springer, 2011: 98-124.[6]BONALD T. The Erlang model with non-Poisson call arrivals[J]. ACM SIGMETRICS Performance Evaluation Review, 2006,34(1):276-286.[7]高茜,冯琦,李广侠.基于组合模型的自相似业务流量预测[J].计算机科学,2012,39(4):123-126.[8]张宾,杨家海,吴建平.Internet流量模型分析与评述[J]. 软件学报, 2011,22(1):115-131.[9]MANDELBROT B B. The fractal geometry of nature[M]. [S.l.]: W.H. Freeman and Company, 1982.[10]徐志强,陈剑,陆俊.自相似混合业务流的网络性能研究[J].通信技术,2012,45(6):117-120.[11]NORROS I. A storage model with self-similar input [J]. Queueing Systems,1994,16(3/4): 387-396.[12]TAQQU M S, TEVEROVSKY V, WILLINGER W. Is network traffic self-similar or multifractal[J]. Fractals, 1997, 5(1): 63-73.[13]LAU W C, ASHOK E, WANG J L, et al. Self-similar traffic generation: the random midpoint dispalcement algorithm and its properties[C]// Proceedings of ICC '95: IEEE International Conference on Communications. Piscataway, NJ: IEEE Press, 1995: 466-472.[14]Bellcore Morristown Research and Engineering Facility. BC[EB/OL].[2011-08-29].http://ita.ee.lbl.gov/html/contrib/BC.html.[15]Lawrence berkeley laboratory. LBL-PKT [EB/OL]. [2011-01-28].http://ita.ee.lbl.gov/html/contrib/LBL-PKT.html.[16]KARAGIANNIS T, FALOUTOS M. SELFIS: a tool for self-similarity and long-range dependence analysis[EB/OL]. [2011-07-23].http://www.cs.ucr.edu/~tkarag/Selfis/Selfis.html. |