Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 200

The DOI matches its Crossref record.

Modelling and Evaluation of CCN-Caching Trees

Open access
Psaras, Ioannis, Clegg, Richard G., Landa, Raul, Chai, Wei Koong, Pavlou, George·2011·Lecture Notes in Computer Science

Abstract

Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Internet, from security and content naming and resolution, to caching at routers, and new flow models. In this paper, we study the caching part of the proposed networking paradigm in isolation from the rest of the suggested features. In CCNs, every router caches packets of content and reuses those that are still in the cache, when subsequently requested. It is this caching feature of CCNs that we model and evaluate in this paper. Our modelling proceeds both analytically and by simulation. Initially, we develop a mathematical model for a single router, based on continuous time Markov-chains, which assesses the proportion of time a given piece of content is cached. This model is extended to multiple routers with some simple approximations. The mathematical model is complemented by simulations which look at the caching dynamics, at the packet-level, in isolation from the rest of the flow.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-642-20757-0_7

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 200

Metadata

Authors
Psaras, I., Clegg, R. G., Landa, R., Chai, W. K., & Pavlou, G.
Venue
Lecture Notes in Computer Science
Published
2011
Pages
78-91
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1810116042
Cited by
200
References
0
FWCI
27.13
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Modelling and Evaluation of CCN-Caching Trees. https://app.cochat.ai/papers/10.1007/978-3-642-20757-0_7
The paper
Psaras, I., Clegg, R. G., Landa, R., Chai, W. K., & Pavlou, G. (2011). Modelling and Evaluation of CCN-Caching Trees. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-20757-0_7

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.