By Topic

Performance comparison of content-oriented networking alternatives: A tree versus a distributed hash table

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Jaeyoung Choi ; Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., Seoul, South Korea ; Jinyoung Han ; Eunsang Cho ; Hyunchul Kim
more authors

While the Internet was designed with host-oriented networking applications, recent Internet statistics show that content-oriented traffic has become more and more dominant. Even though content-oriented networking, which tries to resolve this discordance, has received increasing attention, there have been few comprehensive and quantitative studies on how to realize a content-oriented networking architecture. In this paper, we focus on the design alternatives of the content-oriented networking architecture and evaluate their performance: (i) how to locate contents, (ii) how to cache contents, and (iii) how to deliver contents. There are two major infrastructure alternatives in substantiating these mechanisms: a tree and a distributed hash table (DHT).We carry out comprehensive simulation experiments to compare these alternatives in terms of content transfer latency, cache effectiveness, and failure resilience.

Published in:

Local Computer Networks, 2009. LCN 2009. IEEE 34th Conference on

Date of Conference:

20-23 Oct. 2009