24,822 research outputs found
vSkyConf: Cloud-assisted Multi-party Mobile Video Conferencing
As an important application in the busy world today, mobile video
conferencing facilitates virtual face-to-face communication with friends,
families and colleagues, via their mobile devices on the move. However, how to
provision high-quality, multi-party video conferencing experiences over mobile
devices is still an open challenge. The fundamental reason behind is the lack
of computation and communication capacities on the mobile devices, to scale to
large conferencing sessions. In this paper, we present vSkyConf, a
cloud-assisted mobile video conferencing system to fundamentally improve the
quality and scale of multi-party mobile video conferencing. By novelly
employing a surrogate virtual machine in the cloud for each mobile user, we
allow fully scalable communication among the conference participants via their
surrogates, rather than directly. The surrogates exchange conferencing streams
among each other, transcode the streams to the most appropriate bit rates, and
buffer the streams for the most efficient delivery to the mobile recipients. A
fully decentralized, optimal algorithm is designed to decide the best paths of
streams and the most suitable surrogates for video transcoding along the paths,
such that the limited bandwidth is fully utilized to deliver streams of the
highest possible quality to the mobile recipients. We also carefully tailor a
buffering mechanism on each surrogate to cooperate with optimal stream
distribution. We have implemented vSkyConf based on Amazon EC2 and verified the
excellent performance of our design, as compared to the widely adopted unicast
solutions.Comment: 10 page
A survey of parallel execution strategies for transitive closure and logic programs
An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using
end-to-end random measurements (e.g., delay) between a subset of nodes,
referred to as the participants. The rest of the nodes are hidden, and do not
provide any information for topology discovery. We consider topology discovery
under two routing models: (a) the participants exchange messages along the
shortest paths and obtain end-to-end measurements, and (b) additionally, the
participants exchange messages along the second shortest path. For scenario
(a), our proposed algorithm results in a sub-linear edit-distance guarantee
using a sub-linear number of uniformly selected participants. For scenario (b),
we obtain a much stronger result, and show that we can achieve consistent
reconstruction when a sub-linear number of uniformly selected nodes
participate. This implies that accurate discovery of sparse random graphs is
tractable using an extremely small number of participants. We finally obtain a
lower bound on the number of participants required by any algorithm to
reconstruct the original random graph up to a given edit distance. We also
demonstrate that while consistent discovery is tractable for sparse random
graphs using a small number of participants, in general, there are graphs which
cannot be discovered by any algorithm even with a significant number of
participants, and with the availability of end-to-end information along all the
paths between the participants.Comment: A shorter version appears in ACM SIGMETRICS 2011. This version is
scheduled to appear in J. on Random Structures and Algorithm
Determination of the Topology of a Directed Network
We consider strongly-connected directed networks of identical synchronous,
finite-state processors with in- and out-degree uniformly bounded by a network
constant. Via a straightforward extension of Ostrovsky and Wilkerson's
Backwards Communication Algorithm in [OW], we exhibit a protocol which solves
the Global Topology Determination Problem, the problem of having the root
processor map the global topology of a network of unknown size and topology,
with running time O(ND) where N represents the number of processors and D
represents the diameter of the network. A simple counting argument suffices to
show that the Global Topology Determination Problem has time-complexity Omega(N
logN) which makes the protocol presented asymptotically time-optimal for many
large networks.Comment: 9 pages, no figures, accepted to appear in IPDPS 2002 (unable to
attend), (journal version to appear in Information Processing Letters
A graph-based mathematical morphology reader
This survey paper aims at providing a "literary" anthology of mathematical
morphology on graphs. It describes in the English language many ideas stemming
from a large number of different papers, hence providing a unified view of an
active and diverse field of research
Brief Announcement: Massively Parallel Approximate Distance Sketches
Data structures that allow efficient distance estimation have been extensively studied both in centralized models and classical distributed models. We initiate their study in newer (and arguably more realistic) models of distributed computation: the Congested Clique model and the Massively Parallel Computation (MPC) model. In MPC we give two main results: an algorithm that constructs stretch/space optimal distance sketches but takes a (small) polynomial number of rounds, and an algorithm that constructs distance sketches with worse stretch but that only takes polylogarithmic rounds. Along the way, we show that other useful combinatorial structures can also be computed in MPC. In particular, one key component we use is an MPC construction of the hopsets of Elkin and Neiman (2016). This result has additional applications such as the first polylogarithmic time algorithm for constant approximate single-source shortest paths for weighted graphs in the low memory MPC setting
- …