Sciweavers

364 search results - page 27 / 73
» Shortest-path network interdiction
Sort
View
ITCC
2003
IEEE
14 years 25 days ago
Alternate Path Routing Algorithm for Traffic Engineering in the Internet
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...
Shyam Subramanian, Muthukumar Venkatesan
ORL
2010
85views more  ORL 2010»
13 years 6 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...
CVPR
2011
IEEE
13 years 5 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes
INFOCOM
2008
IEEE
14 years 1 months ago
Circular Sailing Routing for Wireless Networks
Abstract—Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the short...
Fan Li, Yu Wang 0003
LCN
2003
IEEE
14 years 25 days ago
Improving Multicast Tree Construction in Static Ad Hoc Networks
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast ...
Aleksi Penttinen, Jorma T. Virtamo