Routing Configuration Research Articles

Investigation of the possibility of building a Software-defined Wide Area Network SD-WAN based on Aruba equipment

SD-WAN allows to centralize management of a distributed network infrastructure, as the entire network is provided by a controller that is located in the head office or in the cloud and supports the operation of branches (SD-Branch). SD-WAN is a technological transition to solutions that are more flexible, open and integrated with the cloud. SD-WAN solutions must provide a secure, service-provider-independent network with enterprise-class performance over a variety of WAN technologies. Building a software-defined WAN with Aruba hardware requires research to select the elements and ensure key characteristics are met. The SD-WAN controller can be Aruba Central, a powerful cloud solution for managing networks, switches, and branch controllers that includes built-in analytics tools that provide network and business process data for important decisions. The SD-WAN controller maintains connections to all SD-WAN Edge and SD-WAN Gateways to determine the operating status of SD-WAN paths over different WANs and restores quality of performance for each SD-WAN path. Aruba 9000, 7200, 7000 series mobility controllers and gateways can act as gateways for head offices and branches and support automatic configuration of IPsec tunnels and configuration of dynamic routing of head offices and branches. o build a branch network requires equipment, namely the appropriate set of access level switches and access points that Aruba has. The Aruba SD-Branch solution provides network access for employees, wireless Internet access for guests, and connectivity for IoT devices.

A Novel Genetic Algorithm-Based Methodology for Large-Scale Fixed Charge Plus Routing Network Design Problem With Efficient Operators

In this paper, we present a novel approach that addresses the problem of large-scale network topology design and routing. There are research works that used exact methodologies based on Integer Linear Programming (ILP) models to develop potential solutions for this problem. However, this problem is computationally NP-hard, thus solving it is hugely demanding on computational power for large-scale networks, and in many cases, it is not even possible to generate a solution with a reasonable optimality gap. This paper presents a hybrid algorithm based on the Genetic Algorithm with efficiently designed genetic operators. This algorithm aims to design the topology of large-scale networks and generate a routing configuration for a set of predefined traffic demands on the networks while keeping the total cost of design and routing at a minimum. The results have been compared to an exact ILP model, a relaxed ILP model, and a customized GA as benchmarks for validation purposes. These comparisons showed that the proposed algorithm significantly outperforms the ILP solutions in all of the large-scale network configurations that were used as case studies.

DEMILITARIZED ZONE AND PORT KNOCKING METHODS FOR COMPUTER NETWORK SECURITY

Currently, the way of network communication has changed a lot. All aspects become very dependent on online services. Employees can work from home, and students of all ages take online classes. The more the public depends on staying connected to the network, the greater potential network attacks to occur. In a computer network, if it is not protected, it will data or file loss, damage to the server system, not being optimal in serving users or even losing valuable institutional assets. The attacks most often used in networks are Port Scanning and DDoS (Distributed Denial Of Service). In this study, the DeMilitarized Zone and Port Knocking methods are combined to secure computer networks. DeMilitarized Zone technique implementation is used to access local servers, so that they can be accessed from outside with Port Knocking technique. To open the access port that is filtered in the router configuration on the server network security system. DeMilitarized Zone and Port Knocking can be implemented on local and long distance networks where if an attacker wants to exploit or attack the main server, the first to be attacked is the firewall server (router). Port Knocking can also be implemented on local and long distance networks with a combined ping request time limit which makes it safer, so that if an attacker wants to access the router, and doesn't know the rules from the remote, what happens is a rejection of port access.

IMPLEMENTASI VIRTUAL PRIVATE NETWORK (VPN) DI PERPUSTAKAAN UNIVERSITAS ISLAM MALANG

This study aims to explain to use a VPN in the UNISMA Library. The research method used is descriptive-qualitative and data was obtained through interviews with five informants, observation, and documentation. Data analysis techniques by collecting data, data reduction, data presentation and drawing conclusions. While the validity of the data was obtained through triangulation. The results showed that the use of VPN in the UNISMA Library to speed up internet connection and data privacy. UNISMA library uses a proxy server router operating system for VPN networks. To be able to make Mikrotik a VPN server, configuration is required which includes IP pool configuration, IP router configuration, PPP configuration, DHCP server configuration, NAT by pass firewall configuration and IP security configuration. The library selection of VPN products considers the aspects of strong authentication, encryption that is strong enough, meets standards, integration with other field network services.

