A Novel Boundary Cutting on Data Transferring in Network Based on Nodes & Routers using Building a BC Decision Tree

Dudala Sujatha, N. Shiva Kumar


New applications of networks have demanded a multi-match packet classification in which the entire matching results along with highest-priority matching rule have to be returned and it is essential to discover competent algorithms to resolve classification problems. A new resourceful packet classification algorithm was introduced in our work named as boundary cutting. Mainly conventional applications of packet classification necessitate the maximum priority matching. The algorithm that was introduced has two principal advantages. Boundary cutting of projected algorithm is more effectual than that of earlier algorithms as it is based on rule boundaries to a certain extent than permanent intervals thus, amount of necessary memory is considerably reduced. Although boundary cutting loses indexing capability at internal nodes binary search recommend better-quality search performance.


FPGA; Decision tree algorithms; Packet classification; Boundary cutting; Priority matching; Binary search

Full Text:


Copyright (c) 2015 Dudala Sujatha, N. Shiva Kumar

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 

Paper submission: ijr@pen2print.org