6th International Virtual Congress (IVC-2019) And Workshop.  International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

Comparative Analysis of Packet Filtering Algorithms with Implementation

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 4, Issue (2), Pages 72-82, February,2 (2015)

Abstract

Packet classification is an essential part of networking tools like firewalls and routers. All the packets have to be categorized systematically to facilitate broadband internet facilities, as well as a host of applications, embracing Internet gaming, Video on Demand (VoD), TV/Radio and e-businesses, which unceasingly necessitate an cutting-edge intensity of transmission bandwidth, meticulous Quality of Service (QoS) and elaborate security. This dissertation presents a fair appraisal and analysis of packet classification algorithms, BV, HiCuts and DimCut which are constructed on a decision tree structure. The assessment has been piloted on procedures based on analogous principles and design selections. Performance capacities have been obtained by assigning the applied classifiers in an identical set-up of trial environments. Our core involvement in this effort is an unbiased comparison with mutual norms and assessment cases, by affording a standardized appraisal of the three classification algorithms. This work stresses the evaluation of high performance packet classification systems, which are considered necessary to facilitate futuristic routers and switching systems to achieve combat security risks in a very good speed environment. In this study, we have elucidated our erstwhile recommended DimCut packet classification algorithm, and compared it with the HiCut and BV decision tree packet classification algorithms. The proposed improvements have been corroborated by simulated trials.

References

  1. Sundström M., Time and Space Efficient Algorithms for Packet Classification and Forwarding, Doctoral Thesis, Luleå University of Technology Department of Computer Science and Electrical Engineering Centre for Distance Spanning Technology, (2007)
  2. 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)
  3. Gupta P. and McKeown N., Packet Classification Using Hierarchical Intelligent Cuttings, in Proceedings of IEEE Symp. High Performance Interconnects (HotI), 7, (1999)
  4. Vamanan B., Voskuilen G. and Vijay kumar T.N., EffiCuts: optimizing packet classification for memory and throughput, in Proceedings of the ACM SIGCOMM 2010 conference on SIGCOMM, New Delhi, India, (2010)
  5. 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)
  6. Taylor D., Survey and Taxonomy of Packet Classication Techniques, in Proceedings of ACM Computing Surveys, (CSUR), 37(3), 238-275 (2005)
  7. Song H. and Turner J., Toward Advocacy-Free Evaluation of Packet Classification Algorithms, in IEEE Transactions on Computers,60, (2011)
  8. Srinivasan V., Varghese G., Suri S. and Waldvogel M., Fast and scalable layer four switching, in Proceedings of ACM Sigcomm '98, 191-202,Vancouver, Canada, (1998)
  9. Waldvogel M., Varghese G., Turner J. and Plattner B., Scalable High Speed IP Routing Lookups, in Proceedings of the ACM SIGCOMM, 25-38 (1997)
  10. Srinvasan V.and Varghese G., Fast Address Lookups Using Controlled Prefix Expansion, in Proceedings of the ACM Transactions on Computer Systems, Sigmetrics '98/Performance'98, Joint International Conference on Measurement and Modelling of Computer Systems,(1999)
  11. 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)
  12. Feldmann A. and Muthukrishnan S., Trade-offs for Packet Classification, in Proceedings of the IEEE INFOCOM, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies,, 1193–1202 (2000)
  13. Stihdis D. and Lakslunan T.V., High-speed policy-based packet forwarding using efficient multi-dimensional range matching, in Proceedings of ACM Sigcomm, 203214, Vancouver, Canada, August 31– September (1998)
  14. 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, October, 9–11, (2006)
  15. Song H., Turner J. and Dharmapurikar S., Packet Classification Using Coarse-Grained Tuple Spaces, in Proceedings of the ACM/IEEE Symp, Architecture for Networking and Comm., Systems (ANCS ’06), 41- 50 (2006)
  16. Srinivasan V., Suri S.and Varghese G., Packet Classification Using Tuple Space Search, Proc. ACM SIGCOMM, citeseer.ist.psu.edu/srinivasan99packet.html, (1999)
  17. Baboescu F. and Varghese G., Scalable Packet Classification, ACM SIGCOMM, (2001)
  18. Abdelghani M., Sezer S., Garcia E. and Jun M., Packet Classification Using Adaptive Rules Cutting (ARC), in Proceedings of the IEEE Telecommunications, advanced industrial conference on telecommunications/service assurance with partial and intermittent resources conference/e-learning on telecommunications workshop, (2005)
  19. Amirjahanshahi H., Poustchi M. and Acharya H., Modification on Packet Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut) with Analysis, in proceeding of the Research journal of Recent Sciences,3(8), (issue in-press), August (2014)