Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Hi-index | 0.00 |
Attribute reduction is one of the most important issues and the focus of the research on efficient algorithms in rough sets. This paper focus on the routing selection algorithms and application used to compute QoS routes in OSPF protocol that are based on the rough set, which the attribute-value system about the link of network is created from the network topology. The use of rough set method can simplify enormous irregular link QoS attribute and classify the link with the link-status attribute. A illustrative example is employed to show the feasibility and effectiveness that the most excellent routing attribute set is obtained by rough set theory.