Results

**1 - 2**of**2**### Table 1: Comparison of the exact L(n) with the asymptotic expansion Lasym(n) obtained in Theo- rem 1 and the approximation LPST(n) proposed by Phillips, Shenker, and Tangmunarunkit [9] for a = 0:5, that is, N = 2n.

2001

"... In PAGE 8: ...The quantities c1(a) and c2(a) converge quickly and hence (5) provides a convenient way for the approximate computation of L(n). In order to verify the accuracy of the above asymptotic expansion (denoted Lasym(n) in Table1 ) we compare it to the exact formula L(n) and the approximation LPST(n) proposed by the authors of [9]. From Table 1 one concludes that the asymptotic expansion presented in Theorem 1 is very good, even for small values of n.... In PAGE 8: ... In order to verify the accuracy of the above asymptotic expansion (denoted Lasym(n) in Table 1) we compare it to the exact formula L(n) and the approximation LPST(n) proposed by the authors of [9]. From Table1 one concludes that the asymptotic expansion presented in Theorem 1 is very good, even for small values of n. gt;From Theorem 1 one also must conclude that R(n) ND (V=(V ? 1) ? c1(a)), which most de nitely does not exhibit the power law for general a.... ..."

Cited by 5

### Table Growth by Filtering Based on Address Allocation Policies. http://www.research.att.com/ jrex/papers/filter.pdf [26] E. Kohler, J. Li, V. Paxson, and S. Shenker. Observed structure of ad- dresses in IP traffic. 2nd Internet Measurement Workshop, November 2002. [27] T. Bates and Y. Rekhter. Scalable Support for Multi-homed Multi-provider Connectivity. RFC 2260. [28] V. Srinivasan, G. Varghese. Fast address lookups using controlled prefix expansion. ACM Transactions on Computer Systems. [29] M. Waldvogel, G. Varghese, J. Turner, B. Plattner. Scalable High-speed prefix matching. ACM Transactions of Computer Systems. [30] M. Degermark, A. Brodnik, S. Pink. Small Forwarding Table for Fast Routing Lookups. SIGCOMM 1997.

**1 - 2**of

**2**