D. Feldmeier. Improving gateway performance with a routing table cache. In IEEE INFOCOM' 88, pages 298--307, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of route table lookups will allow lookups to complete in a single step and solve this problem. Such a cache can also hold the results of NAT table lookups and enhance the performance of that application. The viability of route table caches has been studied extensively in the literature [19] 20][21]. We validate previous studies and present data that indicate trends favorable to caching schemes. We collected miss ratio data for a few points in the design space for routing caches indexed simply by the destination IP address. We present the results for a line size of 1 block because the ....

O. Feldmeier, "Improving gateway performance with a routing-table cache," IEEE INFOCOM, pp. 298--307, March 1988.

....packets. The packet size affects the buffer space and the packet transmission time at the output port. The destination address determines where the packet needs to be sent and the distribution of the number of unique addresses seen in an interval affects mechanisms such as routing table caches [9] used in a switch or router. The connection characteristics can affect how often a particular routing table entry is used. The TCP connection duration and the number of bytes and packets sent determine the temporal locality of addresses seen. 4. Methods of generating high bandwidth The simplest ....

Feldmeier, D., "Improving gateway performance with a routing table cache," Proceedings of IEEE Infocom, pp. 298-307, New Orleans (Mar 1988).

....We think this is an issue that needs attention. In other measurements, Jain and Routbier [18] reported that successive packets on a Local Area Network belonged to the same end to end transmission entity. Moghul [28] has reported existence of similar localities at the level of processes. Feldmeier [7] has used locality of traffic for routing caches in gateways. Gussella [13] has studied local area network traffic and has reported on packet inter arrival and size distributions. Shoch and Hupp s landmark paper [37] is perhaps one of the earliest papers on traffic measurements over a Local Area ....

Feldmeier, D. "Improving gateway performance with a routing-table cache," ?roc. IEEE Infocorn, March 1988.

....of techniques for modelling workloads, but also in their application to network design. Several recent research efforts have identified the presence of network traffic locality [8, 9, 11] and suggested ways to exploit the locality property in the design and operation of computer networks [2, 6, 14]. Exploiting locality, usually by caching recently referenced items, has been crucial in the success of virtual memory systems, multiprocessor systems, and distributed file systems, where the access time of the cache is an order of magnitude faster than access to main storage. It remains to be ....

....a long term phenomenon. Packets on a local area network are concentrated to small subsets of the address space over significant periods of time. 4 Performance of a Locality Based Network Interconnection Device There are several possible applications of the phenomenon of network traffic locality [2, 6, 14, 15]. Among these are implications on the design and performance of network interconnection devices. To take specific examples, the presence of temporal locality suggests that caching recently active host addresses could be effective, and the presence of concentration suggests that only small caches ....

D. Feldmeier, "Improving Gateway Performance with a Routing-Table Cache", Proceedings of IEEE INFOCOM '88, New Orleans, March 1988, pp. 298-307.

....but instead stores recent lookup keys, as exact matches are generally much simpler and faster to implement. Unfortunately, with the growth of the Internet, access locality in packet streams seems to decrease, requiring larger and larger caches to achieve similar hit rates. In 1987, Feldmeier [Feldmeier 1988] found that a cache for the most recent 9 destination addresses already provided for a 90 hit rate. 8 years later, Partridge [Partridge 1996] did a similar study, where caches with close to 5000 entries were required to achieve the same hit rate. We expect this trend to continue and potentially ....

FELDMEIER, D. C. 1988. Improving gateway performance with a routing-table cache. In Proceedings of IEEE Infocom '88 (New Orleans, March 1988), pp. 298--307.

....but instead stores recent lookup keys, as exact matches are generally much simpler and faster to implement. Unfortunately, with the growth of the Internet, access locality in packet streams seems to decrease, requiring larger and larger caches to achieve similar hit rates. In 1987, Feldmeier [Feldmeier 1988] found that a cache for the most recent 9 destination addresses already provided for a 90 hit rate. 8 years later, Partridge [Partridge 1996] did a similar study, where caches with close to 5000 entries were required to achieve the same hit rate. We expect this trend to continue and potentially ....

FELDMEIER, D. C. 1988. Improving gateway performance with a routing-table cache. In Proceedings of IEEE Infocom '88 (New Orleans, March 1988), pp. 298--307.

