Outgoing Packets Research Articles

Markov transition and smart cache congestion control for IoT enabled wireless mesh networks

Wireless Mesh Networking (WMN) is the latest Internet framework that provides a comprehensive range for Subsequent Internet (SI) prototype. Despite significant advantages provided by WMN, its practical distribution to connect Internet of Things (IoT) networks caused exorbitant congestion and restricted bandwidth. Motivated by this, a novel mechanism that ensures control in the manifestation of mobbing, end-to-end delay, energy consumption for enhancing the network performance of IoT-enabled WMN is presented. The proposed method is called as an Integrated Markov State Transition and Open Loop Smart Caching (MST-OLSC) for congestion control in IoT-enabled WMN. The proposed method uses Markov state transition scheduling model to differentiate the states of the incoming data packets from the host computer. This is performed by applying the State Betweenness centrality. Next, Congestion Control Token Caching mechanism is applied with the objective of controlling the congestion by means of caching via overflow with well-balanced isolation between regulated and unregulated flow of data packet. Finally, Open Loop Smart Caching is presented to ensure constant data rate, thereby providing fair inflow and outflow between the incoming and outgoing data packets. The evaluation results of MST-OLSC ensure higher network performance with minimum end-to-end delay, energy consumption and higher packet delivery rate is achieved with respect to inflated IoT nodes in WMN.

Decoherence of charge density waves in beam splitters for interacting quantum wires

Simple intersections between one-dimensional channels can act as coherent beam splitters for non-interacting electrons. Here we examine how coherent splitting at such intersections is affected by inter-particle interactions, in the special case of an intersection of topological edge states. We derive an effective impurity model which represents the edge-state intersection within Luttinger liquid theory at low energy. For Luttinger K = 1 / 2 , we compute the exact time-dependent expectation values of the charge density as well as the density-density correlation functions. In general a single incoming charge density wave packet will split into four outgoing wave packets with transmission and reflection coefficients depending on the strengths of the tunnelling processes between the wires at the junction. We find that when multiple charge density wave packets from different directions pass through the intersection at the same time, reflection and splitting of the packets depend on the relative phases of the waves. Active use of this phase-dependent splitting of wave packets may make Luttinger interferometry possible. We also find that coherent incident packets generally suffer partial decoherence from the intersection, with some of their initially coherent signal being transferred into correlated quantum noise. In an extreme case four incident coherent wave packets can be transformed entirely into density-density correlations, with the charge density itself having zero expectation value everywhere in the final state.

Packet Scheduling in Multipath TCP: Fundamentals, Lessons, and Opportunities

Multipath transmission control protocol (MPTCP) is a transport protocol that allows the simultaneous use of multiple transmission control protocol subflows across the existing IP addresses between peers. Since each subflow undergoes the bottleneck link condition of its path, selecting the best subflow to schedule an outgoing packet plays a key role in the multipath performance. While good scheduling decisions can significantly improve throughput, wrong decisions prevent users from benefiting the aggregating capacities of available subflows. To deal with this concern, in the last years, several scheduling solutions were proposed to achieve different goals and applications. Different from other surveys and tutorials, in this article, we provide a tutorial of packet scheduling in the MPTCP that brings not only its fundamentals but also a detailed analysis of multipath performance from a consistent experimental methodology. In a multipath network setup, we compare single-criterion and multicriteria schedulers under different bottleneck conditions and multipath congestion controls. From a comprehensive experimental analysis that unveils several performance issues, we discuss the lessons learned and research opportunities regarding the multipath throughput improvement as the central motivation. In this way, this article provides a comprehensive analysis of packet scheduling in the MPTCP, not only in theory but in practice as well.

Decarbonizing warehousing activities through digitalization and automatization with WMS integration for sustainability supporting operations

