Date of Award


Publication Type

Master Thesis

Degree Name



Computer Science

First Advisor

Aggarwal, A. K.


Computer Science.




Network bandwidth is an important resource in the Internet. As greater numbers of people and companies implement their businesses using the Internet, the measurement of network bandwidth, especially the bottleneck-link bandwidth, becomes a critical and challenging issue. To improve the practicability, accuracy and performance of existing network-bandwidth measurement algorithms, such as PathChar, Bprobe and Cartouche algorithm, we have developed a new method: PATH (PAcket-Train with Header) algorithm. PATH is the combination of single-packet and packet-pair algorithms. It is a sender-based algorithm that is straightforward to implement in the Internet. To verify and improve upon the PATH algorithm, we have developed a user-friendly tool: BAMA (BAndwidth Measurement Algorithms) simulator. It can simulate most network bottleneck bandwidth algorithms. By using this BAMA simulator and Network Simulator to implement the PATH algorithm and compare it with the other algorithms, we prove that, under heavy cross traffic, PATH is more accurate than existing sender-based algorithms. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2003 .W45. Source: Masters Abstracts International, Volume: 42-03, page: 0977. Adviser: A. K. Aggarwal. Thesis (M.Sc.)--University of Windsor (Canada), 2003.