6,602 research outputs found
Analyzing Peer Selection Policies for BitTorrent Multimedia On-Demand Streaming Systems in Internet
The adaptation of the BitTorrent protocol to multimedia on-demand streaming
systems essentially lies on the modification of its two core algorithms, namely
the piece and the peer selection policies, respectively. Much more attention
has though been given to the piece selection policy. Within this context, this
article proposes three novel peer selection policies for the design of
BitTorrent-like protocols targeted at that type of systems: Select Balanced
Neighbour Policy (SBNP), Select Regular Neighbour Policy (SRNP), and Select
Optimistic Neighbour Policy (SONP). These proposals are validated through a
competitive analysis based on simulations which encompass a variety of
multimedia scenarios, defined in function of important characterization
parameters such as content type, content size, and client interactivity
profile. Service time, number of clients served and efficiency retrieving
coefficient are the performance metrics assessed in the analysis. The final
results mainly show that the novel proposals constitute scalable solutions that
may be considered for real project designs. Lastly, future work is included in
the conclusion of this paper.Comment: 19 PAGE
Improving BitTorrent's Peer Selection For Multimedia Content On-Demand Delivery
The great efficiency achieved by the BitTorrent protocol for the distribution
of large amounts of data inspired its adoption to provide multimedia content
on-demand delivery over the Internet. As it is not designed for this purpose,
some adjustments have been proposed in order to meet the related QoS
requirements like low startup delay and smooth playback continuity.
Accordingly, this paper introduces a BitTorrent-like proposal named as
Quota-Based Peer Selection (QBPS). This proposal is mainly based on the
adaptation of the original peer-selection policy of the BitTorrent protocol.
Its validation is achieved by means of simulations and competitive analysis.
The final results show that QBPS outperforms other recent proposals of the
literature. For instance, it achieves a throughput optimization of up to 48.0%
in low-provision capacity scenarios where users are very interactive.Comment: International Journal of Computer Networks & Communications(IJCNC)
Vol.7, No.6, November 201
POOL File Catalog, Collection and Metadata Components
The POOL project is the common persistency framework for the LHC experiments
to store petabytes of experiment data and metadata in a distributed and grid
enabled way. POOL is a hybrid event store consisting of a data streaming layer
and a relational layer. This paper describes the design of file catalog,
collection and metadata components which are not part of the data streaming
layer of POOL and outlines how POOL aims to provide transparent and efficient
data access for a wide range of environments and use cases - ranging from a
large production site down to a single disconnected laptops. The file catalog
is the central POOL component translating logical data references to physical
data files in a grid environment. POOL collections with their associated
metadata provide an abstract way of accessing experiment data via their logical
grouping into sets of related data objects.Comment: Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 4 pages, 1 eps figure, PSN MOKT00
Combining edge and cloud computing for mobility analytics
Mobility analytics using data generated from the Internet of Mobile Things
(IoMT) is facing many challenges which range from the ingestion of data streams
coming from a vast number of fog nodes and IoMT devices to avoiding overflowing
the cloud with useless massive data streams that can trigger bottlenecks [1].
Managing data flow is becoming an important part of the IoMT because it will
dictate in which platform analytical tasks should run in the future. Data flows
are usually a sequence of out-of-order tuples with a high data input rate, and
mobility analytics requires a real-time flow of data in both directions, from
the edge to the cloud, and vice-versa. Before pulling the data streams to the
cloud, edge data stream processing is needed for detecting missing, broken, and
duplicated tuples in addition to recognize tuples whose arrival time is out of
order. Analytical tasks such as data filtering, data cleaning and low-level
data contextualization can be executed at the edge of a network. In contrast,
more complex analytical tasks such as graph processing can be deployed in the
cloud, and the results of ad-hoc queries and streaming graph analytics can be
pushed to the edge as needed by a user application. Graphs are efficient
representations used in mobility analytics because they unify knowledge about
connectivity, proximity and interaction among moving things. This poster
describes the preliminary results from our experimental prototype developed for
supporting transit systems, in which edge and cloud computing are combined to
process transit data streams forwarded from fog nodes into a cloud. The
motivation of this research is to understand how to perform meaningfulness
mobility analytics on transit feeds by combining cloud and fog computing
architectures in order to improve fleet management, mass transit and remote
asset monitoringComment: Edge Computing, Cloud Computing, Mobility Analytics, Internet of
Mobile Things, Edge Fog Fabri
Large-Scale User Modeling with Recurrent Neural Networks for Music Discovery on Multiple Time Scales
The amount of content on online music streaming platforms is immense, and
most users only access a tiny fraction of this content. Recommender systems are
the application of choice to open up the collection to these users.
Collaborative filtering has the disadvantage that it relies on explicit
ratings, which are often unavailable, and generally disregards the temporal
nature of music consumption. On the other hand, item co-occurrence algorithms,
such as the recently introduced word2vec-based recommenders, are typically left
without an effective user representation. In this paper, we present a new
approach to model users through recurrent neural networks by sequentially
processing consumed items, represented by any type of embeddings and other
context features. This way we obtain semantically rich user representations,
which capture a user's musical taste over time. Our experimental analysis on
large-scale user data shows that our model can be used to predict future songs
a user will likely listen to, both in the short and long term.Comment: Author pre-print version, 20 pages, 6 figures, 4 table
An Efficient Transport Protocol for delivery of Multimedia An Efficient Transport Protocol for delivery of Multimedia Content in Wireless Grids
A grid computing system is designed for solving complicated scientific and
commercial problems effectively,whereas mobile computing is a traditional
distributed system having computing capability with mobility and adopting
wireless communications. Media and Entertainment fields can take advantage from
both paradigms by applying its usage in gaming applications and multimedia data
management. Multimedia data has to be stored and retrieved in an efficient and
effective manner to put it in use. In this paper, we proposed an application
layer protocol for delivery of multimedia data in wireless girds i.e.
multimedia grid protocol (MMGP). To make streaming efficient a new video
compression algorithm called dWave is designed and embedded in the proposed
protocol. This protocol will provide faster, reliable access and render an
imperceptible QoS in delivering multimedia in wireless grid environment and
tackles the challenging issues such as i) intermittent connectivity, ii) device
heterogeneity, iii) weak security and iv) device mobility.Comment: 20 pages, 15 figures, Peer Reviewed Journa
- …