Sciweavers

830 search results - page 73 / 166
» Route kernels for trees
Sort
View
COMCOM
2006
98views more  COMCOM 2006»
15 years 4 months ago
High-speed IP address lookup using balanced multi-way trees
Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, ...
Hyesook Lim, Wonjung Kim, Bomi Lee, Changhoon Yim
AINA
2009
IEEE
15 years 11 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
16 years 29 days 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
INFOCOM
2000
IEEE
15 years 8 months ago
Alternate Path Routing for Multicast
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...
Daniel Zappala
CN
2004
140views more  CN 2004»
15 years 3 months ago
Mobile hop-by-hop multicast routing
This work focuses on mobility management in a multicast environment. Traditional solutions, based either on bi-directional tunneling or on remote subscription, have different draw...
Rolland Vida, Luís Henrique Maciel Kosmalsk...