153 search results - page 8 / 31 » An experimental study of greedy routing algorithms |
155
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
172
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
In this paper, we consider the design of a policy-based routing system and the role that link state might play. Looking at the problem from a link-state perspective, we propose Ce...
168
click to vote
MUE
2007
IEEE
16 years 26 days ago
2007
IEEE
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problem...
168
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
178
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...