....routes) for the maximum length prefix that matches the destination field of a given packet. Without one of the fast route lookup techniques mentioned before, the performance of conventional routers was severely limited by this operation. To speed up the route lookup, a cache is normally employed [11]. It basically stores some routes that have been recently looked up to shorten the processing time for certain packets. The performance of a conventional router is highly dependable on the cache hit rate. In general, if all route lookups miss a cache, the performance of a conventional router can ....

D. C. Feldmeier, "Improving gateway performance with a routing table cache," in Proc. IEEE Infocom'88, New Orleans, LA, pp. 298--307.

....that is consulted (as the front end to the routing table) before the routing table lookup. Finding a particular destination in this database is easier because an exact match is done instead of the more expensive best match operation of the routing table. So, most routers relied on route caches [15][16] The route caching techniques rely on there being enough locality in the traffic so that the cache hit rate is sufficiently high and the cost of a routing lookup is amortized over several packets. This front end database might be organized as a hash table [17] After the router has forwarded ....

....router throughput. Since routing table lookup is a time consuming process of packet forwarding, some traditional software based routers cache the IP destination to next hop association in a separate database that is consulted as the front end to the routing table before the routing table lookup [15]. Still, the performance of the traditional bus based router depends heavily on the throughput of the shared bus and on the forwarding speed of the central processor. This architecture cannot scale to meet the increasing throughput requirements of multigigabit network interface cards. 3.2 ....

[Article contains additional citation context not shown here]

. D. C. Feldmeier, "Improving Gateway Performance with a Routing-Table Cache," Proc. IEEE Infocom'88, New Orleans, LI, Mar. 1988.

....Williamson [Wil89] calls spatial locality in networks persistence, and defines it as a packet arriving at a process from the same source process as the previous packet. Persistence is quite high in packet traffic and is exploited to improve performance through 1 behind caching of transport [Fel88] or session level [Wil89] protocol parameters. Temporal locality is a message arriving at a processor within a predictable time interval of the previous message. The existence of temporal locality in message traffic suggests using scheduling techniques to avoid queuing delays. We now will define ....

....and sizes. 4.1.3 Arrival locality Two types of locality have been observed in packets arriving from the network: persistence and temporal locality (defined in Section 2.3. 2) Persistence is quite high in packet traffic and is exploited to improve performance through 1 behind caching of transport [Fel88] or session level [Wil89] protocol parameters. If persistence is also high in message traffic, the same techniques could improve performance in a distributed toolkit. The transport level state could be cached by providing a custom protocol or by hinting to the system provided protocol to use ....

[Article contains additional citation context not shown here]

Feldmeier, D. Improving Gateway Performance with a Routing-Table Cache. In Proceedings IEEE INFOCOM '88. IEEE, March 1988.

....routing. None of the custom designed processors explicitly mention the use of cache in the chip descriptions, although some of them do mention [19] that the traffic as seen in major Internet backbone routers is not expected to exhibit sufficient locality to justify the use of caches. Feldmeier [7] studied the management policy for the routing table cache, and showed that the routing table lookup time can be reduced by up to 65 . Chen [2] investigated the validity and effectiveness of caching for routing table lookup in multimedia environments. Estrin and Mitzel [6] derived the storage ....

D. Feldmeier. Improving gateway performance with a routing-table cache. IEEE INFOCOM, pages 298--307, March 1988.

....implementation based on exploiting the address and page management hardware software in commodity PCs. None of previous works have reported detailed delay measurements that included CPU caching effects. Another way to speed up routing table lookup is to cache the lookup results. Feldmeier [6] studied the management policy for the routingtable cache, and showed that the routing table lookup time can be reduced by up to 65 . Chen [7] investigated the validity and effectiveness of caching for routing table lookup in multimedia environments. Estrin and Mitzel [8] derived the storage ....

Feldmeier, D.C., Improving gateway performance with a routing-table cache, IEEE INFOCOMM '88, p. 298-307, New Orleans, LA, USA 27-31 March 1988.

