Equal-cost multi-path routing

About: Equal-cost multi-path routing is a research topic. Over the lifetime, 10472 publications have been published within this topic receiving 249362 citations.

Placement and Routing for Performance-Oriented FPGA layout.

Abstract: This paper presents a performance-oriented placement and routing tool for field-programmable gate arrays. Using recursive geometric partitioning for simultaneous placement and global routing, and a graph-based strategy for detailed routing, our tool optimizes source-sink pathlengths, channel width and total wirelength. Our results compare favorably with other FPGA layout tools, as measured by the maximum channel width required to place and route several benchmarks.

Method and system for efficient routing in ad hoc networks

Abstract: The present invention relates to a method for efficient routing in a multiple hop wireless communication network. The invention is characterized in that data packets are routed over transmission paths using the following steps providing link status information by acquiring link status quality between nodes in the network, updating a routing element (101) with said link status information, determining possible routes with essentially similar link quality status for said data packet, and routing said data packet via the determined routes.

Low-Rate TCP-Targeted DoS Attack Disrupts Internet Routing.

Abstract: Compared to attacks against end hosts, Denial of Service (DoS) attacks against the Internet infrastructure such as those targeted at routers can be more devastating due to their global impact on many networks. We discover that the recently identified low-rate TCP-targeted DoS attacks can have severe impact on the Border Gateway Protocol (BGP). As the interdomain routing protocol on today’s Internet, BGP is the critical infrastructure for exchanging reachability information across the global Internet. We demonstrate empirically that BGP routing sessions on the current commercial routers are susceptible to such low-rate attacks launched remotely, leading to session resets and delayed routing convergence, seriously impacting routing stability and network reachability. This is a result of a fundamental weakness with today’s deployed routing protocols: there is often no protection in the form of guaranteed bandwidth for routing traffic. Using testbed and Internet experiments, we thoroughly study the effect of such attacks on BGP. We demonstrate the feasibility of launching the attack in a coordinated fashion from wide-area hosts with arbitrarily lowrate individual attack flows, further raising the difficulty of detection. We explore defense solutions by protecting routing traffic using existing router support. Our findings highlight the importance of protecting the Internet infrastructure, in particular control plane packets.

A fault-tolerant routing strategy in hypercube multicomputers

Abstract: We investigate fault-tolerant routing which aims at finding feasible minimum paths in a faulty hypercube. The concept of unsafe node and its extension are used in our scheme. A set of stringent criteria is proposed to identify the possibly bad candidates for forwarding a message. As a result, the number of such undesirable nodes is reduced without sacrificing the functionality of the mechanism. Furthermore, the notion of degree of unsafeness for classifying the unsafe nodes is introduced to facilitate the design of efficient routing algorithms which rely on having each node keep the states of its nearest neighbors. We show that a feasible path of length no more than the Hamming distance between the source and the destination plus four can always be established by the routing algorithm as long as the hypercube is not fully unsafe. The issue of deadlock freeness is also addressed in this research. More importantly, another fault-tolerant routing algorithm, which requires only a constant of five virtual networks in wormhole routing to ensure the property of deadlock freeness for a hypercube of any size, is presented in this paper.

Methods, systems, and computer readable media for providing dynamic origination-based routing key registration in a diameter network

Abstract: Methods, systems, and computer readable media for providing dynamic origination-based routing key registration in a DIAMETER network are disclosed. According to one method, origin-based routing information is received, at a first DIAMETER node, from a second DIAMETER node. The origin-based routing information specifies one or more sources such that traffic originating from one of the one or more sources should be routed to the second DIAMETER node. A routing rule is automatically generated, at he first DIAMETER node, based on the received origin-based routing information.