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
27 Aug 2007
TL;DR: RAPID is presented, an intentional DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency or the fraction of packets that are delivered within a deadline and significantly outperforms existing routing protocols for several metrics.
Abstract: Many DTN routing protocols use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, so these approaches have only an incidental effect on such routing metrics as maximum or average delivery latency. In this paper, we present RAPID, an intentional DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency or the fraction of packets that are delivered within a deadline. The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into per-packet utilities which determine how packets should be replicated in the system.We evaluate RAPID rigorously through a prototype of RAPID deployed over a vehicular DTN testbed of 40 buses and simulations based on real traces. To our knowledge, this is the first paper to report on a routing protocol deployed on a real DTN at this scale. Our results suggest that RAPID significantly outperforms existing routing protocols for several metrics. We also show empirically that for small loads RAPID is within 10% of the optimal performance.
1,078 citations
TL;DR: This survey classifies routing problems from the perspective of information quality and evolution and presents a comprehensive review of applications and solution methods for dynamic vehicle routing problems.
1,066 citations
Journal Article•
1,046 citations
01 Jan 2008
TL;DR: In this article, the authors present a survey of the state-of-the-art approaches for solving the Capacitated Vehicle Routing Problem on trees and using a genetic algorithm to solve the generalized orienteering problem.
Abstract: Overviews and Surveys- Routing a Heterogeneous Fleet of Vehicles- A Decade of Capacitated Arc Routing- Inventory Routing- The Period Vehicle Routing Problem and its Extensions- The Split Delivery Vehicle Routing Problem: A Survey- Challenges and Advances in A Priori Routing- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography- Parallel Solution Methods for Vehicle Routing Problems- Recent Developments in Dynamic Vehicle Routing Systems- New Directions in Modeling and Algorithms- Online Vehicle Routing Problems: A Survey- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems- Challenges and Opportunities in Attended Home Delivery- Chvatal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows- Vehicle Routing Problems with Inter-Tour Resource Constraints- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods- Practical Applications- Vehicle Routing for Small Package Delivery and Pickup Services- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network- Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation- Vehicle Routing Problems and Container Terminal Operations - An Update of Research
976 citations
30 Aug 2004
TL;DR: A detailed, empirical evaluation of the performance of three link-quality metrics---ETX, per-hop RTT, andper-hop packet pair---and compare them against minimum hop count finds that the ETX metric has the best performance when all nodes are stationary and the hop-count metric outperforms all of the link- quality metrics in a scenario where the sender is mobile.
Abstract: Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly taking the quality of the wireless links into account. In this paper, we conduct a detailed, empirical evaluation of the performance of three link-quality metrics---ETX, per-hop RTT, and per-hop packet pair---and compare them against minimum hop count. We study these metrics using a DSR-based routing protocol running in a wireless testbed. We find that the ETX metric has the best performance when all nodes are stationary. We also find that the per-hop RTT and per-hop packet-pair metrics perform poorly due to self-interference. Interestingly, the hop-count metric outperforms all of the link-quality metrics in a scenario where the sender is mobile.
965 citations