....processors explicitly mention the use of cache in the chip descriptions, although some of them did mention [7] the reason why they choose not to use cache: the traffic as seen in major Internet backbone routers is not expected to exhibit sufficient locality to justify the use of cache. Feldmeier [15] studied the management policy for the routing table cache, and showed that the routing table lookup time can be reduced by up to 65 . Chen [16] investigated the validity and effectiveness of caching for routing table lookup in multimedia environments. Estrin and Mitzel [17] derived the storage ....

....the above NART algorithm on a Pentium II 233 MHz machine with 16 KByte L1 data cache running Linux, and tested it on the IPMA routing table. The measured software NART lookup time is 120 CPU cycles on the average. 7 Level 3 Table 9 bytes 2 Base1 64K entries 256 entries 256 bits [15, 8] 2 bytes 1 byte 1 0 Level 2 Pointer OutPort OutPort Compare Level 2 Table Level 1 Table bits [31, 0] 32 bits 32 bits Base3 Base2 bits [31, 16] 11111111 Destination IP Address (DA) OutPort Network Mask Network Address Figure 1: The data flow of the NART ....

Feldmeier, D.C., "Improving gateway performance with a routing-table cache," IEEE INFOCOM '88, p. 298-307, New Orleans, LA, USA 27-31 March 1988.

....it is not clear what the definition of a neighboring name should be, and so we do not consider it here 3 . The property of locality of reference has been observed in other situations, including program execution [16] file and database access [24] and network addresses in data packets [8, 7]. Temporal locality can be quantified using the LRU stack model [7] the working set model [23] the probability that two successive requests reference the same name [7] etc. In this paper, we proceed as in [8] Specifically, for a current name in the trace, we measure how far down the trace ....

....[16] file and database access [24] and network addresses in data packets [8, 7] Temporal locality can be quantified using the LRU stack model [7] the working set model [23] the probability that two successive requests reference the same name [7] etc. In this paper, we proceed as in [8]. Specifically, for a current name in the trace, we measure how far down the trace this same name will be seen again. From this, we compute the distribution of the intername gap, i.e. the number of names which separate 2 occurrences of a same name in the trace. Figure 2 shows the relative ....

[Article contains additional citation context not shown here]

D. Feldmeier, "Improving gateway performance with a routing table cache", Proc. INFOCOM '88, March 1988, pp. 298-307.

....packets between them, assuring that packets arriving 25 from one network are transmitted toward their ultimate destination. The gateway examines the destination address of a received packet and determines the next hop address by using the destination address as an index to a routing table [11, 12]. A routing table is a table of destination next hop address pairs maintained by the gateway. High throughput gateways are necessary in an internetwork environment to provide high speed communication that is transparent to the user. A fully utilized gateway connecting two 100 Mbps networks ....

....simulation offers the advantages of flexibility, accuracy, and ease of use. The experiments are fully repeatable and the same data can be used to compare different cache strategies. For the last several years trace driven simulation has been the mainstay of cache performance estimation [5, 11, 12, 17, 31, 35, 36]. The usefulness of trace driven simulation depends on the representativeness of the traces used to drive the simulations [31] It is important to obtain traces that provide accurate cache performance predictions. 59 Given the general advantages of using trace driven simulation and the ....

Feldmeier D. C., "Improving Gateway Performance with a Routing-Table Cache", Proceedings of IEEE Infocom '88, New Orleans, March 1988, pp. 298307.

....algorithms, Suez s routing table lookup algorithm does not require backtracking to support longest prefix match. None of previous works reported detailed delay measurements that included CPU caching effects. Another way to speed up routing table lookup is to cache the lookup results. Feldmeier [6] studied the management policy for the routing table cache, and showed that the routing table lookup time can be reduced by up to 65 . Chen [7] investigated the validity and effectiveness of caching for routing table lookup in multimedia environments. Estrin and Mitzel [8] derived the storage ....

Feldmeier, D.C., "Improving gateway performance with a routing-table cache," IEEE INFOCOM '88, p. 298-307, New Orleans, LA, USA 27-31 March 1988.

....processors explicitly mention the use of cache in the chip descriptions, although some of them did mention [10] the reason why they choose not to use cache: the traffic as seen in major Internet backbone routers is not expected to exhibit sufficient locality to justify the use of caches. Feldmeier [18] studied the management policy for the routing table cache, and showed that the routing table lookup time can be reduced by up to 65 . Chen [19] investigated the validity and effectiveness of caching for routing table lookup in multimedia environments. Estrin and Mitzel [20] derived the storage ....

