R. Jain, "Characteristics of destination address locality in computer networks: A comparison of caching schemes," Computer Networks and ISDN Systems, vol. 18, pp. 243--254, 1989.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... header information between arrivals is redundant due to network traffic locality[2] 3] 6] Consequently, there have been several attempts to take advantage of network traffic locality to reduce processing overhead at the LAN interconnection nodes, thereby improving transfer delay[3] 4] [5]. Typically, such attempts involve caching the previously processed header and predicting that the next packet will require the same processing as the previous packet. In this paper, a new scheme is proposed for header prediction based upon the interframe gap between arriving packets. This allows ....

....of clustering of packets from the same source station, to improve internetworking performance . While the notion of source correlation itself is not new, and several traffic measurements simulation studies have convincingly demonstrated the existence of source locality in network traffic [3] 4] [5], our study is more general in the sense that we establish a theoretical foundation for the notion of source locality which can be applied to a wide range of specific internetworking configurations. This new scheme proposes that two packet forwarding service options be provided in internetworking ....

Raj Jain, "Characteristics of Destination Address Locality in Computer Networks: A comparison of Caching Schemes," Computer Networks and ISDN Systems, No. 18, pp. 243-254, 198990.

....[10] have been proposed to explain such behaviour. Such models have proven to be useful not only in the improvement 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, ....

....remains to be seen how important the notion of locality is to the design of future networks. Several recently proposed network architectures [13, 15] rely explicitly on network locality for efficient operation. Exploiting locality may become even more important as networks become larger and faster [9]. While the intuitive notion of network traffic locality is fairly well understood, there is a distinct lack of formal definitions or measures of network locality in the literature. The purpose of this paper, then, is to precisely characterize the salient aspects of network traffic locality in a ....

[Article contains additional citation context not shown here]

R. Jain, "Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes", DEC-TR-592, February 1989.

....processing in the routers within the connection less network specifically includes the address resolution process. This process is indispensable for the packet transfer over physical links such as ATM, and the efficiency of the address resolution process has significant influence on the throughput [3] [5] Performance of the address resolution process depends on the number of arriving packets regardless of their lengths in byte. On the other hand, performance of the packet transfer process depends on the amount of bytes to be transferred regardless of the number of arriving packets. ....

....B. Reference Models for Computer Memory In computer memory references, it is well known that the concept about locality of a reference pattern appears. The locality (especially, temporal locality) implies a high probability of reuse. A similar concept also appears in Internet access [3]. This subsection reviews typical memory reference models arranged for Internet access models [3] independent reference model (IRM) This model assumes accesses are independent. The probability that a new access has address i is determined by the address i (and the probability is denoted as p ....

[Article contains additional citation context not shown here]

R. Jain, "Characteristics of destination address locality in computer networks: A comparison of caching schemes," DEC Tech. Rep., DEC-TR592, 1990.

....a distribution strategy that provides detailed information about certain domains, and less information about others, based on the locality characteristics exhibited by network traffic . 3. 2 Exploiting Locality to Achieve Scaling Studies have shown the matrix for internetwork traffic to be sparse [9, 11, 15, 22, 24]. At any time, each stub domain communicates with only a small percentage of other stub domains. We refer to this as destination locality, and expect it to exist in future networks. This leads us to believe that a second kind of locality, which we call route locality, also exists and can be ....

....protocol in particular and with our adaptive source routing approach in general. RPU s ability to provide a reduction in routing overhead is a function of the locality exhibited in internetwork traffic. Studies have shown the matrix of internetwork traffic to exhibit source destination locality [9, 11, 15, 22, 24]. However, the extent of route locality has yet to be measured systematically. Combining traces of inter domain traffic, along with information about the routes used by such traffic would provide an actual measurement of route locality and an important basis for further studies of limited ....

Raj Jain. Characteristics of destination address locality in computer networks: A comparison of schemes. Computer Networks and ISDN Systems, 18:243--254, 1990.

....the validity and effectiveness of caching for routing table lookup in multimedia environments. Estrin and Mitzel [6] derived the storage requirements for maintaining state and lookup information on the routers, and showed that locality exists by performing trace driven simulations. Jain [8] studied the cache replacement algorithms for different types of traffic (interactive vs. non interactive) More recently, results from Internet traffic studies [13] as well as our own [3] showed that there is significant locality in the packet stream that caching could be a simple and powerful ....

R. Jain. Characteristics of destination address locality in computer networks: a comparison of caching schemes. Computer Networks and ISDN Systems, 18(4):243--54, May 1990.

....multimedia environments. Estrin and Mitzel [17] derived the storage requirements for maintaining state and lookup information on the routers, and showed that locality exists by performing trace driven simulations of an LRU routing table lookup cache, for different conversation granularities. Jain [18] found that the cache replacement algorithm may need to be different for different types of traffic (interactive vs. non interactive) and in some cases, cache could actually hurt the performance if the cache size is not sufficiently large. More recently, results from Internet traffic studies [2] ....

R. Jain, "Characteristics of destination address locality in computer networks: a comparison of caching schemes," Computer Networks and ISDN Systems, vol.18, no.4, p. 243-54, May 1990.

....layer 4 address for transit. This implies that if we save a recentlyused lookup result, called a layer 4 route, in a cache, there is a high probability that an incoming packet will hit the cache and will be forwarded without a full edged lookup. Similar locality behavior was observed at layer 3 [11] and caching has been used in commercial routers to speed up the IP lookup [12] 3] However, recent studies show that the hit ratio of layer 3 route cache tends to be low (60 to 80 ) and unstable [12] but none of them seriously explains why. After an in depth study of the route caching ....