The current strong outsourcing trend dictates that the efficiency of outsourced warehousing is a big contributing impact factor for the carbon footprint from supply chains. A good warehouse management system boosts warehousing eco-friendliest by reducing space waste and unnecessary number of material movements, to ensure continuous fast materials flow and to keep the heating and cooling costs to a minimum. All this may happen on some lengths inside the traditional manual warehousing scenes, but in fact, if the highest level of efficiency is wanted/needed, the operator shall need to automate, digitalize and robotize their operations. Authors presents an example of automation in the warehousing context, where the warehouse operator is capable of turning around an order line as an outgoing packet, even in high peak load times under 3h time period. This sort of efficiency means less needed storage space as items stay less time in the warehouse and such automatization also gives the 3PLs possibility to store materials in high rising automated systems like automated storage and retrieval systems to optimize their space usage. All combined, the future warehouse operations can make a positive impact on efforts to reduce overall CO₂emissions made by supply chains.

Enhancing the Anonymity in Information Diffusion Based on Obfuscated Coded Data

Linear network coding (LNC) is a promising approach to facilitate anonymity in information diffusion because each packet is generated by linearly combining multiple incoming packets. Since the coefficients used in the linear combination would reveal the correlation between incoming and outgoing packets at a node, most existing studies on anonymous LNC design focus on encrypting these coefficients. Despite the importance of these studies, the correlation of coded content can still be analyzed and the potential of un-encrypted LNC has not been fully exploited. In this paper, we tackle these issues and we propose a novel ALNCode scheme that can enhance anonymity by generating outgoing packets that are correlated to incoming coded packets of multiple flows. With solid theoretical analysis, we first prove the probability that incoming coded packets from different flows are correlated. Then, we prove that, if such correlation exists, we can design deterministic LNC to obfuscate the correlation of packets. With the same condition, we also prove the probability that a randomly generated coded packet is correlated to coded packets in other flows. Besides the theoretical study, we conduct extensive numerical experiments to understand the impacts of various coding parameters and the performance of ALNCode in real scenarios.

Recovery of High-Energy Photoelectron Circular Dichroism through Fano Interference.

It is commonly accepted that the magnitude of a photoelectron circular dichroism (PECD) is governed by the ability of an outgoing photoelectron wave packet to probe the chiral asymmetry of a molecule. To be able to accumulate this characteristic asymmetry while escaping the chiral ion, photoelectrons need to have relatively small kinetic energies of up to a few tens of electron volts. Here, we demonstrate a substantial PECD for very fast photoelectrons above 500eV kinetic energy released from methyloxirane by a participator resonant Auger decay of its lowermost O 1s excitation. This effect emerges as a result of the Fano interference between the direct and resonant photoionization pathways, notwithstanding that their individual effects are negligibly small. The resulting dichroic parameter has an anomalous dispersion: It changes its sign across the resonance, which can be considered as an analogue of the Cotton effect in the x-ray regime.

APPLICATION OF ACCESS CONTROL LIST FOR NETWORK SECURITY AT CISCO ROUTER AS A FIREWALL

The provision limiting access to network users is one of the defensive action system from cyber attacks that can occur through a network connected to the user. Installation ACL device the router can be a firewall, where each incoming and outgoing packets will be matched with a list of existing entries, and then will proceed preconfigured actions.

Counter-propagating wave packets in the quantum transition state approach to reactive scattering.

The quantum transition state concept provides an intuitive and numerically efficient framework for the description of quantum state-resolved reactive scattering and thermal reaction processes. Combining multiconfigurational time-dependent Hartree wave packet dynamics calculations with a flux correlation function based analysis, rigorous full-dimensional calculations of initial state-selected and state-to-state reaction probabilities for six atom reactions are feasible. In these calculations, a set of wave packets is generated in the transition state region, propagated into the asymptotic area, and analyzed. In the present work, an alternative approach which employs counter-propagating sets of wave packets is introduced. Outgoing wave packets started in the transition state region are matched with incoming wave packets generated in the reactant (or product) asymptotic area. Studying the H + CH4 → H2 + CH3 reaction as a prototypical example, one finds that the incoming wave packets can be propagated closely up to the transition state region with minor numerical effort. Employing cross correlation functions of incoming and outgoing wavefunctions, the propagation times required for the outgoing wave packet and thus the numerical costs of the entire calculation can be reduced significantly. Detailed full-dimensional calculations studying initial state-selected reaction probabilities for the H + CH4 → H2 + CH3 reaction are presented to illustrate the new approach. It is found that converged results can be obtained using shorter propagation times of the outgoing wave packets and less single-particle functions.

NoMoAds: Effective and Efficient Cross-App Mobile Ad-Blocking

Abstract Although advertising is a popular strategy for mobile app monetization, it is often desirable to block ads in order to improve usability, performance, privacy, and security. In this paper, we propose NoMoAds to block ads served by any app on a mobile device. NoMoAds leverages the network interface as a universal vantage point: it can intercept, inspect, and block outgoing packets from all apps on a mobile device. NoMoAds extracts features from packet headers and/or payload to train machine learning classifiers for detecting ad requests. To evaluate NoMoAds, we collect and label a new dataset using both EasyList and manually created rules. We show that NoMoAds is effective: it achieves an F-score of up to 97.8% and performs well when deployed in the wild. Furthermore, NoMoAds is able to detect mobile ads that are missed by EasyList (more than one-third of ads in our dataset). We also show that NoMoAds is efficient: it performs ad classification on a per-packet basis in real-time. To the best of our knowledge, NoMoAds is the first mobile ad-blocker to effectively and efficiently block ads served across all apps using a machine learning approach.

Design of a dynamic sonar emitter inspired by hipposiderid bats

The ultrasonic emission of the biosonar systems of bats, such as Old World leaf-nosed bats (family Hipposideridae) and the related horseshoe bats (family Rhinolophidae), is characterized by a unique dynamics where baffle shapes (‘noseleaves’) deform while diffracting the outgoing wave packets. As of now, nothing comparable to this dynamics has been used in any related engineering application (e.g. sonar or radar). Prior work with simple concave baffle shapes has demonstrated the impact of the dynamics on the emission characteristics, but it has remained unclear whether this was simply due to the change in aperture size or also influenced by the geometrical shape detail. Hence, it has also remained unclear whether it would be possible to further enhance the time-variant effects reported so far through different static and dynamic geometries. To address this issue, we have created a dynamic emission baffle with biomimetic shape detail modeled after Pratt’s roundleaf bats (Hipposideros pratti). The impact of the dynamic deformation of the shape on the time-variant emission characteristics was evaluated by virtue of the gradient magnitude and the entropy in the gradient orientation. The results have shown that the dynamics results in much larger gradients in signal representation, which change jointly over direction and time.

Consecutive Switch Codes

Switch codes, first proposed by Wang et al. , are codes that are designed to increase the parallelism of data writing and reading processes in network switches. A network switch is required to write $n$ incoming packets and read $k$ outgoing packets while using $m$ memory banks, each able to write and read one packet per time unit. Each set of $n$ packets written to the switch simultaneously is called a generation. The objective is to store the packets in the banks such that every request of $k$ packets, which can belong to previous generations, can be handled by reading at most one packet from every bank. In this paper, we study a new type of switch codes that can simultaneously deliver large packet request and good coding rate. These attractive features are achieved by relaxing the request model to a natural sub-class we call consecutive requests . For this new request model, we define a new type of codes called consecutive switch codes . These codes are studied in both the computational and combinatorial models, corresponding to whether the data can be encoded or not. For binary codes, we also study an intermediate model in which a coded packet is formed by the XOR operations of at most two input packets. We present several code constructions and prove the optimality of one family of these codes by providing the corresponding lower bound. Finally, we introduce a construction of conventional switch codes, which improves upon the best known results for the case $n=k$ .

RETRACTED ARTICLE: Stealthy attack detection in multi-channel multi-radio wireless networks

In recent years, the lack of network traffic analysis and flexible network topologies reduce the performance of the multi-channel multi-radio wireless networks. As high scalability of its participants and routing structure, multicast communication of wireless networks is vulnerable to stealthy attacks. Stealthy packet dropping disrupts the packet from reaching the destination through malicious behavior at an intermediate node. A network table is maintained in each hop to transfer the data packet from source to destination. The main contribution of this paper is to use that network table to monitor the drastic changes incoming packet as well as an outgoing packet. More specifically, we have proposed Cumulative Sum algorithm (CuSum) with bootstrap analysis method to monitor the changes in the network packet transmission. We have used NS-2 network simulator to simulate the proposed CUSUM algorithm with a bootstrap method is compared with various other existing change detection methods such as such as Binary Segmentation (BinSeg), Pruned Exact Linear Time (PELT) and Segment Neighborhood (SegNeigh) method. The simulation results proved the efficiency of the proposed CuSum with bootstrap analysis method.

