The rapid proliferation of Internet of Things (IoT) devices has brought significant advancements across various sectors, yet their widespread use exposes them to numerous cybersecurity risks. This article comprehensively analyses IoT cybersecurity, focusing on common attack vectors, defensive mechanisms, and analytical tools. Key threats such as device spoofing, node capture, and side-channel attacks are detailed alongside effective countermeasures, including encryption, authentication, and secure boot processes. The paper also explores the application of machine learning algorithms, such as Random Forests and Support Vector Machines, in detecting and mitigating IoT-specific threats. Security frameworks, ranging from qualitative approaches like OCTAVE to quantitative methodologies like CVSS, are also evaluated for their relevance in assessing and managing IoT vulnerabilities. This study guides the development of robust IoT security strategies based on recent research.

The rapid proliferation of Internet of Things (IoT) devices has introduced significant cybersecurity challenges due to the heterogeneity and vulnerability of these systems. This paper investigates the integration of Fortinet’s security solutions with IoT systems to enhance threat detection and mitigation capabilities. A hybrid architecture combining conventional networking components with Fortinet technologies, such as FortiGate and FortiAnalyzer, is proposed and implemented. The solution is validated through a series of practical scenarios that simulate real-world network attacks on IoT devices. Results demonstrate improved detection accuracy and response time, emphasizing the effectiveness of Fortinet’s centralized logging and anomaly detection mechanisms. The study provides a scalable framework that can be adapted for various IoT environments, contributing to the development of more secure and resilient network infrastructures.

Summary We consider an ideal link with bounded, independent, and identically distributed stochastic arrival and capacity processes. We use the theory of effective bandwidth and the theory of generating functions to improve known results about the queue process. Specifically, we prove better bounds on the probability distribution function and the tail distribution function of queue lengths.

Summary The network convergence time may take hundreds of milliseconds or more. Since this repair performance may be unsatisfactory, IP fast reroute (IPFRR) approaches have been developed to decrease the network convergence time and minimize traffic loss. These IPFRR mechanisms are usually based on the proactive precomputation of a backup path before a failure occurs. Once a failure is detected, the router running IPFRR will immediately use this backup path in response to the failure, rather than computing a replacement path only after a failure has occurred. The computation of an alternative path in many IPFRR mechanisms requires that the computing node (router) knows the exact network topology. In this paper, we present a new IPFRR mechanism called the multicast repair (M‐REP) IPFRR mechanism, which provides an advanced fast reroute technique for Internet service providers‘ (ISP‘s) core networks. The M‐REP IPFRR mechanism is based on IP multicast and utilizes Protocol Independent Multicast – Dense Mode (PIM‐DM) with the modification of an internal reverse path forwarding (RPF) check. The M‐REP IPFRR mechanism does not depend on any particular routing protocol type (distance‐vector or link‐state) and requires less system resources because of its precomputation‐less character but still provides immediate reaction to failure.