2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333)
DOI: 10.1109/icc.2002.997227
|View full text |Cite
|
Sign up to set email alerts
|

On performance prediction of address lookup algorithms of IP routers through simulation and analysis techniques

Abstract: Abstract-Many address lookup methods on the IP routers have been recently proposed to improve the packet forwarding capability; nevertheless, their performance prediction is very limited because of lack of considering actual traffic characteristics in their evaluations. It is necessary to consider actual traffic to predict more realistic performances on routers, specially in case of layers 3 and 4 switches whose performances are more influenced by flow characteristic. In this paper, we propose new methods for … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…The OSDSM packet management processing requires a very short period, so, it can be ignored in the total handover latency. That is because the packet management algorithm in the router is very fast which is about 120 sec in the worst case [21,22]. The original release of the code has been extended to enable it to work with two or more mobile nodes.…”
Section: Performance Evaluation and Comparisonsmentioning
confidence: 99%
“…The OSDSM packet management processing requires a very short period, so, it can be ignored in the total handover latency. That is because the packet management algorithm in the router is very fast which is about 120 sec in the worst case [21,22]. The original release of the code has been extended to enable it to work with two or more mobile nodes.…”
Section: Performance Evaluation and Comparisonsmentioning
confidence: 99%
“…The entire handoff For neighbor cache look up, we have used the Patricia Trie lookup algorithm as described in [9,10]. In the case of Patricia Trie search algorithm, address lookup delay is equivalent to the delay of access and comparison operations in RAM multiplied by number of lookup.…”
Section: B Handoff Processmentioning
confidence: 99%
“…We use this algorithm in order to show the lookup time of the worst performance. Under the present circumstance, since a memory access requires from 60 to 100 nsec [14] and a comparison requires 10nsec in DRAM [15], we can use the value of DAC t as 70 and 110nsec. In Patricia Trie case, the lookups require accessing memory of 48 times in the worst case, the value is 48.…”
Section: Lookup Procedures For Fast Ncoa Confirmationmentioning
confidence: 99%