Sciweavers

557 search results - page 61 / 112
» On Fast Estimation of Network Bandwidth
Sort
View
114
Voted
COMCOM
2007
99views more  COMCOM 2007»
15 years 3 months ago
Topology-aware overlay path probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n2 ), which is prohibitive in large-scale...
Chiping Tang, Philip K. McKinley
154
Voted
IM
2007
15 years 4 months ago
Estimating End-to-End Performance by Collaborative Prediction with Active Sampling
— Accurately estimating end-to-end performance in distributed systems is essential both for monitoring compliance with service-level agreements (SLAs) and for performance optimiz...
Irina Rish, Gerald Tesauro
127
Voted
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 3 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
166
Voted
TIT
2008
141views more  TIT 2008»
15 years 3 months ago
Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Olivier Roy, Martin Vetterli
ISCA
2009
IEEE
186views Hardware» more  ISCA 2009»
15 years 10 months ago
Application-aware deadlock-free oblivious routing
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edwa...