Results 1  10
of
37
Adaptive Packet Routing for Bursty Adversarial Traffic
, 1998
"... One of the central tasks of networking is packetrouting when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual subproblems: path selection and congestion resolution along the selected paths. However, this conceptual separatio ..."
Abstract

Cited by 56 (7 self)
 Add to MetaCart
One of the central tasks of networking is packetrouting when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual subproblems: path selection and congestion resolution along the selected paths. However, this conceptual separation has a serious drawback: each packet's path is fixed at the source and cannot be modified adaptively enroute. The problem is especially severe when packet injections are modeled by an adversary, whose goal is to cause "trafficjams".
Message Multicasting In Heterogeneous Networks
, 1998
"... In heterogeneous networks, sending messages may incur different delays on different links, and each node may have a different switching time between messages. The well studied Telephone model is obtained when all link delays and switching times are equal to one unit. We investigate the problem of fi ..."
Abstract

Cited by 52 (0 self)
 Add to MetaCart
In heterogeneous networks, sending messages may incur different delays on different links, and each node may have a different switching time between messages. The well studied Telephone model is obtained when all link delays and switching times are equal to one unit. We investigate the problem of finding the minimum time required to multicast a message from one source to a subset of the nodes of size k. The problem is NPhard even in the basic Telephone model. We present a polynomial time algorithm that approximates the minimum multicast time within a factor of O(log k). Our algorithm improves on the best known approximation factor for the Telephone model by a factor of O log n log log k . No approximation algorithms were known for the general model considered in this paper.
Asymptotically optimal algorithm for job shop scheduling and packet routing
 J. Algorithms
, 1999
"... We propose asymptotically optimal algorithms for the job shop scheduling and packet routing problems. We propose a fluid relaxation for the job shop scheduling problem in which we replace discrete jobs with the flow of a continuous fluid. We compute an optimal solution of the fluid relaxation in clo ..."
Abstract

Cited by 49 (3 self)
 Add to MetaCart
We propose asymptotically optimal algorithms for the job shop scheduling and packet routing problems. We propose a fluid relaxation for the job shop scheduling problem in which we replace discrete jobs with the flow of a continuous fluid. We compute an optimal solution of the fluid relaxation in closed form, obtain a lower bound Cmax to the job shop scheduling problem, and construct a feasible schedule from the fluid relaxation with objective value at most C � OŽ C. max ' max, where the constant in the OŽ. � notation is independent of the number of jobs, but it depends on the processing time of the jobs, thus producing an asymptotically optimal schedule as the total number of jobs tends to infinity. If the initially present jobs increase proportionally, then our algorithm produces a schedule with value at most C � OŽ. max 1. For the packet routing problem with fixed paths the previous algorithm applies directly. For the general packet routing problem we propose a linear programming relaxation that provides a lower bound Cmax and an asymptotically optimal algorithm that uses the optimal solution of the relaxation with objective value at most C � OŽ C. max ' max. Unlike asymptotically optimal algorithms that rely on probabilistic assumptions, our proposed algorithms make no probabilistic assumptions and they are asymptotically optimal for all instances with a large number of jobs Ž packets.. In computational experiments our algorithms produce schedules which are within 1 % of optimality even for moderately sized problems.
The Access Network Design Problem
 39th IEEE Symposium on Foundations of Computer Science
, 1998
"... We consider the problem of designing a minimum cost access network to carry traffic from a set of endnodes to a core network. A set of trunks of K differing types are available for leasing or buying. Some trunktypes have a high initial overhead cost but a low cost per unit bandwidth. Others have a ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
We consider the problem of designing a minimum cost access network to carry traffic from a set of endnodes to a core network. A set of trunks of K differing types are available for leasing or buying. Some trunktypes have a high initial overhead cost but a low cost per unit bandwidth. Others have a low overhead cost but a high cost per unit bandwidth. When the central core is given, we show how to construct an access network whose cost is within O(K 2 ) of optimal, under weak assumptions on the cost structure. In contrast with previous bounds, this bound is independent of the network and the traffic. Typically, the value of K is small. Our approach uses a linear programming relaxation and is motivated by a rounding technique of Shmoys, Tardos and Aardal [15]. Our techniques extend to a more complex situation in which the core is not given a priori. In this case we aim to minimize the switch cost of the core in addition to the trunk cost of the access network. We provide the same pe...
Stability of Adaptive and NonAdaptive Packet Routing Policies in Adversarial Queueing Networks
 In Proc. of the 31st STOC
