Bari, Lukáš · Brno University of Technology Digital Library (Brno University of Technology) · 2017
Práca sa zaoberá teóriou a návrhom generátora sieťového provozu na platforme FPGA. Pre popis je použitý programovací jazyk VHDL. Práca zahrňuje zoznámenie sa s vývojovými postupmi a návrhovými prostriedkami potrebnými pre vytvorenie celkového projektu. Taktiež obsahuje zoznámenie sa s potrebnými technológiami FPGA, NetCOPE a kartami COMBO. Na základe týchto informácií, bol v praktickej části navrhnutý, otestovný a implementovaný generátor paketov pre kartu Combo-80G. Pri realizácií bolo použite vývojové prostredie NetCOPE.
Cited by 0
Chromčák, Michal · Brno University of Technology Digital Library (Brno University of Technology) · 2013
According to increasing requirements on speed of different software and hardware components, there are solutions, which can, by principle, reach better parameters, then solutions commonly known. One of them is to use software with hardware acceleration on the field of generating synthetic network traffic. Exactly this way a packet generator was implemented, in current version without graphical user interface. But to let this system spread into the target group of users, there is need to implement also this interface. This bachelor's thesis describes proposal of graphical interface, its implementation in JavaFX programming language, testing on real users and tutorial demonstrating how to use this interface.
Cited by 0
Nan Zhang, Jianhua Zhang, Zhi-shu LI · 2006
To make convenient for programmers to generate network packets according to user's requirement,a network packet generator was designed and implemented based on COM and ActiveX techniques.The LibnetNT DDL was used to program this generator and the low-level functions were encapsulated according to a unified interface.In this way,the generator can be used in different programming environments.Using this generator,a programmer needs not understand the details of low-level network protocols,and can generate desired network packets.It makes network programming more efficient and design elements more easily to be reused.
Cited by 0
Wahid · Greater South Information System · 2011
Problem statement: Viruses and hacker attacks typically generate a recognizable pattern or "signature" of packets.Most of Network Traffic Analyzer can identify these packets and alert the administrator to their presence on the network via email or page.Approach: Most traffics analyzers let you set alarms to be triggered when a particular pattern is seen.Results: Some network traffic analyzers can be programmed to send an email or page when these conditions are met.Of course; this assumes that the virus and its signature have been seen before and incorporated the analyzer's list of packet filters.((The packet filters once started the filtering process and also by using packet decode together they can determine the traffic type whether it has normal or abnormal activities. Conclusion/Recommendations:In this study we used Packet Generator to generate a traffic that supposes to act the intruder or hacker signature to prove up that Network Traffic Analysis has the ability to detect like this kind of traffics.And also we have explained in depth about network traffic analysis and its ability to monitor all the network traffics (incoming and outgoing) and view their headers and payload and all other information such as traffic source and destination)).
Cited by 0Open access
Bureš, Jiří · Brno University of Technology Digital Library (Brno University of Technology) · 2008
Cílem této diplomové práce je zjištění rozložení napětí a deformace v plechách rotoro-vého svazku a v kritických místech opěrných tyčí synchronního generátoru. Počítány a vzá-jemně porovnány jsou výsledky výpočtu analytického, numerického s využitím 2D modelu a numerického s využitím 3D modelu ve třech variantách (s tyčemi obdélníkového průřezu, kruhového průřezu a s horním zaoblením). Při výpočtu je uvažován vliv teplotní roztažnosti, odstředivé síly, přesahu svazku na hří-deli a osového předpětí ve šroubovém spoji. Ke tvorbě modelu geometrie a numerickému výpočtu je použito programu ANSYS 11.
Cited by 0
Pej Evan Bartolo · Zenodo (CERN European Organization for Nuclear Research) · 2026
This work develops the packet–corridor dynamics of the Scalar Drag Emergence Framework (SDEF), deriving the formation, persistence, and interaction of coherent transport structures directly from the primitive generator governing compatibility and ancestry evolution. A central result is the explicit distinction between existence and persistence. Compatibility structures may transiently arise through coherence-driven interactions; however, persistence requires that ancestry-reinforced coherence overcomes scalar drag. Persistent structures, referred to as packets, therefore emerge only under specific dynamical conditions rather than as generic outcomes of coherence. From the generator equations, the work derives: the formation of reinforced transport pathways (corridors) through ancestry accumulation, the conditions for packet formation as a persistence threshold near the coherence tipping point, the internal structure of packets (leading edge, core, trailing region), and the interaction mechanisms—consolidation, braiding, and partitioning—that reorganize corridor networks. The analysis shows that packet size, propagation speed, and lifetime follow directly from generator scaling relations, with characteristic radius R∼λ−1/4R \sim \lambda^{-1/4}R∼λ−1/4. A minimum structural requirement is identified: identity arises from triadic compatibility, while persistence is governed by generator dynamics under scalar drag. The resulting system is a coupled, non-Markovian dynamical network in which packet propagation reinforces corridors, and corridors guide subsequent propagation, producing evolving transport structures across scales. This work establishes the foundational dynamics of coherent transport in SDEF and provides the basis for subsequent studies of packet simulations, interaction laws, and large-scale compatibility-driven phenomena.
Cited by 0Open access
Emmerich, Paul · TIB KMO / FLOWWORKS GmbH · 2016
Cited by 0Open access
Pej Evan Bartolo · Zenodo (CERN European Organization for Nuclear Research) · 2026
This work develops the packet–corridor dynamics of the Scalar Drag Emergence Framework (SDEF), deriving the formation, persistence, and interaction of coherent transport structures directly from the primitive generator governing compatibility and ancestry evolution. A central result is the explicit distinction between existence and persistence. Compatibility structures may transiently arise through coherence-driven interactions; however, persistence requires that ancestry-reinforced coherence overcomes scalar drag. Persistent structures, referred to as packets, therefore emerge only under specific dynamical conditions rather than as generic outcomes of coherence. From the generator equations, the work derives: the formation of reinforced transport pathways (corridors) through ancestry accumulation, the conditions for packet formation as a persistence threshold near the coherence tipping point, the internal structure of packets (leading edge, core, trailing region), and the interaction mechanisms—consolidation, braiding, and partitioning—that reorganize corridor networks. The analysis shows that packet size, propagation speed, and lifetime follow directly from generator scaling relations, with characteristic radius R∼λ−1/4R \sim \lambda^{-1/4}R∼λ−1/4. A minimum structural requirement is identified: identity arises from triadic compatibility, while persistence is governed by generator dynamics under scalar drag. The resulting system is a coupled, non-Markovian dynamical network in which packet propagation reinforces corridors, and corridors guide subsequent propagation, producing evolving transport structures across scales. This work establishes the foundational dynamics of coherent transport in SDEF and provides the basis for subsequent studies of packet simulations, interaction laws, and large-scale compatibility-driven phenomena.
Cited by 0Open access
Bastián Real, Diego Guzmán-Silva, Rodrigo A. Vicencio · Physical review. B./Physical review. B · 2024
The generation of wave packets with well-defined momentum and energy distribution constitutes an experimental challenge in diverse areas of physics. The excitation of nontrivial states, on different lattice configurations, becomes mandatory nowadays to unveil new and exotic properties. In this work, we propose and demonstrate experimentally a straightforward technique to engineer on-chip wave packets by exploiting the radiation of an atomlike waveguide into a one-dimensional lattice. We show that the radiation modes generated after exciting this pseudoatom can be tuned at desired band energies by simply controlling the on-site properties, such that wave packets with precise quasimomentum can be generated. As a benchmark, we use the wave-packet generator for a precise excitation of the well-known topological edge states of a Su-Schrieffer-Heeger photonic lattice.
Cited by 3
Janeček, David · Brno University of Technology Digital Library (Brno University of Technology) · 2020
Pokrok při zdokonalování klasifikačních algoritmů je zpomalován nedostatkem dat potřebných pro testování. Reálná data je obtížné získat z důvodu bezpečnosti a ochrany citlivých informací. Existují však generátory syntetických sad pravidel, jako například ClassBench-ng. K vyhodnocení správného fungování, propustnosti, spotřeby energie a dalších vlastností klasifikačních algoritmů je zapotřebí také vhodný síťový provoz. Tématem této práce je tvorba takového generátoru síťového provozu, který by umožnil testování těchto vlastností v kombinaci s IPv4, IPv6 a OpenFlow1.0 pravidly vygenerovanými ClassBench-ng. Práce se zabývá různými způsoby, jak toho dosáhnout, které vedly k vytvoření několika verzí generátoru. Vlastnosti jednotlivých verzí byly zkoumány řadou experimentů. Implementace byla provedena pomocí jazyku Python. Nejvýznamnějším výsledkem je generátor, který využívá principů několika zkoumaných přístupů k dosažení co nejlepších vlastností. Dalším přínosem je nástroj, který bylo nutné vytvořit pro analýzu užitých sad klasifikačních pravidel a vyhodnocení vlastností vygenerovaného síťového provozu.
Cited by 0
Andrew Begel Dept, Andrew Begel · 2007
This paper describes the architecture of the BSD Packet Filter package, which consists of a code generator, optimizer and virtual machine. The ability to do per-packet statistical sampling was added to the package. In addition, several modifications were made to the optimizer to increase the quality of the code output. While these modifications don't produce drastic improvements in the resulting code, they do illustrate the advantages of using an SSA-like representation for the intermediate byte code. 1. Introduction A packet filter is a tool used to monitor and control network traffic. It is able to check every packet that comes by its network port and if it matches a predicate, pass it to the next higher level of control. Packet filters may be installed in user space, kernel space, network cards, or even inside routers. The ability to monitor and filter network traffic is important for diagnostic and security reasons. If the network gets congested, an administrator can use a packe...
Cited by 0
Scott E. Carpenter, Mihail L. Sichitiu · IEEE Transactions on Vehicular Technology · 2018
Common vehicular channel models (VCMs) accurately predict the packet reception ratio (PRR) observed from dedicated short-range communication (DSRC) field operational tests. However, such independent and identically distributed (i.i.d.) based packet generation models fail to match the bursty channel conditions that result in occasional long periods of packet losses that thwart the ability of safety applications to assist drivers in improving their situational awareness. In this paper, we propose a bursty packet generation algorithm called BUR-GEN, which we evaluate through simulation and, along with several common VCMs, compare to the PRR, inter-packet gap (IPG), and consecutive reception run length (CRRL) of the safety pilot model deployment, a large-scale DSRC-based measurement campaign. The model that incorporates the BUR-GEN packet generation algorithm improves the root-mean-square error of IPG and CRRL by factors of six and four, respectively. Additionally, we assess safety effectiveness using awareness probability. Our results show that safety reliability estimates for vehicle-to-vehicle safety applications are increased by a factor of 31 for maximum safety tolerances, as compared to an i.i.d.-based model that produces that same PRR but does not account for bursty channel behaviors.
Cited by 3
Paul Emmerich, Florian Wohlfart, Daniel Raumer et al. · 2014
Abstract. We present MoonGen, a flexible high-speed packet generator. MoonGen is able to saturate 10GbE links with minimum sized packets using only a single CPU core by running on top of the packet processing framework DPDK. We move the whole packet generation logic into user-controlled Lua scripts, thereby ensuring high flexibility. MoonGen works with commodity NICs and provides features that were previously only possible with hardware-based solutions. We utilize hardware features of Intel NICs that have not been used for packet generators previously. MoonGen can measure latencies with sub-microsecond precision and ac-curacy by using hardware timestamping, a feature that is available on modern commodity NICs. In the evaluation of MoonGen, we address timing issues with software-based packet generators and show how they can be mitigated. We provide MoonGen as free software under the MIT license at
Cited by 0
A. Danladi, G. P. Vasira · Asian Journal of Research in Computer Science · 2018

 
 
 
 Fractal dimension is mathematically defined as a ratio of statistical complexity of network traffic; its significant manifestation can affect the network performance. In this work, two models of corporate computer networks have been developed using optimized network engineering tool (OPNET) technology. Raw packet generator (RPG) traffic was imposed on the corporate networks and modeled using H = 0.7 and D = 1.3, under the influence of Pareto distribution. Autocorrelation function and power law were used to confirm the presence of fractal traffic on the networks. Average Hurst index (H) of 50 and 100 workstations were estimated using aggregate of variance, absolute moment, periodogram and R/S methods as 0.627, 0.608 and its corresponding fractal dimensions (D) were obtained as 1.371 and 1.391 respectively. These results obtained mean, there is a manifestation of fractal traffic and delay is minimised on the network.
 
 
 
 
