The elastic optical network (EON) fulfills the upcoming generation network requirements such as high‐definition videos, high bandwidth demand services, and ultra‐high‐definition televisions. The key issues in EON are routing spectrum assignment and spectrum fragmentation for spectrum allocation. The spectrum fragmentation issues are resultant in poor consumption of spectrum resources and an increase in the new connection blocking. A flexible defragmentation algorithm must utilize more spectrum resources with a high transmission rate. This paper presents a new multiconstrained defragmentation algorithm (MCDFA) for elastic optical networks. The MCDFA addressed two key issues: spectrum allocation for new connections and then reconfiguring the existing connections in a nondisruptive manner. The first‐last‐exact fit spectrum allocation policy assigns the spectrum slots during the new connection request. It splits each light path request by disjoint/ nondisjoint and by efficiently handling the small fragmented slots in spectrum resources. The simulation results are evaluated using standard metrics such as bandwidth blocking probability, bandwidth fragmentation ratio, and spectrum utilization gain. The results also demonstrated that our proposed algorithm generates promised solution to EON’s routing, spectrum assessment, and fragmentation issues.
Nowadays the modern high-speed networks face two critical challenges, which are maintaining top level security, while at the same time reducing energy usage. As the data transmission rates grow as much as to petabyte rates, the computational expense of inspecting the network traffic has become a major issue in performance. The traditional network intrusion detection systems (IDS), which relies on signature matching, struggles to scale efficiently, which results in increased latency, reduced packet delivery ratio (PDR), and excessive power consumption. This paper illustrates a detailed evaluation of PacketHawk, a smart framework engineered to overcome the above limitations through the application of Decision Tree (DT) algorithm. This framework relies on foundational documentation and thorough research, including the studies by Jadhav et al. (2024) and Jiang et al. (2021), the work breaks down the system’s architecture logic and operating efficiency. this work experimental analysis using the NSL-KDD (Network Security Laboratory - Knowledge Discovery in Databases) dataset confirms that PacketHawk attains 100% detection accuracy, while only taking the processing latency of just 0.0006% ms per network packet. Besides, the work investigates the downstream effects of the ultra-low latency, highlighting its direct relation with enhanced quality of service (QoS), higher throughput, and reduction in footprint of network security operations.