IMPLEMENTATION

Implementation is the stage of the project when the theoretical

design is turned out into a working system. Thus it can be considered to
be the most critical stage in achieving a successful new system and in
giving the user, confidence that the new system will work and be
effective.
The implementation stage involves careful planning, investigation
of the existing system and its constraints on implementation, designing
of methods to achieve changeover and evaluation of changeover methods.

3.1. Module Description

Modules:
1. Networking Module.
2. Data forwarding module.
3. Link failure module.
4. Biased Rand-walk module.

Module Description:

1. Networking Module.
Client-server computing or networking is a distributed application
architecture that partitions tasks or workloads between service
1

providers (servers) and service requesters, called clients. Often clients

and servers operate over a computer network on separate hardware. A
server machine is a high-performance host that is running one or more
server programs which share its resources with clients. A client also
shares any of its resources; Clients therefore initiate communication
sessions with servers which await (listen to) incoming requests.

2. Data forwarding module.

The bias is embedded in the next hops selection logic in the form of an
effective distributed algorithm, which also encompasses look ahead. The
protocol can be adapted to multitarget search straightforwardly. We will
first present how the biasing information is achievedboth for single
target and multitarget searches. Then, we present the forwarding protocol,
which implements the steps of the random walk.

3. Link failure module.

An unstructured search has to potentially explore the whole network; as
such, it is generally carried out by flooding. Alternatively, random walks
can be used. Compared to flooding, a random walk search has a more

fine-grained control of the search space, a higher adaptive-ness to

termination conditions, and can naturally cope with failures or voluntary
disconnections of nodes.

4. Biased Rand-walk module.

Biased random walks are random walks in which nodes have statistical
preference to forward the walker toward the target. The clear advantage
of a biased random walk is that it reduces the excepted number of steps
before the target is reached, called the hitting time, significatively.
However, the bias level achievable in a real setting is limited, while the
implementation of any biasing mechanism comes at some additional cost.
Thus, to understand the effect of bias on the hitting time is an important
preliminary step for deciding the practical benefit of a random walkbased search algorithm.