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.

Data center without structural bottlenecks

Abstract: A method of networking a plurality of servers together within a data center is disclosed. The method includes the step of addressing a data packet for delivery to a destination server by providing the destination server address as a flat address. The method further includes the steps of obtaining routing information required to route the packet to the destination server. This routing information may be obtained from a directory service servicing the plurality of servers. Once the routing information is obtained, the data packet may be routed to the destination server according to the flat address of the destination server and routing information obtained from the directory service.

Method and system for static trill routing

Abstract: A method and system for static routing in a TRILL network is disclosed. Routing bridges in the TRILL network use LLDP discovery to identify their next hop routing bridges. A data packet, with an inner header specifying a MAC address of a destination host, is sent by a source host and received by an ingress routing bridge. The ingress routing bridge encapsulates the data packet with a TRILL header and an outer header and sends the data packet to a next hop routing bridge on path to the destination host. The next hop routing bridge determines it is not the egress routing bridge for the data packet and sends the data packet onward to the egress routing bridge. The egress routing bridge decapsulates the data packet and forwards the data packet to the destination host specified in the inner header.

Performance Study of Node-Disjoint Multipath Routing in Vehicular Ad Hoc Networks

Abstract: Many multipath routing schemes have recently been proposed to improve the performance of wireless networks. Multipath routing is supposed to reduce the end-to-end packet delay and increase the packet delivery ratio. Therefore, it can also improve the packet delivery ratio in vehicular ad hoc networks (VANETs) when the mobility of relaying vehicles is unknown. However, in wireless networks, multiple paths are exposed to mutual interference or path coupling, which impairs efficiency. The intriguing question is whether the node-disjoint multipath routing really helps. In this paper, we examine the performance of node-disjoint multipath routing in VANETs. Through extensive simulations, we explore the effect of mutual interference on the behavior of node-disjoint paths. It is shown that whether node-disjoint paths are able to improve performance, compared with the single path, is determined by path coupling and the source-destination distance. Results show that node-disjoint multipath routing can be applied to VANETs to substantially improve performance in terms of delay and packet delivery probability only if the node-disjoint paths are properly chosen.

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.

Adaptive multipath routing for dynamic traffic engineering

Abstract: This paper proposes adaptive multi-path routing (AMP) as a simple algorithm for dynamic traffic engineering within autonomous systems. In contrast to related multipath routing proposals, AMP does not employ a global perspective of the network in each node. It restricts available information to a local scope, which opens the potential of reducing signaling overhead and memory consumption in routers. Having implemented AMP in ns-2, the algorithm is compared to standard routing strategies for a realistic simulation scenario. The results demonstrate the stability of AMP as well as the significant performance gains achieved.