9,304 research outputs found
A Comprehensive Analysis of Swarming-based Live Streaming to Leverage Client Heterogeneity
Due to missing IP multicast support on an Internet scale, over-the-top media
streams are delivered with the help of overlays as used by content delivery
networks and their peer-to-peer (P2P) extensions. In this context,
mesh/pull-based swarming plays an important role either as pure streaming
approach or in combination with tree/push mechanisms. However, the impact of
realistic client populations with heterogeneous resources is not yet fully
understood. In this technical report, we contribute to closing this gap by
mathematically analysing the most basic scheduling mechanisms latest deadline
first (LDF) and earliest deadline first (EDF) in a continuous time Markov chain
framework and combining them into a simple, yet powerful, mixed strategy to
leverage inherent differences in client resources. The main contributions are
twofold: (1) a mathematical framework for swarming on random graphs is proposed
with a focus on LDF and EDF strategies in heterogeneous scenarios; (2) a mixed
strategy, named SchedMix, is proposed that leverages peer heterogeneity. The
proposed strategy, SchedMix is shown to outperform the other two strategies
using different abstractions: a mean-field theoretic analysis of buffer
probabilities, simulations of a stochastic model on random graphs, and a
full-stack implementation of a P2P streaming system.Comment: Technical report and supplementary material to
http://ieeexplore.ieee.org/document/7497234
An independence result concerning the arrival rate of and the provision of transport to tourists
What is the relationship between the arrival rate of tourists at a transport providing firm's depot and the long run expected wait time experienced by individual tourists in this depot? We use a renewal theoretic framework in this note to answer this question. Our analysis yields two results. First, we show that the long run expected wait time is independent of the arrival rate of the tourists. Second, we explain why this long run expected wait time is equal to the average residual life of a particular renewal process.
Joint Scheduling and ARQ for MU-MIMO Downlink in the Presence of Inter-Cell Interference
User scheduling and multiuser multi-antenna (MU-MIMO) transmission are at the
core of high rate data-oriented downlink schemes of the next-generation of
cellular systems (e.g., LTE-Advanced). Scheduling selects groups of users
according to their channels vector directions and SINR levels. However, when
scheduling is applied independently in each cell, the inter-cell interference
(ICI) power at each user receiver is not known in advance since it changes at
each new scheduling slot depending on the scheduling decisions of all
interfering base stations. In order to cope with this uncertainty, we consider
the joint operation of scheduling, MU-MIMO beamforming and Automatic Repeat
reQuest (ARQ). We develop a game-theoretic framework for this problem and build
on stochastic optimization techniques in order to find optimal scheduling and
ARQ schemes. Particularizing our framework to the case of "outage service
rates", we obtain a scheme based on adaptive variable-rate coding at the
physical layer, combined with ARQ at the Logical Link Control (ARQ-LLC). Then,
we present a novel scheme based on incremental redundancy Hybrid ARQ (HARQ)
that is able to achieve a throughput performance arbitrarily close to the
"genie-aided service rates", with no need for a genie that provides
non-causally the ICI power levels. The novel HARQ scheme is both easier to
implement and superior in performance with respect to the conventional
combination of adaptive variable-rate coding and ARQ-LLC.Comment: Submitted to IEEE Transactions on Communications, v2: small
correction
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
- …