Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(6)
Asynchronous Communication
Communication Model
Content Delivery Network
Content Distribution
Information Need
Publish Subscribe
Subscribe
Academic
Publications
Storage planning and replica assignment in content-centric publish/subscribe networks
Storage planning and replica assignment in content-centric publish/subscribe networks,10.1016/j.comnet.2011.07.023,Computer Networks,Vasilis Sourlas,G
Edit
Storage planning and replica assignment in content-centric publish/subscribe networks
BibTex
|
RIS
|
RefWorks
Download
Vasilis Sourlas
,
Georgios S. Paschos
,
Dimitrios Katsaros
,
Leandros Tassiulas
Content-centric publish/subscribe networking is a flexible
communication model
that meets the requirements of the
content distribution
in the Internet, where information needs to be addressed by semantic attributes rather than origin and destination identities. In current implementations of publish/subscribe networks, messages are not stored and only active subscribers receive published messages. However, in a dynamic scenario, where users join the network at various instances, a user may be interested in content published before its subscription time. In this paper, we introduce a mechanism that enables storing in such networks, while maintaining the main principle of loose-coupled and asynchronous communication. Furthermore, we propose a new storage placement and replica assignment algorithm which differentiates classes of content based on their popularity and minimizes the clients response latency and the overall traffic of the network. We also present and compare two replica assignment alternatives and examine their performance when both the locality and the popularity of users request change. The performance of our proposed placement and replica assignment algorithm and the proposed storing mechanism is evaluated via simulations and insights are given for future work. The proposed mechanism is compared with mechanisms from the CDN (Content Delivery Networks) context and performs as close as 1–15% (depending on the conducted experiment) to a greedy (near optimal) approach installing up to 3 times less storage servers in the network and providing the necessary differentiation among the classes of the content.
Journal:
Computer Networks - COMPUT NETW
, vol. 55, no. 18, pp. 4021-4032, 2011
DOI:
10.1016/j.comnet.2011.07.023
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)