Results 1  10
of
77,696
EDGE–DISJOINT PATHS IN PERMUTATION GRAPHS
"... In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(V + E)) algorithm to s ..."
Abstract
 Add to MetaCart
In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(V + E)) algorithm
Approximation algorithms for edgedisjoint paths and unsplittable flow
 Efficient Approximation and Online Algorithms
, 2006
"... Abstract. In the maximum edgedisjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edgedisjoint paths. We give a survey of known results about the complexity and approximability of MEDP ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In the maximum edgedisjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edgedisjoint paths. We give a survey of known results about the complexity and approximability of MEDP
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 678 (27 self)
 Add to MetaCart
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route
Routing in a delay tolerant network
 Proceedings of ACM Sigcomm
, 2004
"... We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con ..."
Abstract

Cited by 612 (8 self)
 Add to MetaCart
that no contemporaneous endtoend path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing endtoend path. We propose a framework for evaluating routing algorithms in such environments. We then develop several
EdgeDisjoint Paths in Expander Graphs
, 2000
"... Given a graph G = (V, E) and a set of n pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of n paths so found is edgedisjoint. (For arbitrary graphs the problem is AfPcomplete, although it is in 7 > if n is fixed.) We ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
Given a graph G = (V, E) and a set of n pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of n paths so found is edgedisjoint. (For arbitrary graphs the problem is AfPcomplete, although it is in 7 > if n is fixed.) We
EndtoEnd Routing Behavior in the Internet
, 1996
"... The largescale behavior of routing in the Internet has gone virtually without any formal study, the exception being Chinoy's analysis of the dynamics of Internet routing information [Ch93]. We report on an analysis of 40,000 endtoend route measurements conducted using repeated “traceroutes” ..."
Abstract

Cited by 660 (13 self)
 Add to MetaCart
persisting for either days or weeks. For routing symmetry, we look at the likelihood that a path through the Internet visits at least one different city in the two directions. At the end of 1995, this was the case half the time, and at least one different autonomous system was visited 30 % of the time.
Routing Techniques in Wireless Sensor Networks: A Survey
 IEEE Wireless Communications
, 2004
"... Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, howeve ..."
Abstract

Cited by 704 (2 self)
 Add to MetaCart
, however, has been given to the routing protocols which might differ depending on the application and network architecture. In this paper, we present a survey of the stateoftheart routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive
Existence and Construction of EdgeDisjoint Paths on Expander Graphs
"... Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of q paths so found is edgedisjoint. (For general graphs the related decision problem is NPcomplete.) We prove suffic ..."
Abstract
 Add to MetaCart
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of q paths so found is edgedisjoint. (For general graphs the related decision problem is NPcomplete.) We prove
Permutation Routing in the Hypercube and Grid Topologies
, 2005
"... The problem of edgedisjoint path routing arises from applications in distributed memory parallel computing. We examine this problem in both the directed hypercube and twodimensional grid topologies. Complexity results are obtained for these problems where the routing must consist entirely of short ..."
Abstract
 Add to MetaCart
The problem of edgedisjoint path routing arises from applications in distributed memory parallel computing. We examine this problem in both the directed hypercube and twodimensional grid topologies. Complexity results are obtained for these problems where the routing must consist entirely
Results 1  10
of
77,696