Pseudo-address generation algorithm of packet destinations for Internet performance simulation

Aida, Masaki; T, Abe

doi:10.1109/infcom.2001.916638

Cited by 6 publications

(4 citation statements)

References 13 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We instead use random data from previous work [3], as well as synthetic data. We obtain the latter by extending the approach in [2], adopted in the network community, to generate traffic data according to the distribution of the prefixes of any given routing table T (details given in the technical report [8]). For our experiments we employed an AMD Athlon XP 1900+ (1.6GHz), 256Mb RAM DDR at 133Mhz, 256Kb L2 cache, 128Kb L1 cache (64 Kb data and 64Kb instructions) running Linux kernel 2.4.22.…”

Section: Databases and Experimental Platformsmentioning

confidence: 99%

Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms

Geraci

Grossi

2005

Experimental and Efficient Algorithms

View full text Add to dashboard Cite

Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over five years, discovering what we call the middle-class effect. We exploit this effect for tailoring a simple solution to the IP lookup scheme, taking advantage of the skewed distribution of Internet addresses in routing tables. Our algorithmic solution is easy to implement as it is tantamount to performing an indirect memory access. Its performance can be bounded tightly and has very low memory dependence (e.g. just one memory access to off-chip memory in the hardware implementation). It can quickly handle route announcements and withdrawals on the fly, with a small cost which scales well with the number of routes. Concurrent access is permitted during these updates.

show abstract

Section: Databases and Experimental Platformsmentioning

confidence: 99%

Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms

Geraci

Grossi

2005

Experimental and Efficient Algorithms

View full text Add to dashboard Cite

show abstract

“…We use the approach of the address generation algorithm proposed in [5], where the addresses are generated by a LRU (Least Recently Used) stack and ISGF (Inverse Stack Growth Function).…”

Section: Modeling Destination Addressesmentioning

confidence: 99%

“…While ISGF was originally used for predicting the cache hit ratio of computer architectures, the authors in [5] have found that the number of distinct destination addresses also satisfies ISGF. Namely, when we collect T packets from the traced data, the number of distinct destination addresses can be estimated as T α .…”

Section: Modeling Destination Addressesmentioning

confidence: 99%

Performance Prediction Methods for Address Lookup Algorithms of IP Routers

Kawabe

Ata

Murata

2002

Information Networking: Wired Communications and Management

View full text Add to dashboard Cite

Abstract. Many address lookup methods for an IP router have been recently proposed to improve a packet forwarding capability, but their performance prediction is very limited because of lack of considering actual traffic characteristics. 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 characteristics. In this paper, we propose new methods for predicting the router's performance based on the statistical analysis of the Internet traffic. We also present an example of its application to the existing table lookup algorithms, and show that simulation results based on our method can provide accurate performance prediction.

show abstract

“…We use the approach of the address generation algorithm proposed in [5], where the addresses are generated by a Least Recently Used (LRU) stack and Inverse Stack Growth Function (ISGF).…”

Section: A Modeling Destination Addressesmentioning

confidence: 99%

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

Kawabe

Ata

Murata

et al.

2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333)

View full text Add to dashboard Cite

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 predicting the router's performance based on the statistical analysis of the Internet traffic. We also present an example of its application to the existing table lookup algorithm, and show that simulation results based on our method can provide accurate performance prediction.

show abstract

Pseudo-address generation algorithm of packet destinations for Internet performance simulation

Cited by 6 publications

References 13 publications

Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms

Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms

Performance Prediction Methods for Address Lookup Algorithms of IP Routers

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

Contact Info

Product

Resources

About