Enabling information-centric networking : architecture, protocols, and applications

Access full-text files

Date

2010-08

Authors

Cho, Tae Won, 1978-

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

As the Internet is becoming information-centric, network services increasingly demand scalable and efficient communication of information between a multitude of information producers and large groups of interested information consumers. Such information-centric services are growing rapidly in use and deployment. Examples of deployed services that are information-centric include: IPTV, MMORPG, VoD, video conferencing, file sharing, software updates, RSS dissemination, online markets, and grid computing. To effectively support future information-centric services, the network infrastructure for multi-point communication has to address a number of significant challenges: (i) how to understand massive information-centric groups in a scalable manner, (ii) how to analyze and predict the evolution of those groups in an accurate and efficient way, and (iii) how to disseminate content from information producers to a vast number of groups with potentially long-lived membership and highly diverse, dynamic group activity levels? This dissertation proposes novel architecture and protocols that effectively address the above challenges in supporting multi-point communication for future information-centric network services. In doing so, we make the following three major contributions: (1) We develop a novel technique called Proximity Embedding (PE) that can approximate a family of path-ensembled based proximity measures for information-centric groups. We develop Clustered Spectral Graph Embedding (SCGE) that captures the essential structure of large graphs in a highly efficient and scalable manner. Our techniques help to explain the proximity (closeness) of users in information-centric groups, and can be applied to a variety of analysis tasks of complex network structures. (2) Based on SCGE, we develop new supervision based link prediction techniques called Clustered Spectral Learning and Clustered Polynomial Learning that enable us to predict the evolution of massive and complex network structures in an accurate and efficient way. By exploiting supervised information from past snapshots of network structures, our methods yield up to 20% improvement in link prediction accuracy when compared to existing state-of-the-art methods. (3) Finally, we develop a novel multicast infrastructure called Multicast with Adaptive Dual-state (MAD). MAD supports large number of group and group membership, and efficient content dissemination in a presence of dynamic group activity. We demonstrate the effectiveness of our approach in extensive simulation, analysis, and emulation through the real system implementation.

Description

text

LCSH Subject Headings

Citation