Ludo Hashing
0
Citation
10
Reference
10
Related Paper
Abstract:
Ludo Hashing is a key-value lookup design for networked and distributed systems such as packet forwarding and distributed storage. Ludo costs the least space (3.76 + 1.05l bits per key-value item for l -bit values) among known compact lookup solutions and supports fast lookups, fast updates, and concurrent writing/reading. The experimental results show that Ludo Hashing saves 40% to 80%+ memory cost compared to existing dynamic solutions. It costs only a few GB memory for 1 billion key-value items and achieves over 65 million queries per second on a single node with multiple threads.Keywords:
Value (mathematics)
Packet forwarding
A MANET is a infrastructure-less and auto configurable network of mobile nodes which are connected without wires. As per proposal of this paper, the communication in a MANET works on set of random keys called KEY 1 =X+KEY 0 , KEY 2 =X+KEY 1 , KEY 3 =X+KEY 2 ...KEY N =X+KEY N-1 to establish the connection between nodes and applies to validate the packets. Since there could be a issue of keys length, hence we can enforce the number of hops to be added for key generation after reaching threshold, then generation of keys starts from the beginning. Here all nodes in the network would generate a X-key and appends to the ongoing/flowing key. When a source node initiates communication towards a destination node, the source node will send a packet to a destination via a designated path. The target node and threshold node would be storing a expected key from all its neighbours, when a packet reaches to a target node or threshold node, key of packet and key of target node is compared, if a match is found, then accept the packet as valid one else discard it or deny the communication. This approach would be very helpful to deny the communication of malicious nodes in the MANET.
Cite
Citations (0)
The peer-to-peer network based on distributed hash table could locate the nodes effectively, but it cannot solve the node-failure problem. By introducing the concept of trust into anonymous communication system, this paper proposes a secure query method, in which, the nodes' trust and the mutual distance between the nodes can be used to select high reliable nodes to construct anonymous communication path. The novel method could alleviate the node-failure problem, and further to improve the message forwarding efficiency.
Distributed hash table
Cite
Citations (0)
In this paper we investigate the DoS attack detection and mitigation problem in wireless networks. The DoS attacks are difficult to mitigate because the legitimate nodes can also generate large amount of packets in a short time. The difficulty in differentiating between the malicious nodes and the legitimate nodes always prevents the DoS detection and mitigation schemes from achieving satisfactory performance. We propose a new scheme for DoS mitigation, which requires a node to undertake packet forwarding responsibility if it sends large amount of packets through other nodes. The responsibility is proportionate to the amount of packets the network delivers for the node. By placing this requirement, we are able to differentiate the normal nodes from the malicious nodes, since a normal node is willing to undertake its responsibility while a malicious node would not. However, if a malicious node drops the packets that are supposed to be forwarded, its neighbors are able to detect it and then isolate the malicious node. As the result, a malicious node will have to either pay for its attack by helping forward other nodes' packets or drop the packets and then be isolated.
Cite
Citations (5)
The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.
Prefix
IP forwarding
Trie
Loose Source Routing
Packet forwarding
Lookup table
Cite
Citations (0)
In mobile network, nodes are normally placed in some locations after travelling with various speeds to another location. Packets were broadcast to some location receiver node, but they are moved to another location, due to that node is not able to receive those packets. Attacker node present in routing path should accept those packets, and it acts as original node. Communication privacy is reduced for mobile network. It improves the communication overhead and end to end delay. So, the proposed Enhanced Packet Acceptance for Target Position Alteration (EPATP) technique exactly monitors the target node position, depending on the position to assign the relay node for packet forwarding from sender to target node. Multiaccepter Assigning Algorithm is designed, and if any target node should not receive those packets, it provides another chance for packet receiving by next target node, and it assigns multiple target node for accuracte communication. It reduces communication overhead and end to end delay.
Packet forwarding
End-to-end delay
Cite
Citations (2)
Delay/Disruption Tolerant Networks (DTNs) are a special category of IntermittentlyConnectedNetworks (ICNs). It has features such as long-delay, frequent-disruption, asymmetrical-data-rates, and high-bundle-error-rates. DTNs have been mainly developed for planet-to-planet networks, commonly known as Inter-Planetary-Networks (IPNs). However, DTNs have shown undimmed potency in challenged communication networks, such as DakNet, ZebraNet, KioskNet and WiderNet. Due to unique characteristics (Intermittent-connectivity and long-delay) DTNs face tough/several challenges in various research areas i.e bundle-forwarding, key-distribution, privacy, bundle-fragmentation, and malicious/selfish nodes particularly. Malicious/selfish nodes launch various catastrophic attacks, this includes, fake packet attacks, selective packet drops attacks, and denial-of-service/flood attacks. These attacks inevitably consume limited resources (persistent-buffer and bandwidth) in DTNs. Fake-packet and selective-packet-drops attacks are top among the challenging attacks in ICNs. The focus of this article is on critical analyses of fake-packet and selective-packet-drops attacks. The panoramic view on misbehavior nodes mitigation algorithms are analyzed, and evaluated mathematically through several parameters for detection probability/accuracy. This article presents a novel algorithm to detects/mitigates fake-packet and selective-packet-drops attacks. The proposed algorithm uses Merkle-Hash-Tree to detects the aforementioned attacks. The proposed algorithm added root hash along with all packets, when the malicious nodes drop packets or inject fake packets, the algorithm detects malicious nodes. Moreover, trace-driven simulation results show the proposed algorithm of this article accurately (enhanced detection-accuracy, enhanced packet delivery/packet loss ratios, and reduces false-positive/false-negative rates) detects malicious nodes which launch fake-packet and selective-packet-drops attacks, unlike previously proposed algorithms which detect only one attack (fake-packet or packet-drops at a time) or detect only malicious path (do not exactly detect malicious nodes which launch attacks). Furthermore, this article mathematically analyzed various scenarios to track exactly/position of various vehicular nodes.
Packet forwarding
Packet drop attack
IP traceback
Cite
Citations (8)
Several transmission methods are available to improve the network capacity in MANET. Most of the existing works on wireless networks are point–point, Cooperative transmission. In the existing Cooperative transmission, the source node sends packets to destination node through cooperative node but soon after the source node loses its whole energy and stops transmitting the packets. So, now we are introducing the new transmission technique which overcomes the above mentioned problem. In this technique, we are converting the cooperative node as selfish node. The selfish node stops forwarding the received packets to the destination and find another path to reach destination directly. With this method the capacity of network is increased when compared to Cooperative Communication.
Packet forwarding
Cooperative Diversity
Cite
Citations (1)
Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suitable for fast operations. Therefore, perfect hash functions have been introduced to make the hashing mechanism more efficient. In particular, a minimal perfect hash function is a function that maps a set of n keys into a set of n integer numbers without collisions. In literature, there are many schemes to construct a minimal perfect hash function, either based on mathematical properties of polynomials or on graph theory. This paper proposes a new scheme which shows remarkable results in terms of space consumption and processing speed. It is based on an alternative to Bloom Filters and requires about 4 bits per key and 12.8 seconds to construct a MPHF with 3.8times10 9 elements.
Dynamic perfect hashing
Bloom filter
Universal hashing
Cite
Citations (6)
As an extension of NSMP (neighbor supporting multicast protocol), PatchPSMP not only inherits the advantages of NSMP [Seungjoon Lee et al., 2000] and PatchODMRP [Meejeong Lee et al., 2001], but also has its own characters. Therefore, PatchPSMP has the following characters: (1)its route setting up and evaluation policy is same as that of NSMP; (2)its local recovery method is same as that of PatchODMRP; (3)it defines the unforwarding neighbor of forwarding nodes as pool nodes to collect the route information from its received data packets to reduce its local route recovery scope further. When a forwarding node finds a link failure between it and one of its upstream nodes, it floods out an ADVT packet. A pool node can answer its received ADVT packet when it connects to the wanted sources defined in the ADVT packet. By the simulation, we compare the performance of these protocols. PatchPSMP outperforms the others.
Packet forwarding
Cite
Citations (2)
Nodes in mobile ad hoc networks often need the help of others in order to have their packets delivered to their destination. However, nodes may not be governed by a single authority and need not share a common goal. Thus, a selfish node may prefer to save resources for its own communication, rather than to forward packets for other nodes. We suggest to collect information about the forwarding of packets in the network in a decentralized manner. Through reception of acknowledgments, a node can update a local repository, on which the node can rely to judge the behavior of the other nodes. We define a secure structure for the acknowledgments and the rules for updating the local repository. Also, we discuss a solution to achieve a univocal identification of a node in MANET environments.
Packet forwarding
Cite
Citations (3)