Explore the vast range of titles available.

With the rapid development of automotive intelligent driving technologies, the demand for real-time performance and bandwidth in in-vehicle bus networks is increasing day by day. When contrasted with conventional in-vehicle bus protocols like LIN and CAN, FlexRay delivers superior performance in bandwidth capacity, communication latency and data transmission speed. Such prominent strengths establish it as a core technical solution for modern automotive network systems. Targeting the flexible bandwidth characteristics of FlexRay bus systems, this work develops a novel heterogeneous message scheduling algorithm (DHSA) tailored for the dynamic segment of FlexRay. The DHSA enables flexible timeslot and priority configuration for event-triggered and low-priority messages, thereby improving the overall scheduling efficiency of FlexRay bus communication. This work adopts the CANoe.FlexRay simulation tool to construct a dedicated experimental platform and perform comparative simulations for the proposed algorithm. The experimental results show that the bandwidth utilization of the heterogeneous scheduling algorithm proposed in this paper reaches 96.6%, an increase of 13.4% compared to the Earliest Deadline First (EDF) algorithm; meanwhile, the fastest response time of the proposed algorithm is reduced by 50% compared to the EDF algorithm. This study effectively reduces message transmission latency and enhances system real-time performance and determinism, thereby further improving the communication efficiency of the in-vehicle FlexRay bus network.

Modern quantitative optical imaging is developing toward high throughput and powerful data processing capabilities. Holography is a powerful technique to characterize quantitative phase delays introduced by light–matter interactions. The spatial bandwidth utilization of imaging sensors in digital holography can be expanded via an off‐axis multiplexing technique, which is a powerful tool for high‐throughput quantitative optical imaging. However, the highest bandwidth utilization of sensor is limited at 58.9% to keep the signal spectra away from the zeroth spectra. Kramers–Kronig relation is introduced into the off‐axis multiplexing technology to allow for the overlapping between the signal spectra and unwanted spectra. The bandwidth utilization of sensor in a diffraction‐limited optical system can reach 78.5% in one hologram. It opens a new route to multiplexing quantitative optical imaging and helps to improve the performance of iterative‐free and constraint‐free modern optical microscopes in various spectral regimes. Modern quantitative optical imaging is developing toward high‐throughput and powerful processing capabilities. The proposed Kramers–Kronig multiplexing digital holography (KKM‐DH) realizes the maximum spatial bandwidth utilization of single multiplexed hologram with 78.5%. It helps to improve the iterative‐free and constraint‐free performance of quantitative optical system, enlarging and empowering applications in high‐throughput, large‐scale studies of computational microscopy and biological tissue analysis.

With the rapid development of intelligent driving technology, in-vehicle bus networks face increasingly stringent requirements for real-time performance and data transmission. Traditional bus network technologies such as LIN, CAN, and FlexRay are showing significant limitations in terms of bandwidth and response speed. In-Vehicle Ethernet, with its advantages of high bandwidth, low latency, and high reliability, has become the core technology for next-generation in-vehicle communication networks. This study focuses on bandwidth waste caused by guard bands and the limitations of Frame Pre-Emption in fully utilizing available bandwidth in In-Vehicle Ethernet. It aims to optimize TSN scheduling mechanisms by enhancing scheduling flexibility and bandwidth utilization, rather than modeling system-level vehicle functions. Based on the Time-Sensitive Networking (TSN) protocol, this paper proposes an innovative Adaptive Frame Segmentation (AFS) algorithm. The AFS algorithm enhances the performance of In-Vehicle Ethernet message transmission through flexible frame segmentation and efficient message scheduling. Experimental results indicate that the AFS algorithm achieves an average local bandwidth utilization of 94.16%, improving by 4.35%, 5.65%, and 30.48% over Frame Pre-Emption, Packet-Size Aware Scheduling (PAS), and Improved Qbv algorithms, respectively. The AFS algorithm demonstrates stability and efficiency in complex network traffic scenarios, reducing bandwidth waste and improving In-Vehicle Ethernet’s real-time performance and responsiveness. This study provides critical technical support for efficient communication in intelligent connected vehicles, further advancing the development and application of In-Vehicle Ethernet technology.

The Dynamic Bandwidth Allocation (DBA) algorithm is required for efficient bandwidth utilization in XG-PON. The majority of existing DBA algorithms do not make use of the unused bandwidth of a queue with other service classes queue. In the update operation, the efficient bandwidth utilization (EBU) method employs a Borrow Refund (BR) method to utilize unused bandwidth between traffic class queues. This paper presents an extra efficient bandwidth utilization (EEBU) algorithm, which overcomes the limitations mentioned above with proper polling and scheduling mechanism. The theoretical and simulation results show that EEBU improvements for T-CONT 2 delay are 1% and 10%, and for T-CONT 3 delay are 8% and 22%, and for T-CONT 4 delay by 6% and 4.5% compared to the EBU and Giga PON access network (GIANT) respectively.

