Sciweavers

315 search results - page 9 / 63
» Dynamic vs. Oblivious Routing in Network Design
Sort
View
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
15 years 6 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
ISCAPDCS
2003
15 years 2 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
NOCS
2007
IEEE
15 years 7 months ago
Implementation and Evaluation of a Dynamically Routed Processor Operand Network
— Microarchitecturally integrated on-chip networks, or micronets, are candidates to replace busses for processor component interconnect in future processor designs. For micronets...
Paul Gratz, Karthikeyan Sankaralingam, Heather Han...
123
Voted
GLOBECOM
2007
IEEE
15 years 7 months ago
DSR-Based Directional Routing Protocol for Ad Hoc Networks
Abstract— In this paper, a Dynamic Source Routing (DSR)based directional routing protocol is invoked for wireless ad hoc networks using directional antennas. This is designed to ...
Bin Hu, Hamid Gharavi
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 1 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...