Virtual Routing Research Articles

Analyzed Virtual Routing Protocol for Future Networks (MANET & topological network)

The mobile ad-hoc network (MANET) is a wireless unstructured network and this has mostly suggested for multimedia streaming efficiency. The hackers attacks are reduce the capacity and efficiency of network in MANET. There are various types of protocol are used for the communication in MANET, but security is lacking in those techniques and some insoluble problems present in MANET. In this paper exhibits, a layered protocol network for secured data transmission called Analyzed Virtual Routing Protocol (AVRP). This protocol used to provide more secured data transmission and this not disturbing data streaming in the network.

Anastilosis Virtual de “A Domus Do Mitreo De Lvcvs Avgvsti”

<p>Following the Discovery of a roman Domus and a mithreum at the Pazo de Montenegro in Lugo city,, a new technologies implementation project for recording and spreading heritage has been carried out for the temporary exhibition "Lucus Augusti´s mithreum Domus" at the "House of knowledge". A virtual route through this architectural space reconstructed in 3D is shown on an audiovisual presentation.</p>

Reconfigurable Routing Protocol for Free Space Optical Sensor Networks

Recently, free space optical sensor networks (FSOSNs), which are based on free space optics (FSO) instead of radio frequency (RF), have gained increasing visibility over traditional wireless sensor networks (WSNs) due to their advantages such as larger capacity, higher security, and lower cost. However, the performance of FSOSNs is restricted to the requirement of a direct line-of-sight (LOS) path between a sender and a receiver pair. Once a node dies of energy depletion, the network would probably suffer from a dramatic decrease of connectivity, resulting in a huge loss of data packets. Thus, this paper proposes a reconfigurable routing protocol (RRP) to overcome this problem by dynamically reconfiguring the network virtual topology. The RRP works in three phases: (1) virtual topology construction, (2) routing establishment, and (3) reconfigurable routing. When data transmission begins, the data packets are first routed through the shortest hop paths. Then a reconfiguration is initiated by the node whose residual energy falls below a threshold. Nodes affected by this dying node are classified into two types, namely maintenance nodes and adjustment nodes, and they are reconfigured according to the types. An energy model is designed to evaluate the performance of RRP through OPNET simulation. Our simulation results indicate that the RRP achieves better performance compared with the simple-link protocol and a direct reconfiguration scheme in terms of connectivity, network lifetime, packet delivery ratio and the number of living nodes.

A Population Evolution Algorithm for Supporting Scalable Virtual Routers

A Population Evolution Algorithm for Supporting Scalable Virtual Routers

Processor Coalition Algorithm for Virtual Routers on a Multiprocessor System

Processor Coalition Algorithm for Virtual Routers on a Multiprocessor System

ECO–ALOC: Energy-efficient resource allocation for cluster-based software routers

In this paper, we explore the use of cluster-based software routers as a way to share hardware resources, reduce costs, and save energy. We propose ECO–ALOC, an energy-efficient resource allocation mechanism that reconfigures the router according to the traffic demands using two modules. The first module provides fine-grained energy consumption control by switching CPU operation frequencies among three special frequencies. The second module provides long-term power savings by using virtual router migration to consolidate the load and shut idle servers down. We simulate a cluster-based software router using real traffic traces to evaluate our proposal. Results show that ECO–ALOC provides power savings of up to 93% depending on the cluster load scenario.

Reinforcement Learning Algorithm for Supporting Virtual Routers on Multiprocessor System

Reinforcement Learning Algorithm for Supporting Virtual Routers on Multiprocessor System

AMPLE: an adaptive traffic engineering system based on virtual routing topologies

Handling traffic dynamics in order to avoid network congestion and subsequent service disruptions is one of the key tasks performed by contemporary network management systems. Given the simple but rigid routing and forwarding functionalities in IP base environments, efficient resource management and control solutions against dynamic traffic conditions is still yet to be obtained. In this article, we introduce AMPLE - an efficient traffic engineering and management system that performs adaptive traffic control by using multiple virtualized routing topologies. The proposed system consists of two complementary components: offline link weight optimization that takes as input the physical network topology and tries to produce maximum routing path diversity across multiple virtual routing topologies for long term operation through the optimized setting of link weights. Based on these diverse paths, adaptive traffic control performs intelligent traffic splitting across individual routing topologies in reaction to the monitored network dynamics at short timescale. According to our evaluation with real network topologies and traffic traces, the proposed system is able to cope almost optimally with unpredicted traffic dynamics and, as such, it constitutes a new proposal for achieving better quality of service and overall network performance in IP networks.

Trie shifting scheme with depth adjusting for multiple virtual routers

In network virtualisation, which enables multiple virtual routers to share one physical router, how to ensure the scalability and performance of concurrent virtual routers is a challenging problem in virtual router design. Since physical router only has limited memory resource, it is significant to efficiently store multiple forwarding tables for virtual routers. Motivated by the idea of diminishing the dissimilarities in forwarding tables, the authors propose a novel trie shifting scheme with depth adjusting, and finally obtain a memory-efficient shared trie for all forwarding tables. In this scheme, by diminishing the dissimilarity in the depth and in the shape, memory is saved by reducing the trie nodes needed in the shared trie. In the simulation, the scheme needs only 10% of trie nodes, compared with storing forwarding tables separately. Extensive simulation based on three sets of forwarding tables, which are collected from five backbone routers, shows that the scheme saves memory by reducing the number of trie nodes between 4.7 and 7.8%, compared with the latest scheme in related work. Moreover, this scheme achieves more improvement when the dissimilarity is increasing.

A Survey on Future Internet Architecture

Internet has become as a social infrastructure.The current Internet architecture based on TCP/IP is faced with many challenges.This fact makes the clean-slate design of future Internet architecture be a hot research topic.This paper analyzes the essential problems that are inherent in the current Internet architecture,including scalability,mobility,security and controllability,and comprehensively introduces the existing research works on the future Internet architecture such as the scalability-oriented architecture,the mobility-oriented architecture etc.Considering experiment-based validation is an important means for the research of future Internet,this paper further presents the development of programmable virtual routers and the corresponding testbeds.Finally,open issues on the future Internet architecture design are discussed.

The relationship of topographical memory performance to regional neurodegeneration in Alzheimer's disease

The network activated during normal route learning shares considerable homology with the network of degeneration in the earliest symptomatic stages of Alzheimer's disease (AD). This inspired the virtual route learning test (VRLT) in which patients learn routes in a virtual reality environment. This study investigated the neural basis of VRLT performance in AD to test whether impairment was underpinned by a network or by the widely held explanation of hippocampal degeneration. VRLT score in a mild AD cohort was regressed against gray matter (GM) density and diffusion tensor metrics of white matter (WM) (n = 30), and, cerebral glucose metabolism (n = 26), using a mass univariate approach. GM density and cerebral metabolism were then submitted to a multivariate analysis [support vector regression (SVR)] to examine whether there was a network associated with task performance. Univariate analyses of GM density, metabolism and WM axial diffusion converged on the vicinity of the retrosplenial/posterior cingulate cortex, isthmus and, possibly, hippocampal tail. The multivariate analysis revealed a significant, right hemisphere-predominant, network level correlation with cerebral metabolism; this comprised areas common to both activation in normal route learning and early degeneration in AD (retrosplenial and lateral parietal cortices). It also identified right medio-dorsal thalamus (part of the limbic-diencephalic hypometabolic network of early AD) and right caudate nucleus (activated during normal route learning). These results offer strong evidence that topographical memory impairment in AD relates to damage across a network, in turn offering complimentary lesion evidence to previous studies in healthy volunteers for the neural basis of topographical memory. The results also emphasize that structures beyond the mesial temporal lobe (MTL) contribute to memory impairment in AD—it is too simplistic to view memory impairment in AD as a synonym for hippocampal degeneration.

Virtualization for the LHCb Online system

Virtualization has long been advertised by the IT-industry as a way to cut down cost, optimise resource usage and manage the complexity in large data-centers. The great number and the huge heterogeneity of hardware, both industrial and custom-made, has up to now led to reluctance in the adoption of virtualization in the IT infrastructure of large experiment installations.Our experience in the LHCb experiment has shown that virtualization improves the availability and the manageability of the whole system.We have done an evaluation of available hypervisors / virtualization solutions and find that the Microsoft HV technology provides a high level of maturity and flexibility for our purpose. We present the results of these comparison tests, describing in detail, the architecture of our virtualization infrastructure with a special emphasis on the security for services visible to the outside world. Security is achieved by a sophisticated combination of VLANs, firewalls and virtual routing - the cost and benefits of this solution are analysed.We have adapted our cluster management tools, notably Quattor, for the needs of virtual machines and this allows us to migrate smoothly services on physical machines to the virtualized infrastructure. The procedures for migration will also be described.In the final part of the document we describe our recent R&D activities aiming to replacing the SAN-backend for the virtualization by a cheaper iSCSI solution - this will allow to move all servers and related services to the virtualized infrastructure, excepting the ones doing hardware control via non-commodity PCI plugin cards.

Virtual Area Routing: a Scalable Intra-Domain Routing Scheme

As a distributed link state protocol, OSPF shows poor scalability when dealing with intra-domain routing in large networks. In this paper we present a new routing scheme called Virtual Area Routing (VAR) aimed to overcome the scalability problems of OSPF. The control plane is separated from data plane and is undertaken by dedicated elements in VAR. We show that VAR can simplify network configuration and management as well as avoid unnecessary route computation. Finally we conduct experiments in real topology and the result shows VAR can reduce control overhead and improve network performance.

Computational Electrophysiology: The Molecular Dynamics of Ion Channel Permeation and Selectivity in Atomistic Detail

Presently, most simulations of ion channel function rely upon nonatomistic Brownian dynamics calculations, indirect interpretation of energy maps, or application of external electric fields. We present a computational method to directly simulate ion flux through membrane channels based on biologically realistic electrochemical gradients. In close analogy to single-channel electrophysiology, physiologically and experimentally relevant timescales are achieved. We apply our method to the bacterial channel PorB from pathogenic Neisseria meningitidis, which, during Neisserial infection, inserts into the mitochondrial membrane of target cells and elicits apoptosis by dissipating the membrane potential. We show that our method accurately predicts ion conductance and selectivity and elucidates ion conduction mechanisms in great detail. Handles for over- coming channel-related antibiotic resistance are identified.

PEARL: a programmable virtual router platform

Programmable routers supporting virtualization are a key building block for bridging the gap between new Internet protocols and their deployment in real operational networks. This article presents the design and implementation of PEARL, a programmable virtual router platform with relatively high performance. It offers high flexibility by allowing users to control the configuration of both hardware and software data paths. The platform makes use of fast lookup in hardware and software exceptions in commodity multicore CPUs to achieve highspeed packet processing. Multiple isolated packet streams and virtualization techniques ensure isolation among virtual router instances.

Grilling Gratuitous Detour in ADHOC Network

Routing is a critical function in adhoc network which claim special attention and support extended by the trustable neighbor nodes. The peril of Gratuitous detour on routing process in ad hoc network is manifold which culminates in the deterioration of network performance amounting to deplorable network behavior. Routing in ad hoc network is a cooperative process as it requires periodic assistance from the intermediate nodes to route the packets to the far off nodes that are beyond the direct wireless transmission range. The role of intermediate nodes in routing is crucial and it mandates special attention and support from the sender node and as well the good Samaritan neighboring nodes. This paper advocates the creation of two lists namely PFL and SFL backed by Dominant Pruning Method. The misbehaving middle node exhibiting Gratuitous Detour (GD) has to be curtailed by performing a cardinality operation on the route cache (storing the intermediate nodes enroute to the destination) of the nodes in PFL and SFL. The sender node stringent process of recruiting the genuine intermediate nodes in both the list is echoed periodically by performing a cardinal operation to restrain the occurrence of GD which manifest by projecting a non existent node or concealing an existent node. The result of the cardinal operation approves the truth that the nodes in Route cache (Buffered Route Path) are genuine or not. The proposed solution demands a heavy pay from the M 3 N whose intention is either to disrupt the optimal routing process by hiding a potential peer after launching a blackmail or DoS attack on it. The ulterior motive of the Malicious Misbehaving Middle (M 3 N) in projecting the non existent nodes (Longer Virtual Route) to evade the role of routing intermediary is also effectively thwarted. Suitable graph have been simulated to study the effect of mobility and no. of misbehaving nodes on the Sender Node Probing Latency Index (SNPLI).

VCHR: Virtual Cluster-Based Hybrid Routing Protocol

There are a couple of inherent shortcomings which are hard to be overcome in single topology network; thus we propose a novel routing protocol—VCHR, i.e., Virtual Cluster-based Hybrid Routing, which employs hybrid topology, bears the stamp of flat and hierarchical routing protocol. At stage of hierarchical routing, VCHR draws on the idea of the virtual cluster; base station controls clustering process based on network coverage control criteria in centralized model, and ensuring the reliability of virtual clusters by making use of the three-way handshake mechanism. Flat routing employs shortest path routing protocol to get the optimized routing path to base station. In context of low algorithm complexity, the protocol could realize full network coverage control, effectively balance energy load among sensor nodes and quickly respond to network dynamic changes.

Customizing virtual networks with partial FPGA reconfiguration

Recent FPGA-based implementations of network virtualization represent a significant step forward in network performance and scalability. Although these systems have been shown to provide orders of magnitude higher performance than solutions using software-based routers, straightforward reconfiguration of hardware-based virtual networks over time is a challenge. In this paper, we present the implementation of a reconfigurable network virtualization substrate that combines several partially-reconfigurable hardware virtual routers with software virtual routers. The update of hardware-based virtual networks in our system is supported via real-time partial FPGA reconfiguration. Hardware virtual networks can be dynamically reconfigured in a fraction of a second without affecting other virtual networks operating in the same FPGA. A heuristic has been developed to allocate virtual networks with diverse bandwidth requirements and network characteristics on this heterogeneous virtualization substrate. Experimental results show that the reconfigurable virtual routers can forward packets at line rate. Partial reconfiguration allows for 20x faster hardware reconfiguration than a previous approach which migrated hardware virtual networks to software.

Older people's navigation of urban areas as pedestrians: Measuring quality of the built environment using oral narratives and virtual routes

Studies of navigation and walkability of the outdoor built environment are now common. However, few have taken a ‘virtual’ approach and in this study we examine the qualitative oral narratives of forty-eight older people provided whilst they watched film footage of a journey around an unfamiliar, urban landscape, and compare them with quantitative measures of the built environment. Pre-film cognitive/psychological tests were carried out, and the participants filled out a questionnaire covering relevant issues such as feelings about home area and navigational behaviour. From the oral narratives we found that signage as well as the presence of historical and distinctive buildings to be central. There was little evidence that perception of residential (familiar) neighbourhood impacted upon commentary about the unfamiliar space suggesting the findings are generalisable to the wider senior citizen demographic and transferable to other localities. We propose a prototype index for urban landscape navigation from these findings.

Energy-aware Virtual Ring Routing in Wireless Sensor Networks

Virtual Ring Routing (VRR) is an ad-hoc routing protocol that avoids flooding the network. It uses location independent identifiers for packet routing. However, VRR does not take into consideration the amount of energy in nodes, leading to the failure of several nodes in the network. To resolve this problem, we have adopted a hierarchical Distributed Hash Table in the VRR architecture. In the resulting architecture, the energy powerful sensors are responsible for most message traffic. Weak sensors are then utilized less frequently than powerful sensors. The experimental results show that Coral-based VRR consumes less energy than VRR and extends the network lifetime.