Practical Compact Routing on Sparse Graphs

We describe a simple and practical algorithm for compact routing on graphs which admit compact and balanced vertex separators. Using a recursive nested dissection of then-vertex graph based on these separators, we construct routing tables with as few as O(log n) entries per vertex in a preprocessing step. They support handshaking-based routing on the graph with moderate stretch, where the handshaking can be implemented similarly to a DNS lookup. We describe a basic version of the algorithm that requires modifiable headers and a more advanced version which eliminates this need and provides better stretch. A number of algorithmic parameters control a graceful tradeoff between the size of the routing tables and the stretch. Our routing algorithm is most effective on planar graphs and unit disk graphs of moderate edge/vertex density.

Practical Compact Routing on Sparse Graphs

We describe a simple and practical algorithm for compact routing on graphs which admit compact and balanced vertex separators. Using a recursive nested dissection of then-vertex graph based on these separators, we construct routing tables with as few as O(log n) entries per vertex in a preprocessing step. They support handshaking-based routing on the graph with moderate stretch, where the handshaking can be implemented similarly to a DNS lookup. We describe a basic version of the algorithm that requires modifiable headers and a more advanced version which eliminates this need and provides better stretch. A number of algorithmic parameters control a graceful tradeoff between the size of the routing tables and the stretch. Our routing algorithm is most effective on planar graphs and unit disk graphs of moderate edge/vertex density.

RESEARCH OF SDN NETWORK PERFORMANCE PARAMETERS USING MININET NETWORK EMULATOR

Background. The implementation of the new modern services on existing networks requires replacement or modernization of the old equipment. This negatively affects the efficiency of providing users with new types of services and their cost. Therefore, the issues/tasks of implementing SDN technology in the construction of networks are in the center of attention of representatives of science-research organizations and telecom operators. SDN networks have the advantages of flexible scaling of the system without replacing existing server and network equipment, eliminating operator dependence on specific vendor solutions, and rapid implementation of the new network technologies and services. To determine the numerical values of indicators of the functioning of SDN networks and check their compliance with the requirements, it is proposed to use in working process simulation modelling. For these goals, the Open Networking Foundation consortium developed the Mininet network emulator, the elements of that are published publicly. The formation of the simulation model and the procedure for determining the performance indicators of the SDN network that uses Mininet has a number of features that are considered in the work. Objective. The purpose of the article is to build a simulation model based on the Mininet network emulator and to determine the performance indicators of SDN networks of various structures/topologies. Methods. Creation of a SDN network segment for testing process of its functioning in the overload mode of various communication routes. Results. The Mininet network emulator allows simulating SDN networks of a rather complex structure, change the performance of network branches and the amount of load in communication routes, to create a network-wide overload mode. During the simulation, it is possible to determine a number of indicators of network performance, such as the RTT (Round Trip Time) parameter for each route of communication, the bandwidth of branches and routes of communication, the amount of delay on network elements, loading of OpenFlow Switch ports/interfaces, network elements with the highest delay, the number of served and lost packets. Conclusions. Use of the Mininet network emulator is a fairly convenient tool for determining the performance indicators of SDN networks. However, there are also some problems. First of all, setting up the system's operability requires writing programs to ensure the interaction among standard elements from the Mininet library. Secondone, is when congestion occurs in the communication routes, the Floodlight Controller does not automatically balance traffic along the work-around route. This task has to be solved manually by making changes to the OpenFlow Switch routing tables. Keywords: Software Defined Networking; SDN; Mininet; OpenFlow; Floodlight Controller; OpenFlowSwitch; NFV; virtualization.

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.

PredictRoute: A Network Path Prediction Toolkit

Accurate prediction of network paths between arbitrary hosts on the Internet is of vital importance for network operators, cloud providers, and academic researchers. We present PredictRoute, a system that predicts network paths between hosts on the Internet using historical knowledge of the data and control plane. In addition to feeding on freely available traceroutes and BGP routing tables, PredictRoute optimally explores network paths towards chosen BGP prefixes. PredictRoute's strategy for exploring network paths discovers 4X more autonomous system (AS) hops than other well-known strategies used in practice today. Using a corpus of traceroutes, PredictRoute trains probabilistic models of routing towards prefixes on the Internet to predict network paths and their likelihood. PredictRoute's AS-path predictions differ from the measured path by at most 1 hop, 75% of the time. We expose PredictRoute's path prediction capability via a REST API to facilitate its inclusion in other applications and studies. We additionally demonstrate the utility of PredictRoute in improving real-world applications for circumventing Internet censorship and preserving anonymity online.

IMPROVED ALGORITHM FOR THE PACKET ROUTING IN TELECOMMUNICATION NETWORKS

