Results 1  10
of
74
Randomized decentralized broadcasting algorithms
 In INFOCOM
, 2007
"... Abstract — We consider the problem of broadcasting a live stream of data in an unstructured network. The broadcasting problem has been studied extensively for edgecapacitated networks. We give the first proof that whenever demand λ + ε is feasible for ε>0, a simple localcontrol algorithm is sta ..."
Abstract

Cited by 79 (5 self)
 Add to MetaCart
Abstract — We consider the problem of broadcasting a live stream of data in an unstructured network. The broadcasting problem has been studied extensively for edgecapacitated networks. We give the first proof that whenever demand λ + ε is feasible for ε>0, a simple localcontrol algorithm
Microsoft
, 2006
"... In this paper we consider the problem of broadcasting information from a source node to a set of receiver nodes. In the context of edgecapacitated networks, we consider the “random useful ” packet forwarding algorithm. We prove that it yields a stable system, provided the data injection rate at the ..."
Abstract
 Add to MetaCart
In this paper we consider the problem of broadcasting information from a source node to a set of receiver nodes. In the context of edgecapacitated networks, we consider the “random useful ” packet forwarding algorithm. We prove that it yields a stable system, provided the data injection rate
Provably optimal decentalised broadcast algorithms
, 2006
"... In this paper we consider the problem of broadcasting information from a source node to a set of receiver nodes. In the context of edgecapacitated networks, we consider the “random useful” packet forwarding algorithm. We prove that it yields a stable system, provided the data injection rate at the ..."
Abstract
 Add to MetaCart
In this paper we consider the problem of broadcasting information from a source node to a set of receiver nodes. In the context of edgecapacitated networks, we consider the “random useful” packet forwarding algorithm. We prove that it yields a stable system, provided the data injection rate
Rateoptimal schemes for PeertoPeer live streaming
"... In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peertopeer communications. We consider several models of communication resources, and for each model we identify schemes that achieve successful diffusion of information at optim ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
at optimal rates. For edgecapacitated networks, we show optimality of the socalled “randomuseful” packet forwarding algorithm. As a byproduct, we obtain a novel proof of a famous theorem of Edmonds, characterising the broadcast capacity of a capacitated graph. For nodecapacitated networks, assuming a
A MinEdge Cost Flow Framework for Capacitated Covering Problems
"... In this work, we introduce the CovMECF framework, a special case of minimumedge cost flow in which the input graph is bipartite. We observe that several important covering (and multicovering) problems are captured in this unifying model and introduce a new heuristic LPO for any problem in this fr ..."
Abstract
 Add to MetaCart
In this work, we introduce the CovMECF framework, a special case of minimumedge cost flow in which the input graph is bipartite. We observe that several important covering (and multicovering) problems are captured in this unifying model and introduce a new heuristic LPO for any problem
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
"... ... where all entries of c, U,and d are nonnegative. Given such a formulation, the ratio betweenthe optimal integer solution and the optimal solution to the linear program relaxation can be as bad as jjdjj1, even when U consistsof a single row. We show that by adding additional inequalities, this ra ..."
Abstract

Cited by 85 (1 self)
 Add to MetaCart
. For the minimum knapsack, we show that this improved ratio is at most 2. Thisis the first nontrivial IP/LP ratio for this basic problem. Capacitated network design generalizes the classical networkdesign problem by introducing capacities on the edges, whereas previous work only considers the case when all
Capacitated Network Design  Polyhedral Structure and Computation
 INFORMS JOURNAL ON COMPUTING
, 1994
"... We study a version of the capacity expansion problem (CEP) that arises in telecommunication network design. Given a capacitated network and a traffic demand matrix, the objective in the CEP is to add capacity to the edges, in batches of various modularities, and route traffic, so that the overall co ..."
Abstract

Cited by 76 (8 self)
 Add to MetaCart
We study a version of the capacity expansion problem (CEP) that arises in telecommunication network design. Given a capacitated network and a traffic demand matrix, the objective in the CEP is to add capacity to the edges, in batches of various modularities, and route traffic, so that the overall
Packing trees in communication networks
, 2005
"... Given an undirected edgecapacitated graph and given subset of vertices, we consider the problem of selecting a maximum (weighted) set of Steiner trees, each tree spanning a subset of vertices without violating the capacity constraints. This problem is motivated by applications in multicast communic ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Given an undirected edgecapacitated graph and given subset of vertices, we consider the problem of selecting a maximum (weighted) set of Steiner trees, each tree spanning a subset of vertices without violating the capacity constraints. This problem is motivated by applications in multicast
A branchandcut algorithm for solving an intraring synchronous optical network design problem
, 2000
"... In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical ber technology. The problem is to nd an optimal clustering of traffic demands in the network such that the total number of node assignmen ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
assignments (and, hence, adddrop multiplexer equipment requirements) is minmized, while satisfying the ring capacity and node cardinality constraints. This problem can be conceptualized as an edgecapacitated graph partitioning problem with node cardinality constraints. We formulate the problem as a mixed
A BranchandCut Algorithm for Capacitated Network Design Problems
 MATHEMATICAL PROGRAMMING
, 1998
"... We present a branchandcut algorithm to solve capacitated network design problems. Given a capacitated network and pointtopoint traffic demands, the objective is to install more capacity on the edges of the network and route traffic simultaneously, so that the overall cost is minimized. We study ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
We present a branchandcut algorithm to solve capacitated network design problems. Given a capacitated network and pointtopoint traffic demands, the objective is to install more capacity on the edges of the network and route traffic simultaneously, so that the overall cost is minimized. We study
Results 1  10
of
74