Sciweavers

416 search results - page 49 / 84
» Engineering Route Planning Algorithms
Sort
View
DAC
2003
ACM
14 years 8 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
WWW
2008
ACM
14 years 8 months ago
Anycast CDNS revisited
Because it is an integral part of the Internet routing apparatus, and because it allows multiple instances of the same service to be "naturally" discovered, IP Anycast h...
Hussein A. Alzoubi, Seungjoon Lee, Michael Rabinov...
GLOBECOM
2007
IEEE
13 years 11 months ago
Joint Traffic Blocking and Routing Under Network Failures and Maintenances
Under device failures and maintenance activities, network resources reduce and congestion may arise inside networks. As a result, users experience degraded performance on packet d...
Chao Liang, Zihui Ge, Yong Liu
ECUMN
2007
Springer
14 years 1 months ago
Path Computation for Incoming Interface Multipath Routing
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
Pascal Mérindol, Jean-Jacques Pansiot, St&e...
CODES
2004
IEEE
13 years 11 months ago
Power-aware communication optimization for networks-on-chips with voltage scalable links
Networks-on-Chip (NoC) is emerging as a practical development platform for future systems-on-chip products. We propose an energyefficient static algorithm which optimizes the ener...
Dongkun Shin, Jihong Kim