An efficient approach to optimization of semi‐stable routing in multicommodity flow networks

AbstractIdeally, the network should be dynamically reconfigured as traffic evolves. Yet, even within the software defined network paradigm, network reconfigurations cannot be too frequent due to a number of reasons related to route consistency, forwarding rules instantiation, individual flows dynamics, traffic monitoring overhead, and so on. In this paper, we focus on the fundamental issue of deciding whether, when, and how to reconfigure the network while traffic evolves. We consider a problem of optimizing semi‐stable routing in the capacitated multicommodity flow network when one may use at most a given maximum number of routing configurations (called routing clusters) and when each routing configuration must be used for at least a given minimum amount of time. We propose an efficient solution approach based on routing cluster generation that provides a tight lower bound on the minimum of a selected objective function (like maximum link delay or a sum of link delays) and suboptimal solutions very close to the calculated bound. The approach scales well with the size of the network.

Patient-Specific Hemodynamics of New Coronary Artery Bypass Configurations.

This study aims to quantify the patient-specific hemodynamics of complex conduit routing configurations of coronary artery bypass grafting (CABG) operation which are specifically suitable for off-pump surgeries. Coronary perfusion efficacy and local hemodynamics of multiple left internal mammary artery (LIMA) with sequential and end-to-side anastomosis are investigated. Using a full anatomical model comprised of aortic arch and coronary artery branches the optimum perfusion configuration in multi-vessel coronary artery stenosis is desired. Two clinically relevant CABG configurations are created using a virtual surgical planning tool where for each configuration set, the stenosis level, anastomosis distance and angle were varied. A non-Newtonian computational fluid dynamics solver in OpenFOAM incorporated with resistance boundary conditions representing the coronary perfusion physiology was developed. The numerical accuracy is verified and results agreed well with a validated commercial cardiovascular flow solver and experiments. For segmental performance analysis, new coronary perfusion indices to quantify deviation from the healthy scenario were introduced. The first simulation configuration set;-a CABG targeting two stenos sites on the left anterior descending artery (LAD), the LIMA graft was capable of 31 mL/min blood supply for all the parametric cases and uphold the healthy LAD perfusion in agreement with the clinical experience. In the second end-to-side anastomosed graft configuration set;-the radial artery graft anastomosed to LIMA, a maximum of 64 mL/min flow rate in LIMA was observed. However, except LAD, the obtuse marginal (OM) and second marginal artery (m2) suffered poor perfusion. In the first set, average wall shear stress (WSS) were in the range of 4 to 35 dyns/cm2 for in LAD. Nevertheless, for second configuration sets the WSS values were higher as the LIMA could not supply enough blood to OM and m2. The virtual surgical configurations have the potential to improve the quality of operation by providing quantitative surgical insight. The degree of stenosis is a critical factor in terms of coronary perfusion and WSS. The sequential anastomosis can be done safely if the anastomosis angle is less than 90 degrees regardless of degree of stenosis. The smaller proposed perfusion index value, O(0.04-0) × 102, enable us to quantify the post-op hemodynamic performance by comparing with the ideal healthy physiological flow.

Energy-Efficient Dual-Hop Internet of Things Communications Network With Delay-Outage Constraints

This article considers a dual-hop Internet of Things communications network where sensor nodes transmit data to a gateway either directly or via other nodes using dual-hop communications. Each node employs separate transmission buffers to store its own sensing data and data received from other nodes. End-to-end delay quality-of-service constraints in terms of the maximum acceptable delay-outage probabilities are imposed. We investigate energy-efficient adaptive resource allocation problems (i.e., joint link scheduling, rate, and power allocation) to support minimum data rates of the nodes. A novel approach is proposed exploiting asymptotic delay analysis to first determine the achieved delay exponents of the queue length tail distributions to satisfy the delay-outage constraints. Next, the relation between the delay exponents and resource allocation variables are derived. Last, the solutions to the resulting constrained optimization problems are obtained using the Lagrangian approach and convex optimization. Illustrative examples demonstrate the effects of the rate requirements and delay constraint stringency on the power consumption and routing configuration.

GPS-telemetry unveils the regular high-elevation crossing of the Himalayas by a migratory raptor: implications for definition of a \u201cCentral Asian Flyway\u201d

