Packet-switched Networks Research Articles

Test scheduling of network-on-chip using hybrid WOA-GWO algorithm

The promising Network-on-Chip (NoC) model replaces the existing system-on-chip (SoC) model for complex VLSI circuits. Testing the embedded cores using NoC incurs additional costs in these SoC models. NoC models consist of network interface controllers, Internet Protocol (IP) data centers, routers, and network connections. Technological advancements enable the production of more complex chips, but longer testing times pose a potential problem. NoC packet switching networks provide high-performance interconnection, a significant benefit for IP cores. A multi-objective approach is created by integrating the benefits of the Whale Optimization Algorithm (WOA) and Grey Wolf Optimization (GWO). In order to minimize the duration of testing, the approach implements optimization algorithms that are predicated on the behavior of grey wolves and whales. The P22810 and D695 benchmark circuits are under consideration. We compare the test time with existing optimization techniques. We assess the effectiveness of the suggested hybrid WOA-GWO algorithm using fourteen established benchmark functions and an NP-hard problem. This proposed method minimizes the time needed to test the P22810 benchmark circuit by 69%, 46%, 60%, 19%, and 21% compared to the Modified Ant Colony Optimization, Modified Artificial Bee Colony, WOA, and GWO algorithms. In the same vein, the proposed method reduces the testing time for the d695 benchmark circuit by 72%, 49%, 63%, 21%, and 25% in comparison to the same algorithms. We experimented to determine the time savings achieved by adhering to the suggested procedure throughout the testing process.

A Distributed UAV Management System Inspired by Packet-Switched Networks

A Distributed UAV Management System Inspired by Packet-Switched Networks

СПРОЩЕНА ІМІТАЦІЙНА МОДЕЛЬ НАВАНТАЖЕННЯ В ЗАМКНЕНІЙ МЕРЕЖІ КОМУТАЦІЇ ПАКЕТІВ

An approach to simplified simulation modeling of packet switching network load has been developed. The simulated representation of network processes is based on a simplified mathematical model of the packet switching network, which is based on a dis-cretized description of the load states of the network nodes and corresponds to the repre-sentation of the current state of the network in the tasks of managing its load. Changes in the node's filling state are modeled as a process of reproduction and death, and in the full load model, two factors of change are taken into account: the node's exchange of load with network users and transit load flow passing through it. To study an artificially se-lected "part of the network functioning process" - an approach to transit load modeling in a load-locked network is proposed. The approach allows for significant simplifications and ensures the leveling of the negative impact of simplifications on "load closure" (en-sures the rule of constant amount of load in a closed network). The developed simulation model, firstly, creates the basis for the improvement of the complete model, and secondly, it is convenient for working out routing algorithms when analyzing them from the point of view of indicators of the ability to "influence" the load in the network. The obtained re-sults are generalized, but attention is focused on the example of satellite packet switching networks.

Optimizing energy storage plant discrete system dynamics analysis with graph convolutional networks

Addressing the challenges of suboptimal model performance and excessive parameters and operations in the optimization of energy storage power plants utilizing Graph Convolutional Network (GCN), this paper introduces a novel approach – the packet-switched graph convolutional network. Initially, a GCN extreme learning machine is established. Drawing inspiration from this solid foundation, we have innovatively crafted a group exchange graph convolution module. This module leverages group graph convolution techniques to amalgamate unique node feature information, tailored to diverse topology graph matrices based on various groupings. This innovative approach ensures that information flows freely and effectively among distinct groupings. Furthermore, we have designed a cutting-edge timing depth separation convolution module, comprising two innovative components. The first component introduces timing depth separation convolution, revolutionizing the original timing convolution module. The second component, the packet-switching graph convolutional network, revolutionizes the time sequence depth separation convolution process. It achieves this by employing 1 × 1 convolutional layers between different feature fusion packets, enabling seamless information exchange between distinct packets. Experimental results demonstrate the efficacy of the proposed model, with root mean square error (RMSE) metrics and root mean square error (MAE) metrics for single-step prediction reaching 46.08 and 26.22 at 60 min, respectively. In multi-step testing, the proposed model exhibits a 14.71 % reduction in RMSE error at the 15-min scale and a 9.29 % reduction at the 60-min scale compared to the benchmark model. This performance improvement enhances the operational efficiency and reliability of the energy storage plant, particularly under dynamic changes in the time series.

SIMPLIFIED SIMULATION MODEL OF LOAD IN A CLOSED PACKET SWITCHING NETWORK

An approach to simplified simulation modeling of packet switching network load has been developed. The simulated representation of network processes is based on a simplified mathematical model of the packet switching network, which is based on a discretized description of the load states of the network nodes and corresponds to the representation of the current state of the network in the tasks of managing its load. Changes in the node's filling state are modeled as a process of reproduction and death, and in the full load model, two factors of change are taken into account: the node's exchange of load with network users and transit load flow passing through it. To study an artificially selected "part of the network functioning process" - an approach to transit load modeling in a load-locked network is proposed. The approach allows for significant simplifications and ensures the leveling of the negative impact of simplifications on "load closure" (ensures the rule of constant amount of load in a closed network). The developed simulation model, firstly, creates the basis for the improvement of the complete model, and secondly, it is convenient for working out routing algorithms when analyzing them from the point of view of indicators of the ability to "influence" the load in the network. The obtained results are generalized, but attention is focused on the example of satellite packet switching networks.

Unidirectional switch model for multiservice traffic with polymodal distribution

The modern stage of development of telecommunication networks is characterized by active improvement of routing algorithms in packet-switched networks taking into account the provision of the required quality of service. The need to transfer large amounts of information is due to the need to ensure the normal functioning of modern multimedia applications, in particular such as IP telephony, video and radio broadcasting, interactive distance learning, which determines the multiservice nature of traffic, which is heterogeneous, and its statistical properties in most cases are of a complex polymodal nature. Taking into account the fact that traditional Poisson models providing FIFO servicing of network traffic for solving modern telecommunication problems lead to overly optimistic results in terms of delays, there is a need to develop a new mathematical model of a unidirectional switch providing FIFO servicing of multiservice traffic with polymodal distribution taking into account the provision of the required quality of subscriber service and an algorithm for estimating its main parameters. Development of a mathematical model of a unidirectional switch FIFO-service of multiservice traffic with polymodal distribution taking into account the provision of the required quality of subscriber service and an algorithm for estimating its main parameters. A new mathematical model of a unidirectional switch implementing FIFO-service of multiservice traffic with polymodal distribution has been developed, allowing one to estimate the probabilities that packets arriving at the switch input will not be processed due to overflow of its buffer memory and exceeding the maximum packet processing time. The model takes into account the delays introduced by the channel and channel equipment during the distribution and processing of packets from the source to the switch in question. Recommendations for modeling traffic processing to ensure the specified accuracy of the results are presented.

Maximum Entropy Solution for M^X/G/1 Priority Reiterate G-queue Under Working Breakdown and Working Vacation

The maximum entropy principle has grown progressively more pertinent to queueing systems. The principle of maximum entropy (PME) presents an impartial framework as a promising method to examine complex queuing processes. This principle can be employed to assess the most appropriate probability distributions for queueing scenarios in a variety of widespread industrial issues. The aspects of general service bulk arrival retrial G-queue including working vacation, state-dependent arrival, priority users, and working breakdown are all explored in this article. Real-world applications for this kind of waiting line include computer systems, industrial companies, packet-switching networks, and communication facilities, etc. The adverse users (or negative arrivals) can make an appearance when the server (operator) is preoccupied with a positive user. Consumer’s arrival patterns follow the Poisson distribution. Priority consumers and regular (ordinary) consumers are the two groups of consumers that are considered in this investigation. Priority consumers do not have to wait in line and are granted a special right of prevention that allows them to receive services before ordinary consumers. Initially, we have estimated performance metrics including orbit size and long-run probabilities in this research work. The maximum entropy approach is then used to give a comparative perusal between the system’s exact and estimated waiting times. Apart from that a bi-objective optimization model is developed to diminish both consumers waiting times and estimated costs simultaneously. It is manageable to establish an effective balance between the standard of service and operating expenses using the analytical strategy that has been provided.

Batch poissonian arrival models of multiservice network traffic

The emergence of packet-switched communication networks has made it clear that Poissonian arrival flow models are not quite adequate and required the development of new models based on non-Poisson distributions. This paper is devoted to the analysis of a particular case of a batch Markovian flow, namely, batch (nonordinary) Poissonian arrivals. Such a flow is stationary and memoryless but not ordinary. We consider a class of queueing systems with constant service time. We present results of analytical computations of arrival flow parameters and also simulation results. We show that the variance of the queue depends on the third moment of the batch size in a batch Poissonian arrival flow.

Optical switching will innovate intra data center networks [Invited Tutorial

Reflecting the recent slow-down in Moore’s law and the proliferation of artificial intelligence/machine learning workloads, the performance and energy consumption of networks are becoming barriers in high-performance computing (HPC) and data centers. Optical switches are expected to break these barriers, and indeed their introduction has recently commenced in data centers. This paper discusses how optical switching technologies can innovate future intra data center networks. Hyperscale data centers are much bigger in scale, and network requirements are slightly different from those of HPC. This paper focus on data center networks, since the impact of optical technologies will be more significant in data centers than in HPC. In addition to the scale issue, important metrics to be considered for network design are traffic characteristics and latency, both of which are highlighted in this paper. For hybrid (electrical packet and optical circuit) switching networks, the target latency for the optical circuit switch network (connection setup/teardown time) is shown to be around 10 µs, and the needed technologies are clarified and verified by experiments. The optical switch can simplify the present multi-tier switching network above tier-1 switches into a single tier configuration, which is possible with the development of efficient large port count optical switches. Among the different switching architectures, combining the different dimensions of space and wavelength is shown to be one of the best solutions. Fast switching needs fast device response time. Si photonics devices using Mach–Zehnder interferometers or ring-resonator-based switches and tunable filters are the most promising candidates; they offer cost-effective mass-production and fast operation and so are excellent candidates for the optical switches envisaged. Another critical technology to maximize the benefits of optical switches is a simple and low-latency control mechanism. Different approaches have been suggested as summarized in this work. Among them, harnessing optical switch parallelism is a unique technique that matches recent advances in electrical switch chips. A fast control network is realized by using a fully decentralized and asynchronous control mechanism. A hyperscale data center offers a wide variety of services, and no one system fits all needs. Optimization of parameters is an important task for maximizing the impact of optical switching in different kinds of data centers.

2D router chip design, analysis, and simulation for effective communication

<p class="Correspondencedetails"><span lang="EN-US">The router is a network device that is used to connect subnetwork and packet-switched networking by directing the data packets to the intended IP addresses. It succeeds the traffic between different systems and allows several devices to share the internet connection. The router is applicable for the effective commutation in system on chip (SoC) modules for network on chip (NoC) communication. The research paper emphasizes the design of the two dimensional (2D) router hardware chip in the Xilinx integrated system environment (ISE) 14.7 software and further logic verification using the data packets transmitted from all input/output ports. The design evaluation is done based on the pre-synthesis device utilization summary relating to different field programmable gate array (FPGA) boards such as Spartan-3E (XC3S500E), Spartan-6 (XC6SLX45), Virtex-4 (XC4VFX12), Virtex-5 (XC5VSX50T), and Virtex-7 (XC7VX550T). The 64-bit data logic is verified on the different ports of the router configuration in the Xilinx and Modelsim waveform simulator. The Virtex-7 has proven the fast-switching speed and optimal hardware parameters in comparison to other FPGAs.</span></p>

Experimental Analysis and Optimization Approach of Self-Clocked Rate Adaptation for Multimedia Congestion Control Algorithm in Emulated 5G Environment.

The congestion problem has driven many researchers to address it, among other networking issues. In a packet-switched network, congestion is essential; it leads to a high response time to deliver packets due to heavy traffic, which eventually causes packet loss. Hence, congestion control mechanisms are utilized to prevent such cases. Several interesting algorithms are proposed to focus on this dilemma, such as the Self-Clocked Rate Adaptation for Multimedia (SCReAM) designed for interactive real-time video streaming applications. One of the main issues of SCReAM is the high design complexity due to the large size of its documentation and coding. Furthermore, there is a considerable number of parameters that can be adjusted to accomplish the desired performance. This study proposes a guided parameters' tuning approach to assess and optimize the SCReAM algorithm in an emulated 5G environment through a detailed exploration of its parameters. The proposed approach consists of three phases, namely, the initialization phase, the standalone experimentation phase, and the hybrid experimentation phase. In the first phase, we illustrate the method of initializing and implementing the environment, followed by specifying the investigated parameters' settings, testing, and validation. The second phase aims to investigate SCReAM parameters in isolation to identify the effect on the performance in relation to network queue delay, smoothed Round Trip Time (sRTT), and throughput. The final phase discusses the possibility of achieving the optimum performance by combining various sets to provide researchers with clear and explicit guidelines to establish an adequate SCReAM behavior for the desired application. To the best of our knowledge, this is the first study that proposes a preliminary and comprehensive analysis of the SCReAM algorithm. Based on the proposed approach, when L4S/ECN is disabled, we reduced the network queue delay by 63.36% and increased the network throughput by 48.6% as compared to the results generated by the original design. In L4S/ECN-enabled mode, the network queue delay is reduced by 16.17% while the network throughput increased by 93%.

Statement of Retraction: A Survey on Packet Switching Networks

Statement of Retraction: A Survey on Packet Switching Networks

Spectral efficiency analysis of spectral amplitude coding-based optical packet-switching networks using p value approach

Spectral efficiency analysis of spectral amplitude coding-based optical packet-switching networks using p value approach

Quantum key distribution in a packet-switched network

Packet switching revolutionized the Internet by allowing the efficient use of network resources for data transmission. In a previous work, we introduced packet switching in quantum networks as a path to the Quantum Internet and presented a proof-of-concept for its application to quantum key distribution (QKD). In this paper, we outline a three-step approach for key rate optimization in a packet-switched network. Our simulated results show that practical key rates may be achieved in a sixteen-user network with no optical storage capacity. Under certain network conditions, we may improve the key rate by using an ultra-low-loss fiber delay line to store packets during network delays. We also find that implementing cut-off storage times in a strategy analogous to real-time selection in free-space QKD can significantly enhance performance. Our work demonstrates that packet switching is imminently suitable as a platform for QKD, an important step towards developing large-scale and integrated quantum networks.

Operating Characteristic Curves of Optical Packet-Switching Using Optical Code-Division Multiplexing for Label Switching

In this paper, the operating characteristic curves (OCCs) of optical code-division multiplexing (OCDM) technology for label switching of an optical packet-switching (OPS) network was evaluated. A node structure for processing the packets, with spectral-amplitude-coding (SAC) labels, considering a balanced detector and an optical switch, was developed and modeled. The effects of decoding noises on the performance of both M-sequence and stuffed quadratic congruence (SQC) labeling systems were addressed. Hypothesis testing was applied to the decoder to investigate the results of label recognition. The null and alternative hypotheses were, respectively, defined as a decoder receiving the matching and mismatching labels. Due to the noise effects, the decoder output may not reflect the label status correctly. Type I error occurs when the null hypothesis is true while accepting the alternative one. Type II error occurs when the alternative hypothesis is true while accepting the null one. Analytic equations of both errors were given, considering a desired packet that was missed and an undesired packet shown in a switched path. The trade-off between these two errors, regarding the decoder threshold, was demonstrated in operating characteristic curves (OCCs). A better OCC could be found when a packet had more labeled payload bits, or when the utilized label code had a lower auto-to-cross-correlation ratio.

Relationship between IoT Service User Quality and Network QoS Factors

The Internet of Things (IoT) is a complete network of networked computer devices, digital and mechanical equipment, and the capacity to send data over the Internet based on machine to machine interaction. It is also known as the Internet of Everything (IoE). The Internet is a packet-switched network, which means that the Quality of Service (QoS) elements (such as packet loss, latency, jitter, and so on) have an influence on the Quality of Experience (QoE) for the Internet of Things services. This research used a subjective evaluation method in order to evaluate the relationship between the quality of service (QoS) measures such as packet loss, latency, and jitter and the quality of experience (QoE) for Internet of Things services. In addition to that, a mapping model from quality of service to quality of experience was suggested. According to the results of this research, there is a close connection between the subjective opinion score and the quality of service (QoS) variables such as packet loss, latency, and jitter. The results of this investigation open up possibilities for additional research into the quality of experience of Internet of Things services.

A routing method with adaptively adjusting memory information based on local routing history.

Finding the shortest paths for packets from sources to destinations in packet-switched communication networks is an inevitable problem in building a future high-speed information society. A routing method with memory information has already been proposed to alleviate the congestion of large volumes of packet flow. This routing method shows a high transmission completion rate even for large volumes of packet flows in communication networks with scale-free properties. However, the method exhibits poor performance for networks with local triangular connections and long distances between nodes. To overcome these problems, in this study, we first enhanced the routing performance of the conventional communication network models by using the betweenness centrality of nodes, which is one of the network centralities that measures the number of shortest paths that pass through each node in the networks. Subsequently, we adaptively changed the transmitting paths of packets by using only local information. Numerical simulations indicated that our routing method performs successfully for various topologies of communication networks by avoiding the congested node, and effectively using the memory information.

Method for calculation indicators steganographic systems in multiservice communication networks

An analysis of the performance indicators multiservice telecommunication networks using the sixth technological order based on the NGN (Next Generation Network) architectural concept and future FN (Future Networks) networks was carried out to build high-performance steganographic systems with increased covert channels throughput, ensuring the achievement of a certain level information security. Comprehensive criteria for the efficiency the functioning steganographic systems are considered and the channel capacity of the steganosystem as a communication system with packet switching is selected. On the basis of the study, a new approach to constructing a method for evaluating complex indicators of the quality of steganographic communication during embedding and extracting hidden data is proposed. The quality of steganographic communication refers to the properties stegano communication to ensure the efficiency of the system, both timely and reliable transmission of messages. On the basis of the proposed approach, the effectiveness steganographic systems in the construction of covert channels for the transmission secret data transmitted over communication channels was studied. Taking into account the new entropy approach, a method for calculating the indicators of the latent throughput steganographic systems in packet-switched communication networks has been created. As a result of the study calculation method, important analytical expressions were obtained for evaluating complex indicators throughput steganographic systems, such as the throughput of covert channels, the maximum possible value of the performance of a binary source packets, the average packet transmission time with the proposed coding scheme, and the residual throughput of the communication channel.

ADMIRE: collaborative data-driven and model-driven intelligent routing engine for traffic grooming in multi-layer X-Haul networks

X-Haul aims to provide a unified transport network for integrating mobile fronthaul/midhaul/backhaul. Its architecture is inherited from the IP-over-WDM paradigm, in which the upper layer is an electrical packet-switched network and the bottom layer is an optical circuit-switched network. Traffic grooming in X-Haul poses a big challenge, as the mobile traffic load has shown. As a multi-layer routing problem, traffic grooming has been well studied through some classic mathematical models, such as the auxiliary graph (AG). Recently, a new approach based on machine learning has been attracting much attention for its network routing decision making. According to previous studies, either of the two approaches has its limitations, but the combination of the two may achieve profit maximization. To this end, we propose and demonstrate, for the first time, to our knowledge, a collaborative data-driven (using machine learning) and model-driven (using experiential knowledge) intelligent routing engine (ADMIRE) for traffic grooming in an X-Haul testbed with a real mobile dataset. The principle of ADMIRE is to exploit the capability of machine learning for an accurate AG model in a dynamic network environment. We compare ADMIRE with a traditional model-driven approach (i.e., the AG), and the evaluation results show that ADMIRE can achieve good performance and a strong generalization ability. In addition, we also verify the influence of data correlation on ADMIRE.

ОСОБЕННОСТИ ИЗУЧЕНИЯ ПЕРЕДАЧИ ПАКЕТНОЙ ИНФОРМАЦИИ ПО ТЕХНОЛОГИЯМ КОМПЬЮТЕРНЫХ СЕТЕЙ ОБУЧАЮЩИМИСЯ ЖЕЛЕЗНОДОРОЖНЫХ ВУЗОВ

The article discusses the role of telecommunication systems and networks in the work of railway transport. The authors analyzed the demand for the transfer of information data today, noted the principles of interconnection and building local networks, displayed the revised and supplemented material of the manuals. The introduction of a large number of information equipment in people's lives has led to a global transformation of the digital space. This is especially noticeable in the railway industry, where highquality and timely transmission of information data plays a paramount role in the transportation process. Due to digital transformation, the need for uninterrupted and highquality sending of information over long distances with minimal losses, the need to introduce theoretical and practical material on modern technologies for information data transmission networks. On the basis of this, an urgent need is revealed for training personnel in the study of network technologies in order to improve the efficiency of the functioning of the railway infrastructure. Therefore, it is more important than ever to transform the educational process, to direct resources to introduce as much network equipment as possible into classrooms for visual acquaintance and study of the main points of packet switching by students of the railway university. The work also presents the progress of the laboratory work on the topic "Static Routing in Packet Switching Networks", which is performed in the Cisco Packet Tracer software network emulator. All the necessary commands used to perform laboratory work by students of a railway university are presented. The laboratory work, in turn, is devoted to the user interface, network configuration, one of the types of routing. It is concluded that by developing an educational program for students to study the work of building packet switching networks, it will be possible to produce a qualified specialist who deeply understands the operation of telecommunications equipment. This is what will improve the network component of railway transport.