155 search results - page 8 / 31 » A New Necessary Condition for Shortest Path Routing |
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—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. ...
TON
2010
13 years 5 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
ISCC
2003
IEEE
14 years 19 days ago
2003
IEEE
Multiple Description (MD) and Layered Coding (LC) are two source-coding approaches proposed for adaptive and robust video streaming over lossy networks. Both streaming methods aim...
SIGCOMM
1989
ACM
13 years 11 months ago
1989
ACM
The ARPANBT routing metric wasrevised in July 1987,resulting in substantial performance improvements, especially in terms of user delay and effective network capacity. These revis...
AINA
2008
IEEE
14 years 1 months ago
2008
IEEE
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...