1095 search results - page 105 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
142
click to vote
AINA
2005
IEEE
15 years 10 months ago
2005
IEEE
The rapid development of Internet makes network management on large-scale network a critical issue. But with the management task of large-scale network becoming more complicated, ...
148
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
147
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
142
click to vote
ICDCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today’s Internet as a viable ...
153
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...