55 search results - page 3 / 11 » Engineering Fast Route Planning Algorithms |
DAC
2003
ACM
13 years 10 months ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
TON
2008
13 years 4 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
WEA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
ESA
2008
Springer
13 years 7 months ago
2008
Springer
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
BROADNETS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...