Статті в журналах з теми "Packet trace"
Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Packet trace.
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Packet trace".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Yang, Ming Hour. "Hybrid Single-Packet IP Traceback with Low Storage and High Accuracy." Scientific World Journal 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/239280.
Анотація:
Traceback schemes have been proposed to trace the sources of attacks that usually hide by spoofing their IP addresses. Among these methods, schemes using packet logging can achieve single-packet traceback. But packet logging demands high storage on routers and therefore makes IP traceback impractical. For lower storage requirement, packet logging and packet marking are fused to make hybrid single-packet IP traceback. Despite such attempts, their storage still increases with packet numbers. That is why RIHT bounds its storage with path numbers to guarantee low storage. RIHT uses IP header’s ID and offset fields to mark packets, so it inevitably suffers from fragment and drop issues for its packet reassembly. Although the 16-bit hybrid IP traceback schemes, for example, MORE, can mitigate the fragment problem, their storage requirement grows up with packet numbers. To solve the storage and fragment problems in one shot, we propose a single-packet IP traceback scheme that only uses packets’ ID field for marking. Our major contributions are as follows: (1) our fragmented packets with tracing marks can be reassembled; (2) our storage is not affected by packet numbers; (3) it is the first hybrid single-packet IP traceback scheme to achieve zero false positive and zero false negative rates.
2
ARYANTA, DWI, and BAYU AGUNG PRANATA. "Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP." ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika 2, no. 2 (July 1, 2014): 85. http://dx.doi.org/10.26760/elkomika.v2i2.85.
Анотація:
ABSTRAKOSPF (Open Shortest Path First) dan EIGRP (Enhanced Interior Gateway Routing Protocol) adalah dua routing protokol yang banyak digunakan dalam jaringan komputer. Perbedaan karakteristik antar routing protokol menimbulkan masalah dalam pengiriman paket data. Teknik redistribution adalah solusi untuk melakukan komunikasi antar routing protokol. Dengan menggunakan software Cisco Packet Tracer 5.3 pada penelitian ini dibuat simulasi OSPF dan EIGRP yang dihubungkan oleh teknik redistribution, kemudian dibandingkan kualitasnya dengan single routing protokol EIGRP dan OSPF. Parameter pengujian dalam penelitian ini adalah nilai time delay dan trace route. Nilai trace route berdasarkan perhitungan langsung cost dan metric dibandingkan dengan hasil simulasi. Hasilnya dapat dilakukan proses redistribution OSPF dan EIGRP. Nilai delay redistribution lebih baik 1% dibanding OSPF dan 2-3% di bawah EIGRP tergantung kepadatan traffic. Dalam perhitungan trace route redistribution dilakukan 2 perhitungan, yaitu cost untuk area OSPF dan metric pada area EIGRP. Pengambilan jalur utama dan alternatif pengiriman paket berdasarkan nilai cost dan metric yang terkecil, hal ini terbukti berdasarkan perhitungan dan simulasi.Kata kunci: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.ABSTRACTOSPF (Open Shortest Path First) and EIGRP (Enhanced Interior Gateway Routing Protocol) are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost and metric compared with the simulation results. The result can be OSPF and EIGRP redistribution process. Value delay redistribution 1% better than OSPF and EIGRP 2-3% under traffic density dependent. In calculating the trace route redistribution is done 2 calculations, the cost for OSPF area and the area of the EIGRP metric. Making primary and alternate paths based on the packet delivery rate and the cost of the smallest metric, it is proved by calculation and simulation.Keywords: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.
3
Pang, Ruoming, Mark Allman, Vern Paxson, and Jason Lee. "The devil and packet trace anonymization." ACM SIGCOMM Computer Communication Review 36, no. 1 (January 10, 2006): 29–38. http://dx.doi.org/10.1145/1111322.1111330.
4
Dennis, Simone, and Helen Alexiou. "(Re)making smoking: Of packets and practice." Journal of Material Culture 23, no. 4 (September 29, 2018): 459–71. http://dx.doi.org/10.1177/1359183518799537.
Анотація:
Taking as foundational the well-established anthropological idea that material things can be determinative of expectations and practice, the authors advance the notion that packets are constitutive of smoking in the era of smokefree legislation. Adorned with warnings, graphic messaging and particular colouration, they say that packets do not simply respond to the ‘problem’ of smoking; they are actively involved in remaking it anew, in, with and for the smokefree context, in which smoking is purposefully denormalized. Focusing in the main on the graphic images that ‘plain’ packets bear, they track and trace this constitutional force via sensory means, attending particularly to a reworking of the role presently accorded to vision in the Australian government’s public health ‘view’ that assumes a stark separation between the cigarette packet and the respondent smoker.
5
ARYANTA, DWI, ARSYAD RAMADHAN DARLIS, and DIMAS PRIYAMBODHO. "Analisis Kinerja EIGRP dan OSPF pada Topologi Ring dan Mesh." ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika 2, no. 1 (January 1, 2014): 53. http://dx.doi.org/10.26760/elkomika.v2i1.53.
Анотація:
ABSTRAKEIGRP (Enhanced Interior Gateway Routing Protocol) dan OSPF (Open Shortest Path Fisrt) adalah routing protokol yang banyak digunakan pada suatu jaringan komputer. EIGRP hanya dapat digunakan pada perangkat Merk CISCO, sedangkan OSPF dapat digunakan pada semua merk jaringan. Pada penelitian ini dibandingkan delay dan rute dari kedua routing protokol yang diimplementasikan pada topologi Ring dan Mesh. Cisco Packet Tracer 5.3 digunakan untuk mensimulasikan kedua routing protokol ini. Skenario pertama adalah perancangan jaringan kemudian dilakukan pengujian waktu delay 100 kali dalam 5 kasus. Skenario kedua dilakukan pengujian trace route untuk mengetahui jalur yang dilewati paket data lalu memutus link utama. Pada skenario kedua juga dilakukan perbandingan nilai metric dan cost hasil simulasi dengan perhitungan rumus. Skenario ketiga dilakukan pengujian waktu konvergensi untuk setiap routing protokol pada setiap topologi. Hasilnya EIGRP lebih cepat 386 µs daripada OSPF untuk topologi Ring sedangkan OSPF lebih cepat 453 µs daripada EIGRP untuk topologi Mesh. Hasil trace route menunjukan rute yang dipilih oleh routing protokol yaitu nilai metric dan cost yang terkecil. Waktu konvergensi rata-rata topologi Ring pada EIGRP sebesar 12,75 detik dan 34,5 detik pada OSPF sedangkan topologi Mesh di EIGRP sebesar 13 detik dan 35,25 detik di OSPF.Kata Kunci: EIGRP, OSPF, Packet Tracer 5.3, Ring, Mesh, KonvergensiABSTRACTEIGRP (Enhanced Interior Gateway Routing Protocol) and OSPF (Open Shortest Path Fisrt) is the routing protocol that is widely used in a computer network. EIGRP can only be used on devices Brand CISCO, while OSPF can be used on all brands of network. In this study comparison of both the delay and the routing protocol implemented on Ring and Mesh topology. Cisco Packet Tracer 5.3 is used to simulate both the routing protocol. The first scenario is the design of the network and then do the test of time delay 100 times in 5 cases. The second scenario tested trace route to determine the path of the data packet and then disconnect the main link. In the second scenario also conducted a cost comparison of metrics and the simulation results with the calculation formula. The third scenario testing time for each routing protocol convergence on any topology. The result EIGRP faster than 386 microseconds for a ring topology while OSPF OSPF 453 microseconds faster than EIGRP for Mesh topology. The results showed trace route chosen by the routing protocol metric value and cost is the smallest. Average convergence time in the EIGRP topology Ring of 12.75 seconds and 34.5 seconds, while the Mesh topology in an OSPF EIGRP for 13 seconds and 35.25 seconds in OSPF.Keywords: EIGRP,OSPF, Packet Tracer 5.3, Ring, Mesh, Convergence
6
Paxson, Vern. "Automated packet trace analysis of TCP implementations." ACM SIGCOMM Computer Communication Review 27, no. 4 (October 1997): 167–79. http://dx.doi.org/10.1145/263109.263160.
7
Et. al., Dr B. Shadaksharappa,. "Attack Prediction By Using Greedy Algorithm For Diminishing The Drop And Delay In Wireless Sensor Networks." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 6 (April 11, 2021): 1072–82. http://dx.doi.org/10.17762/turcomat.v12i6.2425.
Анотація:
The essential constraint of the internet is that forwarding the data packets of data among the restricted and trustworthy data nodes. If the receiver node is attacker node then it'll drop the data rather than forwarding the data to ensuing neighbor node. Therefore, efficient and secure data transmission is extremely necessary within the network data transmission. Each router node within the network can accept the data packets up to its buffer size only. Once the queue value reached the buffer threshold value then congestion can occur at the node. Once congestion happens then it would lose the data packets. By sending the data packets to the next neighbour node this problem will be resolved. This congestion will be handled by the Fully Distributed Congestion Control FDCC and Cooperative and Memory Efficient Token Bucket (CMTB) algorithms. Because the data is transmitted to the next neighbour node predicting the node behavior is extremely necessary because it is an attacker or the conventional transmitter node because it has to transmit the efficient data securely to the destination node. In this paper, the node behavior will be predicted by analyzing the trace file. The simulation results show that this proposed method would provide a lot of security in data transmission. The WSN comprises a group of sensor nodes that are disseminated on the network. These sensor nodes initially exchange their data packets to the near nodes to send the data packets to the target node. During the transmission of these data packets some data packets drop may also happen inside the network. This packet drop should be kept up as low as feasible for correct data transmission to the target node or destination node. This algorithm highlights the routes with high link quality, low packet delay and with low packet drop. Simulation results show that this proposed algorithm can provide the most effective path for transmitting the data to the destination meanwhile it reduces the packet drop and packet delay.
8
Memon, Mudasar Latif, Mukesh Kumar Maheshwari, Navrati Saxena, Abhishek Roy, and Dong Ryeol Shin. "Artificial Intelligence-Based Discontinuous Reception for Energy Saving in 5G Networks." Electronics 8, no. 7 (July 11, 2019): 778. http://dx.doi.org/10.3390/electronics8070778.
Анотація:
5G is expected to deal with high data rates for different types of wireless traffic. To enable high data rates, 5G employs beam searching operation to align the best beam pairs. Beam searching operation along with high order modulation techniques in 5G, exhausts the battery power of user equipment (UE). LTE network uses discontinuous reception (DRX) with fixed sleep cycles to save UE energy. LTE-DRX in current form cannot work in 5G network, as it does not consider multiple beam communication and the length of sleep cycle is fixed. On the other hand, artificial intelligence (AI) has a tendency to learn and predict the packet arrival-time values from real wireless traffic traces. In this paper, we present AI based DRX (AI-DRX) mechanism for energy efficiency in 5G enabled devices. We propose AI-DRX algorithm for multiple beam communications, to enable dynamic short and long sleep cycles in DRX. AI-DRX saves the energy of UE while considering delay requirements of different services. We train a recurrent neural network (RNN) on two real wireless traces with minimum root mean square error (RMSE) of 5 ms for trace 1 and 6 ms for trace 2. Then, we utilize the trained RNN model in AI-DRX algorithm to make dynamic short or long sleep cycles. As compared to LTE-DRX, AI-DRX achieves 69 % higher energy efficiency on trace 1 and 55 % more energy efficiency on trace 2, respectively. The AI-DRX attains 70 % improvement in energy efficiency for trace 2 compared with Poisson packet arrival model for λ = 1 / 20 .
9
Spiekermann, Daniel, and Jörg Keller. "Requirements for Crafting Virtual Network Packet Captures." Journal of Cybersecurity and Privacy 2, no. 3 (July 6, 2022): 516–26. http://dx.doi.org/10.3390/jcp2030026.
Анотація:
Currently, network environments are complex infrastructures with different levels of security, isolation and permissions. The management of these networks is a complex task, faced with different issues such as adversarial attacks, user demands, virtualisation layers, secure access and performance optimisation. In addition to this, forensic readiness is a demanded target. To cover all these aspects, network packet captures are used to train new staff, evaluate new security features and improve existing implementations. Because of this, realistic network packet captures are needed that cover all appearing aspects of the network environment. Packet generators are used to create network traffic, simulating real network environments. There are different network packet generators available, but there is no valid rule set defining the requirements targeting packet generators. The manual creation of such network traces is a time-consuming and error-prone task, and the inherent behaviour of virtual networks eradicates a straight-forward automation of trace generation in comparison to common networks. Hence, we analyse relevant conditions of modern virtualised networks and define relevant requirements for a valid packet generation and transformation process. From this, we derive recommendations for the implementation of packet generators that provide valid and correct packet captures for use with virtual networks.
10
Liu, X., J. Xu, J. Yue, and S. L. Vadas. "Numerical modeling study of the momentum deposition of small amplitude gravity waves in the thermosphere." Annales Geophysicae 31, no. 1 (January 3, 2013): 1–14. http://dx.doi.org/10.5194/angeo-31-1-2013.
Анотація:
Abstract. We study the momentum deposition in the thermosphere from the dissipation of small amplitude gravity waves (GWs) within a wave packet using a fully nonlinear two-dimensional compressible numerical model. The model solves the nonlinear propagation and dissipation of a GW packet from the stratosphere into the thermosphere with realistic molecular viscosity and thermal diffusivity for various Prandtl numbers. The numerical simulations are performed for GW packets with initial vertical wavelengths (λz) ranging from 5 to 50 km. We show that λz decreases in time as a GW packet dissipates in the thermosphere, in agreement with the ray trace results of Vadas and Fritts (2005) (VF05). We also find good agreement for the peak height of the momentum flux (zdiss) between our simulations and VF05 for GWs with initial λz ≤ 2π H in an isothermal, windless background, where H is the density scale height. We also confirm that zdiss increases with increasing Prandtl number. We include eddy diffusion in the model, and find that the momentum deposition occurs at lower altitudes and has two separate peaks for GW packets with small initial λz. We also simulate GW packets in a non-isothermal atmosphere. The net λz profile is a competition between its decrease from viscosity and its increase from the increasing background temperature. We find that the wave packet disperses more in the non-isothermal atmosphere, and causes changes to the momentum flux and λz spectra at both early and late times for GW packets with initial λz ≥ 10 km. These effects are caused by the increase in T in the thermosphere, and the decrease in T near the mesopause.
11
Bhuvaneshwari, P., and T. R. Jaya Chandra Lekha. "Design of Advanced High Performance Bus Tracer in System on Chip Using Matrix Based Compression for Low Power Applications." Journal of Computational and Theoretical Nanoscience 17, no. 4 (April 1, 2020): 1852–56. http://dx.doi.org/10.1166/jctn.2020.8453.
Анотація:
This project proposes multilayer advanced high-performance bus architecture for low power applications. The proposed AHB architecture consists of the bus arbiter and the bus tracer (A.R.M.A., 1999. Specification (Rev 2.0) ARM IHI0011A). The bus arbiter, which is self motivated selects the input packet based on the control signals of the incoming packet. So that arbitration leads to a maximum performance. The On-Chip bus is an important system-on-chip infrastructure that connects major hardware components. Monitoring the on-chip bus signals is crucial to the SoC debugging and performance analysis/optimization (Gu, R.T., et al., 2007. A Low Cost Tile-Based 3D Graphics Full Pipeline with Real-Time Performance Monitoring Support for OpenGL ES in Consumer Electronics. 2007 IEEE International Symposium on Consumer Electronics, June; IEEE. pp.1–6). But, such signals are difficult to observe since they are deeply embedded in a SoC and there are often no sufficient I/O pins to access these signals. Therefore, a straightforward approach is to embed a bus tracer in SoC to capture the bus signal trace and store the trace in on-chip storage such as the trace memory which could then be off loaded to outside world for analysis. The bus tracer is capable of capturing the bus trace with different resolutions, all with efficient built in compression mechanisms such as dictionary based compression scheme for address and control signals and differential compression scheme for data. To improve the compression ratio matrix based compression which is lossless compression is used instead of differential compression. This system is designed using Verilog HDL, simulated using Modelsim and synthesized using Xilinx software.
12
Lan, Haoliang, Jie Xu, Qun Wang, and Wei Ding. "Packet Loss Measurement Based on Sampled Flow." Symmetry 13, no. 11 (November 10, 2021): 2149. http://dx.doi.org/10.3390/sym13112149.
Анотація:
This paper is devoted to further strengthening, in the current asymmetric information environment, the informed level of operators about network performance. Specifically, in view of the burst and perishability of a packet loss event, to better meet the real-time requirements of current high-speed backbone performance monitoring, a model for Packet Loss Measurement at the access network boundary Based on Sampled Flow (PLMBSF) is presented in this paper under the premise of both cost and real-time. The model overcomes problems such as the inability of previous estimation to distinguish between packet losses before and after the monitoring point, deployment difficulties and cooperative operation consistency. Drawing support from the Mathis equation and regression analysis, the measurement for packet losses before and after the monitoring point can be realized when using only the sampled flows generated by the access network boundary equipment. The comparison results with the trace-based passive packet loss measurement show that although the proposed model is easily affected by factors such as flow length, loss rate, sampling rate, the overall accuracy is still within the acceptable range. In addition, the proposed model PLMBSF, compared with the trace-based loss measurement is only different in the input data granularity. Therefore, PLMBSF and its advantages are also applicable to aggregated traffic.
13
Jiang, Xi, Shinan Liu, Aaron Gember-Jacobson, Arjun Nitin Bhagoji, Paul Schmitt, Francesco Bronzino, and Nick Feamster. "NetDiffusion: Network Data Augmentation Through Protocol-Constrained Traffic Generation." Proceedings of the ACM on Measurement and Analysis of Computing Systems 8, no. 1 (February 16, 2024): 1–32. http://dx.doi.org/10.1145/3639037.
Анотація:
Datasets of labeled network traces are essential for a multitude of machine learning (ML) tasks in networking, yet their availability is hindered by privacy and maintenance concerns, such as data staleness. To overcome this limitation, synthetic network traces can often augment existing datasets. Unfortunately, current synthetic trace generation methods, which typically produce only aggregated flow statistics or a few selected packet attributes, do not always suffice, especially when model training relies on having features that are only available from packet traces. This shortfall manifests in both insufficient statistical resemblance to real traces and suboptimal performance on ML tasks when employed for data augmentation. In this paper, we apply diffusion models to generate high-resolution synthetic network traffic traces. We present NetDiffusion1, a tool that uses a finely-tuned, controlled variant of a Stable Diffusion model to generate synthetic network traffic that is high fidelity and conforms to protocol specifications. Our evaluation demonstrates that packet captures generated from NetDiffusion can achieve higher statistical similarity to real data and improved ML model performance than current state-of-the-art approaches (e.g., GAN-based approaches). Furthermore, our synthetic traces are compatible with common network analysis tools and support a myriad of network tasks, suggesting that NetDiffusion can serve a broader spectrum of network analysis and testing tasks, extending beyond ML-centric applications.
14
Jiang, Xi, Shinan Liu, Aaron Gember-Jacobson, Arjun Nitin Bhagoji, Paul Schmitt, Francesco Bronzino, and Nick Feamster. "NetDiffusion: Network Data Augmentation Through Protocol-Constrained Traffic Generation." ACM SIGMETRICS Performance Evaluation Review 52, no. 1 (June 11, 2024): 85–86. http://dx.doi.org/10.1145/3673660.3655071.
Анотація:
Datasets of labeled network traces are essential for a multitude of machine learning (ML) tasks in networking, yet their availability is hindered by privacy and maintenance concerns, such as data staleness. To overcome this limitation, synthetic network traces can often augment existing datasets. Unfortunately, current synthetic trace generation methods, which typically produce only aggregated flow statistics or a few selected packet attributes, do not always suffice, especially when model training relies on having features that are only available from packet traces. This shortfall manifests in both insufficient statistical resemblance to real traces and suboptimal performance on ML tasks when employed for data augmentation. In this paper, we apply diffusion models to generate high-resolution synthetic network traffic traces. We present NetDiffusion, a tool that uses a finely-tuned, controlled variant of a Stable Diffusion model to generate synthetic network traffic that is high fidelity and conforms to protocol specifications. Our evaluation demonstrates that packet captures generated from NetDiffusion can achieve higher statistical similarity to real data and improved ML model performance than current state-of-the-art approaches (e.g., GAN-based approaches). Furthermore, our synthetic traces are compatible with common network analysis tools and support a myriad of network tasks, suggesting that NetDiffusion can serve a broader spectrum of network analysis and testing tasks, extending beyond ML-centric applications.
15
Roughan, Matt. "Public review for the devil and packet trace anonymization." ACM SIGCOMM Computer Communication Review 36, no. 1 (January 10, 2006): 27–28. http://dx.doi.org/10.1145/1111322.1111329.
16
Chen, Jian, Siyu Kuai, Guoliang Chen, Lihua Yu, and Qiwen Zhan. "Dynamical Modulation of Transverse Orbital Angular Momentum in Highly Confined Spatiotemporal Optical Vortex." Photonics 10, no. 2 (January 31, 2023): 148. http://dx.doi.org/10.3390/photonics10020148.
Анотація:
Spatiotemporal optical vortices (STOVs) have attracted numerous attention from researchers in recent years due to their intriguing characteristics with transverse orbital angular momentum (OAM) in the spatiotemporal domain. In this work, we numerically analyze the tightly focusing characteristics of higher-order STOVs and present a method to dynamically modulate the transverse OAM in highly confined STOVs. Richards–Wolf vectorial diffraction theory was employed to simulate the three-dimensional spatiotemporal distribution of the focused STOV corresponding to the incident wave packet of topological charge of −2. The simulation results show that the higher-order spatiotemporal vortices in the transversely polarized components of the focused wave packets split into two first-order vortices with topological charge of −1 when the waist radius of the incident wave packet was larger than 40% of the pupil radius of the focusing lens, and the spacing of the two split vortices could be tailored by adjusting the waist radius of the incident wave packet. Meanwhile, the incident spatial waist radius also affected the tilt angle of the phase singularity trace in the z-polarized component of the focused field. The presented method provides a flexible way to dynamically engineer the spatiotemporal vortices in the tightly focused wave packet and may find potential applications in nanophotonics, light–matter interaction, quantum information processing, etc.
17
Ma, Naji, and Ming Diao. "CoFi: Coding-Assisted File Distribution over a Wireless LAN." Symmetry 11, no. 1 (January 10, 2019): 71. http://dx.doi.org/10.3390/sym11010071.
Анотація:
The wireless channel is volatile in nature, due to various signal attenuation factors including path-loss, shadowing, and multipath fading. Existing media access control (MAC) protocols, such as the widely adopted 802.11 wireless fidelity (Wi-Fi) family, advocate masking harsh channel conditions with persistent retransmission and backoff, in order to provide a packet-level best-effort service. However, the asymmetry of the network environment of client nodes in space is not fully considered in the method, which leads to the decline of the transmission efficiency of the good ones. In this paper, we propose CoFi, a coding-assisted file distribution protocol for 802.11 based wireless local area networks (LANs). CoFi groups data into batches and transmits a random linear combination of packets within each batch, thereby reducing redundant packet and acknowledgement (ACK) retransmissions when the channel is lossy. In addition, CoFi adopts a MAC layer caching scheme that allows clients to store the overheard coded packets and use such cached packets to assist nearby peers. With this measure, it further improves the effective throughput and shortens the buffering delay when running applications such as bulk data transmission and video streaming. Our trace based simulation demonstrates that CoFi can maintain a similar level of packet delay to 802.11, but increases the throughput performance by a significant margin in a lossy wireless LAN. Furthermore, we perform a reverse-engineering on CoFi and 802.11 using a simple analytical framework, proving that they asymptotically approach different fairness measures, thus resulting in a disparate performance.
18
Yatskih, Alex, Yuri Yermolaev, Aleksandr Kosinov, and Nikolay Semionov. "Wave Packet Excitation and its Development in Supersonic Boundary Layer." Siberian Journal of Physics 8, no. 2 (June 1, 2013): 70–78. http://dx.doi.org/10.54362/1818-7919-2013-8-2-70-78.
Анотація:
A method of exciting of artificial disturbances localized in space and time (wave packets) in a supersonic boundary layer is developed. Experimental investigations are carried out in the low noise supersonic wind tunnel T-325 at Mach M = 2. A model of a flat steel plate with a sharp leading edge is used. Measurements of mean flow and fluctuations are performed by using a constant temperature anemometer. To generate controlled fluctuations the short time surface glow discharge is used. Measurements of controlled disturbances are synchronized in time with glow discharge ignition. To increase the signal-to-noise ratio the time trace averaging technique is applied. Electrical power and polarity of the glow discharge initiation are changed to see their influence on the initial wave packet amplitude. Optimal glow discharge parameters for generation of artificial disturbances are found. The experimental data on the localized disturbances evolution in boundary layer are received. It is obtained that the velocity of the wave packet propagation has speed close to the free stream for the leading wave edge. The trailing edge of the wave packet spreads with subsonic speed relatively the supersonic flow. The wave packet propagates in both the streamwise and spanwise directions. Half-angle of this spreading is approximately equal to 10 degrees relative to the free stream direction. It has been found, that the wave packet is developed inside the boundary layer near of the artificial pulsations source. However the evolution of controlled disturbances leads to their radiation into free flow
19
Karande, Shirish S., Kiran Misra, and Hayder Radha. "Survival of the Fittest: An Active Queue Management Technique for Noisy Packet Flows." Advances in Multimedia 2007 (2007): 1–10. http://dx.doi.org/10.1155/2007/64695.
Анотація:
We present a novel active queue management (AQM) technique to demonstrate the efficacy of practically harnessing the predictive utility of SSR indications for improved video communication. We consider a network within which corrupted packets are relayed over multiple hops, but a certain percentage of packets needs to be dropped at an intermediate node due to congestion. We propose an AQM technique,survival of the fittest(SOTF), to be employed at the relay node, within which we use packet state information, available from SSR indications and checksums, to drop packets with the highest corruption levels. On the basis of actual 802.11b measurements we show that such a side information (SI) aware processing within the network can provide significant performance benefits over an SI-unaware scheme,random queue management(RQM), which is forced to randomly discard packets. With trace-based simulations, we show the utility of the proposed AQM technique in improving the error recovery performance of cross-layer FEC schemes. Finally, with the help of H.264-based video simulations these improvements are shown to translate into a significant improvement in video quality.
20
Mustapha, Oba Zubair, Muhammad Ali, Yim Fun Hu, and Raed A. Abd-Alhameed. "Service-aware LSP selection with fuzzy based packet scheduling scheme for non-real time traffics." International Journal of Informatics and Communication Technology (IJ-ICT) 10, no. 2 (August 1, 2021): 126. http://dx.doi.org/10.11591/ijict.v10i2.pp126-139.
Анотація:
An essential solution is available in Multi-protocol label switching (MPLS), which solve the problems faced by present-day networks: speed, scalability, quality-of-service (QoS) management, and traffic engineering. This paper is an extension of work on Fuzzy based Packet Scheduling Algorithm (FPSA) combined with Packets Processing Algorithm (PPA) in an Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) networks. This will make provision for an intelligent service to the Label Switched Path (LSP) in MPLS networks. Several research work have been proposed on the MPLS Traffic Engineering. However, it is still imperative to further research on the effect of bandwidth increment on the core network using different mechanisms such as the analytical model of MPLS, expert-based packet scheduling algorithm for MPLS QoS support. Since MPLS is not able to provide intelligent routing, it is necessary to propose an intelligent expert system of FPSA combined with PPA. And analytical model of packet forwarding in the MPLS network would be given to provide suitable solution to traffic congestion and reliable services. Furthermore, the network model created using Network Simulator (NS 2), which carries non-real time application such as File Transfer Protocol (FTP) with bandwidth variations. The results obtained from trace files are interpreted by AWK script and used for the further analysis.
21
Alyami, Mnassar, Abdulmajeed Alghamdi, Mohammed A. Alkhowaiter, Cliff Zou, and Yan Solihin. "Random Segmentation: New Traffic Obfuscation against Packet-Size-Based Side-Channel Attacks." Electronics 12, no. 18 (September 9, 2023): 3816. http://dx.doi.org/10.3390/electronics12183816.
Анотація:
Despite encryption, the packet size is still visible, enabling observers to infer private information in the Internet of Things (IoT) environment (e.g., IoT device identification). Packet padding obfuscates packet-length characteristics with a high data overhead because it relies on adding noise to the data. This paper proposes a more data-efficient approach that randomizes packet sizes without adding noise. We achieve this by splitting large TCP segments into random-sized chunks; hence, the packet length distribution is obfuscated without adding noise data. Our client–server implementation using TCP sockets demonstrates the feasibility of our approach at the application level. We realize our packet size control by adjusting two local socket-programming parameters. First, we enable the TCP_NODELAY option to send out each packet with our specified length. Second, we downsize the sending buffer to prevent the sender from pushing out more data than can be received, which could disable our control of the packet sizes. We simulate our defense on a network trace of four IoT devices and show a reduction in device classification accuracy from 98% to 63%, close to random guessing. Meanwhile, the real-world data transmission experiments show that the added latency is reasonable, less than 21%, while the added packet header overhead is only about 5%.
22
Obeidat, Ibrahim, Ala Mughaid, and Shadi Alzoubi. "A Secure Encrypted Protocol for Clients' Handshaking in the Same Network." International Journal of Interactive Mobile Technologies (iJIM) 13, no. 05 (May 21, 2019): 47. http://dx.doi.org/10.3991/ijim.v13i05.9845.
Анотація:
<p><strong>Abstract</strong></p><p><strong> </strong></p><p>Users in the same network can trace the data being transmitted amongst users and other users to the internet using many available online tools such as packet sniffers and many packets capturing tools, the need to make the data resistible to be read comes obvious. The proposed solution is to encrypt the data using inscription algorithm. In this paper, we propose a solution to protect Network Clients from other Clients in the same network.</p>
23
Ibrahim, Idris Skloul, Peter J. B. King, and Hans-Wolfgang Loidl. "NsGTFA: A GUI Tool to Easily Measure Network Performance through the Ns2 Trace File." Journal of Intelligent Systems 24, no. 4 (December 1, 2015): 467–77. http://dx.doi.org/10.1515/jisys-2014-0153.
Анотація:
AbstractNs2 is an open-source communications network simulator primarily used in research and teaching. Ns2 provides substantial support for simulation of TCP, routing, and multicast protocols over wired and wireless networks. Although Ns2 is a widely used powerful simulator, it lacks a way to measure networks that are used to assess reliability and performance metrics (e.g., the number of packets transferred from source to destination, delay in packets, packet loss, etc.) and it does not analyse the trace files it produces. The data obtained from the simulations are not straightforward to analyse. Ns2 is still unable to provide any data analysis statistics or graphics as requested. Moreover, the analysis of the Ns2 trace file using any software scripts requires further steps by a developer to do data processing and then produce graphical outputs. Lack of standardisation of tools means that results from different users may not be strictly comparable. There are alternative tools; however, most of them are not standalone applications, requiring some additional libraries. Also, they lack a user-friendly interface. This article presents the architecture and development considerations for the NsGTFA (Ns2 GUI Trace File Analyser) tool, which intends to simplify the management and enable the statistical analysis of trace files generated during network simulations. NsGTFA runs under Windows and has a friendly graphical user interface. This tool is a very fast standalone application implemented in VC++, taking as input an Ns2 trace file. It can output two-dimensional (2D) and 3D graphs (points, lines, and bar charts) or data sets, whatever the trace file format (Tagged, Old, or New). It is also possible to specify the output of standard network performance metrics. NsGTFA satisfies most user needs. There is no complex installation process, and no external libraries are needed.
24
Dong, Wei. "IPMT, an IPv6 Packet Manipulation Tool: Design Considerations and Applications." Applied Mechanics and Materials 543-547 (March 2014): 3040–43. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3040.
Анотація:
To facilitate research into IPv6 protocol, we propose IPMT in this paper, an IPv6 packet manipulation tool that allows rapid encode and decapsulation of IPv6 frames. IPMT offers capabilities of IPv6 packet manipulation, such as packet encapsulation, packet decapsulation, and packet trace. We mainly focus on IPv6 protocols because most popular network tools that are currently used don't support IPv6. We describe the main features of IPMT and demonstrate how the IPMT programming class enables users to easily develop portable IPv6 packet analysis tools without needing to consider the details of the capture format, file compression or intermediate protocol headers. Unlike other popular network tools, IPMT can almost decode all layers all at once. We divide IPMT into two modules and implement the tool and test the tool in a real test scenario to show that the tool works well. At the same time, we design a versatile way of storing decoding information result. As a result, we conclude that IPMT is a valuable contribution to the passive measurement community that will aid the development of better and more reliable IPv6 analysis and network monitoring tools.
25
Miyim, Abubakar Muhammad. "Techniques for Throughput Enhancement in Wireless Networks." Journal of Communications Technology, Electronics and Computer Science 4 (February 16, 2016): 1. http://dx.doi.org/10.22385/jctecs.v4i0.11.
Анотація:
In wireless systems, unnecessary signal degradation are caused by spurious timeouts from highly variable round-trip times (RTTs) for transmission control protocol (TCP). This paper proposes two methods of improving TCP throughput in wireless networks. Selecting a threshold higher than standard for retransmission timeout (RTO) and use of select-N-repeat (SNR) and trace-N-retransmit (TNR) as retransmission policies upon packet timeout are the two techniques adopted in this study. Simulations reveals that the former method helps reduce timeouts and provides relative throughput gain in a simulated network environment. However in the later method, TNR was found to improve throughput gain by about 8% over the SNR policy when packets at the receiver end arrive out-of-order.
26
AlArnaout, Zakwan, Nour Mostafa, Samer Alabed, Wael Hosny Fouad Aly, and Ahmed Shdefat. "RAPT: A Robust Attack Path Tracing Algorithm to Mitigate SYN-Flood DDoS Cyberattacks." Sensors 23, no. 1 (December 22, 2022): 102. http://dx.doi.org/10.3390/s23010102.
Анотація:
In the recent past, Distributed Denial of Service (DDoS) attacks have become more abundant and present one of the most serious security threats. In a DDoS attack, the attacker controls a botnet of daemons residing in vulnerable hosts that send a significant amount of traffic to flood the victim or the network infrastructure. In this paper, a common type of DDoS attacks known as “TCP SYN-Flood” is studied. This type of attack uses spoofed Internet Protocol (IP) addresses for SYN packets by exploiting the weakness in Transmission Control Protocol (TCP) 3-Way handshake used by the TCP/IP suite of protocols, which make the web servers unreachable for legitimate users or even worse, it might lead to server crash. In this paper, a resilient, efficient, lightweight, and robust IP traceback algorithm is proposed using an IP tracing packet for each attack path. The proposed algorithm suggests that edge routers—where the attack starts from—observe the traffic pattern passing through, and if the observed traffic carries the signature of TCP SYN-Flood DDoS attack and a high percentage of it is destined to a particular web server(s), it starts the tracing process by generating an IP trace packet, which accompanies the attack path recording the routers’ IP addresses on the path between the attacker/daemon and the victim, which can extract the path and react properly upon receiving it by discarding any SYN packets originating from that attacker/daemon. To our knowledge, this is the first research that efficiently traces these kinds of attacks while they are running. The proposed solution has low computation and message overhead, efficient detection and tracing time, and converges in near optimal time. The results are validated using extensive simulation runs.
27
Rusek, Krzysztof, Lucjan Janowski, and Zdzisław Papir. "Transient and stationary characteristics of a packet buffer modelled as an MAP/SM/1/b system." International Journal of Applied Mathematics and Computer Science 24, no. 2 (June 26, 2014): 429–42. http://dx.doi.org/10.2478/amcs-2014-0033.
Анотація:
Abstract A packet buffer limited to a fixed number of packets (regardless of their lengths) is considered. The buffer is described as a finite FIFO queuing system fed by a Markovian Arrival Process (MAP) with service times forming a Semi-Markov (SM) process (MAP /SM /1/b in Kendall’s notation). Such assumptions allow us to obtain new analytical results for the queuing characteristics of the buffer. In the paper, the following are considered: the time to fill the buffer, the local loss intensity, the loss ratio, and the total number of losses in a given time interval. Predictions of the proposed model are much closer to the trace-driven simulation results compared with the prediction of the MAP /G/1/b model.
28
Ohkuwa, Y., and T. Kitazoe. "Wave Packet in Quantum Cosmology and Definition of Semiclassical Time." International Journal of Modern Physics A 12, no. 05 (February 20, 1997): 859–71. http://dx.doi.org/10.1142/s0217751x97000657.
Анотація:
We consider a quantum cosmology with a massless background scalar field ϕB and adopt a wave packet as the wave function. This wave packet is a superposition of the WKB form wave functions, each of which has a definite momentum of the scalar field ϕB. In this model it is shown that to trace the formalism of the WKB time is seriously difficult without introducing a complex value for a time. We define a semiclassical real time variable TP from the phase of the wave packet and calculate it explicitly. We find that, when a quantum matter field ϕQ is coupled to the system, an approximate Schrödinger equation for ϕQ holds with respect to TP in a region where the size a of the universe is large and |ϕB| is small.
29
Tanveer Baig, Z., and Chandrasekar Shastry. "Smart Hybridized Routing Protocol for Animal Monitoring and Tracking Applications." Scalable Computing: Practice and Experience 23, no. 4 (December 23, 2022): 339–49. http://dx.doi.org/10.12694/scpe.v23i4.2040.
Анотація:
Wireless sensor networks (WSN) have been exploited for {countless} application domains, most notably the surveillance of environments and habitats, which has already become a critical mission. As a result, WSNs have been implemented to monitor animal care and track their health status. However, excessive energy utilization and communication traffic on packet transmissions lead to system deterioration, especially whenever perceived information captured in the monitoring area is transferred to the access point over multiple dynamic sinks. Further to manage the energy and data transmission issue, the energy consumption and location aware routing protocol has been architected on the wireless Nano sensor nodes. In this article, a novel hybrid energy and location aware routing protocol to cloud enabled IoT based Wireless Sensor Network towards animal health monitoring and tracking has been proposed. However proposed data routing protocol incorporates the trace file for path selection for data transmission to base station using sink node. Trace file has been obtained on processing the cluster heads established in the network. Therefore, clustering of node in the network has to be achieved using LEACH protocol which enhances the network scalability and network lifetime by clustering the nodes with Metaheuristics constraints like location or node density comparability. The objective of the proposed model is to enhance the network scalability and energy consumption by establishing the multiple node clusters with high density cluster head through Metaheuristics Node Clustering optimization techniques. Metaheuristics based node clustering is been obtained using Improved Particle Swarm Optimization. Further it is employed to compute the optimal path for sensed data transmission to base station. Node clustering provides high energy consumption among the sensing nodes and to establish the high energy clusters towards sensed information dissemination to base station on dynamically reforming the nodes clusters with respect to Node density and node location. Simulation analysis of the proposed energy efficient routing protocol provides high performance in energy utilization, packet delivery ratio, packet loss and Average delay compared against the conventional protocols on propagation of the data through sink node to base station
30
Lin, Yi-Bing. "Parallel trace-driven simulation for packet loss in finite-buffered voice multiplexers." Parallel Computing 19, no. 2 (February 1993): 219–28. http://dx.doi.org/10.1016/0167-8191(93)90051-l.
31
Lin, Yi-Bing. "Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy." Information Processing Letters 47, no. 4 (September 1993): 197–201. http://dx.doi.org/10.1016/0020-0190(93)90032-5.
32
Peng, Han Chuan, Li Feng Sha, Qiang Gan, and Yu Wei. "Combining adaptive sigmoid packet and trace neural network for fast invariance-learning." Electronics Letters 34, no. 9 (1998): 898. http://dx.doi.org/10.1049/el:19980667.
33
Marciniak, Marian. "Towards broadband global optical and wireless networking." Journal of Telecommunications and Information Technology, no. 3 (September 30, 2004): 1–6. http://dx.doi.org/10.26636/jtit.2004.3.249.
Анотація:
This paper presents a novel, non-conventional approach to the future optical and wireless hybrid transport network, capable of supporting dominant kinds of traffic, i.e., voice/real time, wireless and packet data traffic in a single transport network. The proposed model combines different technologies as connection and connectionless networks, optical cable and wireless (microwave/millimetre wave or optical wireless), being suitable for a variety of purposes and services in order to achieve global broadband networking features. Our new networking model contains an extension to wireless world in order to achieve mobility and personalisation of connection. From the networking point of view it consists of an upgrade of real-time traffic with the microwave modulated optical wave, in order to carry out conventional mobile wireless signals via optical fibres over long distances and without significant distortion. The whole available bandwidth can be fully exploited in the hybrid network. In the IP part of the network the quality of service (QoS) can be differentiated for various classes of packets and network reliability/survivability can be categorised for the whole hybrid network. This proposal combines complete and revolutionary shift to packet traffic with smooth evolutionary upgrades. We believe the model presented here is a powerful tool to trace the future evolution of telecommunications worldwide for the next 25 years.
34
RAHMIATI, PAULINE, DWI ARYANTA, and TAUFIQ AGUNG PRIYADI. "Perancangan dan Analisis Perbandingan Implementasi OSPF pada Jaringan IPv4 dan IPv6." ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika 2, no. 1 (January 1, 2014): 40. http://dx.doi.org/10.26760/elkomika.v2i1.40.
Анотація:
ABSTRAKOSPF (Open Shortest Path First) adalah suatu routing protokol bersifat terbuka dan didukung oleh berbagai perangkat network. IPv4 telah mencapai batas maksimum dalam jumlah alamat sehingga IPv6 merupakan solusi dalam hal tersebut. Seperti IPv4, IPv6 juga sudah mulai diimplementasikan untuk routing protokol OSPF, oleh karena itu pada penelitian ini akan dirancang suatu routing protokol OSPF IPv6 dan sebagai bahan perbandingan akan dibandingkan dengan OSPF IPv4. Software Cisco Packet Tracer 5.3 digunakan untuk mensimulasikan perancangan jaringan yang dibuat. Pada penelitian ini akan dibandingkan 2 buah jaringan berbasis routing protokol OSPF, yaitu OSPF untuk IPv4 dan IPv6. Skenario pertama dilakukan 100 kali dalam 5 kasus untuk mengetahui nilai delay OSPF IPv4 dan OSPF IPv6. Skenario kedua dilakukan pemutusan link dilakukan sebanyak 30 kali, hal yang dilihat dari pengujian ini adalah hasil trace route dari cost yang ada. Skenario ketiga dilakukan dengan mengamati waktu konvergensi dari OSPF IPv4 dan IPv6. Secara keseluruhan nilai delay OSPF IPv6 lebih kecil dibandingkan dengan OSPF IPv4 sebesar 3-6%, Trace route dan nilai cost pada OSPF IPv6 dan OSPF IPv4 sama tetapi nilai delay OSPF IPv6 lebih kecil sebesar 3-6% dan waktu konvergensi OSPF IPv4 bernilai sama dengan OSPF IPv6 yaitu 10 detik.Kata kunci: OSPF, IPv4, Ipv6, delay, konvergensiABSTRACTOSPF (Open Shortest Path First) is a routing protocol that opened and supported by a wide range of network devices. IPv4 has reached the maximum limit on the number of addresses that IPv6 are a solution in this case. Same as IPv4, IPv6 also has begun to be implemented for the OSPF routing protocol, therefore this study wiould design an IPv6 OSPF routing protocol and as a comparison will be compared to IPv4 OSPF. Cisco Packet Tracer 5.3 software was used to simulate the made network design. This research would compare two pieces of network-based routing protocol OSPF, OSPF for IPv4 and IPv6. The first scenario was done 100 times in of 5 cases to determine the value of delay OSPF OSPF IPv4 and IPv6. The second scenario was carried out link terminations 30 times, it was seen from the tests was the result of trace route from the existing cost. The third scenario was done by observed at the convergence time of OSPF IPv4 and IPv6. The overall delay value OSPF IPv6 better than IPv4 OSPF by 3-6%, the trace route and the OSPF cost value of IPv6 and IPv4 OSPF were same but delay OSPF IPv6 was better 3-6% and convergence time was the same as IPv4 OSPF OSPF IPv6 as 10 seconds.Keywords: OSPF, IPv4, IPv6, delay, convergence
35
Galiana-Merino, J. J., S. Parolai, and J. Rosa-Herranz. "Seismic wave characterization using complex trace analysis in the stationary wavelet packet domain." Soil Dynamics and Earthquake Engineering 31, no. 11 (November 2011): 1565–78. http://dx.doi.org/10.1016/j.soildyn.2011.06.009.
36
SAHNI, SARTAJ, and KUN SUK KIM. "EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS." International Journal of Foundations of Computer Science 15, no. 04 (August 2004): 567–91. http://dx.doi.org/10.1142/s0129054104002625.
Анотація:
Internet (IP) packet forwarding is typically done by finding the longest prefix in a router table that matches the packet's destination address. Although significant effort has been devoted to the development of data structures for static and dynamic router-tables for random packet-access-patterns, considerably less effort has been expended in the development of such structures for bursty access-patterns (i.e., streams of packets in which destination addresses repeat frequently within localized windows of packets). In this paper, we first formulate a variant, ACRBT (alternative collection of red-black trees), of the CRBT (collection of red-black trees) data structure proposed earlier for dynamic router-tables. By replacing the red-black trees used in the ACRBT with splay trees, we obtain the CST (collection of splay trees) structure in which search, insert, and delete take O( log n) amortized time per operation, where n is the number of prefixes in the router table. By replacing the front end of the CST with biased skip lists, we obtain the BSLPT (biased skip lists with prefix trees) structure in which search, insert, and delete take O( log n) expected time. The CST and BSLPT structures are designed so as to perform much better when the access pattern is bursty than when it is not. Experimental results using real IPv4 routing databases and synthetically generated search sequences as well as trace sequences are presented. For extremely bursty access patterns, the CST structure is best. Otherwise, the ACRBT is recommended. Our experiments also indicate that a supernode implementation of the ACRBT usually has better search performance than does the traditional one-element-per-node implementation.
37
Mishra, Abhishek kumar, Sara Ayoubi, Giulio Grassi, and Renata Teixeira. "NemFi." ACM SIGCOMM Computer Communication Review 51, no. 3 (July 11, 2021): 2–8. http://dx.doi.org/10.1145/3477482.3477484.
Анотація:
This paper presents NemFi: a trace-driven WiFi emulator. NemFi is a record-and-replay emulator that captures traces representing real WiFi conditions, and later replay these traces to reproduce the same conditions. In this paper, we demonstrate that the state-of-the-art emulator that was developed for cellular links cannot emulate WiFi conditions. We identify the three key differences that must be addressed to enable accurate WiFi record-and-replay: WiFi packet losses, medium-access control, and frame aggregation. We then extend the existing cellular network emulator to support WiFi record-and-replay. We evaluate the performance of NemFi via repeated experimentation across different WiFi conditions and for three different types of applications: speed-test, file download, and video streaming. Our experimental results demonstrate that average application performance over NemFi and real WiFi links is similar (with less than 3 percent difference).
38
S. Raj, Jennifer, and Abul Basar. "QOS OPTIMIZATION OF ENERGY EFFICIENT ROUTING IN IOT WIRELESS SENSOR NETWORKS." Journal of ISMAC 01, no. 01 (June 9, 2019): 12–23. http://dx.doi.org/10.36548/jismac.2019.1.002.
Анотація:
The internet of things is a group of connected computing, digital and mechanical machines with the capability of being identified by other devices that are internet enabled. The wireless sensor networks is a gathering of sovereign sensing elements in combination with actuating, computing, communicating and energy storing devices to keep track of the continuous physical world changes. These clique of independent sensors that commune wirelessly incurring advantages such as low cost, limited power consumption, high scalability with adaptableness to hostile and harsh environments afford them to be connected with IOT to become a part of it, to trace the physical changes encountered in the things that are internet enabled. The conventional methods for connection establishment between WSNs with IOT are more energy consuming and prone to failures in terms of network life time, packet delivery ratio and delay. So the proposed methodology that uses the concatenation of clustering with neural and simple fuzzy rule based system supported by the shortest route determination to provide with an energy efficient and enhanced routing capabilities for IOT with WSNs ensures to have a route entrenchment with reduced power consumption and improvised QOS metrics. The performance analysis is done with regard to the packet delivery ratio, energy consumption, sensor network life time and delay to evidence it perfect functioning.
39
Jan, Naveed, Ali Al-Bayatti, Naseer Alalwan, and Ahmed Alzahrani. "An Enhanced Source Location Privacy based on Data Dissemination in Wireless Sensor Networks (DeLP)." Sensors 19, no. 9 (May 2, 2019): 2050. http://dx.doi.org/10.3390/s19092050.
Анотація:
Wireless Sensor Network is a network of large number of nodes with limited power and computational capabilities. It has the potential of event monitoring in unattended locations where there is a chance of unauthorized access. The work that is presented here identifies and addresses the problem of eavesdropping in the exposed environment of the sensor network, which makes it easy for the adversary to trace the packets to find the originator source node, hence compromising the contextual privacy. Our scheme provides an enhanced three-level security system for source location privacy. The base station is at the center of square grid of four quadrants and it is surrounded by a ring of flooding nodes, which act as a first step in confusing the adversary. The fake node is deployed in the opposite quadrant of actual source and start reporting base station. The selection of phantom node using our algorithm in another quadrant provides the third level of confusion. The results show that Dissemination in Wireless Sensor Networks (DeLP) has reduced the energy utilization by 50% percent, increased the safety period by 26%, while providing a six times more packet delivery ratio along with a further 15% decrease in the packet delivery delay as compared to the tree-based scheme. It also provides 334% more safety period than the phantom routing, while it lags behind in other parameters due to the simplicity of phantom scheme. This work illustrates the privacy protection of the source node and the designed procedure may be useful in designing more robust algorithms for location privacy.
40
Peng, Guang-Qian, Guangtao Xue, and Yi-Chao Chen. "Network Measurement and Performance Analysis at Server Side." Future Internet 10, no. 7 (July 16, 2018): 67. http://dx.doi.org/10.3390/fi10070067.
Анотація:
Network performance diagnostics is an important topic that has been studied since the Internet was invented. However, it remains a challenging task, while the network evolves and becomes more and more complicated over time. One of the main challenges is that all network components (e.g., senders, receivers, and relay nodes) make decision based only on local information and they are all likely to be performance bottlenecks. Although Software Defined Networking (SDN) proposes to embrace a centralize network intelligence for a better control, the cost to collect complete network states in packet level is not affordable in terms of collection latency, bandwidth, and processing power. With the emergence of the new types of networks (e.g., Internet of Everything, Mission-Critical Control, data-intensive mobile apps, etc.), the network demands are getting more diverse. It is critical to provide finer granularity and real-time diagnostics to serve various demands. In this paper, we present EVA, a network performance analysis tool that guides developers and network operators to fix problems in a timely manner. EVA passively collects packet traces near the server (hypervisor, NIC, or top-of-rack switch), and pinpoints the location of the performance bottleneck (sender, network, or receiver). EVA works without detailed knowledge of application or network stack and is therefore easy to deploy. We use three types of real-world network datasets and perform trace-driven experiments to demonstrate EVA’s accuracy and generality. We also present the problems observed in these datasets by applying EVA.
41
Zhao, Ning, Xue Li, Mei Yang, and Xin Ting Huang. "Vehicular Ad-Hoc Network and Routing Design." Applied Mechanics and Materials 641-642 (September 2014): 829–32. http://dx.doi.org/10.4028/www.scientific.net/amm.641-642.829.
Анотація:
To analyze vehicular Ad-Hoc network routing performance, the GPSR routing performance is studied using network simulation software NS2 compared with traffic simulation software VanetMobiSim. 100 nodes communicated with each other was stimulated by adding routing protocol into NS2, building the environment of simulation, setting simulation parameters and writing TCL script. The data packet delivery path was examined by trace files and GPSR routing performance was concluded through Gawk. The average end-to-end transmission delay trends to increase and the average delivery rate trends to drop when the average speed of vehicle nodes increase.
42
Chiesa, Marco, and Fábio L. Verdi. "Network Monitoring on Multi-Pipe Switches." Proceedings of the ACM on Measurement and Analysis of Computing Systems 7, no. 1 (February 27, 2023): 1–31. http://dx.doi.org/10.1145/3579321.
Анотація:
Programmable switches have been widely used to design network monitoring solutions that operate in the fast data-plane level, e.g., detecting heavy hitters, super-spreaders, computing flow size distributions and their entropy. Many existing works on networking monitoring assume switches deploy a single memory that is accessible by each processed packet. However, high-speed ASIC switches increasingly deploymultiple independent pipes, each equipped with its own independent memory thatcannot be accessed by other pipes. In this work, we initiate the study of deploying existing heavy-hitter data-plane monitoring solutions on multi-pipe switches where packets of a "flow" may spread over multiple pipes, i.e., stored into distinct memories. We first quantify the accuracy degradation due to splitting a monitoring data structure across multiple pipes (e.g., up to 3000x worse flow-size estimation average error). We then present PipeCache, a system that adaptsexisting data-plane mechanisms to multi-pipe switches by carefully storing all the monitoring information of each traffic class into exactly one specific pipe (as opposed to replicate the information on multiple pipes). PipeCache relies on the idea of briefly storing monitoring information into a per-pipe cache and then piggybacking this information onto existing data packets to the correct pipeentirely at data-plane speed. We implement PipeCache on ASIC switches and we evaluate it using a real-world trace. We show that existing data-plane mechanisms achieves accuracy levels and memory requirements similar to single-pipe deployments when augmented with PipeCache (i.e., up to 16x lower memory requirements).
43
Bhaumik, Mani L. "Is the Quantum State Real in the Hilbert Space Formulation?" Quanta 9, no. 1 (December 19, 2020): 37–46. http://dx.doi.org/10.12743/quanta.v9i1.142.
Анотація:
The persistent debate about the reality of a quantum state has recently come under limelight because of its importance to quantum information and the quantum computing community. Almost all of the deliberations are taking place using the elegant and powerful but abstract Hilbert space formalism of quantum mechanics developed with seminal contributions from John von Neumann. Since it is rather difficult to get a direct perception of the events in an abstract vector space, it is hard to trace the progress of a phenomenon. Among the multitude of recent attempts to show the reality of the quantum state in Hilbert space, the Pusey–Barrett–Rudolph theory gets most recognition for their proof. But some of its assumptions have been criticized, which are still not considered to be entirely loophole free. A straightforward proof of the reality of the wave packet function of a single particle has been presented earlier based on the currently recognized fundamental reality of the universal quantum fields. Quantum states like the atomic energy levels comprising the wave packets have been shown to be just as real. Here we show that an unambiguous proof of reality of the quantum states gleaned from the reality of quantum fields can also provide an explicit substantiation of the reality of quantum states in Hilbert space.Quanta 2020; 9: 37–46.
44
Ryzhov, Oleg S., and Sergey V. Timofeev. "Interaction of a potential vortex with a local roughness on a smooth surface." Journal of Fluid Mechanics 287 (March 25, 1995): 21–58. http://dx.doi.org/10.1017/s002211209500084x.
Анотація:
Disturbances generated by a potential vortex moving past a small hump or dent on the otherwise smooth flat plate are considered. Features peculiar to this problem derive from the fact that the vortex is stuck with a fixed fluid particle; hence the nonlinear dependence of the pressure on the induced velocity field ensues even if the vortex intensity tends to zero. Formulation of the problem on a flow in the viscous wall sublayer given in canonical variables involves four similarity parameters for any particular shape of a roughness. The parallels between the process at hand and sound scattering from a boundary layer with a small obstacle at the bottom are indicated. Results from numerical integration of the boundary-value problem posed allow us to trace the evolution of the wave-packet structure depending on the potential vortex intensity. Overlapping of the peak wings and formation of an almost continuous spectrum in the Fourier decomposition of the signal serve as a guide for explaining the explosive development of the wave packet as distinct from the Tollmien–Schlichting wavetrain that has been registered experimentally.The theory developed is applied to discussing the so-called bypass mode of transition provoked by external turbulence. Special emphasis is laid on flows in gas turbine engines where bypass transition plays a dominant role owing to extremely high free-stream turbulence levels.
45
Ware, Christopher, and Joe Chicharo. "Simulating capture behaviour in 802.11 radio modems." Journal of Telecommunications and Information Technology, no. 3 (September 30, 2001): 46–54. http://dx.doi.org/10.26636/jtit.2001.3.68.
Анотація:
Simulation plays an important role in the performance evaluation of MAC protocols. Building simulation models which are able to accurately model physical behaviour is fundamental to the outcome of such techniques. Through both qualitative and quantitative comparison of experimental trace data against simulation results obtained using delay, power, and hybrid capture models, this paper investigates the performance of various packet capture models in the simulation analysis of the 802.11 PHY and MAC layer protocols. We illustrate these models are unable to accurately describe the fairness properties of the experimental data. A new model is proposed, Message Retraining, to describe the operation of an 802.11 receiver. We illustrate that the Message Retraining reception model is able to model the fairness characteristics obtained with an IEEE 802.11 radio modem more accurately than the previous capture models.
46
Aleroud, Ahmed, Fan Yang, Sai Chaithanya Pallaprolu, Zhiyuan Chen, and George Karabatis. "Anonymization of Network Traces Data through Condensation-based Differential Privacy." Digital Threats: Research and Practice 2, no. 4 (December 31, 2021): 1–23. http://dx.doi.org/10.1145/3425401.
Анотація:
Network traces are considered a primary source of information to researchers, who use them to investigate research problems such as identifying user behavior, analyzing network hierarchy, maintaining network security, classifying packet flows, and much more. However, most organizations are reluctant to share their data with a third party or the public due to privacy concerns. Therefore, data anonymization prior to sharing becomes a convenient solution to both organizations and researchers. Although several anonymization algorithms are available, few of them allow sufficient privacy (organization need), acceptable data utility (researcher need), and efficient data analysis at the same time. This article introduces a condensation-based differential privacy anonymization approach that achieves an improved tradeoff between privacy and utility compared to existing techniques and produces anonymized network trace data that can be shared publicly without lowering its utility value. Our solution also does not incur extra computation overhead for the data analyzer. A prototype system has been implemented, and experiments have shown that the proposed approach preserves privacy and allows data analysis without revealing the original data even when injection attacks are launched against it. When anonymized datasets are given as input to graph-based intrusion detection techniques, they yield almost identical intrusion detection rates as the original datasets with only a negligible impact.
47
Saputra, I. Wayan Adi, and I. Komang Ari Mogi. "Performance Analysis of MANET Proactive and Reactive Routing Protocols Using Network Simulator 2." JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) 8, no. 3 (January 25, 2020): 251. http://dx.doi.org/10.24843/jlk.2020.v08.i03.p06.
Анотація:
The development of Mobile ad hoc networks (MANET) has the nature and character of a fast, costeffective. The development of Mobile ad hoc networks (MANET) has the nature and character of a fast, cost-effective deployment and able to manage the topology independently. This has caused in recent years, MANET to be an interesting and popular thing to study. MANET can be applied even in difficult areas, forest fire detection, military operations and even health monitoring. Changes in the topology dynamically on MANET, limited energy consumption, and built without existing infrastructure are a problem in MANET. Problems especially dynamic topology changes make routing very important in MANET design. This article aims to analyze AODV, DSDV and DSR routing protocols based on quality of service (QoS). The test scenario is based on the number of nodes, packet size, area of simulation, simulation time, simulation speed, mobility model, and propagation model. The simulation that has been done produces 4 graphs, each of which explains the packet delivery ratio, throughput, network routing load, and delay. Simulation results are obtained using NS2 network simulators through *. Tcl files and generate *. Tr (trace) and *.nam (animator) files. Simulation results show that the DSR routing protocol has better performance than AODV and DSDV in terms of pdr, throughput, network routing load, and delay. The average value of the DSR routing protocol is 657,498 on throughput and 0.244 milliseconds on delay.
48
de Prost, Nicolas, Bruno Mégarbane, Frank Questel, Vanessa Bloch, Delphine Cantin Bertaux, Jean Louis Pourriat, and Antoine Rabbat. "Blood cocaine and metabolite pharmacokinetics after cardiac arrest in a body-packer case." Human & Experimental Toxicology 29, no. 1 (November 19, 2009): 49–53. http://dx.doi.org/10.1177/0960327109354940.
Анотація:
Introduction: Cocaine body packing, the internal concealment of cocaine for transportation between countries, may expose to life-threatening intoxications. No data is currently available on the pharmacokinetics of cocaine and its metabolites when a packet rupture occurs in a body packer. Case report: We report the first pharmacokinetic data associated with a severe cocaine intoxication in a body packer, resulting in cardiac arrest. Massive concentrations of cocaine (observed maximal concentration: 1.66 mg/L, 1 hour after the cardiac arrest) were measured in plasma up to about 15 hours, suggesting a prolonged absorption due to a slow-release in the gastrointestinal tract despite surgical extraction of the packets. Apparent cocaine elimination half-life was 7.6 hours. Conclusion: A prolonged apparent cocaine elimination half-life has been observed. Further pharmacokinetic studies are needed to understand better the pathophysiology of acute cocaine intoxication in body packers.
49
Shidaganti, Ganeshayya Ishwarayya, Amogh Shreedhar Inamdar, Sindhuja V. Rai, and Anagha M. Rajeev. "SCEF: A Model for Prevention of DDoS Attacks From the Cloud." International Journal of Cloud Applications and Computing 10, no. 3 (July 2020): 67–80. http://dx.doi.org/10.4018/ijcac.2020070104.
Анотація:
Distributed denial of service (DDoS) attacks are some of the biggest threats to network performance and security today. With the advent of cloud computing, these attacks can be performed remotely on rented virtual machines (VMs), potentially increasing their capabilities and making them harder to trace and mitigate, and negatively affecting the cloud service provider as well. By analyzing packet transmission statistics, attacks can be detected on a virtual machine monitor (VMM) that controls the behavior of the VMs. This article proposes a solution to stop such detected attacks from the source, and analyses solutions proposed for a few different types of such attacks. The authors propose a model called selective cloud egress filter (SCEF) which implements specific modules to deal with detected attacks. If an attack is detected, the SCEF relays information to the VMM about which VMs are participating in the attack, allowing for specific corrective action.
50
Gupta, Neha, Pradeep Kumar Juneja, Sachin Sharma, and Umang Garg. "A proposed customized architecture for 5G-IoT based smart healthcare system: 5G-IoT-SHS." Journal of Information and Optimization Sciences 44, no. 6 (2023): 1179–94. http://dx.doi.org/10.47974/jios-1456.
Анотація:
The emergence of new technology is making enormous changes in healthcare which is the largest industry in the world. Therefore, a smart healthcare system is required that can communicate across different available network devices and applications. This will enable patients and doctors to trace, observe and record sensitive patient data with medical readings. The Internet of things (IoT) has a great contribution to put the healthcare sector in its leading state to provide the safe and healthy environment for patients and to enable doctors to give outstanding care remotely. The integration of 5G and IoT can be utilized to address these issues due to its capability to handle massive amounts of data with low latency and offers larger bandwidth, fast data rates, and greater reliability. It has heightened the patient involvement and satisfaction due to its capability to make the real time uncomplicated and competent communication among patients and doctors. Thus, a comprehensive smart healthcare architecture including 5G is required. This research is presented a literature review on various healthcare architectures and proposed a customized architecture for a 5G-IoT based smart healthcare system that incorporate different sensors, technology standards and communication protocols. The proposed architecture is validated using a software called Cisco Packet tracer, demonstrating the effectiveness and dependability of the suggested system. This work was carried out in Arya Bhatt Lab, GEU, Dehradun, India.