478 search results - page 49 / 96 » Diameter and Center Computations in Networks |
108
click to vote
NCA
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
109
click to vote
IWQOS
2004
Springer
15 years 5 months ago
2004
Springer
— Traditional SLAs, defined by average delay or packet loss, often camouflage the instantaneous performance perceived by end-users. We define a set of metrics for service avai...
GD
2009
Springer
15 years 3 months ago
2009
Springer
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract--The paper introduces DILOC, a distributed, iterative algorithm to locate sensors (with unknown locations) in 1, with respect to a minimal number of + 1 anchors with known...
WCNC
2010
IEEE
15 years 3 months ago
2010
IEEE
—When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportional amount of relayin...