Study of Overlay Web Service Discovery Based on Rough Set

Ban Chengying · Jisuanji gongcheng · 2007

This paper presents a model of overlay network service discovery. This model deals effectively with the familiar imperfect information lying in overlay network architecture, with the help of attribute reduction algorithm and decision rule optimization algorithm in rough sets theory. Results from experiment indicate that decision rule optimization algorithm can realize the rough matching of user demand and service attribute, therefore avoiding the low efficiency of traditional exact matching in exactness and maturity, so this model broadens the application field of rough sets.

Read the paper · More papers on PaperTik