3319 search results - page 332 / 664 » The topology of dark networks |
169
click to vote
WIOPT
2006
IEEE
16 years 24 days ago
2006
IEEE
— This paper examines the achievable performance gains when a particular class of cooperative relaying known as best-select is employed. In essence, best-select seeks to improve ...
142
click to vote
IPTPS
2005
Springer
16 years 9 days ago
2005
Springer
A great deal of work has been done to improve peerto-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer arc...
174
click to vote
IPPS
2003
IEEE
16 years 2 days ago
2003
IEEE
This work presents a new switching mechanism to tolerate arbitrary faults in interconnection networks with a negligible implementation cost. Although our routing technique can be ...
177
click to vote
AICCSA
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper presents a novel approach based on clustering algorithms in combination with the location area (LA) scheme to solve the mobility management problem. Users' movemen...
161
click to vote
SIROCCO
2010
15 years 8 months ago
2010
This paper studies local-control strategies to estimate the size of a certain event affecting an arbitrary connected subset of nodes in a network. For example, our algorithms allow...