Static routing

About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.

Methods and systems for monitoring network routing

Abstract: The disclosed methods and systems include collecting routing data from a plurality of network routers (108), and collecting data across routers (104a, 106a) and across time to obtain network data. The network data can be streamed to a user (114) in real-time and the user (114) can interactively query the data. In one embodiment, interactive routing analyses, drill-down, and forensics can be performed using a repository of Border Gateway Protocol (BGP) (112) update traffic. Alarms can be set to detect selected routing problems. In setting the alarms, the message data for each router (104, 106) can be processed in timestamp order. Current message data from each router (104, 106) can be compared with previous message data to determine a condition status. An alarm can be provided when the condition status meets a temporal correlation criterion and/or spatial correlation criterion.

Global dynamic routing for scale-free networks

Abstract: Traffic is essential for many dynamic processes on networks. The efficient routing strategy [G. Yan, T. Zhou, B. Hu, Z. Q. Fu, and B. H. Wang, Phys. Rev. E 73, 046108 (2006)] can reach a very high capacity of more than ten times of that with shortest path strategy. In this paper, we propose a global dynamic routing strategy for network systems based on the information of the queue length of nodes. Under this routing strategy, the traffic capacity is further improved. With time delay of updating node queue lengths and the corresponding paths, the system capacity remains constant, while the travel time for packets increases.

Routing packets across multiple forwarding elements

Abstract: A modularized routing system includes a control element and forwarding elements, all of which are connected via a private network, for example, an Ethernet. The control element computes a routing table for each of the forwarding elements. Based on information in the routing table, a forwarding element decrements a time-to-live counter in the packet header only if the forwarding element is the first one in the routing system encountered by the packet. Accordingly, the forwarding elements preserve the behavior of a single router while using substantially the same routing protocols as the single router.

Energy-aware evolutionary routing protocol for dynamic clustering of wireless sensor networks

Abstract: The main challenges in designing and planning the operations of Wireless Sensor Networks (WSNs) are to optimize energy consumption and prolong network lifetime. Cluster-based routing techniques, such as the well-known low-energy adaptive clustering hierarchy (LEACH), are used to achieve scalable solutions and extend the network lifetime until the last node dies (LND). Also, evolutionary algorithms (EAs), have been successfully used in recent years as meta-heuristics to address energy-aware routing challenges by designing intelligent models that collaborate together to optimize an appropriate energy-aware objective function. On the other hand, some protocols, such as stable election protocol (SEP), are concerned with another objective: extending the stability time until the first node dies (FND). Often, there is a tradeoff between extending the time until FND and the time until LND. To our knowledge, no attempt has been made to obtain a better compromise between the stability time and network lifetime. This paper reformulates the design of the most important characteristic of the EA (i.e., the objective function), so as to obtain a routing protocol that can provide more robust results than the existing heuristic and meta-heuristic protocols in terms of network stability period, lifetime, and energy consumption. An evolutionary-based routing protocol is proposed, which can guarantee better tradeoff between the lifespan and the stability period of the network with efficient energy utilization. To support this claim, extensive simulations on 90 homogeneous and heterogeneous WSN models are evaluated and compared against the LEACH, SEP, and one of the existing evolutionary-based routing protocols, hierarchical clustering-algorithm-based genetic algorithm (HCR).

A family of fault-tolerant routing protocols for direct multiprocessor networks

Abstract: Our goal is to reconcile the conflicting demands of performance and fault-tolerance in interprocessor communication. To this end, we propose a pipelined communication mechanism-pipelined circuit-switching (PCS)-which is a variant of the well known wormhole routing (WR) mechanism. PCS relaxes some of the routing constraints imposed by WR and as a result enables routing behavior that cannot otherwise be realized. This paper presents a new class of adaptive routing algorithms-misrouting backtracking with m misroutes (MB-m). This class of routing algorithms is made possible by PCS. We provide an analysis of the performance and static fault-tolerant properties of MB-m. The results of an experimental evaluation of PCS and MB-3 are also presented. This methodology provides performance approaching that of WR, while realizing a level of resilience to static faults that is difficult to achieve with WR. >