Routing algorithm

Owing to features of open medium, absence of infrastructure, dynamic network topology, cooperative algorithms, lack of centralized monitoring and resource constraints, ad hoc networks are vulnerable to many kinds of attacks, among which wormhole attack is chosen as the topic of discussion. This attack, when launched during route discovery phase can percolate wrong route/topology information into the network thereby, defeating the purpose of routing algorithms. In this paper we propose a novel technique based on clustering and digital signatures for prevention against wormhole attacks without use of special hardware, time synchronisation or dependency on time or hop difference between colluding nodes to identify attacked routes. We employ independent algorithms to form clusters and to implement intra-cluster and inter-cluster routing of data packets. Simulation Results show that the method achieved high level of efficiency in isolating wormhole nodes in the network.

In this paper a new pedestrian mobility model for outdoor scenarios is presented. It captures realistic features like moving-in-groups, conscious traveling and smart traveling. The routing algorithm proposed within the model works under a step by step approach, leading users to their destination while, at the same time, using more attractable streets from a pedestrian point of view. The model concept is perfectly generic and applicable to any pedestrian outdoor scenario, provided that the street database and pedestrian traffic information is available. The mobility model was validated using Lisbon's downtown as a case study. The output shows a high correlation between simulated and real data, thus validating the approach.

Abstract: - As innovation shrink, the force scattered by the connections of a network-on-chip (NoC) begins to imitate with the force dispersed by alternate components like as switches and the network interfaces (NIs).In this venture Cartesian switch is outlined keeping in mind the end goal to diminish the force dissipation. Cartesian switch is a composite of gatherer and arterials. A gatherer is a 'horizontal network' connecting authority switches, while a blood vessel is a 'vertical network' that divide gatherers. Authority switches has an east and a west port, connecting the switch to its gatherer, while blood vessel switches have sufficient ports to permit connection to its authorities and its arterials. To guarantee connectivity, a blood vessel is not allowed to diversion a gatherer. Every switch is given a location that indicate its location in Cartesian space (spoke to, for instance, utilizing scope and longitude); inside an authority, all gatherer switches offer common scope. At last we choose that the port transition of double information between the ports are proficient in NOC application for exchange the information rates in effective way and it additionally lessened Area of the switch. At long last the Cartesian switch will be actualized by utilizing FPGA Kit.

The design of scalable and reliable interconnection net-works for System on Chips (SoCs) introduce new design constraints not present in current multicomputer systems. Although regular topologies are preferred for building NoCs, heterogeneous blocks, fabrication faults and reliabil-ity ...

Ant Colony Optimization (ACO) has proven to be a very powerful optimization heuristic for combinatorial optimization problems. This paper introduces a new type of ACO algorithm that will be used for routing along multiple routes in a network as opposed to optimizing a single route. Contrary to traditional routing algorithms, the Ant Dispersion Routing (ADR) algorithm has the objective of determining recommended routes for every driver in the network, in order to increase network efficiency. We present the framework for the new ADR algorithm, as well as the design of a new cost function that translates the motivations and objectives of the algorithm. The proposed approach is illustrated with a small simulation-based case study for the Singapore Expressway Network.

This paper presents a nonblocking routing algorithm
for Beneˇs networks. Such networks are of potential interest
in implementing large scale optical cross-connects, but their
complex routing algorithm limits their applications. We use a
simple approach to determine the routing tags for a conflict
free routing. Available methods proposed in the literature use
computationally complex solutions to determine the routing tags.
We propose a new approach for determining the paths through
the network for all the requests coming to the inputs of the switch
for unicast routing. Each switching stage has been represented by
a set of sub-matrices and hence a conflict free routing is found.
The correctness of the generated routing tags have been validated
with mathematical method as well as with a simulator that
can validate the correctness of the routing tags. This algorithm
requires less complex practical implementation than the looping
algorithm, making it viable for use in cross connect systems.
Keywords: Rearrangeable Network, Permutation, Interconnection
Networks, Blocking, Routing Tags, Parallel Processing,
Distributed Processing.

... 5: Scalable Video Coding (in integrated form with ITU-T Rec. H.264 | ISO/IEC 14996-10). JointVideo Team (JVT), Doc. JVT-R201, Jan. 2006. 4. Luby, M., Stockhammer, T., Watson, M., Gasiba, T., and Xu, W. Raptor Codes for Reliable Download Delivery in Wireless Broadcast ...

In packet switched computer networks, data are routed along communication links making up the network, the problem arises of how to determine the shortest paths to route the data. Each link has a cost representing the desirability of using that particular link. The shortest path then becomes the path in which the total link cost from a source node to

Abstract The intensive and continuous use of high-performance computing systems for executing computationally intensive applications, coupled with the large number of elements that make them up, dramatically increase the likelihood of failures during their operation. Clearly, network faults have an extremely high impact because most routing algorithms are not designed to tolerate faults. In such algorithms, just a single fault may lead to deadlocked configurations thus preventing the correct finalization of applications. This paper ...

In this paper, we study a constraint-based routing strategy using label switching in a multi-layered hierarchical satellite constellation such as transformational communications architecture. Both quality (bit error rate on free space optical and radio inter-satellite links) and bandwidth availability on a satellite link are taken into account when setting up routes for high priority real-time traffic such as VoIP, which is sensitive to delay and jitter. To protect the real-time traffic from being swamped by bursty best-effort traffic we propose to have a ...

International Journal on Cryptography and Information Security ( IJCIS) is an open access peer reviewed journal that focuses on cutting-edge results in applied cryptography and Information security. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.

A novel infrastructureless mobile networks (MANETs) is a collection of wireless nodes that can dynamically form a network to exchange information. The special features of MANET bring this technology great opportunity together with severe challenges. This paper describes the fundamental problems of ad hoc networking by giving its related background including the concept, features, applications, issues of MANETs, investigates and presents recent research trends and identifies Simulators for MANETs[5]. Based on recent research interests of scholars we found that some issues such as routing and power management attracted much attention and issues such as IP addressing and fault tolerance will have wide scope in the future. In the qualitative analysis [5], we found that some factors such as scalability, stability, and reliability attracted much. The essential simulation metrics for various MANET issues are identified and Simulators are listed for experiment. The analysis results demonstrate the utilization trends for various MANET simulators.

Business Analytics (BA) is reformulating corporate success. Transforming data in knowledge and using it harmoniously in Decision Making is not, anymore, a luxury of the most prestigious companies and organizations, but an obligation to deliver competitive products and high-quality services. Approaches coming from different mathematical and computer sciences areas are deeply involved in this field. Nowadays, BA is probably the most important manifestation of the knowledge economy and knowledge society. A growing number of companies are identifying innovative ways to take advantage of the developed solutions based on BA. These applications—when enriched with computational intelligence—are capable of generating information that can be vital for making strategic decisions in a more informed and reliable way even under high uncertainty environments. Consequently, research on computational intelligence for BA exhibits a substantial impact on our world today.

Eurekas is a Multinational Multidisciplinary Scientific Community joining professionals of Mathematics, Computer Sciences, Engineering, as well as Administration, Economics, and Social Sciences, towards theoretical and practical developments useful for Data and Business Analytics, in this way contributing to building the Knowledge Society and Knowledge Economy. It was founded in 2008 and it has been contributing by multiple projects to that purpose.

Computational Intelligence for Business Analytics is a new Eurekas editorial initiative that aims to collect the latest technological innovations in the field of BA to improve business models related to Group Decision-Making, Forecasting, Risk Management, Knowledge Discovery, Data Breach Detection, Social Well-Being,
among other topics related to this field.

In order to meet the insatiable demands for cloud-based services, today’s data centers may have hundreds of thousands of servers. During the past decade, many topologies have been proposed to interconnect a large number of servers in a data center network. However, existing topologies face several challenges including the rigid structure, high network cost, and packet relay overheads on servers. In this paper, we propose a novel switch-centric network topology, called DCCube, which offers many desirable properties for data center networking. DCCube is a flexible structure because, given the switches degree and the network diameter, it is possible to construct different structures with different number of connected servers, bisection bandwidth and network cost. Furthermore, DCCube can accommodate a large number of servers with high bisection bandwidth, low cost, small diameter and desirable path diversity. By comparing with existing data center network topologies, we show that DCCube achieves both high performance and low network cost. We also design both minimal and non-minimal routing algorithms for the proposed topology. Simulation results reveal that non-minimal routing is preferred for unbalanced traffic patterns. Keywords: Data center network, Network topology, Flexibility, High performance, Routing

In mobile ad hoc networks (MANETs), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we propose a formulation of the routing problem in multi-services MANETs, as well as the implementation of an adaptation of the dynamic source routing (DSR) protocol.

The voltage/frequency island (VFI) design paradigm is a practical architecture for energy-efficient networks-on-chip (NoC) systems. In VFI-based NoC systems, each island can be operated with different voltage and clock frequency and thus it is important to carefully partition processing elements (PEs) into islands based on their workloads and communications. In this paper, we propose an energy-efficient design scheme that optimizes energy consumption and hardware costs in VFI-based NoC systems. Since on-chip networks take up a substantial portion of system power budget in NoC-based systems, the proposed scheme uses communication-aware VFI partitioning and tile mapping/routing algorithms to minimize the inter-VFI communications. Experimental results show that the proposed design technique can reduce communication energy consumption by 32–51% over existing techniques and total energy consumption by 3–14%.

Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing power-efficient routing algorithms. Most of the existing cooperation-based routing algorithms are implemented by finding a shortest-path route first. As such, these routing algorithms do not fully exploit the merits of cooperative communications at the physical layer. In this paper, we propose a cooperation-based routing algorithm, namely, minimum power cooperative routing (MPCR) algorithm, which makes full use of the cooperative communications while constructing the minimum-power route. The MPCR algorithm constructs the minimum-power route as a cascade of the minimum-power single-relay building blocks from the source to the destination. Hence, any distributed shortest-path algorithm can be utilized to find the optimal route with polynomial complexity, while guaranteeing certain throughput. We show that the MPCR algorithm can achieve power saving of 57.36% compared to the conventional shortest-path routing algorithms. Furthermore, the MPCR algorithm can achieve power saving of 37.64% compared to the existing cooperative routing algorithms, in which the selected routes are constructed based on the noncooperative routes.