Variable Packet Size Research Articles

Toward Wireless Smart Grid Communications: An Evaluation of Protocol Latencies in an Open-Source 5G Testbed

Fifth-generation networks promise wide availability of wireless communication with inherent security features. The 5G standards also outline access for different applications requiring low latency, machine-to-machine communication, or mobile broadband. These networks can be advantageous to numerous applications that require widespread and diverse communications. One such application is found in smart grids. Smart grid networks, and Operational Technology (OT) networks in general, utilize a variety of communication protocols for low-latency control, data monitoring, and reporting at every level. Transitioning these network communications from wired Wide Area Networks (WANs) to wireless communication through 5G can provide additional benefits to their security and network configurability. However, introducing these wireless capabilities may also result in a degradation of network latency. In this paper, we propose utilizing 5G for smart grid communications, and we evaluate the latency impacts of encapsulating GOOSE, Modbus, and DNP3 for transmission over a 5G network. The OpenAirInterface open-source library is utilized to deploy an in-lab 5G Core Network and gNB for testing with off-the-shelf User Equipment (UE). This creates an effective 5G test platform for experimenting with different OT protocols such as GOOSE. The results are validated by measuring two different Intelligent Electronic Devices’ contact closure times for each network configuration. These tests are also conducted for varying packet sizes in order to isolate different sources of network latency. Our study outlines the latency impact of communication over 5G for time-critical and non-critical applications regarding their transition toward private 5G-based OT network implementations. The conducted experiments illustrate that in the case of GOOSE packets, simple encapsulation may exceed the protocol’s time-critical nature, and, therefore, additional measures must be taken to ensure a viable transition of GOOSE to 5G services. However, non-critical applications are shown to be viable for migration to 5G.

A Novel Energy-Efficient Reservation System for Edge Computing in 6G Vehicular Ad Hoc Network.

The roadside unit (RSU) is one of the fundamental components in a vehicular ad hoc network (VANET), where a vehicle communicates in infrastructure mode. The RSU has multiple functions, including the sharing of emergency messages and the updating of vehicles about the traffic situation. Deploying and managing a static RSU (sRSU) requires considerable capital and operating expenditures (CAPEX and OPEX), leading to RSUs that are sparsely distributed, continuous handovers amongst RSUs, and, more importantly, frequent RSU interruptions. At present, researchers remain focused on multiple parameters in the sRSU to improve the vehicle-to-infrastructure (V2I) communication; however, in this research, the mobile RSU (mRSU), an emerging concept for sixth-generation (6G) edge computing vehicular ad hoc networks (VANETs), is proposed to improve the connectivity and efficiency of communication among V2I. In addition to this, the mRSU can serve as a computing resource for edge computing applications. This paper proposes a novel energy-efficient reservation technique for edge computing in 6G VANETs that provides an energy-efficient, reservation-based, cost-effective solution by introducing the concept of the mRSU. The simulation outcomes demonstrate that the mRSU exhibits superior performance compared to the sRSU in multiple aspects. The mRSU surpasses the sRSU with a packet delivery ratio improvement of 7.7%, a throughput increase of 5.1%, a reduction in end-to-end delay by 4.4%, and a decrease in hop count by 8.7%. The results are generated across diverse propagation models, employing realistic urban scenarios with varying packet sizes and numbers of vehicles. However, it is important to note that the enhanced performance parameters and improved connectivity with more nodes lead to a significant increase in energy consumption by 2%.

Analysis of the Varying Packet Sizes Effect on Energy Consumption in Cognitive Radio Networks

Günümüzde, özellikle kablosuz iletişim ihtiyacı gerektiren uygulamaların artmasıyla bu alana yönelik yapılan çalışmalar giderek önem kazanmaktadır. Çoklu ortam iletişimi, sosyal ağların kullanımı ve dosya paylaşımı gibi yoğun veri trafiği gereksinimi olan uygulamaların artışı, kablosuz iletişim teknolojilerinde önemli bir yeri olan spektruma olan ihtiyacı günden güne artırmaktadır. Kablosuz iletişimde spektrum, en önemli kaynak olarak görülmektedir. Son yıllarda geliştirilen kablosuz iletişim cihazları, sabit bir spektrum atama tekniği ile çalışmakta ve çoğunlukla spektrumun belirli kısımlarını kullanmaktadır. Bilişsel Radyo Ağları (Cognitive Radio Networks, CRN'ler), spektrumun atıl kalan kısımlarına dinamik erişim sağlayarak en iyi durumdaki iletişim kanalının seçilmesine imkan vermektedir. CR kullanıcıları arasında frekans değişimi sonucu ortaya çıkan enerji tüketiminin azaltılabilmesi amacıyla, kullanıcılar arasındaki iletişimde kullanılan paket boyutunun belirlenmesi önem taşımaktadır. Çünkü, CR kullanıcılarının frekanslarını dinamik olarak değiştirmeleri, kendilerine veri iletişimi için ayrılan zaman dilimlerinde kalan süreyi azaltmaktadır. Azalan bu süre içerisinde en uygun paket boyutunun belirlenmesi önem arz etmektedir. Bu çalışmada, paket uzunluk değerlerinin CRN'lerdeki enerji verimliliğine etkileri, Pyhon benzetim ortamında farklı değişken parametreleri için nümerik analizler yoluyla incelenmiştir. Bu parametrelerle yapılan incelemeler; birim kanal değişim gücünün ve süresinin paket boyutlarına göre toplam enerjiye etkisi, farklı zaman dilimlerinin paket boyutlarına göre toplam enerjiye etkisi, başarısız gönderim oranın paket boyutlarına göre toplam enerjiye etkisi ve toplam bilişsel sürenin değişimine göre paket gönderim/alım veriminin değişimi şeklinde sıralanabilir.

Novel Homomorphic Encryption for Mitigating Impersonation Attack in Fog Computing

Fog computing is a rapidly growing technology that aids in pipelining the possibility of mitigating breaches between the cloud and edge servers. It facilitates the benefits of the network edge with the maximized probability of offering interaction with the cloud. However, the fog computing characteristics are susceptible to counteract the challenges of security. The issues present with the Physical Layer Security (PLS) aspect in fog computing which included authentication, integrity, and confidentiality has been considered as a reason for the potential issues leading to the security breaches. In this work, the Octonion Algebra-inspired Non- Commutative Ring-based Fully Homomorphic Encryption Scheme (NCR-FHE) was proposed as a secrecy improvement technique to overcome the impersonation attack in cloud computing. The proposed approach was derived through the benefits of Octonion algebra to facilitate the maximum security for big data-based applications. The major issues in the physical layer security which may potentially lead to the possible security issues were identified. The potential issues causing the impersonation attack in the Fog computing environment were identified. The proposed approach was compared with the existing encryption approaches and claimed as a robust approach to identify the impersonation attack for the fog and edge network. The computation cost of the proposed NCR-FHE is identified to be significantly reduced by 7.18%, 8.64%, 9.42%, and 10.36% in terms of communication overhead for varying packet sizes, when compared to the benchmarked ECDH-DH, LHPPS, BF-PHE and SHE-PABF schemes.

Buffer Sizing for Multimedia Flows in Packet-Switching NoCs

Wormhole packet switching, used in many NoC designs, introduces jitter. This may produce violations of application deadlines. Several works in the literature propose stream workload models, and techniques for buffer sizing. These works do not consider the concurrency between different flows, or the NoC model is too abstract, masking the jitter introduced by data packaging and router processing. One technique to deal with jitter is to introduce a decoupling buffer (D-buffer) on the target IP. This buffer receives data from the NoC with jitter, while the target IP consumes data from this buffer at the application rate, without jitter. Two problems must be solved to implement D-buffers: (i) which size must the buffer have? (ii) how much time should be expected before data consumption starts (threshold)? This work proposes a general method to define D-buffer size and threshold, considering the influence of packaging, arbitration, routing and concurrency between flows. A traffic model for stream applications is detailed and used to characterize jitter sources in wormhole packet switching. Experimental results demonstrate the impact on multimedia flows with fixed and variable packet sizes (from real traffic traces). Simple traffic models employing constant frame sizes result in small D-buffers. On the other hand, employing multimedia frames from application traces (i.e. real application data) increases buffer size and threshold while still suppressing jitter. Another parameter analyzed in the paper is the percentage of deadline violations as a function of D-buffer size. The method guarantees throughput with no deadline violation and does not modify the NoC structure. The cost of adding such D-buffers is an increased latency and extra silicon area.

Reduction of Padding Overhead for RLNC Media Distribution With Variable Size Packets

Random linear network coding (RLNC) can enhance the reliability of multimedia transmissions over lossy communication channels. However, RLNC has been designed for equal size packets, while many efficient multimedia compression schemes, such as variable bitrate (VBR) video compression, produce unequal packet sizes. Padding the unequal packet sizes with zeros to the maximum packet size creates an overhead on the order of 20%–50% or more for typical VBR videos. Previous padding overhead reduction approaches have focused on packing the unequal packet sizes into fixed size packets, e.g., through packet bundling or chaining and fragmentation. We introduce an alternative padding reduction approach based on coding macro-symbols (MSs), whereby an MS is a fixed-sized part of a packet. In particular, we introduce a new class of RLNC, namely MS RLNC which conducts RLNC across columns of MSs, instead of the conventional RLNC across columns of complete packets of equal size. Judiciously arranging the source packets into columns of MSs, e.g., through shifting the source packets horizontally relative to each other, supports favorable MS RLNC coding properties. We specify the MS RLNC encoding and decoding mechanisms and analyze their complexity for a range of specific MS arrangement strategies within the class of MS RLNC. We conduct a comprehensive padding overhead evaluation encompassing both previous approaches of packing the unequal size packets into fixed size packets as well as the novel MS RLNC approaches with long VBR video frame size traces. We find that for small RLNC generation sizes that support low network transport delays, MS RLNC achieves the lowest padding overheads; while for large generation sizes, both the previous packing approaches and the novel MS RLNC approaches effectively reduce the padding overhead.

Analyzing Adhoc Networks performance on QoS requirements by varying Packet size and measuring the nodes remaining energy

Analyzing Adhoc Networks performance on QoS requirements by varying Packet size and measuring the nodes remaining energy

Spectrum management with simultaneous power‐controlled assignment decisions in cognitive radio networks

SummarySpectrum sharing protocols for cognitive radio networks (CRNs) are often designed based on an exclusive channel occupancy policy. This policy does not allow concurrent cognitive radio (CR) transmissions to take place over the same channel. Unfortunately, this can significantly affect spectrum utilization and network performance. Allowing several secondary users to simultaneously share the same channel naturally improves spectrum utilization and avoids unnecessary blocking of CR transmissions. The key challenge in enabling efficient operation of multichannel CRNs is how to perform efficient power‐controlled media‐access‐control (MAC) protocols. These protocols include both power control and channel assignment. In this paper, we propose a power‐controlled MAC protocol for CRNs based on interference‐channel occupancy model with the objective of maximizing the number of served CR transmissions. It uses a novel power‐controlled channel assignment mechanism that allows several concurrent interference‐limited transmissions to simultaneously proceed over each idle channel in the same neighborhood. We present two variants of the power‐controlled channel assignment mechanism. The first proposed variant is suitable for CRNs with fixed data packet size, whereas the other is suitable for dynamic CRNs with variable packet size. The second variant of our protocol employs a users' scheduling procedure that attempts to fully utilize the available time‐frequency blocks. Simulation results indicate that employing transmission power control along with appropriate channel assignment and users' scheduling in CRNs can significantly improve the spectrum utilization and the overall network performance.

Traffic model using a novel sniffer that ensures the user data privacy

Nowadays, the traffic over the networks is changing because of new protocols, devices and applications. Therefore, it is necessary to analyze the impact over services and resources. Traffic Classification of network is a very important prerequisite for tasks such as traffic engineering and provisioning quality of service. In this paper, we analyze the variable packet size of the traffic in an university campus network through the collected data using a novel sniffer that ensures the user data privacy. We separate the collected data by type of traffic, protocols and applications. Finally, we estimate the traffic model that represents this traffic by means of a Poisson process and compute its associated numerical parameters.

Toward a Sweet Spot of Data Plane Programmability, Portability, and Performance: On the Scalability of Multi-Architecture P4 Pipelines

Despite having received less attention compared to the control and application plane aspects of software-defined networking (SDN), the data plane is a critical piece of the puzzle. P4 takes SDN datapaths to the next level by unlocking deep programmability through a target-independent high-level programming language that can be compiled to run on a variety of targets (e.g., ASIC, FPGA, and GPU). This paper presents the design and evaluation of our sweet spot approach on SDN datapaths, offering three contending characteristics, namely, performance, portability, and scalability in multiple realistic scenarios. The focus is on our Multi-Architecture Compiler System for Abstract Data Planes proposal, which blends the high-level protocol-independent programmability of P4 with low-level but cross-platform (HW & SW) Application Programming Interfaces brought by OpenDataPlane, this way supporting many different vendors and architectures. Besides the performance evaluation for varying packet sizes and memory lookup tables, we investigate the impact of increasing pipeline complexity ranging from elemental L2 switching to more complex data center and border network gateways. We investigate the scalability for increasing the number of cores and evaluate a novel method for run-time core reallocation. Furthermore, we run experiments on different target platforms (e.g., $\times 86$ , ARM, 10G/100G), inducing different ways of packet mangling through specific drivers (e.g., DPDK and Netmap), and compare the results to state-of-the-art datapath alternatives.

An Experimental Evaluation of Tools for Estimating Bandwidth-Related Metrics

For many different applications, current information about the bandwidth-related metrics of the utilized connection is very useful as they directly impact the performance of throughput sensitive applications such as streaming servers, IPTV and VoIP applications. In literature, several tools have been proposed to estimate major bandwidth-related metrics such as capacity, available bandwidth and achievable throughput. The vast majority of these tools fall into one of Packet Pair (PP), Variable Packet Size (VPS), Self-Loading of Periodic Streams (SLoPS) or Throughput approaches. In this study, seven popular bandwidth estimation tools including nettimer, pathrate, pathchar, pchar, clink, pathload and iperf belonging to these four well-known estimation techniques are presented and experimentally evaluated in a controlled testbed environment. Differently from the rest of studies in literature, all tools have been uniformly classified and evaluated according to an objective and sophisticated classification and evaluation scheme. The performance comparison of the tools incorporates not only the estimation accuracy but also the probing time and overhead caused.

Analysis of Pure and Slotted ALOHA With Multi-Packet Reception and Variable Packet Size

Multiple packet reception (MPR) is becoming a viable reality for wireless random access protocols thanks to advances in the physical layer and new coding techniques. In the simplest $K$ -MPR model, a receiver can resolve up to $K\geq 1$ parallel transmissions. We extend the classical analysis of pure and slotted ALOHA to $K$ -MPR devices with arbitrary degree $K$ for fixed and variable packet size. Through a parsimonious modeling approach, we derive relatively simple analytical expressions. In this way, we gain insight and quantitative understanding on the fundamental tradeoffs between pure and slotted ALOHA and on the scaling of maximum achievable throughput with $K$ .

Performance Comparison of DSR and AODV Routing Protocols for Soft Delay Deadlines in Wireless Multimedia Sensor Network

Wireless Multimedia Sensor Network (WMSN) is a collection of the vast amount of different types of sensors like camera sensor, video and scalar sensors which are involved in retrieving multimedia data from the large environment. The real-time sending of video and audio content to the destination before a strict playout deadline has been necessary for multimedia environment. Otherwise, it will be dropped at the destination. In WMSN sending real time multimedia data with soft play deadlines is a challenging task to solve this challenge, routing protocols play an important role in WMSN. Routing demands of multimedia content of WMSNs need to be perfect routing protocols to optimize path selection and guarantee communication. This paper presents a performance comparison between two reactive routing protocols; namely AODV and DSR, with soft delay deadlines and efficient utilization of resources in WMSN. The objective is to assess the real-time behavior of these two protocols upon sending multimedia content. Here, we evaluate the performance with respect to the use of these matrices like latency, Average jitter, Average delay and throughput and factors includes are CBR and multimedia traffic with varying packet size and bandwidth. DSR perform better as compared to AODV routing protocol since it discovers the routes more efficiently. AODV is better in term of Jitter than DSR. NS-2 simulator tool used for the purpose of this comparison.

Performance Analysis of VXLAN and NVGRE Tunneling Protocol on Virtual Network

Virtualization is a new revolutionary approach in networking industry, its make possible to build several virtual machine (VM) in one physical hardware. In virtualization practice, one VM might be connected to others, but not all of VM in one environment must be connected due the privacy and security issues. One of the solutions which can address this issue is tunneling protocol. Tunneling protocol is a layer-2-in-layer-3 protocol which can isolate tenant traffic in virtualize environment. This research conducted about the performance of VXLAN and NVGRE tunneling protocol which works on virtualize environment and aims to determine the perfomances of throughput, delay, jitter, and vCPU Usage using variable packet size in range of 128-1514 byte. From the the result, can be conclude that both of tunneling protocol can isolate the traffic between tenant. For the performance result, NVGRE has the highest value of throughput, 771,02 Mbps and the VXLAN got 753,62 Mbps. For the delay NVGRE got 2.24 ms and VXLAN got 2.29 ms. For the jitter, NVGRE has better rate value of 0.361 ms, than VXLAN value of 0.348 ms, and the vCPU usage performance, NVGRE has the highest performance too that value is 60.57%. So on overall performance NVGRE has the better performance than VXLAN.

Impact of Packet Size on Performance of TCP traffic with Small Router buffers

In this paper, we research the impact of packet size on the performance of TCP traffic with small router buffers. First of all, we established a simple model which had two TCP flows, combined with the queue management mechanism in a router and analyzed the effect on TCP packet loss performance of variable packet sizes. Secondly, the corresponding network topology was established based on the NS2 simulation software. And the correctness of the model was verified by experiments.

Quality of Service Analysis of Ethernet Network Based on Packet Size

Ethernet network, standardized by IEEE 802.3, is vastly installed in Local Area Network (LAN) for cheaper cost and reliability. With the emergence of cost effective and enhanced user experience needs, the Quality of Service (QoS) of the underlying Ethernet network has become a major issue. A network must provide predictable, reliable and guaranteed services. The required QoS on the network is achieved through managing the end-to-end delay, throughput, jitter, transmission rate and many other network performance parameters. The paper investigates QoS parameters based on packet size to analyze the network performance. Segmentation in packet size larger than 1500 bytes, Maximum Transmission Unit (MTU) of Ethernet, is used to divide the large data into small packets. A simulation process under Riverbed modeler 17.5 initiates several scenarios of the Ethernet network to depict the QoS metrics in the Ethernet topology. For analyzing the result from the simulation process, varying sized packets are considered. Hence, the network performance results in distinct throughput, end-to-end delay, packet loss ratio, bit error rate etc. for varying packet sizes.

FlowPing - The New Tool for Throughput and Stress Testing

This article presents a new tool for network throughput and stress testing. The FlowPing tool is easy to use, and its basic output is very similar to standard Linux ping application. The FlowPing tool is not limited to reach-ability or round trip time testing but is capable of complex UDP based throughput stress testing with rich reporting capabilities on client and server sides. Our new tool implements features, which allow the user to perform tests with variable packet size and traffic rate. All these features can be used in one single test run. This allows the user to use and develop new methodologies for network throughput and stress testing. With the FlowPing tool, it is easy to perform the test with the slowly increasing the amount of network traffic and monitor the behavior of network when the congestion occurs.

Extensive Performance Evaluation of Efficient Method for Vertical Handoff in Heterogeneous Networks

Handover during mobile communications is becoming the general task in heterogeneous wireless networks. To make handover efficient and faster without leaking data with less delay is prime objective. Since from last two decades, many on-going research studies presented to achieve these goals. Still many research works going on to claim more robust performance. In this paper presenting new method for vertical handover in heterogeneous wireless networks. Taking vertical handoff decision plays significance role. In this paper the extensive simulation studies and performance evaluation for proposed work and comparing it against existing work. Here introduced the fuzzy rule based HMM (FR-HMM) technique for VHD. In addition to this, we further extended FR-HMM method in order to reduce latency and handover delay using concept of automatic authentication auditor (AAA). AAA helps FR-HMM to take speed decision about network selection to perform handover based on logs and history maintained at AAA. Core task of AAA is to minimize the time required for authentication in order to switch to another network using the scores computed for each network. The performance evaluation in done by considering different types of networks to form heterogeneous network such as WIFI, WIMAX, WLAN, UMTS etc. Two different network scenarios are considered one by varying mobility speed and another by varying packet size.

Research on the data transmission optimization for building energy consumption monitoring system based on fuzzy self-adaptation method

BECMP (building energy consumption monitoring platform) offers powerful help to realize building energy conservation by collecting energy consumption data. A great quantity BECMPs have been established all over the world in recent years. However, packet loss problem begins to appear when the scale of BECMP is large enough and the network congestion happen. This paper presents a fuzzy control transmission methodology in order to solve the problem based on network delay. The proposed method could adjust the data transmission strategy according to the network congestion level by changing packet interval and packet size to adapt the changes of network load, and improve the quality and efficiency of data transmission. Three novel transmission controllers are proposed, VPI-FSaTC (varying packet interval fuzzy self-adaptive transmission controller), VPS-FSaTC (varying packet size fuzzy self-adaptive transmission controller), and VPIS-FSaTC (varying packet interval & size fuzzy self-adaptive transmission controller). The simulation results indicates that, the packet loss ratio decreases 23%, 71% and 79% by VPI-FSaTC, VPS-FSaTC and VPIS-FSaTC, respectively, compared to the default transmission method.

Leaving One Slot Empty: Flit Bubble Flow Control for Torus Cache-Coherent NoCs

Short and long packets co-exist in cache-coherent NoCs. Existing designs for torus networks do not efficiently handle variable-size packets. For deadlock free operations, a design uses two VCs, which negatively affects the router frequency. Some optimizations use one VC. Yet, they regard all packets as maximum-length packets, inefficiently utilizing the precious buffers. We propose flit bubble flow control (FBFC), which maintains one free flit-size buffer slot to avoid deadlock. FBFC uses one VC, and does not treat short packets as long ones. It achieves both high frequency and efficient buffer utilization. FBFC performs 92.8 and 34.2 percent better than LBS and CBS for synthetic traffic in a <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$4 \times 4$</tex> <mathgraphic fileref="ma-ieq1-2295523.gif" graphicformat="GIF"/></formula> torus. The gains increase in larger networks; they are 107.2 and 40.1 percent in an <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$8 \times 8$</tex> <mathgraphic fileref="ma-ieq2-2295523.gif" graphicformat="GIF"/></formula> torus. FBFC achieves an average 13.0 percent speedup over LBS for PARSEC workloads. Our results also show that FBFC is more power efficient than LBS and CBS, and a torus with FBFC is more power efficient than a mesh.