Measuring Capacity Bandwidth of Targeted Path Segments

Network Bandwidth measurement is important for many Internet Applications and protocols. Accurate measurement of network bandwidth are useful to network operators who are concerned with problems such as capacity provisioning, traffic engineering, network trouble shooting and verification of service level agreements(SLAs).

Normally files are transferred from one host to other host. According to the files size and the time, the bandwidth is calculated. If bandwidth changes the time varies. If time delay changes the bandwidth varies. These three parameters file size, bandwidth and time delay of the data transmission depend on path and the distance. Here Min Max Algorithm has been used to check the various values of the data size, distance, bandwidth and the time delay.

Existing System:

Existing work has focused on two approaches to measuring bandwidth: measuring it hop-by-hop, and measuring it end-to-end along a path. Unfortunately, best-practice techniques for the former are inefficient and techniques for the latter are only able to observe bottlenecks visible at end-to-end scope. In the present real time system, data transmission will be calculated by checking the size and the distance of the data node respectively.

Proposed System:

We develop end-to-end probing methods which can measure bottleneck capacity bandwidth along arbitrary, targeted sub paths of a network, shared by a set of flows. We evaluate our technique through ns simulations, and then provide a comparative performance evaluation against hop-by-hop and end-to-end techniques. This system measures the bandwidth which is the main factor of the data transmission. Here the accurate and the low, high level values will be calculated using the Min-Max Algorithm.