TY - JOUR
T1 - Network and user driven alpha-beta on-off source model for network traffic
AU - Sarvotham, Shriram
AU - Riedi, Rudolf
AU - Baraniuk, Richard
N1 - Funding Information:
Richard G. Baraniuk received the B.Sc. degree in 1987 from the University of Manitoba, the M.Sc. degree in 1988 from the University of Wisconsin-Madison, and the Ph.D. degree in 1992 from the University of Illinois at Urbana-Champaign, all in Electrical Engineering. After spending 1992–1993 at Ecole Normale Superieure in Lyon, France, he joined Rice University in Houston, Texas, where he is currently the Victor E. Cameron Professor. His research interests lie in the areas of statistical and distributed signal processing and communications networks. Dr. Baraniuk received a NATO postdoctoral fellowship from NSERC in 1992, the National Young Investigator award from NSF in 1994, a Young Investigator Award from ONR in 1995, the Rosenbaum Fellowship from the Isaac Newton Institute of Cambridge University in 1998, the C. Holmes MacDonald National Outstanding Teaching Award from Eta Kappa Nu in 1999, the Charles Duncan Junior Faculty Achievement Award from Rice in 2000, the ECE Young Alumni Achievement Award from the University of Illinois in 2000, and the George R. Brown Award for Superior Teaching at Rice in 2001 and 2003. He was co-author on a paper with Matthew Crouse and Robert Nowak that won the IEEE Signal Processing Society Junior Paper Award in 2001 and another with Vinay Ribeiro and Rolf Riedi that won the Passive and Active Measurement (PAM) Workshop Best Student Paper Award in 2003. He was elected a Fellow of the IEEE in 2001 and a Plus Member of AAA in 1986.
Funding Information:
This work was supported by NSF grant ANI-0099148, DARPA/AFRL grant F30602-00-2-0557, DOE SciDAC grant DE-FC02-01ER25462, and Texas Instruments Leadership University Program.
Funding Information:
Rudolf H. Riedi received the MSc degree in 1986 and the PhD degree in 1993, both from the Federal Institute of Technology ETH Zurich (Switzerland) in Mathematics. From 1993–1995 he was with B. Mandelbrot at the Mathematics Department of Yale University in New Haven, Connecticut. After spending 1995–1997 with the National Research Institute in Automation and Computing INRIA in Paris, France, he joined the Electrical and Computer Engineering Department at Rice University in Houston, Texas. From there he moved to the Dept. of Statistics at Rice University where he is currently an assistant professor. His research interests lie in the theory and practice of multiscale stochastic modeling and statistical inference, especially for networks in communication and economics. Dr. Riedi won the ETHZ Polya prize in 1986 and received a postdoctoral fellowship from the National Science Foundation of Switzerland in 1993. At Rice he has won research grants from NSF (2001, co-PI), DoE (2001, co-PI), DARPA (2000, acting PI), NSF (2003, PI) and ATP (2003, co-PI), and consulted with AT&T Labs. He served as a guest-editor for the IEEE Transactions on Signal Processing in 2002 and is on the technical program committee of the IEEE Infocom conference since 2003.
PY - 2005/6/21
Y1 - 2005/6/21
N2 - We shed light on the effect of network resources and user behavior on network traffic through a physically motivated model. The classical on-off model successfully captures the long-range, second-order correlations of traffic, allowing us to conclude that transport protocol mechanisms have little influence at time scales beyond the round trip time. However, the on-off model fails to capture the short-range spikiness of traffic, where protocols and congestion control mechanisms have greater influence. Based on observations at the connection-level we conclude that small rate sessions can be characterized by independent duration and rate, while large rate sessions have independent file size and rate. In other words, user patience is the limiting factor of small bandwidth connections, while users with large bandwidth freely choose their files. We incorporate these insights into an improved two-component on-off model-which we call the alpha-beta on-off model-comprising an aggressive alpha component (high rate, large transfer) and passive beta component (residual). We analyze the performance of our alpha-beta on-off model and use it to better understand the causes of burstiness and long-range dependence in network traffic. Our analysis yields new insights on Internet traffic dynamics, the effectiveness of congestion control, the performance of potential future network architectures, and the key parameters required for realistic traffic synthesis.
AB - We shed light on the effect of network resources and user behavior on network traffic through a physically motivated model. The classical on-off model successfully captures the long-range, second-order correlations of traffic, allowing us to conclude that transport protocol mechanisms have little influence at time scales beyond the round trip time. However, the on-off model fails to capture the short-range spikiness of traffic, where protocols and congestion control mechanisms have greater influence. Based on observations at the connection-level we conclude that small rate sessions can be characterized by independent duration and rate, while large rate sessions have independent file size and rate. In other words, user patience is the limiting factor of small bandwidth connections, while users with large bandwidth freely choose their files. We incorporate these insights into an improved two-component on-off model-which we call the alpha-beta on-off model-comprising an aggressive alpha component (high rate, large transfer) and passive beta component (residual). We analyze the performance of our alpha-beta on-off model and use it to better understand the causes of burstiness and long-range dependence in network traffic. Our analysis yields new insights on Internet traffic dynamics, the effectiveness of congestion control, the performance of potential future network architectures, and the key parameters required for realistic traffic synthesis.
KW - Alpha-beta on-off model
KW - Long-range dependence
KW - Network traffic
UR - http://www.scopus.com/inward/record.url?scp=17644386851&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=17644386851&partnerID=8YFLogxK
U2 - 10.1016/j.comnet.2004.11.024
DO - 10.1016/j.comnet.2004.11.024
M3 - Article
AN - SCOPUS:17644386851
SN - 1389-1286
VL - 48
SP - 335
EP - 350
JO - Computer Networks
JF - Computer Networks
IS - 3
ER -