1999
DOI: 10.1109/49.772436
|View full text |Cite
|
Sign up to set email alerts
|

On fast address-lookup algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2001
2001
2024
2024

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 69 publications
(13 citation statements)
references
References 19 publications
0
13
0
Order By: Relevance
“…According to the fluidflow model, N mn can be given as: N mn = ρ · A c . On the other hand, the routing cost is proportional to the logarithm of the length of the routing table [47], for IP routing table lookup is based on the longest prefix matching and most implementations use the traditional Patricia trie [48]. Therefore, the processing cost at the MAG in the BS can be expressed as [42,[44][45][46]:…”
Section: Sr (Mag-rpmentioning
confidence: 99%
“…According to the fluidflow model, N mn can be given as: N mn = ρ · A c . On the other hand, the routing cost is proportional to the logarithm of the length of the routing table [47], for IP routing table lookup is based on the longest prefix matching and most implementations use the traditional Patricia trie [48]. Therefore, the processing cost at the MAG in the BS can be expressed as [42,[44][45][46]:…”
Section: Sr (Mag-rpmentioning
confidence: 99%
“…Therefore, the complexity of the GFA visitor list lookup for distributed system is proportional only to !. Since IP routing table lookup is based on the longest prefix matching and most implementations use the traditional Patricia trie [16], the complexity of IP address lookup is proportional to the logarithm of the length of the routing table k [17]. We define the packet processing cost functions at the GFA for centralized system and distributed system as:…”
Section: Packet Delivery Costmentioning
confidence: 99%
“…If there are many such kind of MNs, the forwarding process will take very long. Considering that every packet forwarded by the HA has to undergo this forwarding process, the overhead of this packet forwarding process may be too high even after optimization through the use of appropriate data structures and lookup algorithms [8]. This poses a scalability concern that affects the use of the Mobile IP protocol in future wireless mobile systems.…”
Section: Mobile Ip Scalability Issuesmentioning
confidence: 99%