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.

On characterizing BGP routing table growth

Abstract: BGP routing table sizes have increased by an order of magnitude over the last six years. This dramatic growth can decrease packet forwarding speed and demand more router memory space. We explore the extent that various factors contribute to the routing table size and characterize the growth of each contribution. We begin with a measurement study using the routing tables of an Oregon route views server to determine the contributions of multi-homing, load balancing, address fragmentation, and failure-to-aggregate to routing table size. Address fragmentation makes the greatest contribution and it is three times those of multihoming or load balancing. The contribution of failure-to-aggregate is the least. Although multihoming and load balancing contribute less to routing table size than address fragmentation, we observe that their contributions grow faster than the routing table does and that load balancing has surpassed multihoming, becoming the fastest growing contributor. Moreover, we find that both load balancing and multihoming contribute to routing table growth by introducing more prefixes of length between 17 and 25, which are the fastest growing prefixes. Next, we examine the growth routable IP addresses, and conclude that their growth is much slower than that of routing table size. Lastly, we demonstrate that our findings based on views derived from the Oregon server are accurate through an evaluation using 15 additional routing tables collected from different locations in the Internet.

EECOR: An Energy-Efficient Cooperative Opportunistic Routing Protocol for Underwater Acoustic Sensor Networks

Abstract: Underwater acoustic sensor networks (UW-ASNs) have recently been proposed for exploring the underwater resources and gathering the scientific data from the aquatic environments. UW-ASNs are faced with different challenges, such as high propagation delay, low bandwidth, and high energy consumption. However, the most notable challenge is perhaps how to efficiently forward the packets to the surface sink by considering the energy constrained sensor devices. The opportunistic routing concept may provide an effective solution for the UW-ASNs by the cooperation of the relay nodes to forward the packets to the surface sink. In this paper, the energy consumption problem is addressed and an energy-efficient cooperative opportunistic routing (EECOR) protocol is proposed to forward the packets toward the surface sink. In the EECOR protocol, a forwarding relay set is firstly determined by the source node based on the local information of the forwarder and then, a fuzzy logic-based relay selection scheme is applied to select the best relay based on considering the energy consumption ratio and the packet delivery probability of the forwarder. In the UW-ASNs, most of the energy is wasted due to the collisions amongst sensor nodes during the packet transmission. To alleviate the packet collisions problem, we have designed a holding timer for each of the forwarder to schedule the packets transmission toward the surface sink. We have performed our extensive simulations of the EECOR protocol on the Aqua-sim platform and compared with existing routing protocols in terms of average packet delivery ratio, average end-to-end delay, average energy consumption, and average network lifetime.

Feedback based routing

Abstract: In this paper, we describe the problems that affect availability in BGP, such as vulnerability to attacks, slow convergence time, and lack of scalability. These problems arise from the basic assumption of BGP: every router has to cooperate to make routing work. We propose a new routing system, feedback based routing, which bifurcates structural information and dynamic information. Only structural information is propagated. Dynamic information is discovered by the routers based on feedback and probes. Routing decisions are made based on the dynamic information. We argue that this system is resilient to minority compromises in the infrastructure, provides higher availability than BGP, and can scale to the size of the Internet of the future.

High performance fault tolerant switching system for multimedia satellite and terrestrial communications networks

Abstract: A switch that has a plurality of inputs in which cells are received at these inputs. Each cell received at the inputs of the switch contain routing information. A routing means is employed to route the cells received at the inputs of the switch to outputs using routing information in which a number of the cells are misrouted by the routing means during the process of routing the cells to the outputs. Bus means is employed to route a cell to the destination in which the bus means is connected to the routing means. The bus means routes misrouted cells that are misrouted from the destination by some selected amount.

Quality-of-service routing using maximally disjoint paths

Abstract: We apply and evaluate a new efficient algorithm for finding maximally link disjoint pairs of paths in a network. We apply this algorithm for QoS routing in connection-oriented networks that support calls with multiple QoS requirements. Our algorithm (called MADSWIP) is applied for precomputing paths in advance of call arrivals. Through simulations, we compare our QoS routing method to another method that is typical of what a switch vendor might implement today. We then examine the performance of three different policies for selecting a path among multiple potential paths. We also study the effects of decreasing the density of a network topology. We study two styles of topologies: commercial-style and random topologies. We demonstrate that precomputing paths that have minimal overlap is more important than precomputing paths that explicitly address all QoS metrics in a network. We also show that load balancing policies outperform call packing policies in networks that support diverse applications.