1,861 research outputs found
MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops
When deploying resource-intensive signal processing applications in wireless
sensor or mesh networks, distributing processing blocks over multiple nodes
becomes promising. Such distributed applications need to solve the placement
problem (which block to run on which node), the routing problem (which link
between blocks to map on which path between nodes), and the scheduling problem
(which transmission is active when). We investigate a variant where the
application graph may contain feedback loops and we exploit wireless networks?
inherent multicast advantage. Thus, we propose Multicast-Aware Routing for
Virtual network Embedding with Loops in Overlays (MARVELO) to find efficient
solutions for scheduling and routing under a detailed interference model. We
cast this as a mixed integer quadratically constrained optimisation problem and
provide an efficient heuristic. Simulations show that our approach handles
complex scenarios quickly.Comment: 6 page
Queuing with future information
We study an admissions control problem, where a queue with service rate
receives incoming jobs at rate , and the decision maker is
allowed to redirect away jobs up to a rate of , with the objective of
minimizing the time-average queue length. We show that the amount of
information about the future has a significant impact on system performance, in
the heavy-traffic regime. When the future is unknown, the optimal average queue
length diverges at rate , as . In sharp contrast, when all future arrival and service times are revealed
beforehand, the optimal average queue length converges to a finite constant,
, as . We further show that the finite limit of
can be achieved using only a finite lookahead window starting from the current
time frame, whose length scales as , as
. This leads to the conjecture of an interesting duality between
queuing delay and the amount of information about the future.Comment: Published in at http://dx.doi.org/10.1214/13-AAP973 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Recommended from our members
MILO : a microarchitecture and logic optimizer
In this report we discuss strengths and weaknesses of logic synthesis systems and describe a system for microarchitectural and logic optimization. Our system uses a set of algorithms for synthesizing SSI/MSI macros from parameterized microarchitecture components. In addition, it uses rules for optimizing both at the microarchitecture and logic level. The system increases designer productivity and requires less design knowledge and experience from circuit engineers
Degrees of Lookahead in Regular Infinite Games
We study variants of regular infinite games where the strict alternation of
moves between the two players is subject to modifications. The second player
may postpone a move for a finite number of steps, or, in other words, exploit
in his strategy some lookahead on the moves of the opponent. This captures
situations in distributed systems, e.g. when buffers are present in
communication or when signal transmission between components is deferred. We
distinguish strategies with different degrees of lookahead, among them being
the continuous and the bounded lookahead strategies. In the first case the
lookahead is of finite possibly unbounded size, whereas in the second case it
is of bounded size. We show that for regular infinite games the solvability by
continuous strategies is decidable, and that a continuous strategy can always
be reduced to one of bounded lookahead. Moreover, this lookahead is at most
doubly exponential in the size of a given parity automaton recognizing the
winning condition. We also show that the result fails for non-regular
gamesxwhere the winning condition is given by a context-free omega-language.Comment: LMCS submissio
Suggestions to Improve Lean Construction Planning
The Last Planner System® has been one of the most popular lean construction tools that offers a solution to tackle the problems of production management on construction sites. Since its inception almost 20 years ago, construction companies across the world have implemented Last Planner with reported success. However, even as Last Planner was originally designed to address some shortcomings of the CPM method, a particular shortcoming – namely task continuity was not addressed directly. Also, excepting PPC and Reasons for Non Completion charts, there are no explicit visual tools offered by the Last Planner system. On the other hand, Line of Balance based approaches intrinsically support the consideration of task continuity, and offer a basic visual management approach in schedule representation. With some exceptions, Line of Balance is seen as a special technique applicable only in linear or repetitive work based schedules. The authors suggest that i) there is a need for a robust theory of planning and scheduling and ii) there is a need for a more suitable approach that addresses critical aspects of planning and scheduling function for example by integrating Line of Balance and Last Planner to provide a more robust support for construction scheduling
- …