Sciweavers

1017 search results - page 37 / 204
» Throughput-centric routing algorithm design
Sort
View
CONEXT
2006
ACM
14 years 3 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 6 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
HOTOS
2003
IEEE
14 years 3 months ago
One Hop Lookups for Peer-to-Peer Overlays
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to ...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
AINA
2004
IEEE
14 years 1 months ago
A Personal Tourism Navigation System to Support Traveling Multiple Destinations with Time Restrictions
In this paper, we propose a personal navigation system (called PNS) which navigates a tourist through multiple destinations efficiently. In our PNS, a tourist can specify multiple...
Atsushi Maruyama, Naoki Shibata, Yoshihiro Murata,...
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
14 years 1 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin