Sciweavers

141 search results - page 13 / 29
» Measurement of loss pairs in network paths
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
106
Voted
APNOMS
2006
Springer
15 years 3 months ago
An Admission Control and Traffic Engineering Model for Diffserv-MPLS Networks
Abstract. This paper presents a Bandwidth Broker (BB) based admission control and traffic engineering model for Diffserv supported MPLS networks. The proposed model uses a multi-pa...
Haci A. Mantar
101
Voted
ICNP
2007
IEEE
15 years 6 months ago
Identifying High Throughput Paths in 802.11 Mesh Networks: a Model-based Approach
Abstract— We address the problem of identifying high throughput paths in 802.11 wireless mesh networks. We introduce an analytical model that accurately captures the 802.11 MAC p...
Theodoros Salonidis, Michele Garetto, A. Saha, Edw...
INFOCOM
1999
IEEE
15 years 4 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
IDA
2010
Springer
15 years 1 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou