RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 2018, Volume 54, Issue 2, Pages 103–111 (Mi ppi2269)  

Communication Network Theory

Information-theoretic approach to estimating the capacity of distributed memory systems

B. Ya. Ryabkoab

a Institute of Computational Technologies, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia

Abstract: Systems with cash memory (or more generally, with distributed memory) are very widely used in information technologies. Such are content delivery networks (CDN) of various types, which deliver digital movies, books, and similar content; peer-to-peer (P2P) networks, where millions of members exchange various information; and many other systems and devices of this kind. We introduce the notions of capacity and entropy efficiency for distributed memory systems, propose methods for estimating these quantities, and give an example of their application.

Funding Agency Grant Number
Russian Foundation for Basic Research 15-07-01851
Supported in part by the Russian Foundation for Basic Research, project no. 15-07-01851.


Full text: PDF file (172 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2018, 54:2, 191–198

Bibliographic databases:

UDC: 621.391.1+519.72
Received: 27.07.2017
Revised: 08.12.2017

Citation: B. Ya. Ryabko, “Information-theoretic approach to estimating the capacity of distributed memory systems”, Probl. Peredachi Inf., 54:2 (2018), 103–111; Problems Inform. Transmission, 54:2 (2018), 191–198

Citation in format AMSBIB
\Bibitem{Rya18}
\by B.~Ya.~Ryabko
\paper Information-theoretic approach to estimating the capacity of distributed memory systems
\jour Probl. Peredachi Inf.
\yr 2018
\vol 54
\issue 2
\pages 103--111
\mathnet{http://mi.mathnet.ru/ppi2269}
\elib{http://elibrary.ru/item.asp?id=35752797}
\transl
\jour Problems Inform. Transmission
\yr 2018
\vol 54
\issue 2
\pages 191--198
\crossref{https://doi.org/10.1134/S0032946018020072}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000438828500007}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85049947481}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2269
  • http://mi.mathnet.ru/eng/ppi/v54/i2/p103

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:85
    References:13
    First page:13

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019