Sciweavers

552 search results - page 49 / 111
» Routing complexity of faulty networks
Sort
View
CCR
2002
86views more  CCR 2002»
13 years 7 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
ICNP
2009
IEEE
14 years 2 months ago
Better by a HAIR: Hardware-Amenable Internet Routing
—Routing protocols are implemented in the form of software running on a general-purpose microprocessor. However, conventional software-based router architectures face significan...
Firat Kiyak, Brent Mochizuki, Eric Keller, Matthew...
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
14 years 28 days ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik
GLOBECOM
2006
IEEE
14 years 1 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji
IEEEPACT
1997
IEEE
13 years 12 months ago
Empirical Evaluation of Deterministic and Adaptive Routing with Constant-Area Routers
This paper addresses the issue of how router complexity a ects the overall performance in deterministic and adaptive routing under virtual cut-through switching in k-ary n-cube ne...
Dianne Miller, Walid A. Najjar