117 search results - page 10 / 24 » Minimizing the Diameter of a Network Using Shortcut Edges |
ISCA
2008
IEEE
13 years 7 months ago
2008
IEEE
Evolving technology and increasing pin-bandwidth motivate the use of high-radix routers to reduce the diameter, latency, and cost of interconnection networks. High-radix networks,...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...
IWDC
2005
Springer
14 years 1 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...