22,591 research outputs found
A Survey on Delay-Aware Resource Control for Wireless Systems --- Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning
In this tutorial paper, a comprehensive survey is given on several major
systematic approaches in dealing with delay-aware control problems, namely the
equivalent rate constraint approach, the Lyapunov stability drift approach and
the approximate Markov Decision Process (MDP) approach using stochastic
learning. These approaches essentially embrace most of the existing literature
regarding delay-aware resource control in wireless systems. They have their
relative pros and cons in terms of performance, complexity and implementation
issues. For each of the approaches, the problem setup, the general solution and
the design methodology are discussed. Applications of these approaches to
delay-aware resource allocation are illustrated with examples in single-hop
wireless networks. Furthermore, recent results regarding delay-aware multi-hop
routing designs in general multi-hop networks are elaborated. Finally, the
delay performance of the various approaches are compared through simulations
using an example of the uplink OFDMA systems.Comment: 58 pages, 8 figures; IEEE Transactions on Information Theory, 201
Cost sharing of cooperating queues in a Jackson network
We consider networks of queues in which the independent operators of individual queues may cooperate to reduce the amount of waiting. More specifically, we focus on Jackson networks in which the total capacity of the servers can be redistributed over all queues in any desired way. If we associate a cost to waiting that is linear in the queue lengths, it is known how the operators should share the available service capacity to minimize the long run total cost. We answer the question whether or not (the operators of) the individual queues will indeed cooperate in this way, and if so, how they will share the cost in the new situation. One of the results is an explicit cost allocation that is beneficial for all operators. The approach used also works for other cost functions, such as the server utilization
Stable Wireless Network Control Under Service Constraints
We consider the design of wireless queueing network control policies with
particular focus on combining stability with additional application-dependent
requirements. Thereby, we consequently pursue a cost function based approach
that provides the flexibility to incorporate constraints and requirements of
particular services or applications. As typical examples of such requirements,
we consider the reduction of buffer underflows in case of streaming traffic,
and energy efficiency in networks of battery powered nodes. Compared to the
classical throughput optimal control problem, such requirements significantly
complicate the control problem. We provide easily verifyable theoretical
conditions for stability, and, additionally, compare various candidate cost
functions applied to wireless networks with streaming media traffic. Moreover,
we demonstrate how the framework can be applied to the problem of energy
efficient routing, and we demonstrate the aplication of our framework in
cross-layer control problems for wireless multihop networks, using an advanced
power control scheme for interference mitigation, based on successive convex
approximation. In all scenarios, the performance of our control framework is
evaluated using extensive numerical simulations.Comment: Accepted for publication in IEEE Transactions on Control of Network
Systems. arXiv admin note: text overlap with arXiv:1208.297
Applying autonomy to distributed satellite systems: Trends, challenges, and future prospects
While monolithic satellite missions still pose significant advantages in terms of accuracy and
operations, novel distributed architectures are promising improved flexibility, responsiveness,
and adaptability to structural and functional changes. Large satellite swarms, opportunistic satellite
networks or heterogeneous constellations hybridizing small-spacecraft nodes with highperformance
satellites are becoming feasible and advantageous alternatives requiring the adoption
of new operation paradigms that enhance their autonomy. While autonomy is a notion that
is gaining acceptance in monolithic satellite missions, it can also be deemed an integral characteristic
in Distributed Satellite Systems (DSS). In this context, this paper focuses on the motivations
for system-level autonomy in DSS and justifies its need as an enabler of system qualities. Autonomy
is also presented as a necessary feature to bring new distributed Earth observation functions
(which require coordination and collaboration mechanisms) and to allow for novel structural
functions (e.g., opportunistic coalitions, exchange of resources, or in-orbit data services). Mission
Planning and Scheduling (MPS) frameworks are then presented as a key component to implement
autonomous operations in satellite missions. An exhaustive knowledge classification explores the
design aspects of MPS for DSS, and conceptually groups them into: components and organizational
paradigms; problem modeling and representation; optimization techniques and metaheuristics;
execution and runtime characteristics and the notions of tasks, resources, and constraints.
This paper concludes by proposing future strands of work devoted to study the trade-offs of
autonomy in large-scale, highly dynamic and heterogeneous networks through frameworks that
consider some of the limitations of small spacecraft technologies.Postprint (author's final draft
- …