Least popularity-per-byte replacement algorithm for a proxy cache

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 303
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKim K.ko
dc.contributor.authorPark D.ko
dc.date.accessioned2013-03-16T03:27:15Z-
dc.date.available2013-03-16T03:27:15Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2001-06-26-
dc.identifier.citation8th International Conference on Parallel and Distributed Systems, pp.780 - 787-
dc.identifier.urihttp://hdl.handle.net/10203/126987-
dc.languageEnglish-
dc.publisherICPADS-
dc.titleLeast popularity-per-byte replacement algorithm for a proxy cache-
dc.typeConference-
dc.identifier.wosid000170063200105-
dc.identifier.scopusid2-s2.0-0034849875-
dc.type.rimsCONF-
dc.citation.beginningpage780-
dc.citation.endingpage787-
dc.citation.publicationname8th International Conference on Parallel and Distributed Systems-
dc.identifier.conferencecountryUS-
dc.identifier.conferencelocationKyongju-
dc.contributor.localauthorPark D.-
dc.contributor.nonIdAuthorKim K.-
Appears in Collection
RIMS Conference Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0