-
Notifications
You must be signed in to change notification settings - Fork 2
/
README
56 lines (38 loc) · 2.1 KB
/
README
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
MP1 README
-------------------------------------------------------------------------------
AUTHORS
-------------------------------------------------------------------------------
Gossip protocol implementation by Aditya Rastogi (arastog2@illinois.edu) (MP1Node.h/.c)
Template code, testcases and infrastructure code implementation provided by intructors
of the Fall 2014 CS 425 course at University of Illinois Urbana-Champaign
-------------------------------------------------------------------------------
FILES
-------------------------------------------------------------------------------
* mp2_node.h - header file for mp2_node.c
* mp2_node.c - contains all the functionality for a member.
* emulnet.h - header file for emulnet.c
* emulnet.c - contains all the operations for the network layer.
* params.h - header file for params.c
* params.c - initialization of all required parameters.
* app.h - header file for app.c
* app.c - source file for the Application layer.
-------------------------------------------------------------------------------
COMPILATION
-------------------------------------------------------------------------------
To compile the code do:
make
-------------------------------------------------------------------------------
RUNNING THE CODE
-------------------------------------------------------------------------------
To execute the program, from the program directory do:
./app testcase\<conf-file>
-------------------------------------------------------------------------------
IMPLEMENTATION DETAILS
-------------------------------------------------------------------------------
* Join Mechanism
The introducer is the node that has the address JOINADDR. Every other node will
have a different address. It is assumed that the introducer won't fail, as there
is no way to replace it in the current implementation. However, the functionality
implemented by this node can also be carried out by any other node. When the
introducer receives a JOINREQ message, it will reply with a JOINREP message that
contains a list of neighbors for the new node in the system.