Sciweavers

1574 search results - page 158 / 315
» Efficient QoS Routing
Sort
View
TON
2008
99views more  TON 2008»
15 years 6 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
FCCM
2009
IEEE
123views VLSI» more  FCCM 2009»
15 years 10 months ago
Scalable High Throughput and Power Efficient IP-Lookup on FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. Due to the available on-chip memory and the number of I/O pins of Field Programmab...
Hoang Le, Viktor K. Prasanna
NETWORKING
2007
15 years 8 months ago
Maximum Energy Welfare Routing in Wireless Sensor Networks
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Sound...
VLSISP
2008
95views more  VLSISP 2008»
15 years 6 months ago
A New Routing Metric for Satisfying Both Energy and Delay Constraints in Wireless Sensor Networks
Besides energy constraint, wireless sensor networks should also be able to provide bounded communication delay when they are used to support real-time applications. In this paper,...
Najet Boughanmi, Yeqiong Song
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 6 months ago
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
Peter Sanders