๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Generalized Connection Caching

โœ Scribed by Albers


Publisher
Springer
Year
2002
Tongue
English
Weight
139 KB
Volume
35
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Connection caching: model and algorithms
โœ Edith Cohen; Haim Kaplan; Uri Zwick ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 380 KB

We introduce a theoretical model for connection caching. In our model each host maintains (caches) a limited number of open connections to other hosts. A request may utilize an open connection in which case it is a hit, or it may require to open a new connection in which case it is a miss. Establish

On caching effectiveness of web clusters
โœ Xueyan Tang; Samuel T. Chanson ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 319 KB

Due to the emergence of the HTTP/1.1 standards, persistent connections are increasingly being used in web retrieval. This paper studies the caching performance of web clusters under persistent connections, focusing on the difference between session-grained and request-grained allocation strategies a

Generalized Appell connection sequences
โœ James W Brown; Jack L Goldberg ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 284 KB
Generalized multi-stage connection netwo
โœ G. M. Masson; B. W. Jordan Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 954 KB

This paper develops multi-stage connection networks i n which each input terminaZ can be connected t o any number o f output terminals. strict29 nonblocking or are rearrangeable. rithms and upper bounds on the required number of moves are deveZoped and it is shown that such netuorks have fewer cross

On-Line File Caching
โœ Young ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer ๐ŸŒ English โš– 104 KB