2808 search results - page 144 / 562 » Routing betweenness centrality |
139
click to vote
INFOCOM
2005
IEEE
16 years 1 days ago
2005
IEEE
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
171
click to vote
DIALM
1999
ACM
15 years 10 months ago
1999
ACM
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
165
click to vote
DATE
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper presents a zero-skew gated clock routing technique for VLSI circuits. The gated clock tree has masking gates at the internal nodes of the clock tree, which are selectiv...
149
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
144
click to vote
ATMOS
2009
15 years 7 months ago
2009
We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while m...