Sciweavers

1089 search results - page 6 / 218
» NetComplex: A Complexity Metric for Networked System Designs
Sort
View
123
Voted
CCGRID
2003
IEEE
15 years 8 months ago
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
Farnoush Banaei Kashani, Cyrus Shahabi
CDC
2010
IEEE
149views Control Systems» more  CDC 2010»
14 years 10 months ago
Nonuniform coverage and cartograms
In this paper, we investigate nonuniform coverage of a planar region by a network of autonomous, mobile agents. We derive centralized nonuniform coverage control laws from uniform ...
Francois Lekien, Naomi Ehrich Leonard
145
Voted
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 8 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
122
Voted
ISCC
2008
IEEE
122views Communications» more  ISCC 2008»
15 years 9 months ago
A flexible network monitoring tool based on a data stream management system
Network monitoring is a complex task that generally requires the use of different tools for specific purposes. This paper describes a flexible network monitoring tool, called Pa...
Natascha Petry Ligocki, Carmem S. Hara, Christiano...
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 3 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar