Sciweavers

5079 search results - page 154 / 1016
» Hidden-Action in Network Routing
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
ISCA
2009
IEEE
186views Hardware» more  ISCA 2009»
15 years 4 months ago
Application-aware deadlock-free oblivious routing
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edwa...
ICCCN
2008
IEEE
15 years 4 months ago
STRID: Scalable Trigger-Based Route Incidence Diagnosis
—As the Internet steadily increases in importance, it is still based on a quite fragile routing design. From network operators perspective it is therefore crucial to detect end-t...
Feng Wang, Lixin Gao, Oliver Spatscheck, Jia Wang
INFOCOM
2007
IEEE
15 years 4 months ago
Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...
Haim Zlatokrilov, Hanoch Levy
ICNP
2002
IEEE
15 years 3 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman