Data Packet Processing Research Articles

5G network model development in AnyLogic environment

Problem statement. The development of mobile communication networks does not stop for a minute, new standards and various new technologies are emerging. The opportunities provided by mobile technologies have long gone beyond voice services. The sharp growth of Internet traffic in networks around the world is explained by the widespread use of devices connected to mobile networks. With the development of mobile networks, new and diverse requirements are being imposed on them. Technology development is aimed at increasing productivity and expanding opportunities. Therefore, it becomes necessary to study the influence of the characteristics of additional parameters (delays, station loads) on the quality of data packet processing in order to optimize the operation of 5G networks and ensure more efficient use of resources. Many scientists who conducted research on 5G networks using modeling did not take into account various variants of queue processing algorithms, did not consider how the values of data transmission delays and the number of lost packets would change with an increase or decrease in the number of base stations, models consisting of several base stations were not considered. Based on this, we will conclude that it is advisable to develop a 5G network model, with the help of which various studies can be carried out, which will take into account the above parameters. The goal is to investigate the resource model of data transmission in 5G networks, to analyze the operation of the 5G network model in the AnyLogic environment. Results. During the study of traffic maintenance in the 5G network, the optimal system parameters were determined, allowing the most efficient use of network resources. It turned out that the use of methods of dynamic resource allocation and automatic change of base station parameters reduces the load on the network and increases its performance. The developed model allows us to assess the reliability of the system and its ability to process user requests, because the probability of losing an application or non-fulfillment of an application is high, this can lead to user dissatisfaction and a decrease in the quality of service. Practical significance. The developed model can be used in practice to study and evaluate the parameters of the 5G network, as well as to analyze various characteristics that affect the quality of the network in order to improve it. This can help telecom operators optimize their networks and ensure more efficient use of resources.

Improving the technology for processing the aggregated data flow of a secure corporate multiservice communication network

This paper considers the process of dynamic reservation of the channel resource of a secure corporate multi-service communication network. It has been established that the processes of building and functioning of the schemes of a secure corporate multi-service communication network and improving the quality of the implementation of its main work processes involve the evaluation and dynamic reservation of channel resources for incoming aggregated data flows of the network. The model of dynamic reservation of the channel resource of the aggregated data stream of the secure corporate multi-service communication network was built and proposed. The proposed model makes it possible to set the quantitative values of the reserved channel resource for different service methods depending on the number of component flows in the total aggregated data flow of the VPN tunnel. It was established that an increase in the density of the aggregated data stream requires an increase in the reserved channel resource. At the same time, its value is influenced by the way of servicing the aggregated data flow in the VPN tunnel of the secure corporate multi-service communication network. Application of the isolated service method gives a gain in the allocated resource for the channel reserve from 10 to 20 percent compared to the group service method for IR and video telephony. This is due to the more flexible management process of the border router's incoming data storage buffer under the isolated service mode. The model of dynamic reservation of the channel resource of the secure corporate multi-service communication network reported in this paper could be used in the improvement of existing and development of new structures of the secure corporate multi-service communication network. The consequence of such an improvement is a reduction in the delay time for the processing of incoming data packets in the specified network

P-IOTA: A Cloud-Based Geographically Distributed Threat Alert System That Leverages P4 and IOTA

The recent widespread novel network technologies for programming data planes are remarkably enhancing the customization of data packet processing. In this direction, the Programming Protocol-independent Packet Processors (P4) is envisioned as a disruptive technology, capable of configuring network devices in a highly customizable way. P4 enables network devices to adapt their behaviors to mitigate malicious attacks (e.g., denial of service). Distributed ledger technologies (DLTs), such as blockchain, allow secure reporting alerts on malicious actions detected across different areas. However, the blockchain suffers from major scalability concerns due to the consensus protocols needed to agree on a global state of the network. To overcome these limitations, new solutions have recently emerged. IOTA is a next-generation distributed ledger engineered to tackle the scalability limits while still providing the same security capabilities such as immutability, traceability, and transparency. This article proposes an architecture that integrates a P4-based data plane software-defined network (SDN) and an IOTA layer employed to notify about networking attacks. Specifically, we propose a fast, secure, and energy-efficient DLT-enabled architecture that combines the IOTA data structure, named Tangle, with the SDN layer to detect and notify about network threats.

Decoding the Interplay Between Latency, Reliability, Cost, and Energy While Provisioning Resources in Fog-Computing-Enabled IoT Networks

By bringing the processing and storage capabilities of the cloud closer to the end devices, fog computing (FC) enhances the Quality of Service (QoS) for latency-critical Internet of Things (IoT) applications, such as autonomous driving, haptics, and augmented reality (AR). To facilitate the processing and storage of data packets, the fog nodes in the underlying FC-enabled IoT network (FC-IoTN) are to be provisioned with storage and processing resources. Existing resource provisioning solutions focus mainly on latency sensitivity and cost efficiency. They also operate under the assumption that these fog nodes are completely reliable and energy efficient. In reality, this is not true. The fog nodes are not 100% reliable. Neither are they energy efficient. In this study, we propose a novel resource provisioning framework for the fog nodes that considers reliability and energy efficiency, in addition to latency sensitivity and cost efficiency. We first give an analytical framework to model the failures and recoveries in a fog node and use this modeling to provision resources in the fog nodes such that the resultant resource provisioning is optimal in terms of cost and energy consumption. Further, to understand the effect of latency, reliability, cost, and energy on resource provisioning, we analyze and decode the interplay between these factors during resource provisioning in fog nodes. We finally show the efficacy of our approach over the scenario that does not consider reliability and energy efficiency while provisioning resources. Without affecting the latency sensitivity and reliability of the system, our framework achieves an enhancement of 35%, and 37% in terms of cost and energy consumption, respectively, over a nonoptimized framework.

On the Prefix Granularity Problem in NDN Adaptive Forwarding

One unique architectural benefit of Named Data Networking (NDN) is adaptive forwarding, i.e., the forwarding plane is able to observe past data retrieval performance and use it to adjust forwarding decisions for future Interests. To be effective, adaptive forwarding assumes that <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Interest Routing Locality</i> is related to Interests’ common name prefix, meaning that Interests sharing the same prefix are likely to follow a similar forwarding path within a short period of time. Since Interests can have multiple common prefixes with different lengths, the real challenge is determining which prefix length should be used in adaptive forwarding to record path performance measurements - we refer to this as the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Prefix Granularity Problem</i> . The longer the common prefix is, the better the Interest Routing Locality, and the larger the forwarding table. Given the limited FIB size, route names are designed to be considerably shorter than Interest names. Existing adaptive forwarding designs use route names to record path performance measurements, which looses forwarding adaptability as it promises in the event of partial network failures. In this work, we propose to dynamically aggregate and de-aggregate name prefixes in the forwarding table in order to use the prefixes that are the most appropriate given current network situation. In addition, to reduce the overhead of adaptive forwarding, we propose mechanisms to minimize the use of the longest prefix matching in Data packet processing. Simulations demonstrate that the proposed techniques can result in better forwarding decisions in the event of partial network failures with significantly reduced overhead.

Построение комплексных расписаний обработки пакетов данных в конвейерной системе при задании ограничений на длительность интервалов времени ее функционирования

The problem of planning data packet processing in a pipeline system with a time limit on the duration of its operation intervals is considered. The solution of the problem involves determining the composition of data packets, the composition of groups of data packets processed during these time intervals, and the schedules for processing packets of each group. To optimize solutions, the hierarchical game theory is applied. Conditions have been introduced that allow you to determine packages that are processed or readjusted to processing, which causes maximum downtime of pipeline segments. A method for constructing effective group compositions is proposed, which involves excluding packages that are determined in accordance with these conditions and placing packages that are not included in them in groups.

Labeled Network Stack: A High-Concurrency and Low-Tail Latency Cloud Server Framework for Massive IoT Devices

Internet of Things (IoT) applications have massive client connections to cloud servers, and the number of networked IoT devices is remarkably increasing. IoT services require both low-tail latency and high concurrency in datacenters. This study aims to determine whether an order of magnitude improvement is possible in tail latency and concurrency in mainstream systems by proposing a hardware–software codesigned labeled network stack (LNS) for future datacenters. The key innovation is a cross-layered payload labeling mechanism that distinguishes different requests by payload across the full network stack, including application, TCP/IP, and Ethernet layers. This type of design enables prioritized data packet processing and forwarding along the full datapath, such that latency-insensitive requests cannot significantly interfere with high-priority requests. We build a prototype datacenter server to evaluate the LNS design against a commercial X86 server and the mTCP research, using a cloud-supported IoT application scenario. Experimental results show that the LNS design can provide an order of magnitude improvement in tail latency and concurrency. A single datacenter server node can support over 2 million concurrent long-living connections for IoT devices as a 99-percentile tail latency of 50 ms is maintained. In addition, the hardware–software codesign approach remarkably reduces the labeling and prioritization overhead and constrains the interference of high-priority requests to low-priority requests.

Simulation modeling of packet switching network segment functioning

The testing results of required channel resource mathematical estimating models for the for serving the proposed multimedia load in packet-switched communication networks are presented in the article. The assessment of the attainable level of quality of service at the level of data packet transportation was carried out by means of simulation modeling of the functioning of a switching node of a communication network. The developed modeling algorithm differs from the existing ones by taking into account the introduced delay for processing each data stream packet arriving at the switching node, depending on the size of the reserved buffer and the channel resource for its maintenance. A joint examination of the probability of packet loss and the introduced delay in the processing of data packets in the border router allows a comprehensive assessment of the quality of service «end to end», which in turn allows you to get more accurate values of the effective data transmitted rate by aggregating flows at the entrance to the transport network.

Optimization of traditional Snort intrusion detection system

With the rapid development of the Internet, the following network security issues are increasingly prominent and the increasing number of network attacks has also attracted the attention of more professionals. Network attacks are generally divided into operation attack, spoofing attack, flooding attack, redirection and so on. In order to ensure the security of computer system, intrusion detection system is designed, and people pay more and more attention to it. Firewall as the first security gate to maintain network security, intrusion detection system is undoubtedly the second security gate after the firewall. Snort intrusion detection system is a typical application of intrusion detection system. In addition, Snort is a real-time traffic analysis system that can capture and analyze packets on the network according to defined rules. However, with the continuous increase of data volume and the emergence of big data, the pattern library of Snort intrusion detection system also expands correspondingly, leading to the decrease of detection efficiency. DPDK(Data Plane Development Kit) adopts polling method to realize data packet processing, which saves CPU interrupt time, memory copy time, and provides a simple and efficient data packet processing method to the application layer, making the development of network applications more convenient. How to improve the efficiency of Snort intrusion detection system with the advantage of DPDK’s high-performance packet processing is the research focus of this paper.

Coded color shift keying with frequency domain equalization for low complexity energy efficient indoor visible light communications

The adaptive tri-chromatic color shift keying (CSK) modulation standardized in IEEE 802.15.7 and the advanced quad-chromatic CSK are unable to utilize their entire spectral efficiency range over dispersive indoor VLC channels and incur large power penalties without the use of channel equalization and forward error correction. This degrades the energy efficiency and limits the throughput capability of CSK schemes to approximately half of the data-rates specified in the IEEE standard for multimedia services in wireless personal area networks. To comply with the desire for low latency and minimal implementation complexity in the CSK standardization framework, we consider an industry standard binary convolutional code and frequency domain equalization (FDE) which provide one-shot data packet processing. Our results show that when operating over hybrid indoor visible light communication (VLC) links, the FDE based rate-adaptive coded modulation CSK scheme achieves a significant 11 dB SNR gain over an uncoded, unequalized system.

Ultrasonic Positioning System Implementation and Dynamic 3D Visualization

Abstract The paper contributes to the design and implementation of the ultrasonic positioning system based on new multifunctional hardware components, newly released. A moving object coordinates’ determination is described analytically and a matrix equation in respect to unknown coordinates with coefficients, measurement distances, is derived. Stages of data packet processing are formulated, and a pseudo pyramid of measurement distances is built. HX7TR multifunctional ultrasonic devises, transceivers, are used to implement the positioning system. A C# program source code for coordinate determination and 3D visualization is created. The algorithm for moving object coordinate computation, and its program realization as well as HX7TR ultrasonic devises can be used in development of indoor ultrasonic positioning systems embedded in IoT and robotics applications.

English

Aunifiedfiber-to-the-homes (FTTHs) and wireless sensor network (WSN) provides a profitable solution to build up an immaculate ubiquitous-City (U-city). The key objects of actual convergence of FTTH and WSN are less computational intricacy for data packet processing, little installation cost, and good quality of services. In this paper, we familiarise an integrated network structure of multi-optical line terminal (multi-OLT) passive optical network (PON) which can lodge multiple service workers in a single PON. A modified version of interleaved polling algorithm is proposed for scheduling of control messages from multiple OLTs in a single network. We also provide thorough mathematical analysis of cycle time variation, succeeding grant scheduling time, and average packet interruption for both uniform and non-uniform traffic loads generated by each ONU, using fixed service bandwidth provision scheme and limited service bandwidth sharing scheme. We also compare the throughput of the anticipated scheme with existing single-OLT PON for non-uniform traffic load using limited provision bandwidth allocation scheme. The replication results show that the proposed multi-OLT PON system can ropes prevailing bandwidth allocation schemes with better routine than the single-OLT PON in terms of average packet delay, bandwidth consumption, and throughput.

