The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Routing Attribute Data Mining Based on Rough Set Theory
|
Author(s): Yanbing Liu (UEST of China & Chongqing University of Posts and Telecommunications, China), Shixin Sun (UEST, China), Menghao Wang (Chongqing University of Posts and Telecommunications, China)and Hong Tang (Chongqing University of Posts and Telecommunications, China)
Copyright: 2008
Pages: 16
Source title:
Data Warehousing and Mining: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-59904-951-9.ch194
Purchase
|
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 in the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision-making. This paper 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 of-fers a knowledge discovery approach to extracting routing-decisions from attribute set. The extracted rules can then be used to select significant routing-attributes and make routing-selections in routers. A case study is conducted to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algo-rithm based on data mining and rough set offers a promising approach to the attribute-selection problem in internet routing.
Related Content
Md Sakir Ahmed, Abhijit Bora.
© 2024.
15 pages.
|
Lakshmi Haritha Medida, Kumar.
© 2024.
18 pages.
|
Gypsy Nandi, Yadika Prasad.
© 2024.
16 pages.
|
Saurav Bhattacharjee, Sabiha Raiyesha.
© 2024.
14 pages.
|
Naren Kathirvel, Kathirvel Ayyaswamy, B. Santhoshi.
© 2024.
26 pages.
|
K. Sudha, C. Balakrishnan, T. P. Anish, T. Nithya, B. Yamini, R. Siva Subramanian, M. Nalini.
© 2024.
25 pages.
|
Sabiha Raiyesha, Papul Changmai.
© 2024.
28 pages.
|
|
|