Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Hasslinger, G. Ntougias, K. Hasslinger, F. |
| Copyright Year | 2014 |
| Description | Author affiliation: Fixed Mobile Eng., Deutsche Telekom Tech., Darmstadt, Germany (Hasslinger, G.; Ntougias, K.; Hasslinger, F.) |
| Abstract | Least recently used (LRU) is the most commonly applied strategy to update the content of caches in computing and database systems as well as for Web caching. Although some case studies have shown that LRU hit rates can be low when compared to Web caching strategies being aware of complete statistics of past requests, proposed alternatives seem too complex to cope with constant update effort of LRU. In this work we start with an evaluation of the hit rates for LRU as compared to statistic-based caching strategies for Zipf distributed popularity of web content, which has been confirmed manifold as the relevant access profile to content on the Internet. We conclude that LRU has more than 10% absolute hit rate deficits not only in some special cases but over the entire relevant parameter range of Zipf law access pattern. We show that a 10% gain over LRU hit rates is already realized by the variant of score-gated LRU, whose mean updating effort is comparable to pure LRU. As another main advantage, score-gated LRU avoids most of the input traffic of a pure LRU strategy, which frequently reloads objects into the cache. Score-gated LRU keeps the cache content stable in case of unchanged popularity and loads new objects only when their score is increasing until it exceeds the score of a cached object. |
| Starting Page | 1 |
| Ending Page | 7 |
| File Size | 826817 |
| Page Count | 7 |
| File Format | |
| ISBN | 9781479965151 |
| DOI | 10.1109/NETWKS.2014.6958534 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2014-09-17 |
| Publisher Place | Portugal |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Fading least recently used (LRU) hit rate analysis and simulation Web caching strategies Internet Steady-state Complexity theory Zipf distributed requests Arrays score functions based on sliding window statistics and geometric fading Sorting Load modeling |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| 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 |
|
Loading...
|