The Outgoing and Incoming Network Packets Intercepting Method

In connexion with the rapidly growing computer network information capacities, information security of local networks connected with global networks becomes a critical challenge. One of the information security aspects is to control and filter the network traffic by intercepting the incoming and outgoing network packets. This is accomplished owing to firewalls. The Linux kernel 2.4.x included the Netfilter firewall and the iptables utility, which allow us to analyse only the packets headers and their pertaining to specific network connections. In addition, the practice of rewriting the Linux kernel codes complicates the maintenance of the software targeting for this firewall.The article proposes a network packet intercepting method based directly on the structures and functions of the kernel, so it has no restrictions associated with the inherent Netfilter/iptables functionality. To provide intercepting, are used the struct net_device structure of the kernel that describes a network device and the struct net_device_ops structure that lists operations possible on the network device and two functions: ndo_start_xmit and rx_handler used to process outgoing and incoming packets, respectively. These functions are rewritten in order to include new functionality into the kernel to meet the users’ requests. The use of the structures and functions of the kernel provides desirable stability, versatility, and adaptive capability of the developed software for users’ requests such as content analysis of data transmitted in packets, their encryption and decryption. The proposed method can be used to create firewalls of the next-generation to implement technology of deep packet inspection, as well as a complement to the available firewalls.

FIREWALLS: A STUDY AND ITS CLASSIFICATION

In today’s modern life the people are blessed with the best gift of the internet. Internet helps the netizens to do their work anywhere at any time, according to their comfortability. Bye the use of the internet the people are able to do various task like online net banking, e-business, online shopping, e-tendering, getting connected to different friends & family, online courses and many more. But with the increasing use of the internet, people started to spend more and more time using the internet and wasting their precious time by performing the unwanted activities like chatting, playing games, gambling and so on. And some person tries to learn new things which is harmful to the society like hacking and tries to execute those things in the network during their working hours. Moreover these days the hackers enters into the company’s network and steal the important document or damages the network, thus that company suffers the heavy lose in terms of monetary as well as its market value. Due to this reasons there is a loss to the company and to the entrepreneurs. So to keep the watch on the employee and on their firm’s network the company places the firewall. Firewall is one of the important network security perimeter know to everyone. It is one of the most essential section to provide security to both the world as well as the user a firewall is defined as the software and hardware or the combination of the both. It takes care of the incoming as well as the outgoing packets. The main aim of the firewall is to protect the users and keep watch on the activities of the users

Cavity-assisted spontaneous emission of a singleΛ-type emitter as a source of single-photon packets with controlled shape

The radiation emitted by a classically pumped three-level $\mathrm{\ensuremath{\Lambda}}$-type emitter in a resonator cavity featuring both radiative and unwanted losses is studied. In particular, the efficiency of one-photon Fock state excitation of the outgoing wave packet and the spatiotemporal shape of the wave packet are investigated. It is shown that, for a given shape of the emitter-cavity interaction, adjusting the shape of the pump pulse renders it possible to generate the emission of one-photon Fock state wave packets of desired shape with high efficiency.

Entropy of the information retrieved from black holes

The retrieval of black hole information was recently presented in two interesting proposals in the ‘Hawking Radiation’ conference: a revised version by Hooft of a proposal he initially suggested 20 years ago and, a new proposal by Hawking. Both proposals address the problem of black hole information loss at the classical level and derive an expression for the scattering matrix. The former uses gravitation back reaction of incoming particles that imprints its information on the outgoing modes. The latter uses supertranslation symmetry of horizons to relate a phase delay of the outgoing wave packet compared to their incoming wave partners. The difficulty in both proposals is that the entropy obtained from them appears to be infinite. By including quantum effects into the Hawking and Hooft’s proposals, I show that a subtlety arising from the inescapable measurement process, the quantum Zeno effect, not only tames divergences but it actually recovers the correct 1/4 of the area Bekenstein–Hawking entropy law of black holes.

Secure On-Chip Communication Architecture for Reconfigurable Multi-Core Systems

