626 research outputs found
Recommended from our members
Multimedia delivery in the future internet
The term âNetworked Mediaâ implies that all kinds of media including text, image, 3D graphics, audio
and video are produced, distributed, shared, managed and consumed on-line through various networks,
like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white
paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked
challenges of the Networked Media in the transition to the Future of the Internet.
Internet has evolved and changed the way we work and live. End users of the Internet have been confronted
with a bewildering range of media, services and applications and of technological innovations concerning
media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace
of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more
than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so
regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected
to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising
to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged
that in a near- to mid-term future, the Internet will provide the means to share and distribute (new)
multimedia content and services with superior quality and striking flexibility, in a trusted and personalized
way, improving citizensâ quality of life, working conditions, edutainment and safety.
In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe
network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as
community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of
interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and
innovative applications âon the moveâ, like virtual collaboration environments, personalised services/
media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content
combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P
networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to
contribute towards such a vision.
Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6)
and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily
contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way
ahead in the area of Content Aware media delivery platforms
Exploiting Parallelism in the Design of Peer-to-Peer Overlays
Many peer-to-peer overlay operations are inherently parallel and this parallelism can be exploited by using multi-destination multicast routing, resulting in significant message reduction in the underlying network. We propose criteria for assessing when multicast routing can effectively be used, and compare multi-destination multicast and host group multicast using these criteria. We show that the assumptions underlying the Chuang-Sirbu multicast scaling law are valid in large-scale peer-to-peer overlays, and thus Chuang-Sirbu is suitable for estimating the message reduction when replacing unicast overlay messages with multicast messages. Using simulation, we evaluate message savings in two overlay algorithms when multi-destination multicast routing is used in place of unicast messages. We further describe parallelism in a range of overlay algorithms including multi-hop, variable-hop, load-balancing, random walk, and measurement overlay
Efficient service discovery in wide area networks
Living in an increasingly networked world, with an abundant number
of services available to consumers, the consumer electronics market
is enjoying a boom. The average consumer in the developed world may
own several networked devices such as games consoles, mobile phones,
PDAs, laptops and desktops, wireless picture frames and printers to
name but a few. With this growing number of networked devices comes
a growing demand for services, defined here as functions requested
by a client and provided by a networked node. For example, a client
may wish to download and share music or pictures, find and use
printer services, or lookup information (e.g. train times, cinema
bookings).
It is notable that a significant proportion of networked devices are
now mobile. Mobile devices introduce a new dynamic to the service
discovery problem, such as lower battery and processing power and
more expensive bandwidth. Device owners expect to access services
not only in their immediate proximity, but further afield (e.g. in
their homes and offices). Solving these problems is the focus of
this research.
This Thesis offers two alternative approaches to service discovery
in Wide Area Networks (WANs). Firstly, a unique combination of the
Session Initiation Protocol (SIP) and the OSGi middleware technology
is presented to provide both mobility and service discovery
capability in WANs. Through experimentation, this technique is shown
to be successful where the number of operating domains is small, but
it does not scale well.
To address the issue of scalability, this Thesis proposes the use of
Peer-to-Peer (P2P) service overlays as a medium for service
discovery in WANs. To confirm that P2P overlays can in fact support
service discovery, a technique to utilise the Distributed Hash Table
(DHT) functionality of distributed systems is used to store and
retrieve service advertisements. Through simulation, this is shown
to be both a scalable and a flexible service discovery technique.
However, the problems associated with P2P networks with respect to
efficiency are well documented.
In a novel approach to reduce messaging costs in P2P networks,
multi-destination multicast is used. Two well known P2P overlays are
extended using the Explicit Multi-Unicast (XCAST) protocol. The
resulting analysis of this extension provides a strong argument for
multiple P2P maintenance algorithms co-existing in a single P2P
overlay to provide adaptable performance. A novel multi-tier P2P
overlay system is presented, which is tailored for service rich
mobile devices and which provides an efficient platform for service
discovery
Poor Man's Content Centric Networking (with TCP)
A number of different architectures have been proposed in support of data-oriented or information-centric networking. Besides a similar visions, they share the need for designing a new networking architecture. We present an incrementally deployable approach to content-centric networking based upon TCP. Content-aware senders cooperate with probabilistically operating routers for scalable content delivery (to unmodified clients), effectively supporting opportunistic caching for time-shifted access as well as de-facto synchronous multicast delivery. Our approach is application protocol-independent and provides support beyond HTTP caching or managed CDNs. We present our protocol design along with a Linux-based implementation and some initial feasibility checks
QuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts
Large inter-datacenter transfers are crucial for cloud service efficiency and
are increasingly used by organizations that have dedicated wide area networks
between datacenters. A recent work uses multicast forwarding trees to reduce
the bandwidth needs and improve completion times of point-to-multipoint
transfers. Using a single forwarding tree per transfer, however, leads to poor
performance because the slowest receiver dictates the completion time for all
receivers. Using multiple forwarding trees per transfer alleviates this
concern--the average receiver could finish early; however, if done naively,
bandwidth usage would also increase and it is apriori unclear how best to
partition receivers, how to construct the multiple trees and how to determine
the rate and schedule of flows on these trees. This paper presents QuickCast, a
first solution to these problems. Using simulations on real-world network
topologies, we see that QuickCast can speed up the average receiver's
completion time by as much as while only using more
bandwidth; further, the completion time for all receivers also improves by as
much as faster at high loads.Comment: [Extended Version] Accepted for presentation in IEEE INFOCOM 2018,
Honolulu, H
- âŠ