Topic
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.
Papers published on a yearly basis
Papers
More filters
Patent•
31 Jul 2006TL;DR: In this paper, a telephone number mapping query associated with a call is generated and forwarded to a control device to bypass a core portion of an Internet multimedia subsystem (IMS) when a calling party associated with the call does not invoke an IMS service.
Abstract: A method includes receiving a telephone number mapping query associated with a call. The method may also include generating routing information based on the query and forwarding the routing information to a control device. The routing information may indicate that processing associated with routing the call is to bypass a core portion of an Internet multimedia subsystem (IMS) when a calling party associated with the call does not invoke an IMS service, the called party associated with the call does not invoke an IMS service and the called party is not an IMS subscriber.
133 citations
21 Mar 1999
TL;DR: An implementation of QoS routing extensions to the open shortest path first (OSPF) routing protocol is discussed and its performance over a wide range of operating conditions is evaluated to establish strong empirical evidence that the cost ofQoS routing is well within the limits of modern technology and can be justified by the performance improvements.
Abstract: We discuss an implementation of QoS routing extensions to the open shortest path first (OSPF) routing protocol and evaluate its performance over a wide range of operating conditions. Our evaluations are aimed at assessing the cost and feasibility of QoS routing in IP networks. The results provide insight into the respective weights of the two major components of QoS routing costs, processing cost and protocol overhead and establish strong empirical evidence that the cost of QoS routing is well within the limits of modern technology and can be justified by the performance improvements.
133 citations
07 Nov 2002
TL;DR: Using a route's path information, two consistency assertions for path vector routing algorithms are developed that are used to compare similar routes and identify infeasible routes, resulting in substantial reduction in both BGP convergence time and the total number of intermediate route changes.
Abstract: This paper presents a new mechanism for improving the convergence properties of path vector routing algorithms, such as BGP. Using a route's path information, we develop two consistency assertions for path vector routing algorithms that are used to compare similar routes and identify infeasible routes. To apply these assertions in BGP, mechanisms to signal failure/policy withdrawal, and traffic engineering are provided. Our approach was implemented and deployed in a BGP testbed and evaluated using simulation. By identifying and ignoring the infeasible routes, we achieved substantial reduction in both BGP convergence time and the total number of intermediate route changes.
132 citations
Patent•
26 Nov 2008
TL;DR: In this article, the routing node examines a portion of a data payload of a received message based on the offset and routes the message to each of the group of interested nodes if the information at the offset matches the criteria associated with the offset.
Abstract: A message routing method includes receiving a plurality of messages at a routing node. The routing node is configured to receive instructions indicating an offset, criteria associated with the offset, and a group of interested nodes. The routing node examines a portion of a data payload of a received message based on the offset. If the information at the offset matches the criteria, the routing node routes the message to each of the group of interested nodes. Thus, the routing node can route messages to different groups of destination nodes depending on information in the data payload of received messages, thereby providing a flexible way to route messages over a network.
132 citations
20 Jun 2009
TL;DR: This paper introduces indirect global adaptive routing (IAR) in which the adaptive routing decision uses information that is not directly available at the source router, and describes four IAR routing methods: credit round trip (CRT), progressive adaptive routing, piggyback routing (PB), and reservation routing (RES).
Abstract: Recently proposed high-radix interconnection networks [10] require global adaptive routing to achieve optimum performance. Existing direct adaptive routing methods are slow to sense congestion remote from the source router and hence misroute many packets before such congestion is detected. This paper introduces indirect global adaptive routing (IAR) in which the adaptive routing decision uses information that is not directly available at the source router. We describe four IAR routing methods: credit round trip (CRT) [10], progressive adaptive routing (PAR), piggyback routing (PB), and reservation routing (RES). We evaluate each of these methods on the dragonfly topology under both steady-state and transient loads. Our results show that PB, PAR, and CRT all achieve good performance. PB provides the best absolute performance, with 2-7% lower latency on steady-state uniform random traffic at 70% load, while PAR provides the fastest response on transient loads. We also evaluate the implementation costs of the indirect adaptive routing methods and show that PB has the lowest implementation cost requiring
132 citations