By Topic

Effective content drifting method on content-based network using game theory

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
$33 $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

4 Author(s)
Y. Nakamura ; Tokyo Inst. of Technol., Japan ; A. Kobayashi ; K. Yamaoka ; Y. Sakai

Content distribution networks (CDNs) are well known to be able to distribute many kinds of content on the Internet, where caches and mirror servers are used to store and distribute content. In this paper, we propose novel network architecture to distribute content, called a content-based network (CBN). Each unit of content in the CBN has meta-data including keys to retrieve content If meta-data has a parameter that indicates how often the content has recently been retrieved, we can select adequate operation ("store content", "delete content", "move content", "divide content", and "merge content") considering network traffic, capacity in each node, and also the meta-data parameters. To achieve the above, we used the game theory. In this paper, two game players and gain are defined; "content group" player and "neighboring nodes group" player. Computer simulation revealed that the proposed algorithm has the capability of minimizing the number of hops to retrieve target content.

Published in:

Communications, Computers and signal Processing, 2003. PACRIM. 2003 IEEE Pacific Rim Conference on  (Volume:1 )

Date of Conference:

28-30 Aug. 2003