Software Routers Research Articles

A New Approach for Formal Behavioral Modeling of Protection Services in Antivirus Systems

ABSTRACT Formal method techniques provides a suitable platform for the software development in software systems. Formal methods and formal verification is necessary to prove the correctness and improve performance of software systems in various levels of design and implementation, too. Security Discussion is an important issue in computer systems. Since the antivirus applications have very important role in computer systems security, verifying these applications is very essential and necessary. In this paper, we present four new approaches for antivirus system behavior and a behavioral model of protection services in the antivirus system is proposed. We divided the behavioral model in to preventive behavior and control behavior and then we formal these behaviors. Finally by using some definitions we explain the way these behaviors are mapped on each other by using our new approaches. K EYWORDS Antivirus system, protection services, behavioral modeling, formal method; 1. I NTRODUCTION Today, antivirus software is very important in business and software development, because any computer the system should install a security application on itself to maintain regularize and security of its data [1]. In the recent years, many attacks are occurred to home the systems, bank servers and military systems by Viruses and Malwares [2]. Information maintenance and prevent to data accessibility is the cause of attacking and destroying data which has been occurred by invasive malware widely and suddenly [3]. So, users need to powerful security applications which secure their systems against the attack of viruses and malwares [4]. The attacks in the system security section is divided into two parts [5]. The first set of attacks are enabled to eliminate security files or security applications of a computer the system. After disabling these files and applications, these attacks access to important data in the computer system. The second set of attacks can remove a set of special files and destroying important files. These attacks are executed and handled from intelligence agencies and hacker on computer systems of the users. These attacks have not needed to destroy the system security of computer. But, these attacks are executed and run by hiding themselves in URL web addresses or in created files using routing software such as Microsoft office, adobe reader, win zip, etc. By notice to these attacks, a computer system need to an online security system. Of course, an offline security

Controls Mitigating the Risk of Confidential Information Disclosure by Facebook: Essential Concern in Auditing Information Security

Facebook allows people to easily share information about themselves which in some cases could be classified as confidential or sensitive in the organisation they’re working for. In this paper we discuss the type of data stored by Facebook and the scope of the terms “confidential” and “sensitive data”. The intersection of these areas shows that there is high possibility for confidential data disclosure in organisations with none or ineffective security policy. This paper proposes a strategy for managing the risks of information leakage. We define five levels of controls against posting non-public data on Facebook - security policy, applications installed on employees’ workstations, specific router software or firmware, software in the cloud, Facebook itself. Advantages and disadvantages of every level are evaluated. As a result we propose developing of new control integrated in the social media.

Differential energy saving algorithms in a distributed router architecture

A distributed multistage software router (MSSR) is composed by several interconnected software routers running on personal computers (PCs). The MSSR architecture overcomes scalability and performance issues of single software router by providing parallel forwarding paths. Like many networking devices, a MSSR must be sized for peak traffic load, which implies energy inefficiency at low loads. Thus, we focus on energy saving schemes to improve the router energy efficiency by dynamically adapting the MSSR architecture to the currently offered load. We first introduce an optimal energy saving algorithm defined as a mixed integer linear programming (MILP) optimization model. Then, heuristic solutions, named differential algorithms are discussed. While the optimal approach provides higher energy savings, the heuristics avoid the complete MSSR reconfiguration, thus reducing forwarding delays and minimizing service interruption. The performance evaluation shows that the proposed heuristic algorithms, that gracefully modifies the internal MSSR configuration, preserve the load proportional energy demand characteristics of the optimal algorithm, with a minimal loss of efficiency, largely compensated by algorithm simplicity.

Energy adaptation in multi-core software routers

We consider a new generation of Commercial-Off-The-Shelf (COTS) Software Routers (SRs), able to effectively exploit multi-core/CPU hardware platforms. This choice was mainly driven from the fact that SRs are one of the few platforms including power management features, and that can be easily customized. Our main objective is to evaluate and to model the impact of power saving mechanisms, generally included in today’s COTS processors, on the SR networking performance and behavior. To this purpose, we separately characterize the roles of both hardware and software layers through a large set of internal and external experimental measurements, obtained with a heterogeneous set of hardware platforms and SR setups. Starting from this detailed measure analysis, we propose a simple model, able to represent the SR performance with a high accuracy level in terms of packet throughput and related power consumption. The proposed model is thought to estimate how SRs behave under different network conditions and power management configurations. In fact, the model has been effectively applied inside a “green optimization” policy, which aims at minimizing power consumption, while maintaining a certain SR performance target. Finally, in order to provide an experimental evaluation of the proposed ideas, we apply such power management policies to a new generation software router platform, and we test their performance under real traffic traces.

A Load Balancer for a Multi-Stage Router Architecture

Multi-stage software router architectures permit to overcome several limitations inherent to single stage software routers. One of the key elements of the multi-stage architecture under study are the load balancers, which are used to distribute the load among backend routers. However, using a PC (Personal Computer) as a load balancer could create a performance bottleneck in the overall architecture. Since the operations performed by the load balancer are simple, we explore the possibility of an hardware-based implementation of load balancing functionality with the goal of improving its performance. In this paper, we describe the architecture of an FPGA-based load balancer and we present some performance results of its prototype implementation.

Network resource control for Xen-based virtualized software routers

The pluralist architecture is considered an alternative for the future Internet to support multiple services with contrasting requirements. In this approach, machine virtualization techniques play a fundamental role. Nevertheless, when applied to networking, they impose critical bottlenecks since they do not provide suitable mechanisms to orchestrate the utilization of the underlying resources. In this work, we propose XTC (Xen Throughput Control) to fill this gap and control the utilization of network resources in Xen-based virtual routers. The main idea is to provide aggregate control, regardless of the traffic on specific network interfaces. To achieve this goal, XTC indirectly adjusts the maximum throughput of a virtual router by controlling the amount of CPU given to it. Our experimental results show that XTC provides differentiation and fairness between virtual routers and also adapts to system disturbances.

Green Networking With Packet Processing Engines: Modeling and Optimization

With the aim of controlling power consumption in metro/transport and core networks, we consider energy-aware devices able to reduce their energy requirements by adapting their performance. In particular, we focus on state-of-the-art packet processing engines, which generally represent the most energy-consuming components of network devices, and which are often composed of a number of parallel pipelines to “divide and conquer” the incoming traffic load. Our goal is to control both the power configuration of pipelines and the way to distribute traffic flows among them. We propose an analytical model to accurately represent the impact of green network technologies (i.e., low power idle and adaptive rate) on network- and energy-aware performance indexes. The model has been validated with experimental results, performed by using energy-aware software routers loaded by real-world traffic traces. The achieved results demonstrate how the proposed model can effectively represent energy- and network-aware performance indexes. On this basis, we propose a constrained optimization policy, which seeks the best tradeoff between power consumption and packet latency times. The procedure aims at dynamically adapting the energy-aware device configuration to minimize energy consumption while coping with incoming traffic volumes and meeting network performance constraints. In order to deeply understand the impact of such policy, a number of tests have been performed by using experimental data from software router architectures and real-world traffic traces.

Validated Model-Based Performance Prediction of Multi-Core Software Routers

The possibility of using flexible and cost-efficient commodity hardware instead of expensive custom hardware has triggered wide interest in software routers. Performance measurement and simulation are important approaches for identifying bottlenecks of such systems to predict and improve the performance. We measure the performance of software routers using current multi-core hardware architectures. We introduce an innovative and validated node model for intra-node resource contention and realized a resource management extension for the widely-used network simulator ns-3 which allows to evaluate and predict the performance of current and future software router architectures.

Evaluation of Power Saving and Feasibility Study of Migrations Solutions in a Virtual Router Network

The power consumption of the network equipment has increased significantly and some strategies to contain the power used in the IP network are needed. Among the green networking strategies, the virtualization class and in particular the deployment of migrating virtual routers can lead to a high energy saving. It consists in migrating virtual routers in fewer physical nodes when the traffic decreases allowing for a power consumption saving. In this paper we formulate the problem of minimizing the power consumption as a Mixed Integer Linear Programming (MILP) problem. Due to the hard complexity of the introduced MILP problem, we propose a heuristic for the migration of virtual routers among physical devices in order to turn off as many nodes as possible and save power according to the compliance with network node and link capacity constraints. We show that 50% of nodes may be turned off in the case of a real provider network when traffic percentage reduction of 80% occurs. Finally we also perform a feasibility study by means of an experimental test-bed to evaluate migration time of a routing plane based on QUAGGA routing software.

Network Routing of Snowplow Trucks with Resource Replenishment and Plowing Priorities

The routing of snowplow trucks in urban and regional areas encompasses a variety of complex decisions, especially for jurisdictions with heavy snowfall. The main activities involve dispatching a fleet of snowplow trucks from a central depot or satellite facility to clean and spread salt and chemicals on the network links (i.e., snow routes). In this paper, a mixed integer linear program model is proposed to minimize the total operation time of all snowplow trucks needed to complete a given set of snow routes with multiple plowing priorities and to reduce the longest individual truck operation time. Customized construction and local search solution algorithms are developed and used to design snow routes for an empirical application. The computational results show that the proposed solution approach is able to solve the problem effectively and the model result outperforms the current solution in practice. The proposed models and algorithms are also incorporated into the development of a state-of-the-art snowplow routing software that can help planners optimize snow routes and evaluate options for resource allocation.

A Hybrid method for testing routing protocols in mesh networks

Abstract This article presents a hybrid method for testing routing protocols specifically dedicated to mesh networks. The architecture of software routers is described and a graphic environment that would ensure effective configuration of test networks is proposed. The platform for tests of routing protocols presented in the article combines an implementation of routing protocols (the real control plane) with a router data plane simulator. The proposed solution provides an opportunity to test real implementations of routing protocols for any parameters of data plane, not limited by the physical implementation of a test network. The presented platform is based on an open source code

Development of a cross-section based streamflow routing package for MODFLOW

It is challenging to simulate stream-aquifer interactions for the wide channel streams with the existing stream routing packages of MODFLOW. To overcome this limitation, a Cross-Section streamflow Routing (CSR) package is developed to simulate the streamflow and the interaction between streams and aquifers for the stream with a width larger than the MODFLOW grid size. In the CSR package, streams are divided into stream segments which are formed by two consecutive cross-sections. A cross-section is described by a number of streambed points that determine the geometry and hydraulic properties of the streambed. The stream water depth and streamflow at the cross-sections are related by the Single Channel method, the Divided Channel method, a data table or a power function. A rapid algorithm is used to compute the submerged area of the MODFLOW grid. The streambed conductance of a grid cell is computed based on its submerged area, streambed hydraulic conductivity and thickness. Stream-aquifer seepage is subsequently estimated as the product of the streambed conductance and difference between the stream stage and groundwater hydraulic head. Stream-aquifer seepage is treated as lateral flow in the streamflow routing computation with the Muskingum-Cunge method or mass conservation method. A hypothetical problem is established to test the capabilities of the CSR package with steady- and transient-state models. The results compare favorably with the SFR2 package and the HEC-RAS model. However, significant difference in flood wave attenuation is observed between the CSR package and the SFR2 package. It proves that the CSR package is capable of simulating the variation of stream-aquifer interactions in both space and time efficiently. The CSR package represents a certain improvement over previous MODFLOW streamflow packages by providing the efficient cross-section based computation and the unique capability of simulating streambed heterogeneity in longitudinal and transverse directions.

Don't drop, detour!

Today's data centers must support a range of workloads with different demands. While existing approaches handle routine traffic smoothly, ephemeral but intense hotspots cause excessive packet loss and severely degrade performance. This loss occurs even though the congestion is typically highly localized, with spare buffer capacity available at nearby switches. We argue that switches should share buffer capacity to effectively handle this spot congestion without the latency or monetary hit of deploying large buffers at individual switches. We present detour-induced buffer sharing (DIBS), a mechanism that achieves a near lossless network without requiring additional buffers. Using DIBS, a congested switch detours packets randomly to neighboring switches to avoid dropping the packets. We implement DIBS in hardware, on software routers in a testbed, and in simulation, and we demonstrate that it reduces the 99th percentile of query completion time by 85%, with very little impact on background traffic.

AUTOMATIC ROAD DETECTION OF SATELLITE IMAGES USING IMPROVED EDGE DETECTION

Road networks play an important role in a number of geospatial applications, such as cartographic, infrastructure planning and traffic routing software. Automatic and semi-automatic road network extraction techniques have significantly increased the extraction rate of road networks. The road detection performance is a critically affected by the noise or low frequency images. Road edge detection plays an significant role to detect the direction of the road and the specific location of obstacles, size and speed of obstacles in the road. In this paper, several road detection techniques are theoretically analyzed, and a new road detection technique is proposed using median filter. By comparing it with some well known techniques it is found that there exist many gaps in the techniques proposed so far. Â By comparing the proposed algorithm with proposed it is proved that the proposed algorithm does not provide artifacts was quite more in old tewchniques.

Distributed Schemes for Routing Table Management in Next Generation Routers

Current generation routers are being replaced by scalable next generation routers in order to satisfy the growing demand of Internet traffic in core networks. The next generation routers, on the hardware side, are provided with a very large switching capacity, high speed interfaces and additional computing and memory resources. There is a need to re-design the router software in a distributed way in order to efficiently exploit advanced hardware features of the next generation routers. One of the key functions of a router is to manage routes obtained from different routing protocols. The current centralized architecture of the routing table manager will likely face difficulties to handle the growth of routing tables and path computation requests, particularly for high traffic-density networks. This paper proposes two distributed IGP route management schemes for routers. The first scheme enhances the scalability at the control card level. The second one uses the parallel processing of the switch fabric in order to increase the handled number of routes by adding more line cards. Scalability evaluation is done for the two distributed schemes and a centralized architecture in terms of CPU cycles used and required memory.

Phase I of The National Beef Quality Audit-2011: Quantifying willingness-to-pay, best-worst scaling, and current status of quality characteristics in different beef industry marketing sectors1

The National Beef Quality Audit (NBQA)-2011 benchmarked the current status of and assessed progress being made toward quality and consistency of U.S. cattle, carcasses, and beef products after the completion of the first NBQA in 1991. Unlike previous NBQA, objectives of the 2011 Phase I study were to determine how each beef market sector defined 7 quality categories, estimate willingness-to-pay (WTP) for the same quality categories by market sector, and establish a best-worst (B/W) scaling for the quality categories. Structured face-to-face interviews were conducted and responses were recorded using dynamic routing software over an 11-mo period (February to December 2011) with decision makers in each of the following beef market sectors: Feeders (n = 59), Packers (n = 26), Food Service, Distribution, and Further Processors (n = 48), Retailers (n = 30), and Government and Allied Industries (n = 47). All respondents participated in a structured interview consisting of WTP and B/W questions that were tied to 7 quality categories and then were asked to "define" each of the 7 categories in terms of what the category meant to them, resulting in completely unbiased results. The 7 quality categories were a) how and where the cattle were raised, b) lean, fat, and bone, c) weight and size, d) cattle genetics, e) visual characteristics, f) food safety, and g) eating satisfaction. Overall, "food safety" and "eating satisfaction" were the categories of greatest and second most importance, respectively, to all beef market sectors except for Feeders. Feeders ranked "how and where the cattle were raised" and "weight and size" as the most important and second most important, respectively. Overall, "how and where the cattle were raised" had the greatest odds of being considered a nonnegotiable requirement before the raw material for each sector would be considered for purchase and was statistically more important (P < 0.05) as a requirement for purchase than all other categories except "food safety." When all market sectors were considered, "eating satisfaction" was shown to generate the greatest average WTP percentage premium (11.1%), but that WTP premium value only differed statistically (P < 0.05) from "weight and size" (8.8%). Most notably, when a sector said that "food safety" was a nonnegotiable requirement, no sector was willing to purchase the product at a discounted price if the "food safety" of the product could not be assured.

FPGA Design Framework Combined with Commercial VLSI CAD

The most widely used open-source field programmable gate array (FPGA) placement and routing tool is the Versatile Packing, Placement and Routing (VPR) software developed at the University of Toronto, Canada. VPR calculates area and timing using target FPGA architecture and physical information. However, it cannot be used in FPGA IP design efficiently for two reasons. First, VPR cannot directly support most newly developed FPGA architectures, and modifying the C-coded VPR so that it can be used to evaluate a number of new architectures is time consuming. Second, the accuracy of the VPR performance results is inadequate for the evaluation of a complete FPGA IP in a design that targets the production of LSI. We propose an FPGA design framework that is focused on improving FPGA IP design efficiency. A novel FPGA routing tool is developed in this framework, namely the EasyRouter which uses the C# language. When an object-oriented programming method is used, there is less source code and it is easier to manage compared to VPR, thus shortening the development time. By using simple HDL code templates, EasyRouter can automatically generate the entire HDL code for a chip and the configuration bitstream. With these files, the FPGA IP can be evaluated with commercial VLSI CAD systems with high accuracy and reliability.

Automatic Road Detection of Satellite Images- a Survey

Road networks play an important role in a number of geospatial applications, such as cartographic, infrastructure planning and traffic routing software. Automatic and semi-automatic road network extraction techniques have significantly increased the extraction rate of road networks. The road detection performance is a critically affected by the noise or low frequency images. Road edge detection plays an significant role to detect the direction of the road and the specific location of obstacles, size and speed of obstacles in the road. In this paper, several road detection techniques are theoretically analyzed, and are used for road detection. By comparing some well known techniques it is found that there exist many gaps in the techniques proposed so far. This paper ends up with suitable future direction to enhance the road detection method.

Optical switch emulation in programmable software router testbed

A programmable optical router is a key enabler for dynamic service provisioning in Future Internet scenarios. It is equipped with optical switching hardware to forward information at hundreds of Gigabits/s rates and above, controlled and managed through modular and flexible procedures according to emerging standards. The possibility to test such costly optical architectures in terms of logical and physical performance, without implementing complex and expensive testbeds, is crucial to speed-up the development process of high-performance routers. To this purpose, this paper introduces the software-based emulation testbed of a programmable optical router, which is here developed and applied to test optical switching fabrics. Accurate characterization of the optical devices and physical layer aspects is implemented with the Click software router environment. Power loss and optical signal-to-noise-ratio evaluation are provided through accurate software representation of the physical characteristics of the optical devices employed. The scalability of the proposed emulation testbed is also assessed on standard PC hardware. All the obtained results prove the effectiveness of the proposed tool to emulate an optical router at different levels of granularity.

An open-source platform for distributed Linux Software Routers

In this paper, our main objective is to explore how Linux Software Routers (SRs) can deploy advanced and flexible paradigms for supporting novel control-plane functionalities and applications. To this end, we investigate and study a new open-source software (SW) framework: the Distributed SW ROuter Project (DROP), which aims to develop and enable a novel cooperative middleware for distributed IP-router control and management. DROP allows logical network nodes to be built through the aggregation of multiple SRs based on the Linux operating system and commodity hardware, which can be devoted to packet forwarding or control operations. In addition to the original ForCES design, DROP aims to extend router distribution and aggregation concepts by moving them to a network-wide scale to enable and support value-added services for next-generation networks.