A mechanism for the communication between a set of Web caches reducing the time needed to localize the requested document in the system is proposed. The proposal is based on BFS (breadth first search) algorithm. The algorithm works in links and setting a timeout equal to 2RTT, each reponse message arriving after the timeout being considered from an unreachable node. In cooperative Web caching, if the web cache first receiving a request does not have the document in its memory, it starts searching for it in other cooperative web caches, retrieving and sending it to the client. The several factors influencing the request-response latency can be classified in two main categories: network factors and system factors.
On the latency of BFS based interval cooperative web caching
BONUCCELLI, MAURIZIO ANGELO
2004-01-01
Abstract
A mechanism for the communication between a set of Web caches reducing the time needed to localize the requested document in the system is proposed. The proposal is based on BFS (breadth first search) algorithm. The algorithm works in links and setting a timeout equal to 2RTT, each reponse message arriving after the timeout being considered from an unreachable node. In cooperative Web caching, if the web cache first receiving a request does not have the document in its memory, it starts searching for it in other cooperative web caches, retrieving and sending it to the client. The several factors influencing the request-response latency can be classified in two main categories: network factors and system factors.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
