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.

Routing around decoys

Abstract: Decoy Routing is a new approach to Internet censorship circumvention that was recently and independently proposed at FOCI'11, USENIX Security'11 and CCS'11. Decoy routing aims to hamper nation-state level Internet censorship by having routers, rather than end hosts, relay traffic to blocked destinations. We analyze the security of these schemes against a routing capable adversary, a censoring authority that is willing to make routing decisions in response to decoy routing systems.We explore China, Syria, Iran, and Egypt as routing capable adversaries, and evaluate several attacks that defeat the security goals of existing decoy routing proposals. In particular, we show that a routing capable adversary can enumerate the participating routers implementing these protocols; can successfully avoid sending traffic along routes containing these routers with little or no adverse effects; can identify users of these schemes through active and passive attacks; and in some cases can probabilistically identify connections to targeted destinations.

Understanding network delay changes caused by routing events

Abstract: Network delays and delay variations are two of the most important network performance metrics directly impacting real-time applications such as voice over IP and time-critical financial transactions. This importance is illustrated by past work on understanding the delay constancy of Internet paths and recent work on predicting network delays using virtual coordinate systems. Merely understanding currently observed delays is insufficient, as network performance can degrade not only due to traffic variability but also as a result of routing changes. Unfortunately this latter effect so far has been ignored in understanding and predicting delay related performance metrics of Internet paths. Our work is the first to address this short coming by systematically analyzing changes in network delays and jitter of a diverse and comprehensive set of Internet paths. Using empirical measurements, we illustrate that routing changes can result in roundtrip delay increase of converged paths by more than 1 second. Surprisingly, intradomain routing changes can also cause such large delay increase. Given these observations, we develop a framework to analyze in detail the impact of routing changes on network delays between end-hosts. Using topology information and properties associated with routing changes, we explain the causes for observed delay fluctuations and more importantly identify routing changes that lead to predictable effects on delay-related metrics. Using our framework, we study the predictability of delay and jitter changes in response to both passively observed interdomain and actively measured intradomain routing changes.

A fast IP routing lookup scheme for gigabit switching routers

Abstract: One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix matching on the address lookup in order to determine the packet's next hop. This paper presents a fast route lookup mechanism that only needs tiny SRAM and can be implemented in a pipelined skill in hardware. Based on the proposed scheme, the forwarding table is tiny enough to fit in SRAM with very low cost. For example, a large routing table with 40,000 routing entries can be compacted to a forwarding table of 450-470 Kbytes. In the worst case, the number of memory accesses for a lookup is three. When implemented in a pipeline skill in hardware, the proposed mechanism can achieve one routing lookup every memory access. With current 10 ns SRAM, this mechanism furnishes approximately 100 million routing lookups per second. This is much faster than any current commercially available routing lookup schemes.

Distributed address mapping and routing table mechanism that supports flexible configuration and partitioning in a modular switch-based, shared-memory multiprocessor computer system

Abstract: A distributed address mapping and routing technique supports flexible configuration and partitioning in a modular, shared memory multiprocessor system having a plurality of multiprocessor building blocks interconnected by a switch fabric. The technique generally employs physical-to-logical address translation mapping in conjunction with source routing. Mapping operations, such as address range or processor identifier operations, used to determine a routing path through the switch fabric for a message issued by a source multiprocessor building block are resolved through the generation of a routing word. That is, each message transmitted by a source multiprocessor building block over the switch fabric has an appended routing word that specifies the routing path of the message through the fabric.

State-dependent routing for telephone traffic: Theory and results

Abstract: In the modern telephone network, it has become feasible to consider sophisticated call-routing schemes in order to minimize network blocking --- in particular, routing schemes which select a route for a call on the basis of the network 'state' at the time of call-arrival. In this paper, we construct an analytical model for such state-dependent routing in the framework of Markov decision processes, and derive a simple state-dependent routing scheme called 'separable' routing. The performance of this routing scheme in two network designs for a metropolitan network model is compared over a range of loads, by means of call-by-call simulations of traffic flow, with that of two other schemes: the 'sequential' routing used in the Dynamic Non-Hierarchical Routing (DNHR) network, and the 'Least-Loaded Routing' (LLR) proposed for the Trunk Status Map. In one case, separable routing achieves lower network blocking than the other schemes at normal load and overloads, while, in the other case, the improvement occurs only above a certain level of overload. However, a modified version of separable routing (to be presented in a future paper) achieves better performance than the other schemes in both networks over the entire range of loads.