准确的网络带宽测量对许多互联网应用和协议至关重要.现有带宽测量工具如Pathchar,Bing和Bprobe都假定链路对称.但ADSL、cable modem和卫星链路等的广泛存在,使测量必须考虑非对称链路.本文提出了一种新的非对称链路测量算法(ALBMA,Asymmetric Link Bandwidth Measurement Algorithm),来测量一条路径上各链路的双向带宽,并采用核密度评估算法过滤测量噪声.仿真验证了测量和滤波算法的有效性.与先前算法相比,ALBMA具有相近的测量精度,但测量速度更快,并且耗费网络资源少.
Abstract
Accurate measurement of network bandwidth is crucial for many Internet applications and protocols. Existing band-width measurement tools such as Pathchar, Bing and Bprobe assume symmetric links. However, ADSL lines, cable modems and satellite links are popularly used, and it becomes necessary to consider asymmetric links. This paper presents a new algorithm called ALBMA (Asymmetric Link Bandwidth Measuremern Algorithm) to measure each hop's link bandwidth in both directions in an IP network, and uses the kernel density estimator algorithm to filter out measurement noise. Simulations validate ALBMA and filtering method. Compared with previous algorithms, ALBMA has alinost the same accuracy, but with higher measuring speed and lower network resource Cost.
关键词
链路带宽 /
网络带宽测量 /
非对称链路 /
测量噪声
{{custom_keyword}} /
Key words
link bandwidth /
network bandwidth measurement /
asymmetric link /
measurement noise
{{custom_keyword}} /
中图分类号:
TP393.1
{{custom_clc.code}}
({{custom_clc.text}})
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
参考文献
[1] A Barbir,et al.Known CDN request-routing mechanisms[DB/OL].http://www.globecom.net/ietf/draft/draft-cain-cdnp-known-request-routing-01.html.
[2] STOICA I,MORRIS R,et al.Chord:A scalable peer-to-peer lookup service for internet applications[A].ACM SIGCOMM,2001[C].San Diego,USA,149-160.
[3] J Kangasharju,J Roberts,K W Ross.Object replication strategies in content distribution networks[A]. WCW'2001[C].Boston,USA,2001.
[4] CHU Y,RAO S G,ZHANG H.A case for end system multicast[A].ACM SIGMETRICS,2000[C].Santa Clara,USA,2000.1-12.
[5] M E Crovella,R Frangioso,M Harchol-Balter.Connection scheduling in web servers[A].USITS'99[C].http://ns.chejue.ac.kr/~jkim/web-os/connectserver.ps.
[6] K Harfoush,A Bestavros,J Byers.Measuring Bottleneck Bandwidth of Targeted Path Segments[R].Boston University,http://www.cs.bu.edu/techreports/ps/2001-016-segment-bottleneck-bandwidth.ps,2001.
[7] S Keshav.A control-theoretic approach to flow control[A].ACM SIGCOMM'91[C].Zurich,Switzerland,1991.3-15.
[8] J C Bolot.Characterizing end-to-end packet delay and loss in the internet[J].Journal of High Speed Networks,1993,2(3):289-297.
[9] R L Carter,M E Crovella.Measuring bottleneck link speed in packet switched networks[J].International Journal on Performance Evaluation,1996,27:297-318.
[10] Allen Downey.Using pathchar to estimate internet link characteristics[A].ACM SIGCOMM '99[C].Boston,USA,241-250.
[11] V Jacobson.Pathchar-A Tool to Infer Characteristics of Internet Paths[DB/OL].ftp://ftp.ee.lbl.gov/pathchar/.
[12] B A Mah.Pchar:A tool for measuring internet path characteristics[DB/OL].http://www.employees.org/bmah/ Software/pchar/.
[13] Wenyu Jiang.Detecting and measuring asymmetric links in an IP network[R].Columbia University,http://www.cs.columbia.edu/~wenyu/papers/asym-gi99-ea.ps,1999.
[14] K Lai,M Baker.Nettimer:A tool for measuring bottleneck link bandwidth[A].USITS2001[C].San Francisco,USA,March 2001.
[15] K Lai,M Baker.Measuring bandwidth[A].IEEE INFOCOM '99[C].New York,USA,235-245.
[16] D W Scott.Multivariate Density Estimation:Theory,Practice,and Visualization[M].New York,Chichester,Chapter 6,1992.
{{custom_fnGroup.title_cn}}
脚注
{{custom_fn.content}}
基金
国家自然科学基金 (No.3204003); 国家863计划项目 (No.2001AA121052,No.2001AA121052); 高校博士学科点专项科研基金项目 (No.20010013003)
{{custom_fund}}