2 research outputs found

    Landmark-Based End-to-End Bandwidth Inference

    No full text

    Landmark-based End-to-End Bandwidth Inference

    No full text
    acy of the estimations. For a direct path joining two peers, we estimate its end-toend bandwidth using the following class of linear functions: EB = i=1 P i BB i , (1) where BB i is the bandwidth of the indirect path that passes by landmark L i , and P i is a normalized weight (i.e., i=1 P i = 1) assigned to this indirect path based on the location of its corresponding landmark with respect to the two peers. By varying the weight P i , we are able to cover different policies for bandwidth estimation ranging from the one that gives the same priority to all landmarks to the one that privileges the landmark that we deem the most suitable for the direct path bandwidth inference. In [5], the authors observe that 8 to 12 landmarks are enough for a good delay estimation at the scale of the Internet. We consider the same number of landmarks for bandwidth estimation. Therefore, we take 8 Planetlab nodes [1] selected from different European countries as landmarks. We also take 14 Pl
    corecore