32,263 research outputs found
Delivering Live Multimedia Streams to Mobile Hosts in a Wireless Internet with Multiple Content Aggregators
We consider the distribution of channels of live multimedia content (e.g., radio or TV broadcasts) via multiple content aggregators. In our work, an aggregator receives channels from content sources and redistributes them to a potentially large number of mobile hosts. Each aggregator can offer a channel in various configurations to cater for different wireless links, mobile hosts, and user preferences. As a result, a mobile host can generally choose from different configurations of the same channel offered by multiple alternative aggregators, which may be available through different interfaces (e.g., in a hotspot). A mobile host may need to handoff to another aggregator once it receives a channel. To prevent service disruption, a mobile host may for instance need to handoff to another aggregator when it leaves the subnets that make up its current aggregator�s service area (e.g., a hotspot or a cellular network).\ud
In this paper, we present the design of a system that enables (multi-homed) mobile hosts to seamlessly handoff from one aggregator to another so that they can continue to receive a channel wherever they go. We concentrate on handoffs between aggregators as a result of a mobile host crossing a subnet boundary. As part of the system, we discuss a lightweight application-level protocol that enables mobile hosts to select the aggregator that provides the �best� configuration of a channel. The protocol comes into play when a mobile host begins to receive a channel and when it crosses a subnet boundary while receiving the channel. We show how our protocol can be implemented using the standard IETF session control and description protocols SIP and SDP. The implementation combines SIP and SDP�s offer-answer model in a novel way
Control of Multiple Remote Servers for Quality-Fair Delivery of Multimedia Contents
This paper proposes a control scheme for the quality-fair delivery of several
encoded video streams to mobile users sharing a common wireless resource. Video
quality fairness, as well as similar delivery delays are targeted among
streams. The proposed controller is implemented within some aggregator located
near the bottleneck of the network. The transmission rate among streams is
adapted based on the quality of the already encoded and buffered packets in the
aggregator. Encoding rate targets are evaluated by the aggregator and fed back
to each remote video server (fully centralized solution), or directly evaluated
by each server in a distributed way (partially distributed solution). Each
encoding rate target is adjusted for each stream independently based on the
corresponding buffer level or buffering delay in the aggregator. Communication
delays between the servers and the aggregator are taken into account. The
transmission and encoding rate control problems are studied with a
control-theoretic perspective. The system is described with a multi-input
multi-output model. Proportional Integral (PI) controllers are used to adjust
the video quality and control the aggregator buffer levels. The system
equilibrium and stability properties are studied. This provides guidelines for
choosing the parameters of the PI controllers. Experimental results show the
convergence of the proposed control system and demonstrate the improvement in
video quality fairness compared to a classical transmission rate fair streaming
solution and to a utility max-min fair approach
Ad Hoc Multi-Input Functional Encryption
Consider sources that supply sensitive data to an aggregator. Standard encryption only hides the data from eavesdroppers, but using specialized encryption one can hope to hide the data (to the extent possible) from the aggregator itself. For flexibility and security, we envision schemes that allow sources to supply encrypted data, such that at any point a dynamically-chosen subset of sources can allow an agreed-upon joint function of their data to be computed by the aggregator. A primitive called multi-input functional encryption (MIFE), due to Goldwasser et al. (EUROCRYPT 2014), comes close, but has two main limitations:
- it requires trust in a third party, who is able to decrypt all the data, and
- it requires function arity to be fixed at setup time and to be equal to the number of parties.
To drop these limitations, we introduce a new notion of ad hoc MIFE. In our setting, each source generates its own public key and issues individual, function-specific secret keys to an aggregator. For successful decryption, an aggregator must obtain a separate key from each source whose ciphertext is being computed upon. The aggregator could obtain multiple such secret-keys from a user corresponding to functions of varying arity. For this primitive, we obtain the following results:
- We show that standard MIFE for general functions can be bootstrapped to ad hoc MIFE for free, i.e. without making any additional assumption.
- We provide a direct construction of ad hoc MIFE for the inner product functionality based on the Learning with Errors (LWE) assumption. This yields the first construction of this natural primitive based on a standard assumption.
At a technical level, our results are obtained by combining standard MIFE schemes and two-round secure multiparty computation (MPC) protocols in novel ways highlighting an interesting interplay between MIFE and two-round MPC
Comparing the performance of baseball players : a multiple output approach
This article extends ideas from the economics literature on multiple output production and efficiency to develop methods for comparing baseball players that take into account the many dimensions to batting performance. A key part of this approach is the output aggregator. The weights in this output aggregator can be selected a priori (as is done with batting or slugging averages) or can be estimated statistically based on the performance of the best players in baseball. Once the output aggregator is obtained, an individual player can then be measured relative to the best, and a number between 0 and 1 characterizes his performance as a fraction of the best. The methods are applied to hitters using data from 1995-1999 on all regular players in baseball's major leagues
Aggregation of Votes with Multiple Positions on Each Issue
We consider the problem of aggregating votes cast by a society on a fixed set
of issues, where each member of the society may vote for one of several
positions on each issue, but the combination of votes on the various issues is
restricted to a set of feasible voting patterns. We require the aggregation to
be supportive, i.e. for every issue the corresponding component of
every aggregator on every issue should satisfy . We prove that, in such a set-up, non-dictatorial
aggregation of votes in a society of some size is possible if and only if
either non-dictatorial aggregation is possible in a society of only two members
or a ternary aggregator exists that either on every issue is a majority
operation, i.e. the corresponding component satisfies , or on every issue is a minority operation, i.e.
the corresponding component satisfies We then introduce a notion of uniformly non-dictatorial
aggregator, which is defined to be an aggregator that on every issue, and when
restricted to an arbitrary two-element subset of the votes for that issue,
differs from all projection functions. We first give a characterization of sets
of feasible voting patterns that admit a uniformly non-dictatorial aggregator.
Then making use of Bulatov's dichotomy theorem for conservative constraint
satisfaction problems, we connect social choice theory with combinatorial
complexity by proving that if a set of feasible voting patterns has a
uniformly non-dictatorial aggregator of some arity then the multi-sorted
conservative constraint satisfaction problem on , in the sense introduced by
Bulatov and Jeavons, with each issue representing a sort, is tractable;
otherwise it is NP-complete
Crawford-Sobel meet Lloyd-Max on the grid
The main contribution of this work is twofold. First, we apply, for the first
time, a framework borrowed from economics to a problem in the smart grid
namely, the design of signaling schemes between a consumer and an electricity
aggregator when these have non-aligned objectives. The consumer's objective is
to meet its need in terms of power and send a request (a message) to the
aggregator which does not correspond, in general, to its actual need. The
aggregator, which receives this request, not only wants to satisfy it but also
wants to manage the cost induced by the residential electricity distribution
network. Second, we establish connections between the exploited framework and
the quantization problem. Although the model assumed for the payoff functions
for the consumer and aggregator is quite simple, it allows one to extract
insights of practical interest from the analysis conducted. This allows us to
establish a direct connection with quantization, and more importantly, to open
a much more general challenge for source and channel coding.Comment: ICASSP 2014, 5 page
A characterization of the composite price variable to approximate a price aggregator function in the Quadratic Almost Ideal Demand System
In investigating linear approximations to the Quadratic Almost Ideal Demand System (QUAIDS), Matsuda (2006) proposed a composite variable to approximate a price aggregator function. This paper provides an axiomatic characterization of this composite price variable.QUAIDS, Linear approximation, Price aggregator, Characterization
- …