Abstract the problem, a relocation protocol by an object relo-Mobile Cache Protocol (MCP) was proposed as a re-location protocol of a replicated object in a widely dis-tributed object system. MCP has four basic features; relocating a replicated object, 2 optimistic update meth-ods, object reservation and object sharing. To calcu-late relocation function, MCP uses processing time of the object at a candidate sate and predicted network de-lay between the client and the candidate. Thus, a cli-ent observes network status to eliminate the ambiguity. But the observation of the entire network may cause overhand and undesirable traffic. This paper proposes some solutions for the problem, i.e., collecting process-ing time information of partial network and probing delay by preceding ping. Though designed for a dis-tributed object based system, MCP also can be applied to dynamic web caching. Evaluation using DEC web trace shows the effectiveness of these strategies. 1
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.