7,684 research outputs found
Scheduling Bidirectional Traffic on a Path
We study the fundamental problem of scheduling bidirectional traffic along a
path composed of multiple segments. The main feature of the problem is that
jobs traveling in the same direction can be scheduled in quick succession on a
segment, while jobs in opposing directions cannot cross a segment at the same
time. We show that this tradeoff makes the problem significantly harder than
the related flow shop problem, by proving that it is NP-hard even for identical
jobs. We complement this result with a PTAS for a single segment and
non-identical jobs. If we allow some pairs of jobs traveling in different
directions to cross a segment concurrently, the problem becomes APX-hard even
on a single segment and with identical jobs. We give polynomial algorithms for
the setting with restricted compatibilities between jobs on a single and any
constant number of segments, respectively
PACE: Simple Multi-hop Scheduling for Single-radio 802.11-based Stub Wireless Mesh Networks
IEEE 802.11-based Stub Wireless Mesh Networks (WMNs) are a cost-effective and flexible solution to extend wired network infrastructures. Yet, they suffer from two major problems: inefficiency and unfairness. A number of approaches have been proposed to tackle these problems, but they are too restrictive, highly complex, or require time synchronization and modifications to the IEEE 802.11 MAC.
PACE is a simple multi-hop scheduling mechanism for Stub WMNs overlaid on the IEEE 802.11 MAC that jointly addresses the inefficiency and unfairness problems. It limits transmissions to a single mesh node at each time and ensures that each node has the opportunity to transmit a packet in each network-wide transmission round. Simulation results demonstrate that PACE can achieve optimal network capacity utilization and greatly outperforms state of the art CSMA/CA-based solutions as far as goodput, delay, and fairness are concerned
Wireless Scheduling with Power Control
We consider the scheduling of arbitrary wireless links in the physical model
of interference to minimize the time for satisfying all requests. We study here
the combined problem of scheduling and power control, where we seek both an
assignment of power settings and a partition of the links so that each set
satisfies the signal-to-interference-plus-noise (SINR) constraints.
We give an algorithm that attains an approximation ratio of , where is the number of links and is the ratio
between the longest and the shortest link length. Under the natural assumption
that lengths are represented in binary, this gives the first approximation
ratio that is polylogarithmic in the size of the input. The algorithm has the
desirable property of using an oblivious power assignment, where the power
assigned to a sender depends only on the length of the link. We give evidence
that this dependence on is unavoidable, showing that any
reasonably-behaving oblivious power assignment results in a -approximation.
These results hold also for the (weighted) capacity problem of finding a
maximum (weighted) subset of links that can be scheduled in a single time slot.
In addition, we obtain improved approximation for a bidirectional variant of
the scheduling problem, give partial answers to questions about the utility of
graphs for modeling physical interference, and generalize the setting from the
standard 2-dimensional Euclidean plane to doubling metrics. Finally, we explore
the utility of graph models in capturing wireless interference.Comment: Revised full versio
Joint dimensioning of server and network infrastructure for resilient optical grids/clouds
We address the dimensioning of infrastructure, comprising both network and server resources, for large-scale decentralized distributed systems such as grids or clouds. We design the resulting grid/cloud to be resilient against network link or server failures. To this end, we exploit relocation: Under failure conditions, a grid job or cloud virtual machine may be served at an alternate destination (i.e., different from the one under failure-free conditions). We thus consider grid/cloud requests to have a known origin, but assume a degree of freedom as to where they end up being served, which is the case for grid applications of the bag-of-tasks (BoT) type or hosted virtual machines in the cloud case. We present a generic methodology based on integer linear programming (ILP) that: 1) chooses a given number of sites in a given network topology where to install server infrastructure; and 2) determines the amount of both network and server capacity to cater for both the failure-free scenario and failures of links or nodes. For the latter, we consider either failure-independent (FID) or failure-dependent (FD) recovery. Case studies on European-scale networks show that relocation allows considerable reduction of the total amount of network and server resources, especially in sparse topologies and for higher numbers of server sites. Adopting a failure-dependent backup routing strategy does lead to lower resource dimensions, but only when we adopt relocation (especially for a high number of server sites): Without exploiting relocation, potential savings of FD versus FID are not meaningful
LC-PCN: The Load Control PCN Solution
There is an increased interest of simple and scalable resource provisioning solution for Diffserv network. The Load Control PCN (LC-PCN) addresses the following issues:\ud
o Admission Control for real time data flows in stateless Diffserv Domains\ud
o Flow Termination: Termination of flows in case of exceptional events, such as severe congestion after re-routing.\ud
Admission control in a Diffserv stateless domain is a combination of:\ud
o Probing, whereby a probe packet is sent along the forwarding path in a network to determine whether a flow can be admitted based upon the current congestion state of the network\ud
o Admission Control based on data marking, whereby in congestion situations the data packets are marked to notify the PCN-egress-node that a congestion occurred on a particular PCN-ingress-node to PCN-egress-node path.\ud
\ud
The scheme provides the capability of controlling the traffic load in the network without requiring signaling or any per-flow processing in the PCN-interior-nodes. The complexity of Load Control is kept to a minimum to make implementation simple.\u
Using data network metrics, graphics, and topology to explore network characteristics
Yehuda Vardi introduced the term network tomography and was the first to
propose and study how statistical inverse methods could be adapted to attack
important network problems (Vardi, 1996). More recently, in one of his final
papers, Vardi proposed notions of metrics on networks to define and measure
distances between a network's links, its paths, and also between different
networks (Vardi, 2004). In this paper, we apply Vardi's general approach for
network metrics to a real data network by using data obtained from special data
network tools and testing procedures presented here. We illustrate how the
metrics help explicate interesting features of the traffic characteristics on
the network. We also adapt the metrics in order to condition on traffic passing
through a portion of the network, such as a router or pair of routers, and show
further how this approach helps to discover and explain interesting network
characteristics.Comment: Published at http://dx.doi.org/10.1214/074921707000000058 in the IMS
Lecture Notes Monograph Series
(http://www.imstat.org/publications/lecnotes.htm) by the Institute of
Mathematical Statistics (http://www.imstat.org
- âŠ