Results 1  10
of
44
Network Coding in Undirected Networks
, 2004
"... Recent work in network coding shows that, it is necessary to consider both the routing and coding strategies to achieve optimal throughput of information transmission in data networks. So far, most research on network coding has focused on the model of directed networks, where each communication li ..."
Abstract

Cited by 68 (13 self)
 Add to MetaCart
Recent work in network coding shows that, it is necessary to consider both the routing and coding strategies to achieve optimal throughput of information transmission in data networks. So far, most research on network coding has focused on the model of directed networks, where each communication link has a fixed direction. In this paper, we study the benefits of network coding in undirected networks, where each communication link is bidirectional. Our theoretical results show that, for a single unicast or broadcast session, there are no improvements with respect to throughput due to network coding. In the case of a single multicast session, such an improvement is bounded by a factor of two, as long as half integer routing is permitted. This is dramatically different from previous results obtained in directed networks. We also show that multicast throughput in an undirected network is independent of the selection of the sender within the multicast group. We finally show that, rather than improving the optimal achievable throughput, the benefit of network coding is to significantly facilitate the design of efficient algorithms to compute and achieve such optimal throughput. I.
Supereulerian graphs: A survey
 J. Graph Theory
, 1992
"... A graph is supereulerian if it has a spanning eulerian subgraph. There is a reduction method to determine whether a graph is supereulerian, and it can also be applied to study other concepts, e.g., hamiltonian line graphs, a certain type of double cycle cover, and the total interval number of a grap ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
A graph is supereulerian if it has a spanning eulerian subgraph. There is a reduction method to determine whether a graph is supereulerian, and it can also be applied to study other concepts, e.g., hamiltonian line graphs, a certain type of double cycle cover, and the total interval number of a graph. We outline the research on supereulerian graphs, the reduction method and its applications. 1. Notation We follow the notation of Bondy and Murty [22], with these exceptions: a graph has no loops, but multiple edges are allowed; the trivial graph K1 is regarded as having infinite edgeconnectivity; and the symbol E will normally refer to a subset of the edge set E(G) of a graph G, not to E(G) itself. The graph of order 2 with 2 edges is called a 2cycle and denoted C2. Let H be a subgraph of G. The contraction G/H is the graph obtained from G by contracting all edges of H and deleting any resulting loops. For a graph G, denote O(G) = {odddegree vertices of G}. A graph with O(G) = ∅ is called an even graph. A graph is eulerian if it is connected and even. We call a graph G supereulerian if G has a spanning eulerian subgraph. Regard K1 as supereulerian. Denote SL = {supereulerian graphs}. 1 Let G be a graph. The line graph of G (called an edge graph in [22]) is denoted L(G), it has vertex set E(G), where e, e ′ ∈ E(G) are adjacent vertices in L(G) whenever e and e ′ are adjacent edges in G. Let S be a family of graphs, let G be a graph, and let k ≥ 0 be an integer. If there is a graph G0 ∈ S such that G can be obtained from G0 by removing at most k edges, then G is said to be at most k edges short of being in S. For a graph G, we write F (G) = k if k is the least nonnegative integer such that G is at most k edges short of having 2 edgedisjoint spanning trees. 2.
Map Graphs
, 1999
"... We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give an NP characterization for such graphs, and an O(n³)time ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give an NP characterization for such graphs, and an O(n³)time recognition algorithm for a restricted version: given a graph, decide whether it is realized by adjacencies in a map without holes, in which at most four nations meet at any point.
Efficient and Distributed Computation of Maximum Multicast Rates
"... The transmission of information within a data network is constrained by network topology and link capacities. In this paper, we study the fundamental upper bound of information multicast rates with these constraints, given the unique replicable and encodable property of information flows. Based on r ..."
Abstract

Cited by 23 (16 self)
 Add to MetaCart
The transmission of information within a data network is constrained by network topology and link capacities. In this paper, we study the fundamental upper bound of information multicast rates with these constraints, given the unique replicable and encodable property of information flows. Based on recent information theory advances in coded multicast rates, we are able to formulate the maximum multicast rate problem as a linear network optimization problem, assuming the general undirected network model. We then proceed to apply Lagrangian relaxation techniques to obtain (1) a necessary and sufficient condition for multicast rate feasibility, and (2) a subgradient solution for computing the maximum rate and the optimal routing strategy to achieve it. The condition we give is a generalization of the wellknown conditions for the unicast and broadcast cases. Our subgradient solution takes advantage of the underlying network flow structure of the problem, and therefore outperforms general linear programming solving techniques. It also admits a natural intuitive interpretation, and is amenable to fully distributed implementations.
On Achieving Maximum Multicast Throughput in Undirected Networks
 IEEE/ACM TRANS. NETWORKING
, 2006
"... The transmission of information within a data network is constrained by the network topology and link capacities. In this paper, we study the fundamental upper bound of information dissemination rates with these constraints in undirected networks, given the unique replicable and encodable propertie ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
The transmission of information within a data network is constrained by the network topology and link capacities. In this paper, we study the fundamental upper bound of information dissemination rates with these constraints in undirected networks, given the unique replicable and encodable properties of information flows. Based on recent advances in network coding and classical modeling techniques in flow networks, we provide a natural linear programming formulation of the maximum multicast rate problem. By applying Lagrangian relaxation on the primal and the dual linear programs (LPs), respectively, we derive a) a necessary and sufficient condition characterizing multicast rate feasibility, and b) an efficient and distributed subgradient algorithm for computing the maximum multicast rate. We also extend our discussions to multiple communication sessions, as well as to overlay and ad hoc network models. Both our theoretical and simulation results conclude that, network coding may not be instrumental to achieve better maximum multicast rates in most cases; rather, it facilitates the design of significantly more efficient algorithms to achieve such optimality.
Design of Survivable Networks: A survey
 In Networks
, 2005
"... For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication networks have seen an important evolution and therefore, designing survivable networks has become a major objective for telecommunication operators. Over the past years, a big amount of research has then been done for devising efficient methods for survivable network models, and particularly cutting plane based algorithms. In this paper, we attempt to survey some of these models and the optimization methods used for solving them.
New results on rationality and strongly polynomial solvability in eisenberggale markets
 In Proceedings of 2nd Workshop on Internet and Network Economics
, 2006
"... Abstract. We study the structure of EG[2], the class of EisenbergGale markets with two agents. We prove that all markets in this class are rational and they admit strongly polynomial algorithms whenever the polytope containing the set of feasible utilities of the two agents can be described via a c ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
Abstract. We study the structure of EG[2], the class of EisenbergGale markets with two agents. We prove that all markets in this class are rational and they admit strongly polynomial algorithms whenever the polytope containing the set of feasible utilities of the two agents can be described via a combinatorial LP. This helps resolve positively the status of two markets left as open problems by [JV]: the capacity allocation market in a directed graph with two sourcesink pairs and the network coding market in a directed network with two sources. Our algorithms for solving the corresponding nonlinear convex programs are fundamentally different from those obtained by [JV]; whereas they use the primaldual schema, we use a carefully constructed binary search. 1
A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks
, 2008
"... Recent research in network coding shows that, joint consideration of both coding and routing strategies may lead to higher information transmission rates than routing only. A fundamental question in the field of network coding is: how large can the throughput improvement due to network coding be? I ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
Recent research in network coding shows that, joint consideration of both coding and routing strategies may lead to higher information transmission rates than routing only. A fundamental question in the field of network coding is: how large can the throughput improvement due to network coding be? In this paper, we prove that in undirected networks, the ratio of achievable multicast throughput with network coding to that without network coding is bounded by a constant ratio of 2, i.e., network coding can at most double the throughput. This result holds for any undirected network topology, any link capacity configuration, any multicast group size, and any source information rate. This constant bound 2 represents the tightest bound that has been proved so far in general undirected settings, and is to be contrasted with the unbounded potential of network coding in improving multicast throughput in directed networks.