2006
DOI: 10.1016/j.future.2005.08.003
|View full text |Cite
|
Sign up to set email alerts
|

Web object-based storage management in proxy caches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
12
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 14 publications
1
12
0
Order By: Relevance
“…We denote this storage system as Multi-dir. This is similar to the previous proposals on clustering correlated web objects together for better disk performance, such as in [21]. We extended Multi-dir for P2P traffic to maintain the correlation among segments of the same object.…”
Section: Methodssupporting
confidence: 58%
See 2 more Smart Citations
“…We denote this storage system as Multi-dir. This is similar to the previous proposals on clustering correlated web objects together for better disk performance, such as in [21]. We extended Multi-dir for P2P traffic to maintain the correlation among segments of the same object.…”
Section: Methodssupporting
confidence: 58%
“…This is done to answer the question: "What happens if we were to use the already-deployed web caches for P2P traffic?" To the best of our knowledge, we are not aware of any other storage systems designed for P2P proxy caches, and as described in Section 2, storage systems proposed in [21], [22], [23], [24] for web proxy caches and in [25], [26], [27] for multimedia caches are not readily applicable to P2P proxy caches. Therefore, we could not conduct a meaningful comparison with them.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The remaining two transitions, δ(p 1 , w 1,2 ) → p 2 and δ(p 1 , w 1,4 ) → p 4 , describe a selection panel at the end of scene p 1 . The viewer in this example selects button w 1,2 or button w 1,4 . Only one of the buttons/ paths can be selected.…”
Section: Definitionmentioning
confidence: 99%
“…Previous researches have shown that maximum caching hit rate by applying any caching algorithm can achieve is less than 40−50% [3,[17][18][19][20]. In practical, one out of two objects cannot be found in caching [17].…”
Section: Introductionmentioning
confidence: 99%