NDLI: Comparing strength of locality of reference - popularity, majorization, and some folk theorems

Content Provider	IEEE Xplore Digital Library
Author	Vanichpun, S. Makowski, A.M.
Copyright Year	2004
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA (Vanichpun, S.; Makowski, A.M.)
Abstract	The performance of demand-driven caching depends on the locality of reference exhibited by the stream of requests made to the cache. In particular, it is expected that the stronger the locality of reference, the smaller the miss rate of the cache. For the independent reference model, this amounts to a smaller miss rate when the popularity distribution of requested objects in the stream is more skewed. We formalize this "folk theorem" through the companion concepts of majorization and Schur-concavity. This folk theorem is established for caches operating under a random on-demand replacement algorithm (RORA). However, the result fails to hold in general under the (popular) LRU and CLIMB policies, but can he established when the input has a Zipf-like popularity pmf with large skewness parameter. In addition, we explore how the majorization of popularity distributions translates into comparisons of three well-known locality of reference metrics, namely the inter-reference time, the working set size and the stack distance.
Starting Page	838
Ending Page	849
File Size	856524
Page Count	12
File Format	PDF
ISBN	0780383559
ISSN	0743166X
DOI	10.1109/INFCOM.2004.1356972
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-03-07
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Educational institutions Surface-mount technology Telecommunication traffic Network servers Content based retrieval Delay Distributed computing Peer to peer computing Traffic control
Content Type	Text
Resource Type	Article
Subject	Computer Science Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Comparing strength of locality of reference - popularity, majorization, and some folk theorems (2004).

Self-organizing wide-area network caches

Improved search latency in peer to peer networks with content links

Content networks: distributed routing decisions in presence of repeated queries

Efficient peer-to-peer overlay construction

Effective content drifting method on content-based network using game theory

Peer-to-peer searching mechanisms for location-aware contents with time-dependent importance

Content-Based Music Retrieval in P2P Network

P4P Pastry: A novel P4P-based Pastry routing algorithm in peer to peer network

Comparing strength of locality of reference - popularity, majorization, and some folk theorems

Similar Documents

Comparing strength of locality of reference - popularity, majorization, and some folk theorems (2004).

Self-organizing wide-area network caches

Improved search latency in peer to peer networks with content links

Content networks: distributed routing decisions in presence of repeated queries

Efficient peer-to-peer overlay construction

Effective content drifting method on content-based network using game theory

Peer-to-peer searching mechanisms for location-aware contents with time-dependent importance

Content-Based Music Retrieval in P2P Network

P4P Pastry: A novel P4P-based Pastry routing algorithm in peer to peer network

Comparing strength of locality of reference - popularity, majorization, and some folk theorems