Remote technologies are producing leapfrog advances in identifying the routes and connectivity of migratory species, which are still unknown for hundreds of taxa, especially Asian ones. Here, we used GPS-telemetry to uncover the migration routes and breeding areas of the massive population of migratory Black-eared kites wintering around the megacity of Delhi-India, which hosts the largest raptor concentration of the world. Kites migrated for 3300–4800 km along a narrow corridor, crossing the Himalayas at extremely high elevations (up to > 6500 m a.s.l.) by the K2 of the Karakoram Range and travelled long periods at elevations above 3500 m. They then crossed/circumvented the Taklamakan Desert and Tian Shan Range to reach their unknown breeding quarters at the intersection between Kazakhstan, Russia, China and Mongolia. Route configuration seemed to be shaped by dominant wind support and barrier avoidance. Wintering ranges were smaller than breeding ranges and concentrated around Delhi, likely in response to massive human food-subsidies. Our results illustrate that high-elevation crossings by soaring migrants may be more common than previously appreciated and suggest the delineation of a hitherto poorly-appreciated “Central Asian Flyway”, which must funnel hundreds of thousands of migrants from central Asia into the Indian subcontinent via multiple modes of the Himalayan crossing.

Black Hole Attack Prevention in Mobile Ad-hoc Network (MANET) using Ant Colony Optimization Technique

The Mobile ad-hoc networks are auto configured systems where hubs can travel towards any direction. It doesn’t rely on any other frame to build the framework. Because of its versatility, the black hole is a real security issue to be settled. It occurs once a malignant hub referred to as black hole goes into the framework. Black hole center point exhibits its fake lead among the methodology after all disclosure. Currently, varied strategies are made arrangements for Mobile ad-hoc networks. Regardless, at interims seeing Black hole or fake hubs, the entire Mobile ad-hoc frameworks are exposed to various sorts of assaults or network attacks. Among these issues, a black hole center points plugs itself of getting a most nearest targeted hub, whose data packet must be constrained to drop. In this flooding procedures, if the communication from the genuine hub accomplishes later than the fake hub reply as requested by the standard hub. A false communication path is framed through a fake center hub. A perfect method is one in which the package reach to target with less delay and lesser overhead. In this paper we'll talk about the implementation of Ant Colony Optimization Technique and Repetitive Route Configuration with Reactive Routing Protocol for obstruction of black hole Attack in Mobile ad-hoc networks.

Route Configuration Method for Highway Passenger Hubs from the Perspective of Transportation Integration: A Case Study of Nanjing, China

As a result of transportation integration, the role of highway passenger transport hubs has changed dramatically; these nodes act as important links to construct a seamless regional comprehensive passenger transport system which reflects the coordination and symmetry of public transportation and the integrated transportation system. In order to optimise the efficiency of transportation organisation and improve the quality of passenger transport services, in this study we developed an optimisation method for the allocation of passenger transport hubs based on the analysis of passenger flow demand and spatial distribution. Configuration models of the departure sites of single-station and multi-station hub lines were established according to the service scope of the stations and the relative generalised travel cost, respectively. The overall optimisation method of the route allocation scheme was proposed by checking and optimising the passenger volume of each station. The developed methodology was successfully validated by applying it to the highway passenger transport hub system of Nanjing, China. The proposed methodology is expected to help management agencies and business operators to optimise existing highway passenger bus lines, thereby improving the quality of their services.

DISASTER RECOVERY PLAN JARINGAN DENGAN SISTEM BACKUP OTOMATIS MIKROTIK MENGGUNAKAN METODE FILE TRANSFER PROTOCOL (FTP) PADA JARINGAN WAN PT. INDOTRANS DATA

Abstract— The need for communication today is very important along with advances in data communication technology found on the internet network, the router as a device that should be able to serve the availability of 24-hour internet network without stopping will have a big impact if a router device experiences damage that can not be predicted, Disaster Recovery Plan is an effort to prevent the risk of attack, or due to the occurrence of disasters, especially to ensure business processes and implementation can continue in an emergency. PT Indotrans Data, an ISP provider company that uses a proxy router device to smoothly exchange communications and data on the internet network, but in backing up the proxy router configuration is still done manually and backup files are stored on internal storage or disks on the proxy router, the system is very ineffective because the backup configuration is not scheduled and the backup file will be lost when the proxy router is damaged, error or reset. A system is needed to implement fast and effective anticipation or handling of network problems on the proxy router and keep backup files or documentation stored properly and safely. Mikrotik configuration automatic backup system with File Transfer Protocol (FTP) method is very precise and effective, because in the backup configuration on the proxy router automatically and scheduled, then the backup file is sent to the Linux server by FTP method automatically every day. Features used in backing up automatic and scheduled Mikrotik configurations using the script tool and proxy scheduler. The Linux server uses the Linux centos operating system and retrieves backup files from the proxy router to the Linux server using the FTP method. Key : Backup , Disaster, FTP, Mikrotik, Router

Model and exact solution for a two-echelon inventory routing problem

The classic version of the Inventory Routing Problem considers a system with one supplier that manages the inventory level of a set of customers. The supplier defines when and how much products to supply and how to combine customers in routes while minimising storage and transportation costs. We present a new version of this problem that considers a two-echelon system with indirect deliveries and routing decisions at both levels. In this variant, the products are delivered to customers through distribution centres to meet demands with a minimum total cost. We propose a mathematical formulation and a branch-and-cut algorithm combined with a two-step matheuristic to solve the proposed problem for different inventory policies and routing configurations. Intrinsic new valid inequalities to the two-echelon system are introduced. We analyse the efficiency of the new valid inequalities as well as the already known valid inequalities from the literature. Computational experiments are presented for a new set of benchmark instances. The results show that, for the simplest inventory policy, the proposed method is able to solve small and some medium-scale instances to the proven optimality and find feasible solutions for all instances.

Empirical Performance Analysis of Bus Speed and Delay at Intersections for Emerging Spot Improvement Programs

Many North American cities are increasingly interested in implementing small-scale localized spot treatments to surface routes as a simpler approach than top-down, disruptive route change, or redesign. This research seeks to support the identification of effective spot treatments at intersections using a systematic, data-driven approach. By analyzing key bus performance indicators in Toronto, this study developed insights into factors affecting peak-period bus speeds and delays at the segment and intersection levels for a wide variety of route and intersection configurations across eight high-frequency routes. Candidate treatments were then identified to improve bus performance. Data were sourced from the automatic vehicle location system, general transit feed specification, and a specialized ride check and GPS survey. Features of the approaches of 100 signalized intersections along the study routes were analyzed using K-means clustering, ordinary least squares regression, and regression trees, with target variables as their morning and evening peak operating speeds, segment-level delays, and signal delays. The results showed that long signal split is a significant contributor to higher operating speeds and lower delays, suggesting signal timing adjustments are an effective treatment. Clustering analysis suggested turning restrictions, particularly for right turns at intersections with near-side stops, could be effective, since turning volumes of similarly configured intersections were lower at locations with better transit performance. Regression analyses showed that queue jump lanes are an effective treatment if signal timing plans cannot be adjusted. The results from this study are intended to assist in informing transit authorities wishing to implement future spot improvement programs.

COMPUTER NETWORK ROUTING CONFIGURATION BASED ON INTELLIGENT ALGORITHM

With the rapid development of Internet, people are not satisfied with sharing information only on the local network; instead, they intend to maximize the use of various types of network resources in different regions in the world. Therefore, routing technology has become a crucial part of network technology, and it has become the most important network equipment. On the basis of relevant domestic and foreign theories and researches, in view of the existing problems, a computer network routing configuration method based on intelligent algorithm was proposed in this paper; meanwhile, the feasibility of the method was verified by simulation experiment.

A Systemic and Secure SDN Framework for NoC-Based Many-Cores

Recent exploration of Software-Defined Networking (SDN) for Many-Core Systems-on-Chip (MCSoCs) showed higher management flexibility and reduced physical complexity compared to other runtime communication management. In SDN, there is a software SDN Controller (control layer) that configures generic routers (data layer). The adoption of SDN makes the path establishment programmable and straightforward, according to different network policies, such as low power, QoS, fault-tolerance. It is also possible to change the path establishment policies at runtime without the need to redesign the NoC. Current works focus on proposing SDN architectures, lacking a systemic framework that describes the steps required to implement SDN into a Many-core environment. Security is an observed gap in SDN designs. A malicious task could configure SDN routers and take control of the NoC. The contribution of this work is to present a systemic and secure SDN framework (SDN-SS), detailing the steps required to support SDN in MCSoCs. This work also describes the iteration between the hardware, operating system, and user's tasks. The SDN-SS manages a Multiple-Physical NoC, with one packet-switching subnet and a set of circuit-switching subnets. The originality of SDN-SS includes (i) a step-by-step framework description addressing the phases required to support a secure SDN management; (ii) a secure SDN router configuration protocol; (iii) a protocol to change the subnet at runtime. Experimental results show the framework's capability to avoid DoS and Spoofing attacks while presents a low SDN router configuration overhead, corresponding up to 2% of a related work delay and a small impact over the user's task communication.

Distributed Learning Algorithms for Optimal Data Routing in IoT Networks

We consider the problem of joint lossy data compression and data routing in distributed Internet of Things (IoT). Heterogeneous sources compress their data using a source-specific lossy compression scheme, where heterogeneity is meant in terms of signal type and/or transmission rates. The compressed data is thus disseminated in a multi-hop fashion until it reaches a data collector (the IoT gateway). The problem we address is to compute a suitable rate-distortion working point for the compression scheme at the source nodes, while jointly assessing the most energy efficient routing paths for the data they transmit, under channel access, distortion and capacity constraints. This is formulated as a multi-objective optimization problem that is solved through distributed learning algorithms , where source coding and routing configurations emerge as the result of local interactions among the network devices. Our final algorithm is based on the alternating direction method of multipliers (ADMM), which is accelerated using the most recent findings from the literature. As a result, it has faster convergence (up to three times) to the global optimum than standard ADMM. Numerical results are discussed for selected network scenarios, emphasizing the interrelations that exist between signal reconstruction quality at the IoT gateway and total transport energy in the network.

Analysing the modal shift from road-based to coastal shipping-based distribution – a case study of outbound automotive logistics in India

ABSTRACTThis paper analyses the modal shift from a primary road-based to coastal shipping-based freight distribution. A mathematical model is developed to optimize the coastal shipping route planning under a multimodal distribution scenario. The model is applied to a case study of the outbound automotive logistics in India. Exploratory insights on the enablers and challenges to adopting coastal shipping-based distribution are presented along with the route configuration and the level of modal shift achievable based on the model results. The results of the study suggest that the current business and regulatory environment is appropriate to achieve almost one-third shift to intermodal coastal shipping, although investments in infrastructure and substantial cost reductions in ship and port operations need to be implemented to ensure further modal shift.This article is a revised and expanded version of a paper entitled Enhancing the role of coastal shipping in finished vehicle distribution—a viability study presented at The International Association of Maritime Economists (IAME) Conference, Kyoto, Japan; 27–30 June 2017.

Inferring Catchment in Internet Routing

BGP is the de-facto Internet routing protocol for interconnecting Autonomous Systems (AS). Each AS selects its preferred routes based on its routing policies, which are typically not disclosed. Due to the distributed route selection and information hiding, answering questions such as "what is the expected catchment of the anycast sites of a content provider at the AS-level, if new sites are deployed?", or "how will load-balancing behave if an ISP changes its routing policy for a prefix?", is a hard challenge. In this work, we propose a framework and methodology to infer the routing behavior in existing or hypothetical routing configurations, and provide new capabilities and insights for informative route inference (e.g., isolating the effect of randomness that is present in prior simulation-based approaches). The proposed framework can be useful in a number of applications: measurements/monitoring, traffic engineering, network planning, Internet routing models, etc.

System-Level Signal Analysis Methodology for Optical Network-on-Chip Using Linear Model-Based Characterization

State-of-the-art silicon photonics technology has demonstrated its potential use in all required building blocks for ultrahigh bandwidth on-chip optical links. However, a robust system-level abstraction model reflecting the properties of optical devices has not been well established. We propose a linear optical device model (LODM) for silicon photonic devices and an associated computation method of optical signal propagation (CMOP) in an optical network-on-chip (ONoC). The CMOP manipulates the optical signal routing paths according to the topology, router configuration, and routing algorithm of the given ONoC architecture; thus, it allows the transformed information to be adaptable in an LODM to facilitate simplified analysis. Furthermore, we construct a linear system model of a microring resonator (MR) to reduce the computation complexities caused by its resonance structure. By using the CMOP, we accelerate the system-level analysis of optical signal propagation in ONoCs, reflecting the propagation loss, interference, and phase shift with close accuracy to analog and mixed-signal extensions (AMS) environments. The evaluation results show that the computation speeds up by three orders of magnitude with 1.57% error in accuracy when compared to the AMS environments.

RLE-MRC: Robustness and Low-Energy Based Multiple Routing Configurations for Fast Failure Recovery

RLE-MRC: Robustness and Low-Energy Based Multiple Routing Configurations for Fast Failure Recovery