Showing papers on "Multipath routing published in 2013"

A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects

Abstract: Delay tolerant networks (DTNs) may lack continuous network connectivity. Routing in DTNs is thus challenging since it must handle network partitioning, long delays, and dynamic topology in such networks. In recent years, social-based approaches, which attempt to exploit social behaviors of DTN nodes to make better routing decision, have drawn tremendous interests in DTN routing design. In this article, we summarize the social properties in DTNs, and provide a survey of recent social-based DTN routing approaches. To improve routing performance, these methods either take advantages of positive social characteristics such as community and friendship to assist packet forwarding or consider negative social characteristics such as selfishness. We conclude by discussing some open issues and challenges in social-based approaches regarding the design of DTN routing protocols.

Directional routing and scheduling for green vehicular delay tolerant networks

Abstract: The vehicle delay tolerant networks (DTNs) make opportunistic communications by utilizing the mobility of vehicles, where the node makes delay-tolerant based "carry and forward" mechanism to deliver the packets. The routing schemes for vehicle networks are challenging for varied network environment. Most of the existing DTN routing including routing for vehicular DTNs mainly focus on metrics such as delay, hop count and bandwidth, etc. A new focus in green communications is with the goal of saving energy by optimizing network performance and ultimately protecting the natural climate. The energy---efficient communication schemes designed for vehicular networks are imminent because of the pollution, energy consumption and heat dissipation. In this paper, we present a directional routing and scheduling scheme (DRSS) for green vehicle DTNs by using Nash Q-learning approach that can optimize the energy efficiency with the considerations of congestion, buffer and delay. Our scheme solves the routing and scheduling problem as a learning process by geographic routing and flow control toward the optimal direction. To speed up the learning process, our scheme uses a hybrid method with forwarding and replication according to traffic pattern. The DRSS algorithm explores the possible strategies, and then exploits the knowledge obtained to adapt its strategy and achieve the desired overall objective when considering the stochastic non-cooperative game in on-line multi-commodity routing situations. The simulation results of a vehicular DTN with predetermined mobility model show DRSS achieves good energy efficiency with learning ability, which can guarantee the delivery ratio within the delay bound.

VAPR: Void-Aware Pressure Routing for Underwater Sensor Networks

Abstract: Underwater mobile sensor networks have recently been proposed as a way to explore and observe the ocean, providing 4D (space and time) monitoring of underwater environments. We consider a specialized geographic routing problem called pressure routing that directs a packet to any sonobuoy on the surface based on depth information available from on-board pressure gauges. The main challenge of pressure routing in sparse underwater networks has been the efficient handling of 3D voids. In this respect, it was recently proven that the greedy stateless perimeter routing method, very popular in 2D networks, cannot be extended to void recovery in 3D networks. Available heuristics for 3D void recovery require expensive flooding. In this paper, we propose a Void-Aware Pressure Routing (VAPR) protocol that uses sequence number, hop count and depth information embedded in periodic beacons to set up next-hop direction and to build a directional trail to the closest sonobuoy. Using this trail, opportunistic directional forwarding can be efficiently performed even in the presence of voids. The contribution of this paper is twofold: a robust soft-state routing protocol that supports opportunistic directional forwarding; and a new framework to attain loop freedom in static and mobile underwater networks to guarantee packet delivery. Extensive simulation results show that VAPR outperforms existing solutions.

F10: a fault-tolerant engineered network

Abstract: The data center network is increasingly a cost, reliability and performance bottleneck for cloud computing. Although multi-tree topologies can provide scalable bandwidth and traditional routing algorithms can provide eventual fault tolerance, we argue that recovery speed can be dramatically improved through the co-design of the network topology, routing algorithm and failure detector. We create an engineered network and routing protocol that directly address the failure characteristics observed in data centers. At the core of our proposal is a novel network topology that has many of the same desirable properties as FatTrees, but with much better fault recovery properties. We then create a series of failover protocols that benefit from this topology and are designed to cascade and complement each other. The resulting system, F10, can almost instantaneously reestablish connectivity and load balance, even in the presence of multiple failures. Our results show that following network link and switch failures, F10 has less than 1/7th the packet loss of current schemes. A trace-driven evaluation of MapReduce performance shows that F10's lower packet loss yields a median application-level 30% speedup.

Multipath Routing Techniques in Wireless Sensor Networks: A Survey

Abstract: Multipath routing is an efficient technique to route data in wireless sensor networks (WSNs) because it can provide reliability, security and load balance, which are especially critical in the resource constrained system such as WSNs. In this paper we provide a survey of the state-of-the-art of proposed multipath routing protocols for WSNs, which are classified into three categories, infrastructure based, non-infrastructure based and coding based, based on the special techniques used in building multiple paths and delivering sensing data. For each category, we study the design of protocols, analyze the tradeoff of each design, and overview several representing protocols. In addition, we give a summery of design goals, challenges, and evaluation metrics for multipath routing protocols in resource constrained systems in general.

ALERT: An Anonymous Location-Based Efficient Routing Protocol in MANETs

Abstract: Mobile Ad Hoc Networks (MANETs) use anonymous routing protocols that hide node identities and/or routes from outside observers in order to provide anonymity protection. However, existing anonymous routing protocols relying on either hop-by-hop encryption or redundant traffic, either generate high cost or cannot provide full anonymity protection to data sources, destinations, and routes. The high cost exacerbates the inherent resource constraint problem in MANETs especially in multimedia wireless applications. To offer high anonymity protection at a low cost, we propose an Anonymous Location-based Efficient Routing proTocol (ALERT). ALERT dynamically partitions the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which form a nontraceable anonymous route. In addition, it hides the data initiator/receiver among many initiators/receivers to strengthen source and destination anonymity protection. Thus, ALERT offers anonymity protection to sources, destinations, and routes. It also has strategies to effectively counter intersection and timing attacks. We theoretically analyze ALERT in terms of anonymity and efficiency. Experimental results exhibit consistency with the theoretical analysis, and show that ALERT achieves better route anonymity protection and lower cost compared to other anonymous routing protocols. Also, ALERT achieves comparable routing efficiency to the GPSR geographical routing protocol.

NCTU-GR 2.0: Multithreaded Collision-Aware Global Routing With Bounded-Length Maze Routing

Abstract: Modern global routers employ various routing methods to improve routing speed and quality Maze routing is the most time-consuming process for existing global routing algorithms This paper presents two bounded-length maze routing (BLMR) algorithms (optimal-BLMR and heuristic-BLMR) that perform much faster routing than traditional maze routing algorithms In addition, a rectilinear Steiner minimum tree aware routing scheme is proposed to guide heuristic-BLMR and monotonic routing to build a routing tree with shorter wirelength This paper also proposes a parallel multithreaded collision-aware global router based on a previous sequential global router (SGR) Unlike the partitioning-based strategy, the proposed parallel router uses a task-based concurrency strategy Finally, a 3-D wirelength optimization technique is proposed to further refine the 3-D routing results Experimental results reveal that the proposed SGR uses less wirelength and runs faster than most of other state-of-the-art global routers with a different set of parameters , , , Compared to the proposed SGR, the proposed parallel router yields almost the same routing quality with average 271 and 312-fold speedup on overflow-free and hard-to-route cases, respectively, when running on a 4-core system

An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping

Abstract: In this paper, we investigate a routing problem arising in the last-mile delivery of small packages. The problem, called Multi-Depot Vehicle Routing Problem with Private fleet and Common carriers MDVRPPC, is an extension of the Multi-Depot Vehicle Routing Problem MDVRP where customers can either be served by the private fleet based at self-owned depots or by common carriers, i.e., subcontractors. We develop an effective Variable Neighborhood Search algorithm based on the use of cyclic-exchange neighborhoods that incorporates an adaptive mechanism to bias the random shaking step. The approach is successfully used to solve MDVRPPC as well as closely related problems, such as the MDVRP and the single-depot VRP with Private fleet and Common carriers VRPPC, obtaining high quality solutions within short computing time. Our extensive testing on these problems shows the positive impact of the adaptive mechanism with respect to a standard VNS algorithm.

Load balanced routing for low power and lossy networks

Abstract: The RPL routing protocol published in RFC 6550 was designed for efficient and reliable data collection in low-power and lossy networks. Specifically, it constructs a Destination Oriented Directed Acyclic Graph (DODAG) for data forwarding. However, due to the uneven deployment of sensor nodes in large areas, and the heterogeneous traffic patterns in the network, some sensor nodes may have much heavier workload in terms of packets forwarded than others. Such unbalanced workload distribution will result in these sensor nodes quickly exhausting their energy, and therefore shorten the overall network lifetime. In this paper, we propose a load balanced routing protocol based on the RPL protocol, named LB-RPL, to achieve balanced workload distribution in the network. Targeted at the low-power and lossy network environments, LB-RPL detects workload imbalance in a distributed and non-intrusive fashion. In addition, it optimizes the data forwarding path by jointly considering both workload distribution and link-layer communication qualities. We demonstrate the performance superiority of our LB-RPL protocol over original RPL through extensive simulations.

Dynamic survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks

Abstract: Compared to traditional wavelength division multiplexing (WDM) networks, orthogonal frequency division multiplexing (OFDM)-based flexible optical networks provide better spectral efficiency due to their flexible bandwidth allocation capability and fine granularity. Survivability is a crucial issue in OFDM-based flexible optical networks. Recently we proposed a new survivable multi-path provisioning scheme (MPP) that efficiently supports demands with flexible protection requirement in OFDM-based optical networks and studied the static survivable multipath routing and spectrum allocation (SM-RSA) problem, which aims to accommodate a given set of demands with minimum utilized spectrum. We have showed that the MPP scheme achieves higher spectral efficiency than the traditional single-path provisioning (SPP) scheme. In this paper, we study the dynamic SM-RSA problem, which selects multiple routes and allocates spectrum on these routes for a given demand as it arrives at the network. We develop an integer linear programming (ILP) model as well as a heuristic algorithm for the dynamic SM-RSA problem. We conduct simulations to study the advantage of MPP over SPP for the dynamic traffic scenario in terms of blocking performance and fairness. We also compare the performance of the MPP heuristic algorithm and the ILP model.

Efficient Random Route Mutation considering flow and network constraints

Abstract: In the current network protocol infrastructure, forwarding routes are mostly static except in case of failures or performance issues. However, static route selection offers a significant advantage for adversaries to eavesdrop, or launch DoS attacks on certain network flows. Previous works on multipath routing in wireless networks propose using random forwarding to avoid jamming and blackhole attacks [18]. However, this work is far from being practical for wired network because of many topological and QoS constraints. Moreover, the potential of finding a significant number of disjoint paths in wired networks is extremely low, which consequently decreases the value of RRM. In this paper we present a proactive Random Route Mutation (RRM) technique that enables changing randomly the route of the multiple flows in a network simultaneously to defend against reconnaissance, eavesdrop and DoS attacks, while preserving end-to-end QoS properties. Our contributions in this paper are three-fold: (1) modeling RRM as a constraint satisfaction problem using Satisfiability Modulo Theories (SMT) to identify efficient practical route mutations, (2) proposing a new overlay placement technique that can maximize the effectiveness of RRM in visualized networks, and (3) developing analytical and experimental models to measure the effectiveness of RRM under different adversary models and network parameters. We develop a prototype RRM implementation in Software Defined Networks (SDNs). Our analysis, simulation and preliminary implementation show that RRM can protect at least 90% of the packet flow from being attacked against realistic attackers, as compared with static routes. Our evaluation study also shows that RRM can be efficiently deployed on both conventional networks and SDNs without causing any significant disruption for active flows.

I-LEACH: An efficient routing algorithm to improve performance & to reduce energy consumption in Wireless Sensor Networks

Abstract: A large amount of energy in nodes of a Wireless Sensor Network (WSN) is consumed due to the inner-network communications. In this paper, an energy efficient routing algorithm is proposed which saves a significant portion of inner-network communications energy. To do this, the proposed routing algorithm selects sensor nodes with higher residual energy, more neighbors, and lower distance from the Base Station (BS) as Cluster Head (CH) nodes. Then, it manages sensor nodes appropriately and constructs clusters such a way to maximize WSN lifetime and minimize average energy dissipation per each sensor node. To evaluate the proposed routing algorithm, various simulations have been carried out by using of MATLAB simulator. The proposed routing algorithm is compared to the previous proposed algorithms e.g., LEACH, DBS, and LEACH-C algorithms. Results of the simulations show that the proposed routing algorithm has been improved the WSN performance at least 65%, reduces the energy consumption of the WSN up to 62%, and improves the successfully delivered packet ratio by at least 56% as compared to the previous routing algorithms.

Efficient and secure routing protocol for wireless sensor networks through SNR based dynamic clustering mechanisms

Abstract: Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

A Novel Trust-Aware Geographical Routing Scheme for Wireless Sensor Networks

Abstract: Wireless sensor networks are vulnerable to a wide set of security attacks, including those targeting the routing protocol functionality. The applicability of legacy security solutions is disputable (if not infeasible), due to severe restrictions in node and network resources. Although confidentiality, integrity and authentication measures assist in preventing specific types of attacks, they come at high cost and, in most cases, cannot shield against routing attacks. To face this problem, we propose a secure routing protocol which adopts the geographical routing principle to cope with the network dimensions, and relies on a distributed trust model for the detection and avoidance of malicious neighbours. A novel function which adaptively weights location, trust and energy information drives the routing decisions, allowing for shifting emphasis from security to path optimality. The proposed trust model relies on both direct and indirect observations to derive the trustworthiness of each neighboring node, while it is capable of defending against an increased set of routing attacks including attacks targeting the indirect trust management scheme. Extensive simulation results reveal the advantages of the proposed model.

Routing protocol based on genetic algorithm for energy harvesting-wireless sensor networks

Abstract: Traditional routing protocols are no longer suitable for the energy harvesting-wireless sensor networks (EH-WSN), which is powered by the energy harvested from environment instead of batteries. Rather than minimising the energy consumption and maximising the network lifetime, the main challenge in EH-WSN is to maximise its working performance under energy harvesting constraints. In this study, the authors propose a centralised power efficient routing algorithm energy harvesting genetic-based unequal clustering-optimal adaptive performance routing algorithm (EHGUC-OAPR) which contains two parts: (i) energy harvesting genetic-based unequal clustering algorithm EHGUC and (ii) optimal adaptive performance routing algorithm (OAPR). First, the base station (BS) uses EHGUC algorithm to form clusters of unequal size and select associated cluster heads, in which the clusters closer to the BS have smaller size. Then, the BS adopts OAPR algorithm to construct an optimal routing among each cluster heads. The numerical results show that EHGUC-OAPR is not only well applied to EH-WSN, but also has a great improvement in network energy balance and data delivery ratio.

SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping

Abstract: Delay tolerant networks (DTN) are characterized by a lack of continuous end-to-end connections due to node mobility, constrained power sources, and limited data storage space of some or all of its nodes. To overcome the frequent disconnections, DTN nodes are required to store data packets for long periods of time until they come near other nodes. Moreover, to increase the delivery probability, they spread multiple copies of the same packet on the network so that one of them reaches the destination. Given the limited storage and energy resources of many DTN nodes, there is a tradeoff between maximizing delivery and minimizing storage and energy consumption. In this paper, we study the routing problem in DTN with limited resources. We formulate a mathematical model for optimal routing, assuming the presence of a global observer that can collect information about all the nodes in the network. Next, we propose a new protocol based on social grouping among the nodes to maximize data delivery while minimizing network overhead by efficiently spreading the packet copies in the network. We compare the new protocol with the optimal results and the existing well-known routing protocols using real life simulations. Results show that the proposed protocol achieves higher delivery ratio and less average delay compared to other protocols with significant reduction in network overhead.