Feldmeier, D.C., "Improving gateway performance with a routing-table cache," IEEE INFOCOM '88, p. 298-307, New Orleans, LA, USA 27-31 March 1988.

....implementation based on exploiting the address and page management hardware software in commodity PCs. None of previous works have reported detailed delay measurements that included CPU caching effects. Another way to speed up routing table lookup is to cache the lookup results. Feldmeier [6] studied the management policy for the routing table cache, and showed that the routing table lookup time can be reduced by up to 65 . Chen [7] investigated the validity and effectiveness of caching for routing table lookup in multimedia environments. Estrin and Mitzel [8] derived the storage ....

Feldmeier, D.C., "Improving gateway performance with a routing-table cache," IEEE INFOCOMM '88, p. 298-307, New Orleans, LA, USA 27-31 March 1988.

....model has been analyzed extensively in literature beginning with [22] The cumulative frequency of reference up to several different stack levels is shown in Figure 3. Notice that: 1. The stack top (level 1) reference frequency is only 2 to 3 . This is different from the data measured at M.I.T. [4,9] where 30 of the references were found at the stack top and the top two levels had a cumulative reference frequency of 60 . 2. We see that the top 100 stack positions (20 of the total possible stack positions) account for 98 of the frames. This is much lower than corresponding figures seen ....

....With a very large cache, the cache does reduce the search time, but the gain decreases as the cache size increases. The optimal cache size for this trace is approximately 64, which produces 20 to 25 reduction in search time. Earlier measurements at the Massachusetts Institute of Technology [4,9] on a token ring had shown that even a small cache sizewould provide a big payoff. Therefore, we need to understand what behavior in our environment leads to this different conclusion. We suspect several possibilities. First, the traffic level at M.I.T. is only one tenth of that in our ....

D. C. Feldmeier, "Improving Gateway Performance with a Routing-Table Cache," Proc. IEEE INFOCOM '88, March 1988.

....is sent to 5 hosts. Just as program and data caching policies can exploit memory reference locality in a virtual memory system, router designers can exploit traffic locality with analogous schemes such as caching network address and specialized flow information in switching nodes. Feldmeier [36] and Jain [26] simulate caching algorithms on traffic traces taken from LAN gateways. Feldmeier [36] estimated the potential benefit of caching on the performance of gateway routing tables. Using measured traffic from gateways at MIT, he simulated a variety of fully associative caching replacement ....

....in a virtual memory system, router designers can exploit traffic locality with analogous schemes such as caching network address and specialized flow information in switching nodes. Feldmeier [36] and Jain [26] simulate caching algorithms on traffic traces taken from LAN gateways. Feldmeier [36] estimated the potential benefit of caching on the performance of gateway routing tables. Using measured traffic from gateways at MIT, he simulated a variety of fully associative caching replacement algorithms (LRU, FIFO, and random) to determine cache performance metrics such as hit ratio and ....

D. C. Feldmeier, "Improving gateway performance with a routing table cache," in Proceedings of IEEE Infocom 88, pp. 298--307, March 1988. 117

No context found.

D. Feldmeier. Improving gateway performance with a routing table cache. In IEEE INFOCOM' 88, pages 298--307, 1988.

No context found.

D. Feldmeier, "Improving gateway performance with a routing-table cache," in Proc. of IEEE INFOCOM'88, New Orleans, LA, USA, pp. 27--31, March 1988.

No context found.

D. Feldmeier, \Improving gateway performance with a routing-table cache," in Proc. of IEEE INFOCOM'88, New Orleans, LA, USA, pp. 27-31, March 1988.

No context found.

D. Feldmeier, Improving Gateway Performance with a Routing-Table Cache, Proceedings of IEEE INFOCOM'88, March 1988.

No context found.

D. Feldmeier, \Improving gateway performance with a routing-table cache," in Proc. of IEEE INFOCOMM '88, New Orleans, LA, USA, pp. 27-31, March 1988.

No context found.

D. Feldmeier, "Improving Gateway Performance with a Routing Table Cache," Conf. Computer Communications (Infocom 88), IEEE Computer Society Press, Los Alamitos, Calif., USA, 1988, pp. 298-307.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC