Efficient Load-Balance in Distributed QoS Registry for Web Service

A load-balance approach in distributed QoS registry for Web service is proposed. According to peer load status, different load information dissemination policies are applied which significantly reduce network overhead. A load-balance approach based on simple negotiation protocol is proposed. The replication initiator proposes a rational proposal to replication receiver, then it replicates based on opponents offer. The approach improves efficiency of load-balance and reduces unnecessary replication attempt. The approach is tested on the prototype of distributed QoS registry and proved by experimental result.