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 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
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
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