A cloud supported model for efficient community health awareness

The needs for efficient and scalable community health awareness model become a crucial issue in today’s health care applications. Many health care service providers need to provide their services for long terms, in real time and interactively. Many of these applications are based on the emerging Wireless Body Area networks (WBANs) technology. WBANs have developed as an effective solution for a wide range of healthcare, military, sports, general health and social applications. On the other hand, handling data in a large scale (currently known as Big Data) requires an efficient collection and processing model with scalable computing and storage capacity. Therefore, a new computing paradigm is needed such as Cloud Computing and Internet of Things (IoT). In this paper we present a novel cloud supported model for efficient community health awareness in the presence of a large scale WBANs data generation. The objective is to process this big data in order to detect the abnormal data using MapReduce infrastructure and user defined functions with minimum processing delay. The goal is to have a large monitored data of WBANs to be available to the end user or to the decision maker in reliable manner. While reducing data packet processing energy, the proposed work is minimizing the data processing delay by choosing cloudlet or local cloud model and MapReduce infrastructure. So, the overall delay is minimized, thus leading to detect the abnormal data in the cloud in real time mode. In this paper we present a multi-layer computing model composed of Local Cloud (LC) layer and Enterprise Cloud (EP) layer that aim to process the collected data from Monitored Subjects (MSs) in a large scale to generate useful facts, observations or to find abnormal phenomena within the monitored data. Performance results show that integrating the MapReduce capabilities with cloud computing model will reduce the processing delay. The proposed MapReduce infrastructure has also been applied in lower layer, such as LC in order to reduce the amount of communications and processing delay. Performance results show that applying MapReduce infrastructure in lower tire will significantly decrease the overall processing delay.

Multi-OLT and multi-wavelength PON-based open access network for improving the throughput and quality of services

Passive optical network (PON) provides enough bandwidth for combining multiple service providers׳ in addition to the fiber to the home (FTTH) network. Multiple optical line terminals (multi-OLT) PON-based hybrid network is an efficient access network that provides an effective solution for reducing the computational complexity of data packet processing of multiple service providers having different packet lengths and data rates. However, in the multi-OLT PON-based hybrid networks, data transmission in the single upstream channel requires a complicated dynamic bandwidth allocation (DBA) algorithm for improving the bandwidth sharing efficiency among the multiple service providers. In this paper, we propose a new network architecture for a PON-based open access network (OAN) where every optical network unit (ONU) of the PON will be shared by all the service providers and in the central office multiple OLTs will be connected to handle the data packets of multiple service providers. In the upstream direction, we propose to use multiple wavelengths for modulating the data packets of multiple service providers and to avoid the requirement of a complicated DBA algorithm. The simulation results show that the multi-OLT and multi-wavelength PON-based OAN (MM-OAN) provides higher bandwidth utilization, higher upstream efficiency and higher throughput with a lower overhead to data ratio and jitter than the single-OLT and single wavelength PON-based OAN (SS-OAN). The overall throughput of the proposed scheme has been increased more than by a factor equal to the number of wavelengths employed than that of the SS-OAN.

Dynamic Bandwidth Allocation Algorithm With Proper Guard Time Management Over Multi-OLT PON-Based Hybrid FTTH and Wireless Sensor Networks

A passive optical network (PON) is a highly capable access network that effectively converges several service providers, without suffering from any bandwidth deficiency. However, a PON consisting of a single optical line terminal (OLT) for multiple service providers increases the computational complexity for data packet processing in the OLT, resulting in a longer time delay and more packet loss. A multi-OLT PON-based access network is an effective solution for reducing the computational complexity of data packet processing in a hybrid network of multiple service providers. The most important issue concerning the multi-OLT PON is the sharing efficiency of upstream channels among multiple service providers having different packet lengths and data rates. In this paper, we propose a dynamic bandwidth allocation algorithm called adaptive limited dynamic bandwidth allocation for multi-OLT PON (ALDBAM). The proposed scheme is a modified version of adaptive limited dynamic bandwidth allocation (ALDBA) algorithms that we proposed before, where both the ALDBA1 and ALDBA2 schemes are combined with proper guard time management and a modified multipoint control protocol. The simulation results show that the ALDBAM scheme provides lower packet delay with higher bandwidth utilization, higher upstream efficiency, and higher throughput than the conventional ALDBA1 and ALDBA2 schemes.

Network Architecture and Performance Analysis of MULTI-OLT PON for FTTH and Wireless Sensor Networks

