Sciweavers

1657 search results - page 164 / 332
» Network flow spanners
Sort
View
98
Voted
CCR
2008
94views more  CCR 2008»
15 years 27 days ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
IMC
2010
ACM
14 years 10 months ago
Flowroute: inferring forwarding table updates using passive flow-level measurements
The reconvergence of routing protocols in response to changes in network topology can impact application performance. While improvements in protocol specification and implementati...
Amogh Dhamdhere, Lee Breslau, Nick G. Duffield, Ch...
110
Voted
MOBIHOC
2004
ACM
16 years 11 days ago
Towards mobility as a network control primitive
In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlle...
David Kiyoshi Goldenberg, Jie Lin, A. Stephen Mors...
119
Voted
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
16 years 1 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...
102
Voted
INFOCOM
2003
IEEE
15 years 6 months ago
Time-Optimal Network Queue Control: The Case of a Single Congested Node
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
Mahadevan Iyer, Wei Kang Tsai