摘要: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.