R. Jain, \Characteristics of destination address locality in computer networks: A comparison of caching schemes," Computer Networks and ISDN Systems, , no. 18, pp. 243-254, 1990.

....or flow control, and its need to cope with the higher bandwidth of networks being developed, a data link level interconnection device must forward frames at the fastest possible rate to maintain its transparent operation. Optimizing the operation of such devices is hence an important issue [20, 21, 23]. Exploiting the traffic characteristics may be one way to optimize the performance of a data link level device. Previous studies of characteristics of network traffic show that packet arrivals on a LAN display a property similar to that shown by memory and file references [20] It has been found ....

....can be viewed as a series of references to and from the objects they address. The non uniform distribution of these references over time and space is called network traffic locality. The amount of locality in this reference stream may be critical to the efficiency of network implementations [11, 15, 17, 20, 21, 26, 29], if the locality can be exploited through caching or scheduling mechanisms. This chapter deals with previous work done in the area of computer network locality analysis. These studies have treated network locality with an addressing granularity of networks, individual hosts and individual ....

[Article contains additional citation context not shown here]

Jain R., "Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes", DEC-TR-592, February 1989.

....multimedia environments. Estrin and Mitzel [20] derived the storage requirements for maintaining state and lookup information on the routers, and showed that locality exists by performing trace driven simulations of an LRU routing table lookup cache, for different conversation granularities. Jain [21] found that the cache replacement algorithm may need to be different for different types of traffic (interactive vs. non interactive) and in some cases, cache could actually hurt the performance if the cache size is not sufficiently large. More recently, results from Internet traffic studies [2] ....

R. Jain, "Characteristics of destination address locality in computer networks: a comparison of caching schemes," Computer Networks and ISDN Systems, vol.18, no.4, p. 243-54, May 1990.

....more background and discussion of locality studies here. Designers of computer systems have years ago incorporated the notion of memory reference locality in system design, largely through the use of virtual memory and memory caches [25] In deriving metrics for network traffic locality, Jain [26] draws a comparison to memory reference locality, which is either spatial or temporal. Spatial locality refers to the likelihood of reference to memory locations near previously referenced locations. Temporal locality refers to the likelihood of future references to the same location. In network ....

....near previously referenced locations. Temporal locality refers to the likelihood of future references to the same location. In network traffic, the concentration of references to a small fraction of addresses and the persistence of references to recently used addresses are analogous concepts [26]. Jain presents data using three measures of locality: the network traffic income distribution, which can reflect long or short term locality; and two metrics that only apply to short term locality assessment: the average working set size as a function of packet window size, and the stack depth ....

[Article contains additional citation context not shown here]

R. Jain, "Characteristics of destination address locality in computer networks: a comparison of caching schemes," Computer networks and ISDN systems, vol. 18, pp. 243--54, May 1990.

