83,285 research outputs found

    Preventing DDoS using Bloom Filter: A Survey

    Full text link
    Distributed Denial-of-Service (DDoS) is a menace for service provider and prominent issue in network security. Defeating or defending the DDoS is a prime challenge. DDoS make a service unavailable for a certain time. This phenomenon harms the service providers, and hence, loss of business revenue. Therefore, DDoS is a grand challenge to defeat. There are numerous mechanism to defend DDoS, however, this paper surveys the deployment of Bloom Filter in defending a DDoS attack. The Bloom Filter is a probabilistic data structure for membership query that returns either true or false. Bloom Filter uses tiny memory to store information of large data. Therefore, packet information is stored in Bloom Filter to defend and defeat DDoS. This paper presents a survey on DDoS defending technique using Bloom Filter.Comment: 9 pages, 1 figure. This article is accepted for publication in EAI Endorsed Transactions on Scalable Information System

    Fuzzy based load and energy aware multipath routing for mobile ad hoc networks

    Get PDF
    Routing is a challenging task in Mobile Ad hoc Networks (MANET) due to their dynamic topology and lack of central administration. As a consequence of un-predictable topology changes of such networks, routing protocols employed need to accurately capture the delay, load, available bandwidth and residual node energy at various locations of the network for effective energy and load balancing. This paper presents a fuzzy logic based scheme that ensures delay, load and energy aware routing to avoid congestion and minimise end-to-end delay in MANETs. In the proposed approach, forwarding delay, average load, available bandwidth and residual battery energy at a mobile node are given as inputs to a fuzzy inference engine to determine the traffic distribution possibility from that node based on the given fuzzy rules. Based on the output from the fuzzy system, traffic is distributed over fail-safe multiple routes to reduce the load at a congested node. Through simulation results, we show that our approach reduces end-to-end delay, packet drop and average energy consumption and increases packet delivery ratio for constant bit rate (CBR) traffic when compared with the popular Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol

    Sparse Signal Processing Concepts for Efficient 5G System Design

    Full text link
    As it becomes increasingly apparent that 4G will not be able to meet the emerging demands of future mobile communication systems, the question what could make up a 5G system, what are the crucial challenges and what are the key drivers is part of intensive, ongoing discussions. Partly due to the advent of compressive sensing, methods that can optimally exploit sparsity in signals have received tremendous attention in recent years. In this paper we will describe a variety of scenarios in which signal sparsity arises naturally in 5G wireless systems. Signal sparsity and the associated rich collection of tools and algorithms will thus be a viable source for innovation in 5G wireless system design. We will discribe applications of this sparse signal processing paradigm in MIMO random access, cloud radio access networks, compressive channel-source network coding, and embedded security. We will also emphasize important open problem that may arise in 5G system design, for which sparsity will potentially play a key role in their solution.Comment: 18 pages, 5 figures, accepted for publication in IEEE Acces

    Frequency Multiplexing for Quasi-Deterministic Heralded Single-Photon Sources

    Full text link
    Single-photon sources based on optical parametric processes have been used extensively for quantum information applications due to their flexibility, room-temperature operation and potential for photonic integration. However, the intrinsically probabilistic nature of these sources is a major limitation for realizing large-scale quantum networks. Active feedforward switching of photons from multiple probabilistic sources is a promising approach that can be used to build a deterministic source. However, previous implementations of this approach that utilize spatial and/or temporal multiplexing suffer from rapidly increasing switching losses when scaled to a large number of modes. Here, we break this limitation via frequency multiplexing in which the switching losses remain fixed irrespective of the number of modes. We use the third-order nonlinear process of Bragg scattering four-wave mixing as an efficient ultra-low noise frequency switch and demonstrate multiplexing of three frequency modes. We achieve a record generation rate of 4.6Ă—1044.6\times10^4 multiplexed photons per second with an ultra-low g2(0)g^{2}(0) = 0.07, indicating high single-photon purity. Our scalable, all-fiber multiplexing system has a total loss of just 1.3 dB independent of the number of multiplexed modes, such that the 4.8 dB enhancement from multiplexing three frequency modes markedly overcomes switching loss. Our approach offers a highly promising path to creating a deterministic photon source that can be integrated on a chip-based platform.Comment: 28 pages, 9 figures. Comments welcom

    On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks

    Get PDF
    Random linear network coding can be used in peer-to-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are particularly susceptible to Byzantine attacks. We quantify the impact of Byzantine attacks on the coded system by evaluating the probability that a receiver node fails to correctly recover a file. We show that even for a small probability of attack, the system fails with overwhelming probability. We then propose a novel signature scheme that allows packet-level Byzantine detection. This scheme allows one-hop containment of the contamination, and saves bandwidth by allowing nodes to detect and drop the contaminated packets. We compare the net cost of our signature scheme with various other Byzantine schemes, and show that when the probability of Byzantine attacks is high, our scheme is the most bandwidth efficient.Comment: 26 pages, 9 figures, Submitted to IEEE Journal on Selected Areas in Communications (JSAC) "Mission Critical Networking
    • …
    corecore