Packet routing efficiency is and will remain one of the major factors that have a major impact on a network performance and a quality of service. One of the most common routing protocols used in autonomous Internet systems is the Open Shortest Path First (OSPF) protocol. The OSPF protocol performs packet transmission using the shortest paths, calculated according to a certain, but only one criterion. Default criterion is channels bandwidth, but in general any criteria can be selected. The disadvantage here is that channels loading is not considered and thus packets are routed to a shortest but potentially overloaded path. In wider sense usage of single criteria may results in routing through paths suboptimal or even inappropriate by other criteria. The growth of the network traffic, and especially the increase of its multimedia component drives continuous improvement of routing methods in existing telecommunication networks. Network performance will benefit from more advanced routing methods, which would take into account several network characteristics, important for specific services quality. In given work a new algorithm of a gateway selection for the routing tables of autonomous Internet systems is proposed. The algorithm is based on the OSPF protocol but takes into account three criteria: channel bandwidth, the number of intermediate nodes in the path and the signal propagation delay. Weighting coefficient for each criteria is introduced. Besides that, the integral criterion is proposed based on optimal path weights for individual criteria and path weights found by two other criteria. The total relative deviation of the path weight from the path weights calculated according to individual criteria is used as the optimization criterion. The purpose of optimization is to minimize this deviation. Routing tables constructed using proposed algorithm ensure packets transmission through the optimal path, selected according to the integral criterion, taking into account the three criteria and their coefficients of importance. Further research may be conducted to expand the list of criteria used in the optimization process.

Adaptive Mobile Network With Amorphous Topology Node Controller Architecture

The purpose of the article is to develop an adaptive mobile network node architecture with an amorphous topology. The article describes the host controller architecture. The concept of a mobile network is described. The mobile network is adaptive, self-organizing, and able to operate autonomously. The presented mobile network node controller architecture is the object swarm control system basis. A stack of mobile network protocols is presented, consisting of a control protocol, a data exchange protocol and a configuration protocol. The nodes of the network controllers interaction is carried out using several transceivers. The use of multiple transceivers made it possible to distribute data traffic, configuration traffic, and management traffic over different channels, which made it possible to carry out information exchange at the same time. The protocol stack is minimized. The functionality of the host and the network object (swarm) is completely separated. The topology of the mobile network is not deterministic, amorphous and changes when the network objects move in space. In this case, some connections are lost and others arise. The routing tables are constantly updated. The network in accordance with the laid down algorithm, is able to build the necessary topology and organize the necessary connections in order to complete the task with a swarm of objects. The network is capable of building packet retransmission chains for remote network objects. Thus, the implementation of a mobile network at its low cost allows solving a certain range of problems. The performer can be either a separate object associated with the operator through a swarm of repeaters, or a swarm of objects. In order to increase the efficiency of the formation of routing tables and minimize the cluster structures in a mobile network, it is advisable to use optimization algorithms based on set theory. The mobile network is designed to control a swarm of objects, which can be UAVs, robotic objects and control systems for various technological processes.

STUDY METHODS FOR MONITORING OF TELECOMMUNICATION SYSTEMS

The article describes main steps for centralizing routing table databases. Advantages and disadvantages of databases formed at different levels of centralization are described. Main methods of forming routing tables are described. The advantages and disadvantages of each method are indicated. There are also examples of network protocols that are used to implement a particular method for generating databases about the network state. Possible hybrid methods are identified by combining standard methods for creating databases describing the network state. To ensure optimal operation of the telecommunications network, the optimal monitoring method should be selected based on the degree of centralization and the method for creating a database of routing tables. Depending on the scale of the network and the degree of centralization of its resources, it is needed to choose the best method for monitoring the network.

A Comparative Study of Range-Free and Range-Based Localization Protocols for Wireless Sensor Network

Wireless Sensor Network is deployed in many fields including military operations, mechanical applications, human services, smart homes, etc. However, deploying WSN encounters many challenges. One of the challenges is localizing the node position, especially mobile targets in critical situations. In this paper, the authors compare two types from range-free localization algorithms and one type from range-based algorithms, namely: Received Signal Strength (RSS), Centroid, and Distance Vector Hop (DV-Hops) protocols, using Cooja simulator. RSS localization algorithms require determining values of the RSS from the anchor nodes around the mobile node, to calculate the distance between the unknown mobile and the first three anchor nodes in the mobile range. The centroid localization requires only three anchors to compute the location of the mobile sensor without the need for distance measuring. Lastly, the DV-Hop algorithm uses routing tables of each anchor in the network topology to compute the Average Distance of Hops. The results show that rang-based algorithms are more accurate than range-free.