Forwarding Table Entries in Software Defined Networks: Representation and Uses in Network Engineering

<p>Software Defined Networking (SDN) is an emerging architecture that decouples the network control and forwarding functions. In SDN, the functionality of static configuration and routing table in a traditional network has been replaced by forwarding table entries (FTEs). Thus a systematic research on FTE to better monitor traffic and manage networking resources becomes crucial in SDN. There are already some initial works on FTE representation from mathematical/logical perspective. However, they usually concentrate on the abstraction and expression of FTE rather than the applications in real network. Based on existing research, a controller is unable to monitor networking traffic and manage networking resources from a network-wide perspective. To address these challenges, Boolean algebra is chosen and extended in this thesis to examine the relations and manipulations among FTEs together with traffic statistics. Specifically, three SDN applications: i) equivalence evaluation during FTE deployment, ii) non-invasive traffic estimation and iii) anomaly detection, have been proposed and verified with the help of Boolean algebra. All of these applications rely on the mining of the FTEs and their associated statistics, thus no overhead will be introduced to the switch's original packet forwarding functionalities. They can be easily deployed in production networks due to the non-invasive strategy as well as the feasibility and flexibility in real networking scenarios.</p>

Forwarding Table Entries in Software Defined Networks: Representation and Uses in Network Engineering

<p>Software Defined Networking (SDN) is an emerging architecture that decouples the network control and forwarding functions. In SDN, the functionality of static configuration and routing table in a traditional network has been replaced by forwarding table entries (FTEs). Thus a systematic research on FTE to better monitor traffic and manage networking resources becomes crucial in SDN. There are already some initial works on FTE representation from mathematical/logical perspective. However, they usually concentrate on the abstraction and expression of FTE rather than the applications in real network. Based on existing research, a controller is unable to monitor networking traffic and manage networking resources from a network-wide perspective. To address these challenges, Boolean algebra is chosen and extended in this thesis to examine the relations and manipulations among FTEs together with traffic statistics. Specifically, three SDN applications: i) equivalence evaluation during FTE deployment, ii) non-invasive traffic estimation and iii) anomaly detection, have been proposed and verified with the help of Boolean algebra. All of these applications rely on the mining of the FTEs and their associated statistics, thus no overhead will be introduced to the switch's original packet forwarding functionalities. They can be easily deployed in production networks due to the non-invasive strategy as well as the feasibility and flexibility in real networking scenarios.</p>

IMPLEMENTATION OF DYNAMIC ROUTING WITH OSPF (OPEN SHORTEST PATH FIRST) TECHNIQUE IN LOCAL AREA NETWORK (LAN) AT SMKN 2 TELUK KUANTAN

SMKN 2 Teluk Kuantan has 4 (four) main lines of internet network. Of the four networks have their own configuration. Static routing applied in SMKN 2 Teluk kuantan for the four modems of the network has their own area, because it is not under one control of the modem to the Router. Static Routing in SMKN 2 Teluk Kuantan is very possible to be damaged or trouble itself on the network of each modem. Static routing problems are so complex in the form of routing information into the routing table that is set manually by the network administrator. Dynamic Routing is very possible to be implemented in SMKN 2 Teluk Kuantan. where dynamic routing has a basic routing algorithm of dynamic routing. Dynamic Routing enters routing information into the routing table through exchanging information with other routers and creates routing tables dynamically, on dynamic routing network administrators will not enter the entry route manually into the routing table. Routing Open Short Path First (OSPF) is a type of routing protocol that builds topology independently by choosing the best path then iji network quality if the best path is in interference and perform Quality of Service (QoS) against realtime data.

Routing simulation of brain network topology.

The incessant search to understand human cognitive functions has led to the hypothesis that the brain works similar to a packet switched network such as the Internet [28]. In this thesis, I have developed a top-down simulator of brain-like networks which uses prob- ability routing to route data and a distance vector routing algorithm [21] to propagate feedback to varying depths. I investigate the impact of the feedback depth on routing table metrics. The results indicate that important performance metrics are affected by the feedback depth of the routing algorithm but also, to a large extent, by the topological features of such networks [17, 44]. The results indicate feedback depths from 25 to 30 fill the routing table most efficiently in terms of routing table fill percentage, routing table fill time and packet rejection ratio. There is also a strong correlation between the macaque monkey brain and sparse topologies.

Routing simulation of brain network topology.

The incessant search to understand human cognitive functions has led to the hypothesis that the brain works similar to a packet switched network such as the Internet [28]. In this thesis, I have developed a top-down simulator of brain-like networks which uses prob- ability routing to route data and a distance vector routing algorithm [21] to propagate feedback to varying depths. I investigate the impact of the feedback depth on routing table metrics. The results indicate that important performance metrics are affected by the feedback depth of the routing algorithm but also, to a large extent, by the topological features of such networks [17, 44]. The results indicate feedback depths from 25 to 30 fill the routing table most efficiently in terms of routing table fill percentage, routing table fill time and packet rejection ratio. There is also a strong correlation between the macaque monkey brain and sparse topologies.

Heterogeneous field network for power distribution grid based on HPLC and RF adaptive communications technology

In order to improve the connection rate and transmission efficiency of field network for power distribution grid, a dual-mode heterogeneous field network with high-speed power line broadband carrier and micro-power radio frequency wireless communication capabilities was designed. First, the topological structure of the field network, the networking process of the central node and the free nodes and the dynamic maintenance mechanism of the network were discussed in detail. Secondly, the routing measurement mechanism for creating a hybrid routing table and the improved layer limit shortest path routing algorithm were presented. On this basis, each node in the network could choose the optimal communication media at any given moment to create communication links with the adaptive data transfer speed according to the real-time hybrid routing table. Finally, the dual-mode heterogeneous field network was applied to the electricity consumption information collection system and tested in the laboratory and jobsite. The test results show that the dual-mode field network was more effective than the single-mode field network in shortening the reading meter time and increasing networking success rate.

Source Fabrication Detection Model based on Key-value Variables in Reactive Protocols of VANET

The vehicular communication hasbeen considered as the most promising wirelesscommunication technology in the computernetwork scenario, the beginning of which hasmarked a great change for the passengers in therange of safety application. The development ofvehicular communication increased securitythreats and weaknesses. Vehicularcommunication is exposed to severalvulnerabilities such as Denial of Service attacks(DoS), Black hole and fabrication attacks.Fabrication attack consists of a malicious nodethat modifies information in the packet causingcritical damage in the network like congestionand high delay. In this paper, we propose a novelfabrication model which consists of twoalgorithms one for source attack and another foranti-source attack. In such attack, the maliciousnode fabricates the source address of the routerequest message; this means that the maliciousnode selects randomly from the routing table asource address that is different from the inputsource address and the source address of thecurrent node and forwards the message to itsneighbors. In the anti-attack, our novel proposedalgorithm has the role to identify the sourceattack during the communication. We create twovariables at each node in order to check if theinput source address in RREQ is equal to theoutput source address in RREQ; otherwise, thenode is identified as a malicious node and anurgent message is broadcasted to all nodes toremove it from their routing table. The proposedalgorithm targets to minimize the delay ofpackets. Our simulation is done using SUMO0.22 simulator, NS-2.35 and awk scripts; thesimulation was applied on Hamra area (Beirut,Lebanon). The results show good improvementsin terms of packet delivery ratio and the end toend delay.