Ribeiro, Vinay JosephCoates, Mark J.Riedi, Rudolf H.Sarvotham, ShriramHendricks, BrentBaraniuk, Richard G.2007-10-312007-10-312000-09-012000-09-01V. J. Ribeiro, M. J. Coates, R. H. Riedi, S. Sarvotham, B. Hendricks and R. G. Baraniuk, "Multifractal Cross-Traffic Estimation," 2000.https://hdl.handle.net/1911/20249Conference PaperIn this paper we develop a novel model-based technique, the Delphi algorithm, for inferring the instantaneous volume of competing cross-traffic across an end-to-end path. By using only end-to-end measurements, Delphi avoids the need for data collection within the Internet. Unique to the algorithm is an efficient exponentially spaced probing packet train and a parsimonious multifractal parametric model for the cross-traffic that captures its multiscale statistical properties (including long-range dependence) and queuing behavior. The algorithm is adaptive; it requires no a priori traffic statistics and effectively tracks changes in network conditions. NS (network simulator) experiments reveal that Delphi gives accurate ross-traffic estimates for higher link utilization levels while at lower utilizations it over-estimates the cross-traffic. Also, when Delphi's single bottleneck assumption does not hold it over-estimates the cross-traffic.engDelphi algorithmnetwork simulator (NS)cross-trafficmultifractalestimationMultifractalsConference paperDelphi algorithmnetwork simulator (NS)cross-trafficmultifractalestimation