Cited by 0Open access
Antonio Coscia, Antonio Maci, Nicola Tamma · Computer Networks · 2024
Cited by 1
Tatsushi Nakahara, Ryo Takahashi, Hirokazu Takenouchi · 2004
We describe a novel packet-level optical timing-pulse (clock-pulse) generator that generates one optical pulse per incoming asynchronous burst optical packet: the generated optical pulse is accurately synchronized with the input optical packet. We also describe 40-Gbit/s optical packet self-routing based on 40-Gbit/s 16-bit serial optical-label recognition by a CMOS (complementary metal-oxide-semiconductor) circuit operated together with an all-optical serial-to-parallel converter and the optical timing-pulse generator.
Cited by 3
Dowoo Baik, Yu‐Jin Jung, Chang-Hee Choi · 2019
After the advent of GAN technology, many varied models have been studied and applied to various fields such as image and audio. However, in the field of cyber data, which has the same issue of data shortage, the research on data augmentation is insufficient. To solve this problem, we propose PcapGAN that can augment pcap data, a kind of network data. The proposed model includes an encoder, a data generator, and a decoder. The encoder subdivides network data into four parts. The generator generates new data for each part of the data. The decoder combines the generated data into realistic network data. We demonstrate the similarity between the generated data and original data, and validation of the generated data by increased performance of intrusion detection algorithms.
Cited by 31
Zezheng Sun, Zhichuan Guo, Jiandong Ma et al. · Electronics · 2024
RDMA (Remote Direct Memory Access) technology has been widely applied due to its high-throughput and low-latency characteristics compared with traditional networks. Implementing RDMA with an FPGA (Field-Programmable Gate Array) is a feasible solution. This paper proposes an implementation method for the ROCE v2 (Remote Direct Memory Access) protocol packet parser and generator based on an FPGA, capable of supporting various transaction packet types, such as RDMA READ, RDMA WRITE, and SEND, under the Reliable Connection service. The RDMA READ and RDMA WRITE performance of RDMA is close to 100 Gbps, which provides a feasible solution for the application of wide-area networks.
Cited by 5Open access
Yukito Onodera, Erina Takeshita, Tomoya Kosugi et al. · IEEE Access · 2025
Recent advances in network traffic analysis use machine learning (ML) on packet-level data, but obtaining large amount of real data for training ML is becoming a challenge. ML-based generators like Generative Adversarial Networks and Variational Autoencoders are promising candidates for generation the packet-level data but often fail to preserve TCP protocol states and packet arrival time. Without accurately reproducing these characteristics, the synthetic data may fail to reflect real network behavior, potentially leading to erroneous conclusions in the training and evaluation of machine learning models. This paper proposes a new method to synthesize realistic packet-level data with accurate protocol transitions and timing. By separating IP address and port number generation and aligning timing with handshake completion, the model avoids overfitting. Using the CIC-IDS 2017 dataset, our method better replicates headers and timing, producing synthetic data that closely resembles real data features distribution. Visual and statistical comparisons reveal that the synthetic data closely resembles real packet traces, providing a reliable alternative for training and evaluating network analysis.
Cited by 1Open access
Wankyung Kim, Wooyoung Soh · Lecture notes in computer science · 2006
Cited by 1