Results 1  10
of
65
Nodecapacitated ring routing
, 2001
"... We consider the nodecapacitated routing problem in an undirected ring network along with its fractional relaxation, the nodecapacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider the nodecapacitated routing problem in an undirected ring network along with its fractional relaxation, the nodecapacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly
Oblivious routing on nodecapacitated and directed graphs
 IN PROCEEDINGS OF THE 16TH ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA), 2005
, 2005
"... Oblivious routing algorithms for general undirected networks were introduced by Räcke [17], and this work has led to many subsequent improvements and applications. Comparatively little is known about oblivious routing in general directed networks, or even in undirected networks with node capacities. ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
. We present the first nontrivial upper bounds for both these cases, providing algorithms for kcommodity oblivious routing problems with competitive ratio O (√ k log(n)) for undirected nodecapacitated graphs and O (√ k n 1/4 log(n)) for directed graphs. In the special case that all commodities have
NodeCapacitated Multicommodity Routing for a PON Ring
, 1998
"... We consider a routing problem which arises in the development of an algorithm which assigns routes in realtime to incoming path requests (calls) between pairs of nodes in a passive optical local network. For the application addressed, this led to an integral multicommodity flow problem on a ring. I ..."
Abstract
 Add to MetaCart
for this fractional flow problem in the case where there are capacities on the nodes (and/or edges). This yields a polynomial time algorithm to determine whether such a flow exists. We also see that if we increase the capacity of each link by one, then we may always find an integral routing. Finally, we give
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
is stable under demand λ, and as a corollary a famous theorem of Edmonds. We then study the nodecapacitated case and show a similar optimality result for the complete graph. We study through simulation the delay that users must wait in order to playback a video stream with a small number of skipped packets
A FASTER STRONGLY POLYNOMIAL MINIMUM COST FLOW ALGORITHM
, 1991
"... In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the EdmondsKarp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n no ..."
Abstract

Cited by 160 (11 self)
 Add to MetaCart
nodes and m arcs and runs in O(n log n (m + n log n)) time. Using a standard transformation, thjis approach yields an O(m log n (m + n log n)) algorithm for the capacitated minimum cost flow problem. This algorithm improves the best previous strongly polynomial time algorithm, due to Z. Galil and E
On nstep MIR and Partition Inequalities for Integer Knapsack and Singlenode Capacitated Flow Sets
"... Pochet and Wolsey [Y. Pochet, L.A. Wolsey, Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation. Discrete Applied Mathematics 59(1995) 57–74] introduced partition inequalities for three substructures arising in various mixed integer programs, namely th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the integer knapsack set with nonnegative divisible/arbitrary coefficients and two forms of singlenode capacitated flow set with divisible coefficients. They developed the partition inequalities by proving properties of the optimal solution in optimizing a linear function over these sets. More recently
Asymptotic zerotransition activity encoding for address busses in lowpower microprocessorbased systems
 Proc. of Seventh Great Lakes Symposium on VLSI
, 1997
"... In microprocessorbased systems, large power savings can be achieved through reduction of the transition activity of the onand offchip busses. This is because the total capacitance being switched when a voltage change occurs on a bus line is usually sensibly larger than the capacitive load that mus ..."
Abstract

Cited by 94 (11 self)
 Add to MetaCart
that must be charged/discharged when internal nodes toggle. In this paper, we propose an encoding scheme which is suitable for reducing the switching activity on the lines of an address bus. The technique relies on the Observation that, in a remarkable number of cases, pattems traveling onto address busses
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
at the source node is less than the (min(mincut)) of the graph. As a corollary we retrieve a famous theorem of Edmonds. We next consider nodecapacitated networks. In this context we introduce the “random useful to most deprived neighbour ” packet forwarding scheme. We show that it yields a stable system
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
at the source node is less than the (min(mincut)) of the graph. As a corollary we retrieve a famous theorem of Edmonds. We next consider nodecapacitated networks. In this context we introduce the “random useful to most deprived neighbour” packet forwarding scheme. We show that it yields a stable system
The convex hull of two core capacitated network design problems
 MATHEMATICAL PROGRAMMING
, 1993
"... The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed pointtopoint demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs ..."
Abstract

Cited by 60 (1 self)
 Add to MetaCart
the problem, considers a multiple commodity, single arc capacitated network design problem. The second problem is a three node network; this specialized network arises in larger networks if we aggregate nodes. In both cases, we develop families of facets and completely characterize the convex hull of feasible
Results 1  10
of
65