LABERIO: Dynamic load-balanced Routing in OpenFlow-enabled Networks

Abstract: In data center networks, how to balance workloads is a key issue with the fast growth of network applications. Open Flow protocol, which is a competitive candidate for solving the problem, provides each user the programmatic control for specific flows, so as to determine their paths through a network. However, existing solutions based on Open Flow only try to find a static routing path during initialization step while the static routing path often suffers from poor performance since the network configuration may change during the data transmission. To solve the problem, this paper proposes LABERIO, a novel path-switching algorithm, to balance the traffic dynamically during the transmission. Experiments on two kinds of network architectures demonstrate that LABERIO outperform other typical load balancing algorithms like Round Robin and LOBUS by reducing up to 13% transmission time.

GAR: An Energy Efficient GA-Based Routing for Wireless Sensor Networks

Abstract: Routing with energy consideration has paid enormous attention in the field of Wireless Sensor Networks (WSNs). In Some WSNs, some high energy sensors called relay nodes are responsible to route the data towards a base station. Reducing energy consumption of these relay nodes allow us to prolong the lifetime and coverage of the WSN. In this paper, we present a Genetic algorithm based routing scheme called GAR (Genetic Algorithm-based Routing) that considers the energy consumption issues by minimizing the total distance travelled by the data in every round. Our GA based approach can quickly compute a new routing schedule based on the current network state. The scheme uses the advantage of computational efficiency of GA to quickly find out a solution to the problem. The experimental results demonstrate that the proposed algorithm is better than the existing techniques in terms of network life time, energy consumption and the total distance covered in each round.

Greedy Routing in Underwater Acoustic Sensor Networks: A Survey

Abstract: Due to the significant advances of wireless sensor networks (WSNs), researchers are eager to use this technology in the subsea applications. Because of rapid absorption of high radio frequency in the water, acoustic waves are used as communication medium, which pose new challenges, including high propagation delay, high path loss, low bandwidth, and high-energy consumption. Because of these challenges and high movement of nodes by water flow, end-to-end routing methods used in most of existing routing protocols in WSNs are not applicable to underwater environments. Therefore, new routing protocols have been developed for underwater acoustic sensor networks (UWASNs) in which most of the routing protocols take advantage of greedy routing. Due to inapplicability of global positioning system (GPS) in underwater environments, finding location information of nodes is too costly. Therefore, based on a need for location information, we divided the existing greedy routing protocols into two distinctive categories, namely, location-based and location-free protocols. In addition, location-free category is divided into two subcategories based on method of collecting essential information for greedy routing, including beacon-based and pressure-based protocols. Furthermore, a number of famous routing protocols belonging to each category are reviewed, and their advantages and disadvantages are discussed. Finally, these protocols are compared with each other based on their features.

Dynamic Multi-Path Service Provisioning under Differential Delay Constraint in Elastic Optical Networks

Abstract: Optical orthogonal frequency-division multiplexing (O-OFDM) technology has the elastic feature of allocating spectrum resources based on subcarrier slots with bandwidths at a few GHz or even narrower. This feature enables us to utilize link capacity more efficiently by splitting a connection's traffic over multiple routing paths. In this paper, we propose a novel dynamic multi-path provisioning algorithm for O-OFDM based elastic optical networks. The algorithm tries to set up dynamic connections with single-path routing in a best-effort manner. When a connection cannot be served with a single routing path, the algorithm uses an auxiliary-graph based approach to calculate a multi-path provisioning scheme based on two parameters, i.e., the differential delay upper-bound and the bandwidth allocation granularity. Simulation results indicate that compared with several existing single-path provisioning algorithms, the proposed algorithm provides lower bandwidth blocking probability and achieves 10-18% improvement on average network throughput.

Back-pressure-based packet-by-packet adaptive routing in communication networks

Abstract: Back-pressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, we develop a new adaptive routing algorithm built upon the widely studied back-pressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing-coding tradeoff.

Joint Host-Network Optimization for Energy-Efficient Data Center Networking

Abstract: Data centers consume significant amounts of energy. As severs become more energy efficient with various energy saving techniques, the data center network (DCN) has been accounting for 20% or more of the energy consumed by the entire data center. While DCNs are typically provisioned with full bisection bandwidth, DCN traffic demonstrates fluctuating patterns. The objective of this work is to improve the energy efficiency of DCNs during off-peak traffic time by powering off idle devices. Although there exist a number of energy optimization solutions for DCNs, they consider only either the hosts or network, but not both. In this paper, we propose a joint optimization scheme that simultaneously optimizes virtual machine (VM) placement and network flow routing to maximize energy savings, and we also build an OpenFlow based prototype to experimentally demonstrate the effectiveness of our design. First, we formulate the joint optimization problem as an integer linear program, but it is not a practical solution due to high complexity. To practically and effectively combine host and network based optimization, we present a unified representation method that converts the VM placement problem to a routing problem. In addition, to accelerate processing the large number of servers and an even larger number of VMs, we describe a parallelization approach that divides the DCN into clusters for parallel processing. Further, to quickly find efficient paths for flows, we propose a fast topology oriented multipath routing algorithm that uses depth-first search to quickly traverse between hierarchical switch layers and uses the best-fit criterion to maximize flow consolidation. Finally, we have conducted extensive simulations and experiments to compare our design with existing ones. The simulation and experiment results fully demonstrate that our design outperforms existing hostor network-only optimization solutions, and well approximates the ideal linear program.

A Branch-Cut-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands

Abstract: Abstract This paper proposes a state-of-the-art branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (VRPSD). We adapt the model of Christiansen and Lysgaard [6] and formulate the VRPSD as a set partitioning model with additional constraints. Feasible routes are generated using a dynamic programming algorithm executed over a state-space graph. Our method combines 2-cycle elimination with ng -routes. In addition, our pricing problem is significantly accelerated by the introduction of a new aggregate dominance rule. To speed up the generation of negative reduced cost columns, we use a tabu search heuristic and a bidirectional labeling algorithm. We also add capacity and subset-row inequalities dynamically in order to strengthen the linear relaxation of the master problem. As extensive computational tests illustrate, our algorithm is very competitive with the one of [6] . We solve 20 additional instances from the 40-instance set considered by these authors and we considerably improve the computing times for instances already closed. We also solve 17 new instances from the literature.

A Review on Hierarchical Routing Protocols for Wireless Sensor Networks

Abstract: The routing protocol for Wireless Sensor Networks (WSNs) is defined as the manner of data dissemination from the network field (source) to the base station (destination). Based on the network topology, there are two types of routing protocols in WSNs, they are namely flat routing protocols and hierarchical routing protocols. Hierarchical routing protocols (HRPs) are more energy efficient and scalable compared to flat routing protocols. This paper discusses how topology management and network application influence the performance of cluster-based and chain-based hierarchical networks. It reviews the basic features of sensor connectivity issues such as power control in topology set-up, sleep/idle pairing and data transmission control that are used in five common HRPs, and it also examines their impact on the protocol performance. A good picture of their respective performances give an indication how network applications, i.e whether reactive or proactive, and topology management i.e. whether centralized or distributed would determine the network performance. Finally, from the ensuring discussion, it is shown that the chain-based HRPs guarantee a longer network lifetime compared to cluster-based HRPs by three to five times.

The cognitive NET is coming

Abstract: The Internet will break down without new biologically inspired routing. The future Internet will need smarter routing algorithms to handle diverse data flows and prevent failures. Although there are no tried-and-true solutions yet, early designs might follow an architecture like this one.