Entry Jain:1989:CDA from compnetisdn.bib

Last update: Fri Jan 5 02:05:58 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Jain:1989:CDA,
  author =       "R. Jain",
  title =        "Characteristics of Destination Address Locality in
                 Computer Networks: {A} Comparison of Caching Schemes",
  journal =      j-COMP-NET-ISDN,
  volume =       "18",
  number =       "??",
  pages =        "243--254",
  year =         "1989\slash 1990",
  CODEN =        "CNISE9",
  ISSN =         "0169-7552 (print), 1879-2324 (electronic)",
  ISSN-L =       "0169-7552",
  bibdate =      "Sat Sep 25 15:30:02 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Bibnet/authors/j/jain-raj.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compnetisdn.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/cache_ps.htm",
  abstract =     "The size of computer networks, along with their
                 bandwidths, is growing exponentially. To support these
                 large, high-speed networks, it is necessary to be able
                 to forward packets in a few microseconds. One part of
                 the forwarding operation consists of searching through
                 a large address database. This problem is encountered
                 in the design of bridges, routers, gateways and name
                 servers.\par Caching can reduce the lookup time if
                 there is a locality in the address reference pattern.
                 Using a destination reference trace measured on an
                 extended local are a network, we attempt to see if the
                 destination references do have a significant
                 locality.\par We compared the performance of MIN, LRU,
                 FIFO, and random cache replacement algorithms. We found
                 that the interactive (terminal) traffic in our sample
                 had quite different locality behavior than that of the
                 noninteractive traffic. The interactive traffic did not
                 follow the LRU stack model while the noninteractive
                 traffic did. Examples are shown of the environments in
                 which caching can help as well as those in which
                 caching can hurt, unless the cache size is large.",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.sciencedirect.com/science/journal/01697552",
}

Related entries