An integrated fiber-to-the-homes (FTTHs) and wirele ss sensor network (WSN) provides a cost-effective solution to build up an immaculate ubiquitous-City (U-city). The key objectives of effective converge nce of FTTH and WSN are less computational complexity f or data packet processing, low installation cost, and good quality of services. In this paper, we int roduce an integrated network structure of multi-opt ical line terminal (multi-OLT) passive optical network ( PON) which can accommodate multiple service providers in a single PON. A modified version of in terleaved polling algorithm is proposed for schedul ing of control messages from multiple OLTs in a single network. We also provide detailed numerical analysi s of cycle time variation, successive grant schedulin g time, and average packet delay for both uniform a nd non-uniform traffic loads generated by each ONU, us ing fixed service bandwidth allocation scheme and limited service bandwidth allocation scheme. We als o compare the throughput of the proposed scheme with existing single-OLT PON for non-uniform traffi c load using limited service bandwidth allocation scheme. The simulation results show that the propos ed multi-OLT PON system can supports existing bandwidth allocation schemes with better performanc e than the single-OLT PON in terms of average packet delay, bandwidth utilization, and throughput .

The monitoring system of the ARGO-YBJ data acquisition

The ARGO-YBJ detector has been completely installed at the YangBaJing High Altitude Cosmic Ray Observatory (Tibet, China), at 4300 m a.s.l., and is taking data with a trigger rate of about 4 kHz and a dead time of about 4%. The ARGO-YBJ Data Acquisition System is based on a two-layer readout architecture implementing an event-driven data collection. In order to sustain a high data throughput and have a good readout efficiency or keep the dead time as low as possible, the decoupling FIFOs have been housed on the data packet processing modules. In this paper, the hardware solution to monitor the DAQ system and to track in real-time anomalous data transfers is presented.

YESSIR

RSVP has been designed to support resource reservation in the Internet. However, it has two major problems: complexity and scalability. The former results in large message processing overhead at end systems and routers, and inefficient firewall processing at the edge of the network. The latter implies that in a backbone environment, the amount of bandwidth consumed by refresh messages and the storage space that is needed to support a large number of flows at a router are too large. We have developed a new reservation mechanism that simplifies the process of establishing reserved flows while preserving many unique features introduced by RSVP. Simplicity is measured in terms of control message processing, data packet processing, and user-level flexibility. Features such as robustness, advertising network service availability and resource sharing among multiple senders are also supported in the proposal.The proposed mechanism, YESSIR (YEt another Sender Session Internet Reservations) generates reservation requests by senders to reduce the processing overhead, builds on top of RTCP, uses soft state to maintain reservation states, supports shared reservation and associated flow merging and is compatible with the IETF Integrated Services models.YESSIR extends the all-or-nothing reservation model to support partial reservations that improve over the duration of the session.To address the scalability issue, we investigate the possibility of using YESSIR for per-stream reservation and RSVP for aggregate reservation.

The PIM architecture for wide-area multicast routing

The purpose of multicast routing is to reduce the communication costs for applications that send the same data to multiple recipients. Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets or membership report information are occasionally sent over many links that do not lead to receivers or senders, respectively. We have developed a multicast routing architecture that efficiently establishes distribution trees across wide area internets, where many groups will be sparsely represented. Efficiency is measured in terms of the router state, control message processing, and data packet processing, required across the entire network in order to deliver data packets to the members of the group. Our protocol independent multicast (PIM) architecture: (a) maintains the traditional IP multicast service model of receiver-initiated membership, (b) supports both shared and source-specific (shortest-path) distribution trees, (c) is not dependent on a specific unicast routing protocol, and (d) uses soft-state mechanisms to adapt to underlying network conditions and group dynamics. The robustness, flexibility, and scaling properties of this architecture make it well-suited to large heterogeneous internetworks.

An architecture for wide-area multicast routing

Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets or membership report information are occasionally sent over many links that do not lead to receivers or senders, respectively. We have developed a multicast routing architecture that efficiently establishes distribution trees across wide area internets, where many groups will be sparsely represented. Efficiency is measured in terms of the state, control message processing, and data packet processing, required across the entire network in order to deliver data packets to the members of the group. Our Protocol Independent Multicast (PIM) architecture: (a) maintains the traditional IP multicast service model of receiver-initiated membership; (b) can be configured to adapt to different multicast group and network characteristics; (c) is not dependent on a specific unicast routing protocol; and (d) uses soft-state mechanisms to adapt to underlying network conditions and group dynamics. The robustness, flexibility, and scaling properties of this architecture make it well suited to large heterogeneous inter-networks.