Sciweavers

169 search results - page 2 / 34
» A Heuristic Routing Mechanism Using a New Addressing Scheme
Sort
View
INFOCOM
1999
IEEE
13 years 9 months ago
A Fast IP Routing Lookup Scheme for Gigabit Switching Routers
One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix match...
Nen-Fu Huang, Shi-Ming Zhao, Jen-Yi Pan, Chi-An Su
CP
2000
Springer
13 years 9 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
INFOCOM
2007
IEEE
13 years 11 months ago
Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...
Haim Zlatokrilov, Hanoch Levy
WMASH
2003
ACM
13 years 10 months ago
MobileNAT: a new technique for mobility across heterogeneous address spaces
We propose a new network layer mobility architecture called MOBILENAT to efficiently support micro and macro-mobility in and across heterogeneous address spaces common in emergin...
Milind M. Buddhikot, Adiseshu Hari, Kundan Singh, ...
CONEXT
2006
ACM
13 years 11 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