153 search results - page 8 / 31 » An experimental study of greedy routing algorithms |
IMC
2007
ACM
14 years 11 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 ...
ICDCS
2009
IEEE
15 years 6 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...
MUE
2007
IEEE
15 years 3 months 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...
82
Voted
KDD
2009
ACM
15 years 10 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 ...
DAC
1995
ACM
15 years 1 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...