....and 80 consist of less than ten packets. This distribution may imply that a flow cache designer should implement a two phase timeout, e.g. flows that pass a one second threshold would receive space in a longer term cache. Several studies have investigated similar questions regarding caching [9] [26], 27] and we consider it an important area for further empirical research as the nature of Internet flows changes. The disparities between the environment are explainable by the differences in network usage. The LAN environments tend to have a greater proportion of higher volume and longer flows, ....

R. Jain, "Characteristics of destination address locality in computer networks: a comparison of caching schemes", Computer networks and ISDN systems, vol. 18, no. 4, pp. 243--54, May 1990.

....[Leland91] at border routers [C ceres89] and inside a wide area backbone [Heimlich89] These studies have shown that packet interarrival times are not Poisson, but rather follow a packet train model. The packet train model has proven valuable in the design of packet routers [Feldmeier88] [Jain89]. The study presented in this paper is different from all the studies mentioned above. Instead of confining ourselves to the network and transport layers, we studied the characteristics of several applications. We believe these applications are representative of applications currently running on ....

Jain, R., Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes, DEC-TR-592, Feb. '89.

....In these applications, a hashing algorithm can be used to search through a very large information base in constant time. We also investigated caching as a possible solution but found that caching could be harmful in some cases in the sense that the performance would be better without caching [4]. To compare various hashing strategies, we used a trace of destination addresses observed on an Ethernet LAN in use. The trace consisted of 2.046 million frames observed over a period of 1.09 hours. A total of 495 distinct station addresses were observed, of which 296 were seen in the destination ....

....m consecutive bits of address checksums is shown in Figure 4. This also is a good hashing function. 6 Hashing Using Another Checksum Another popular checksum algorithm used to guard against memory errors in network address databases is [2] C = Mod 0 2 8 (4b[1] 2b[3] b[5] 4b[2] 2b[4] b[6] 2 1 6 0 1 1 Here, b[i] is the ith octet of the address and C is the 16 bit checksum. Since we are not aware of its name, we will call it the mod checksum. The information content of the bits of this checksum are shown in Figure 5. Notice that the mod checksum is not as good a ....

[Article contains additional citation context not shown here]

R. Jain, "Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes," Computer Networks and ISDN Systems, Vol. 18 (1989/90), pp. 243-254.

....forwarding code. The organization of this paper is as follows. In the next section, we describe a number of problems in networking design that require searching through a large database. In Section 3, we discuss a number of possible solutions including caching and hashing. In a companion paper [13], we compared the performance of various cache replacement algorithms. One of the unexpected results of this analysis was that in some cases, caching could be harmful in the sense that the performance would be better without caching. We, therefore, tried hashing as a possible solution to the ....

R. Jain, "Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes," DEC Technical Report, DEC-TR-592, January 1989, (Available from the author).

No context found.

R. Jain, "Characteristics of destination address locality in computer networks: A comparison of caching schemes," Computer Networks and ISDN Systems, vol. 18, pp. 243--254, 1989.

No context found.

Jain, R., Characteristics of destination address locality in computer networks: a comparison of caching schemes, Computer Networks and ISDN Systems, 18(4), pages 243-254, May 1990

No context found.

Jain, R., Characteristics of destination address locality in computer networks: a comparison of caching schemes, Computer Networks and ISDN Systems, 18(4), pp. 243-254, May 1990

No context found.

Jain, R., Characteristics of destination address locality in computer networks: a comparison of caching schemes, Computer Networks and ISDN Systems, 18(4), pages 243-254, May 1990

No context found.

R. Jain. Characteristics of destination address locality in computer networks: a comparison of caching schemes. Computer Networks and ISDN Systems, 18(4):243--254, May 1990.

No context found.

R. Jain, "Characteristics of destination address locality in computer networks: a comparison of caching schemes," Computer Networks and ISDN Systems, 18(4), pp. 243--254, May 1990.

No context found.

R. Jain, \Characteristics of destination address locality in computer networks: a comparison of caching schemes," Computer Networks and ISDN Systems, 18(4), pp. 243-254, May 1990.

No context found.

R. Jain, Characteristics of Destination Address Locality in Computer Networks: A comparison of Caching Schemes, Journal of Computer Networks and ISDN Systems, May 1990.

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