Sciweavers

364 search results - page 15 / 73
» Shortest-path network interdiction
Sort
View
CN
2007
104views more  CN 2007»
13 years 7 months ago
Performance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
S. S. Dhillon, Piet Van Mieghem
HICSS
2012
IEEE
251views Biometrics» more  HICSS 2012»
12 years 3 months ago
Topology Skewing for Improved Route Selection in Wireless Multi-hop Networks
—The selection of a path in a network from one node to another is performed by a routing protocol, often using the shortest path approach. However, it has been shown that in wire...
Winston Khoon Guan Seah, Alvin C. Valera, Pius W. ...
ICDCS
2012
IEEE
11 years 10 months ago
Optimal Recovery from Large-Scale Failures in IP Networks
—Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures ...
Qiang Zheng, Guohong Cao, Tom La Porta, Ananthram ...
INFOCOM
2011
IEEE
12 years 11 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari
LCN
1999
IEEE
13 years 11 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen