Implement XOR Based Encoding Algorithm in Preferred Path Routing through Mininet Network Emulator

Preferred Path Routing is a Source Routing Technique in which the path to be followed by a data packet in a network is encoded as a path ID and all such paths are advertised from a particular source to a particular destination. We want to explore two scenarios, in the first one, a path is being randomly encoded and in the second one the path is being encoded using XOR based source routing technique(further details are enclosed in the files attached). The problems faced in Preferred Path Routing is the number of paths from a source to a destination is a non deterministic polynomial, and hence forwarding table becomes too large. To overcome this problem, XOR based encoding is used to create a path label. In the process of creation of a path label, for each node, the interface label is created by XORing the input interface ID with the output interface ID, such that one can be retrieved by XORing the other two when required. All the interface labels are concatenated to get a global interface label and a linear transformation is applied to create the global path label. In the forwarding process the reverse changes are applied to retrieve the interface label of the particular node in which the data packet is present. The input interface through which the data packet has entered needs to be XORed with the interface label to get the output interface and thus forwarding is done. Our job is to implement traditional Preferred Path Routing and XOR based Encoding in Preferred Path Routing in Mininet Emulator(you can use other emulators like ONOS or Quagga in conjuction with Mininet), and compare the parameters in the two scenarios like Forwarding Table Size, Forwarding Delay, Complexity of Path Label Encoding and Advertisement, Storage Amount in Routers etc. by plotting them in the same graph on y axis and number of nodes on x axis. The two kinds of methodologies and a literature review report of the same is attached below.