| R. Panigrahy. Relieving hot spots on the world wide web. Technical Report MIT/LCS/TR-716, 1997. |
....Harrison [6] construct a manually configured hierarchy that must be traversed by all requests. Their scheme is promising in that it reduces load on top level caches by only keeping location pointers in the hierarchy, but it suffers from the same inefficiencies for less popular documents. Panigrahy [5] describes a theoretically based technique for constructing per server distribution trees with good load balancing properties. However, since server load is not taken into account when determining tree size, the trees for small and or lightly loaded servers may be too big, resulting in many ....
Rina Panigrahy. Relieving hot spots on the World Wide Web. Master's thesis, MIT EECS, June 1997.
....[12] construct a manually configured hierarchy that must be traversed by all requests. Their scheme is promising in that it reduces load on top level caches by keeping only location pointers in the hierarchy, but it suffers from the same inefficiencies for less popular documents. Panigrahy [9] describes a theoretically based technique for constructing per server distribution trees. This technique exhibits excellent load balancing properties. However, since server load is not taken into account when determining tree size, the trees for small and or lightly loaded servers may be too big, ....
Rina Panigrahy. Relieving hot spots on the World Wide Web. Master's thesis, MIT EECS, June 1997.
No context found.
R. Panigrahy. Relieving hot spots on the world wide web. Technical Report MIT/LCS/TR-716, 1997.
No context found.
D. Lewin, and R. Panigrahy. Relieving hot spots on the world wide web. STOC, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC