Sciweavers

766 search results - page 116 / 154
» Network tomography on general topologies
Sort
View
IJON
2010
94views more  IJON 2010»
14 years 10 months ago
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
Fabrice Rossi, Nathalie Villa-Vialaneix
IWCMC
2006
ACM
15 years 5 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 5 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
SENSYS
2003
ACM
15 years 5 months ago
Spatiotemporal multicast in sensor networks
Sensor networks often involve the monitoring of mobile phenomena. We believe this task can be facilitated by a spatiotemporal multicast protocol which we call “mobicast”. Mobi...
Qingfeng Huang, Chenyang Lu, Gruia-Catalin Roman
ANCS
2007
ACM
15 years 3 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan