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

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.