Adaptive Probabilistic Flooding for Multipath Routing

In this work, we develop a distributed source routing algorithm for topology discovery suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play control plane, able to find multiple paths toward the same destination, and introduce a novel algorithm, called adaptive probabilistic flooding, to achieve this goal. By keeping a small amount of state in routers taking part in the discovery process, our technique significantly limits the amount of control messages exchanged with flooding -- and, at the same time, it only minimally affects the quality of the discovered multiple path with respect to the optimal solution. Simple analytical bounds, confirmed by results gathered with extensive simulation on four realistic topologies, show our approach to be of high practical interest.Comment: 6 pages, 6 figure

Detection and Optimization of SYBIL Attack by using Received Signal Strength in mobile Ad-HOC Networks (MANET�S)

In this research paper, we address the Sybil attack in MANET. Most often the traditional measures against Sybil attack are not applicable in a MANET due to the differences in aims and architectures. The nodes in MANETs are mobile and limited in resources such as battery, bandwidth etc. Due to frequently changing topology it becomes expensive and impractical to authenticate communication and keep track of devices with a centralized server in such network. We proposed a framework which uses nodes attributes in order to judge their behavior. As Sybil nodes consumes data packet by providing wrong routing information repeatedly, we focus on the distinction of the node parameter value of Sybil node and legitimate node. This distinction is made on the basis of nodes attributes and by assigning fuzzy membership values to each node. For this we use fuzzy inference rule and Bezier curve as a tool. Here suspect any node means is to identify those nodes also whose behavior lie in between legitimate and Sybil nodes. In contrast to the traditional crisp logic in which a node can be either Sybil or legitimate fuzzy inference based model focus on the possibility of a node being Sybil. Later we verify their RSP values by drawing a Bezier curve at two different instant of time to identify the Sybil character

A Markovian Approach to Multipath Data Transfer in Overlay Networks

n/

Service introduction in an active network

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 1999.Includes bibliographical references (p. 151-157).by David J. Wetherall.Ph.D

An Efficient Multipath Forwarding Method

We motivate and formally define dynamic multipath routing and present the problem of packet forwarding in the multipath routing context. We demonstrate that for multipath sets that are suffix matched, forwarding can be efficiently implemented with (1) a per packet overhead of a small, fixed-length path identifier, and (2) router space overhead linear in K, the number of alternate paths between a source and a destination. We derive multipath forwarding schemes for suffix matched path sets computed by both de-centralized (link-state) and distributed (distance-vector) routing algorithms. We also prove that (1) distributed multipath routing algorithms compute suffix matched multipath sets, and (2) for the criterion of ranked k-shortest paths, de-centralized routing algorithms also yield suffix matched multipath sets