International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

Modification on Packet Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut) with Analysis

    , ,

Author Affiliations

  • 1Department of Computer Studies and Research, Symbiosis International University, Pune, INDIA
  • 2 Allana Institute of Management Science, Pune University, Pune, INDIA

Res. J. Recent Sci., Volume 3, Issue (8), Pages 16-24, August,2 (2014)

Abstract

All concerning data which were forwarded or received, on networks, it was with great care maintained the sequence of packets. The significant characteristic is a packet consisting of a header and accompanied with data, and it is essentially required to be sent through networking system. It is seriously taken into consideration that this important medium of networking technology necessarily to be protected against growing piracy and to keep networking system secure, we have to develop intrusion detection system (IDS) along with firewalls which is competently able for controlling, categorizing and keeping a watchful check on network traffic. There is very essential thing to be kept in mind, these systems ought to be compared with every packet header, in comparison against a large set of rules, avoiding any unwanted disruption while analysing such related packets, often incur delay. Here, categorizing delay may possibly happen; therefore, this problem can be cut down with the help of quick packet classification method. This will help achieve conclusions faster in analysis of network packets. This paper presents a modified version of the packet classification algorithm, called Packet Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut V2). We proposed, implemented and tested the DimCut algorithm in the previous article” Packet Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut)”, that classifies packets based on five header fields; it is found that the algorithm can classify packets quickly. In order to get extended DimCut algorithm in addition some discovery and result can be obtained. Modification could extend the DimCut algorithm with adding some new heuristics ideas and new implementing techniques which we propose in this paper.

References

  1. Amirjahanshahi H., Poustchi M. and Acharya H., Packet Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut), in proceeding of the Research journal of Recent Sciences, 2(8), 31-39, (2013)
  2. Abdelghani M., Sezer S., Garcia E. and Jun M., Packet Classification Using Adaptive Rules Cutting (ARC), in proceeding of an advanced industrial conference on telecommunications/service assurance with partial and intermittent resources conference/e-learning on telecommunications workshop, 28-33, (2005)
  3. Song H. and Turner J., Toward Advocacy-Free Evaluation of Packet Classification Algorithms, IEEE Transactions on Computers,60, (2011)
  4. Woo T., A Modular Approach to Packet Classification: Algorithms and Results, in Proceedings of INFOCOM 2000, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, , 26-30 (2000)
  5. Srinivasan V., Varghese G., Suri S. and Waldvogel M., Fast and scalable layer four switching, in Proceedings of ACM Sigcomm, Vancouver, Canada, 98, 191-202, (1998)
  6. Stihdis D. and Lakslunan T.V., High-speed policy-based packet forwarding using efficient multi-dimensional range matching, in Proceedings of ACM Sigcomm, 203-214, Vancouver, Canada, August 31-September 4 (1998)
  7. Gupta P. and McKeown N., Packet Classification Using Hierarchical Intelligent Cuttings, in Proceedings of IEEE Symp. High Performance Interconnects (HotI), 7, (1999)
  8. Gupta P. and McKeown N., Packet Classification on Multiple Fields, in proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication in ACM SIGCOMM’ 99, 147-160, (1999)
  9. Baboescu F. and Varghese G., Scalable Packet Classification, in Proceedings of the ACM SIGCOMM, 199–210, (2001)
  10. Feldmann A. and Muthukrishnan S., Tradeoffs for Packet Classification, in Proceedings of the IEEE INFOCOM, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, , 1193–1202 (2000)
  11. Waldvogel M., Varghese G., Turner J. and Plattner B., Scalable High Speed IP Routing Lookups, in Proceedings of the ACM SIGCOMM, 25-38 (1997)
  12. Srinivasan V. and Varghese G., Fast Address Lookups Using Controlled Prefix Expansion, in Proceedings of the ACM Trans. Computer Systems, 17, 1-40, (1999)
  13. Srinivasan V., Suri S. and Varghese G., Packet Classification Using Tuple Space Search, in Proceedings of the ACM SIGCOMM’ 99, 135-146, (1999)
  14. Singh S., Baboescu F., Varghese G. and Wang J., Packet Classification using Multidimensional Cutting, in Proceedings of the ACM SIGCOMM ’03 Conference on Applications, Tech., Archi., and Protocols for Computer Communication (SIGCOMM ’03), 213–224 (2003)
  15. Chen W., Wang W., Li Z. and Chen H., Dynamic Update of Firewall Policy Based on MFDT, in Proceedings of the Computational Intelligence and Security, International Conference, 2(3-6), 1117–1120 (2006)
  16. Qi Y., and Li J., An efficient hybrid algorithm for multidimensional packet classification, in Proceedings of the International Conference Communication, Network, and Information Security, MIT, Cambridge, MA, USA, 9–11, (2006)
  17. Baboescu F., Singh S. and Varghese G., Packet Classification for Core Routers: Is there an alternative to CAMs?, in Proceedings of the IEEE Infocom, (2003)
  18. Warkhede P., Suri S. and Varghese G., Fast Packet Classification for Two-Dimensional Conflict-Free Filters, in Proceedings of the IEEE Infocom, (2001)