Security is becoming the primary concern in today’s embedded systems. Network-on-chip (NoC)-based communication architectures have emerged as an alternative to shared bus mechanism in multi-core system-on-chip (SoC) devices and the increasing number and functionality of processing cores have made such systems vulnerable to security attacks. In this paper, a secure communication architecture has been presented by designing an identity and address verification (IAV) security module, which is embedded in each router at the communication level. IAV module verifies the identity and address range to be accessed by incoming and outgoing data packets in an NoC-based multi-core shared memory architecture. Our IAV module is implemented on an FPGA device for functional verification and evaluated in terms of its area and power consumption overhead. For FPGA-based systems, the IAV module can be reconfigured at run-time through partial reconfiguration. In addition, a cycle-accurate simulation is carried out to analyze the performance and total network energy consumption overhead for different network configurations. The proposed IAV module has presented reduced area and power consumption overhead when compared with similar existing solutions.

Performance Evaluations of IPTables Firewall Solutions under DDoS attacks

Abstract The paper presents design, background and experimental results of the IPTables applied in IPv4 and IP6Tables applied in IPv6 network compared through several tested parameters. The experimental testbed environment is based on P2P grid utilized for DDoS attacks. IPTables tool is used for packet filtering and consequently for preventing DoS/DDoS attacks. It allows a system administrator to configure the tables, the chains and rules it stores in order to manage the incoming and outgoing packets. The packets are treated according to the rules’ results provided by the packet processing. A rule in a chain can be bound with another chain in the table etc. We employ the P2P grid environment to carry out as well as to coordinate DDoS attack on the availability of services to simulate real DDoS attack launched indirectly through many compromised computing systems. The same routing protocols as well as the same firewall rules were used for IPv4 and for IPv6 network. The main aim was to analyse pros and cons of new IP6Tables tool compared with IPTables in IPv4 networks in light of the resistance to DDoS attacks which is still one of the most significant threats in the IPv6 networks.

Dynamics of biosonar systems in Horseshoe bats

Horseshoe bats have an active ultrasonic sonar system that allows the animals to navigate and hunt prey in structure-rich natural environments. The physical components of this biosonar system contain an unusual dynamics that could play a key role in achieving the animals’ superior sensory performance. Horseshoe bat biosonar employs elaborate baffle shapes to diffract the outgoing and incoming ultrasonic wave packets; ultrasound is radiated from nostrils that are surrounded by noseleaves and received by large outer ears. Noseleaves and pinnae can be actuated while ultrasonic diffraction takes place. On the emission side, two noseleaf parts, the anterior leaf and the sella, have been shown to be in motion in synchrony with sound emission. On the reception side, the pinnae have been shown to change their shapes by up to 20% of their total length within ∼100 milliseconds. Due to these shape changes, diffraction of the incoming and outgoing waves is turned into a dynamic physical process. The dynamics of the diffraction process results in likewise dynamic device characteristics. If this additional dynamic dimension was found to enhance the encoding of sensory information substantially, horseshoe bat biosonar could be a model for the use of dynamic physical processes in sensing technology.

Tight analysis of priority queuing for egress traffic

Recently, the problems of evaluating performances of switches and routers have been formulated as online problems, and a great amount of results have been presented. In this paper, we focus on managing outgoing packets (called egress traffic) on switches that support Quality of Service (QoS), and analyze the performance of one of the most fundamental scheduling policies Priority Queuing (PQ) using competitive analysis. We formulate the problem of managing egress queues as follows: An output interface is equipped with m queues, each of which has a buffer of size B. The size of a packet is unit, and each buffer can store up to B packets simultaneously. Each packet is associated with one of m priority values αj (1 ≤ j ≤ m), where α1 ≤ α2 ≤ ⋅⋅⋅ ≤ αm, α1=1, and αm=α and the task of an online algorithm is to select one of m queues at each scheduling step. The purpose of this problem is to maximize the sum of the values of the scheduled packets.For any B and any m, we show that the competitive ratio of PQ is exactly 2−minx∈[1,m−1]{αx+1∑j=1x+1αj}. That is, we conduct a complete analysis of the performance of PQ using worst case analysis. Moreover, we show that no deterministic online algorithm can have a competitive ratio smaller than 1+α3+α2+αα4+4α3+3α2+4α+1.