, 2000
"... We investigate stability of packet routing policies in adversarial queueing networks. We provide a simple classification of networks which are stable under any greedy scheduling policy  network is stable if and only if the underlying undirected connected graph contains at most two edges. We also ..."
Abstract

Cited by 44 (3 self)
 Add to MetaCart
We investigate stability of packet routing policies in adversarial queueing networks. We provide a simple classification of networks which are stable under any greedy scheduling policy  network is stable if and only if the underlying undirected connected graph contains at most two edges. We also propose a simple and distributed policy which is stable in an arbitrary adversarial queueing network even for the critical value of the arrival rate r = 1. Finally, a simple and checkable network flow type load condition is formulated for adaptive adversarial queueing networks and a policy is proposed which achieves stability under this new load condition. This load condition is a relaxation of the integral network flow type condition considered previously in the literature.
Balanced graph partitioning
 In 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures
, 2004
"... We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In particular we require that for a parameter ν ≥ 1, no component contains more than ν · n k of the graph vertices. For k = 2 an ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In particular we require that for a parameter ν ≥ 1, no component contains more than ν · n k of the graph vertices. For k = 2 and ν = 1 this problem is equivalent to the well known Minimum Bisection Problem for which an approximation algorithm with a polylogarithmic approximation guarantee has been presented in [FK02]. For arbitrary k and ν ≥ 2 a bicriteria approximation ratio of O(logn) was obtained by [ENRS99] using the spreading metrics technique. We present a bicriteria approximation algorithm that for any constant ν> 1 runs in polynomial time and guarantees an approximation ratio of O(log1.5 n) (for a precise statement of the main result see Theorem 6). For ν = 1 and k ≥ 3 we show that no polynomial time approximation algorithm can guarantee a finite approximation ratio unless P = NP. 1
CrossLayer Latency Minimization in Wireless Networks with SINR Constraints
 MOBIHOC’07, SEPTEMBER 9–14, 2007, MONTREAL, QUEBEC, CANADA
, 2007
"... Recently, there has been substantial interest in the design of cross
layer protocols for wireless networks. These protocols optimize
certain performance metric(s) of interest (e.g. latency, energy, rate)
by jointly optimizing the performance of multiple layers of the
protocol stack. Algorithm desig ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
Recently, there has been substantial interest in the design of cross
layer protocols for wireless networks. These protocols optimize
certain performance metric(s) of interest (e.g. latency, energy, rate)
by jointly optimizing the performance of multiple layers of the
protocol stack. Algorithm designers often use geometricgraph
theoretic models for radio interference to design such crosslayer
protocols. In this paper we study the problem of designing cross
layer protocols for multihop wireless networks using a more real
istic Signal to Interference plus Noise Ratio (SINR) model for radio
interference. The following crosslayer latency minimization prob
lem is studied: Given a set V of transceivers, and a set of source
destination pairs, (i) choose power levels for all the transceivers, (ii)
choose routes for all connections, and (iii) construct an endtoend
schedule such that the SINR constraints are satisfied at each time
step so as to minimize the makespan of the schedule (the time
by which all packets have reached their respective destinations).
We present a polynomialtime algorithm with provable worstcase
performance guarantee for this crosslayer latency minimization
problem. As corollaries of the algorithmic technique we show that
a number of variants of the crosslayer latency minimization prob
lem can also be approximated efficiently in polynomial time. Our
work extends the results of Kumar et al. (Proc. SODA, 2004) and
Moscibroda et al. (Proc. MOBIHOC, 2006). Although our algo
rithm considers multiple layers of the protocol stack, it can natu
rally be viewed as compositions of tasks specific to each layer —
this allows us to improve the overall performance while preserving
the modularity of the layered structure.
Dynamic Routing on Networks with FixedSize Buffers
 In Proc. of the 14th ann. ACMSIAM Symposium on Discrete Algorithms
, 2003
"... William Aiello Rafail Ostrovsky Eyal Kushilevitz Adi Ros'en Abstract The combination of the buffer size of routers deployed in the Internet and the Internet traffic itself leads routinely to routers dropping packets. Motivated by this, we initiate the rigorous study of dynamic storeand fo ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
William Aiello Rafail Ostrovsky Eyal Kushilevitz Adi Ros'en Abstract The combination of the buffer size of routers deployed in the Internet and the Internet traffic itself leads routinely to routers dropping packets. Motivated by this, we initiate the rigorous study of dynamic storeand forward routing on arbitrary networks in a model in which dropped packets must explicitly be taken into account. To avoid the uncertainties of traffic modeling, we consider arbitrary traffic on the network. We analyze and compare the effectiveness of several greedy, online, localcontrol protocols using a competitive analysis of the throughput. One goal of our approach is for the competitive results to continue to hold as a network grows without requiring the memory in the nodes to increase with the size of the network. Thus, in our model, we have link buffers of fixed size, B, which is independent of the size of the network, and B becomes a parameter of the model.
Tight Approximation Results for General Covering Integer Programs
 In Proc. of the FortySecond Annual Symposium on Foundations of Computer Science
, 2001
"... In this paper we study approximation algorithms for solving a general covering integer program. An nvector x of nonnegative integers is sought, which minimizes c T x; subject to Ax b; x d: The entries of A; b; c are nonnegative. Let m be the number of rows of A: Covering problems have been hea ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
In this paper we study approximation algorithms for solving a general covering integer program. An nvector x of nonnegative integers is sought, which minimizes c T x; subject to Ax b; x d: The entries of A; b; c are nonnegative. Let m be the number of rows of A: Covering problems have been heavily studied in combinatorial optimization. We focus on the effect of the multiplicity constraints, x d; on approximability. Two longstanding open questions remain for this general formulation with upper bounds on the variables. (i) The integrality gap of the standard LP relaxation is arbitrarily large. Existing approximation algorithms that achieve the wellknown O(log m)approximation with respect to the LP value do so at the expense of violating the upper bounds on the variables by the same O(log m) multiplicative factor. What is the smallest possible violation of the upper bounds that still achieves cost within O(log m) of the standard LP optimum ? (ii) The best known approximation ratio for the problem has been O(log(max j P i A ij )) since 1982. This bound can be as bad as polynomial in the input size. Is an O(log m)approximation, like the one known for the special case of Set Cover, possible? We settle these two open questions. To answer the first question we give an algorithm based on the relatively simple new idea of randomly rounding variables to smallerthaninteger units. To settle the second question we give a reduction from approximating the problem while respecting multiplicity constraints to approximating the problem with a bounded violation of the multiplicity constraints. 1 Research partially supported by NSERC Grant 22780900 and a CFI New Opportunities Award 1.
Source Routing and Scheduling in Packet Networks
, 2001
"... We study routing and scheduling in packetswitched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is admissible if no link in the network is overloaded. We present the first online routing algorit ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
We study routing and scheduling in packetswitched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is admissible if no link in the network is overloaded. We present the first online routing algorithm that finds a set of admissible paths whenever this is feasible. Our algorithm calculates a path for each packet as soon as it is injected at its source using a simple shortest path computation. The length of a link reflects its current congestion. We also show how our algorithm can be implemented under today's Internet routing paradigms.