Multifractal Cross-Traffic Estimation

dc.citation.bibtexNameinproceedingsen_US
dc.citation.conferenceNameITC Conference on IP Traffic, Modeling and Managementen_US
dc.citation.locationMonterey, CAen_US
dc.contributor.authorRibeiro, Vinay Josephen_US
dc.contributor.authorCoates, Mark J.en_US
dc.contributor.authorRiedi, Rudolf H.en_US
dc.contributor.authorSarvotham, Shriramen_US
dc.contributor.authorHendricks, Brenten_US
dc.contributor.authorBaraniuk, Richard G.en_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.date.accessioned2007-10-31T01:00:17Zen_US
dc.date.available2007-10-31T01:00:17Zen_US
dc.date.issued2000-09-01en_US
dc.date.modified2006-06-05en_US
dc.date.note2001-09-04en_US
dc.date.submitted2000-09-01en_US
dc.descriptionConference Paperen_US
dc.description.abstractIn 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.en_US
dc.description.sponsorshipDefense Advanced Research Projects Agencyen_US
dc.description.sponsorshipOffice of Naval Researchen_US
dc.description.sponsorshipNational Science Foundationen_US
dc.identifier.citationV. J. Ribeiro, M. J. Coates, R. H. Riedi, S. Sarvotham, B. Hendricks and R. G. Baraniuk, "Multifractal Cross-Traffic Estimation," 2000.en_US
dc.identifier.urihttps://hdl.handle.net/1911/20249en_US
dc.language.isoengen_US
dc.subjectDelphi algorithmen_US
dc.subjectnetwork simulator (NS)en_US
dc.subjectcross-trafficen_US
dc.subjectmultifractalen_US
dc.subjectestimationen_US
dc.subject.keywordDelphi algorithmen_US
dc.subject.keywordnetwork simulator (NS)en_US
dc.subject.keywordcross-trafficen_US
dc.subject.keywordmultifractalen_US
dc.subject.keywordestimationen_US
dc.subject.otherMultifractalsen_US
dc.titleMultifractal Cross-Traffic Estimationen_US
dc.typeConference paperen_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
Rib2000Sep5Multifract.PDF
Size:
216.04 KB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
Rib2000Sep5Multifract.PS
Size:
603.33 KB
Format:
Postscript Files