Adequate network design, planning, and improvement are pertinent in a campus network as the use of smart devices is escalating. Underinvesting and overinvesting in campus network devices lead to low network performance and low resource utilization respectively. Due to this fact, it becomes very necessary to ascertain if the current network capacity satisfies the available bandwidth requirement. The bandwidth demand varies from different times and periods as the number of connected devices is on the increase. Thus, emphasizing the need for adequate bandwidth forecast. This paper presents a Monte Carlo simulation model that forecast user bandwidth utilization in a campus network. This helps in planning campus network design and upgrade to deliver available content in a period of high and normal traffic load.

This study investigates the optimization of broadband communication channel capacity through an integrative information-theoretic framework. Leveraging Shannon’s theory, it examines fundamental constraints such as bandwidth limitations, channel noise, modulation techniques, error correction mechanisms, and adaptive systems. A comprehensive literature review of 118 articles identified 18 critical enablers, which were evaluated by domain experts. The Fuzzy DEMATEL method was employed to prioritize enablers based on interdependencies and influence. Results indicate that Security Considerations, Channel Access Protocols, and Propagation Characteristics exert the most significant impact on capacity optimization. The findings offer a structured decision-making model for stakeholders, enabling efficient allocation of technological, infrastructural, and human resources. By bridging theoretical principles with practical implementation, this research provides actionable insights for academic researchers and industry practitioners in designing robust, high-capacity broadband systems. The integrative modeling approach advances the application of information theory in modern communication networks, supporting informed technology adoption and system integration.

The adoption of the Voice over Internet Protocol (VoIP) system is growing due to several factors, including its meagre rate and the numerous contours that can be joined with VoIP systems. However, the wasteful utilisation of the computer network is an inevitable problem that limits the rapid growth of VoIP systems. The essential explanation behind this wasteful utilisation of the computer network bandwidth (BW) is the considerable preamble length of the VoIP packet. In this study, we invent a technique that addresses the considerable preamble length of the VoIP packet. The designed technique is known as the manikin voice frame (MVF). The primary idea of the MVF technique is to utilise the VoIP packet preamble tuples that are not essential to the voice calls, particularly client-to-client calls (voice calls between only two users). Specifically, these tuples will be utilised for reserving the data of the VoIP packet. In certain instances, this will make the VoIP packet data manikin or even make it empty. The performance assessment of the introduced MVF technique demonstrated that the utilisation of the computer network BW has enhanced by 33%. Along these lines, the MVF technique indicates potential progress in resolving the inefficient usage of the computer network BW.

The inefficient use of the IP network bandwidth is a fundamental issue that restricts the exponential spreading of Voice over IP (VoIP). The primary reason for this is the big header size of the VoIP packet. In this paper, we propose a method, called Short Voice Frame (SVF), that addresses the big header size of the VoIP packet. The main idea of the SVF method is to make effective use of the VoIP packet header fields that are unneeded to the VoIP technology. In particular, these fields will be used for temporarily buffering the voice frame (VoIP packet payload) data. This will make the VoIP packet payload short or even zero in some cases. The performance evaluation of the proposed SVF method showed that the use of the IP network bandwidth has improved by up to 28.3% when using the G.723.1 codec.

An adaptive real-time gate scheduling scheme for time perceptive stream or packet flow is proposed to improve the standards of Ultra Low Latency during data transmission. For highly dynamic network conditions, the conventional configuration scheme is not suitable and therefore an adaptive real-time gate scheduling method is proposed for time perceptive streams. This dynamicity reconfiguration is difficult and the scheduling problem is formulated using Field Programmable Gate Array – Boolean Satisfiability Problem (FPGA-BSP) solver. This proposed scheme highly helps in network dynamicity conditions with good bandwidth utilization and high flexibility. End-to-end latency is required to be on sub-milliseconds order deal with the applications such as Industrial Internet of Things, 5G and 6G mobile, tactile internet and so on. Simulation analysis is carried out to prove the efficiency of the proposed model.

Voice over IP (VoIP) is widely utilized by organizations, schools, colleges, and so on. Nevertheless, VoIP numerous challenges that hinder its spread. One of the significant challenges is the poor exploit of the VoIP technology network bandwidth (BW), caused by the huge preamble of the VoIP packet. This paper suggests a novel methodology to manage this huge preamble overhead challenge. The proposed methodology is named runt payload VoIP packet (RPV). The core principle of the RPV methodology is to reemploy and exploit the VoIP packet preamble’s data (fields) that are superfluous by VoIP technology, especially for unicast IP voice calls. Generally, those fields will be used to convey the VoIP packet payload. Consequently, diminish or zero the length of the payload and, therefore, spare the BW. The results of the investigation into the suggested RPV methodology indicated significant enhancement in the BW exploitation of VoIP technology. For instance, the saved BW in the examined environment with the LPC codec came to up to 25.9%.