Routing Attribute Data Mining Based on Rough Set Theory

Routing Attribute Data Mining Based on Rough Set Theory

Yanbing Liu (UEST of China & Chongqing University of Posts and Telecommunications, Shixin Sun, UEST, China), Menghao Wang (Chongqing University of Posts and Telecommunications, China) and Jong Tang (Chongqing University of Posts and Telecommunications, China)
Copyright: © 2008 |Pages: 16
DOI: 10.4018/978-1-59904-528-3.ch019
OnDemand PDF Download:
$37.50

Abstract

QOSPF (Quality of Service Open Shortest Path First) based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services on the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision making. This article focuses on routing algorithms and their applications for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory offers a knowledge discovery approach toextracting routing decisions from attribute set. The extracted rules then can be used to select significant routing attributes and to make routing selections in routers. A case study is conducted in order to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algorithm based on data mining and rough set offers a promising approach to the attribute selection problem in Internet routing.

Complete Chapter List

Search this Book:
Reset