Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A self-organization mechanism based on cross-entropy method for P2P-like applications

A self-organization mechanism based on cross-entropy method for P2P-like applications A Self-Organization Mechanism Based on Cross-Entropy Method for P2P-Like Applications GANG CHEN and ABDOLHOSSEIN SARRAFZADEH Unitec New Zealand and CHOR PING LOW and LIANG ZHANG Nanyang Technological University P2P-like applications are quickly gaining popularity in the Internet. Such applications are commonly modeled as graphs with nodes and edges. Usually nodes represent running processes that exchange information with each other through communication channels as represented by the edges. They often need to autonomously determine their suitable working mode or local status for the purpose of improving performance, reducing operation cost, or achieving system-level design goals. In order to achieve this objective, the concept of status con guration is introduced in this article and a mathematical correspondence is further established between status con guration and an optimization index (OI), which serves as a uni ed abstraction of any system design goals. Guided by this correspondence and inspired by the cross-entropy algorithm, a cross-entropy-driven selforganization mechanism (CESM) is proposed in this article. CESM exhibits the self-organization property since desirable status con gurations that lead to high OI values will quickly emerge from purely localized interactions. Both theoretical and experimental analysis have been performed. The results strongly indicate that CESM is a http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Autonomous and Adaptive Systems (TAAS) Association for Computing Machinery

A self-organization mechanism based on cross-entropy method for P2P-like applications

Loading next page...
 
/lp/association-for-computing-machinery/a-self-organization-mechanism-based-on-cross-entropy-method-for-p2p-nby2Mgrv0q
Publisher
Association for Computing Machinery
Copyright
Copyright © 2010 by ACM Inc.
ISSN
1556-4665
DOI
10.1145/1867713.1867716
Publisher site
See Article on Publisher Site

Abstract

A Self-Organization Mechanism Based on Cross-Entropy Method for P2P-Like Applications GANG CHEN and ABDOLHOSSEIN SARRAFZADEH Unitec New Zealand and CHOR PING LOW and LIANG ZHANG Nanyang Technological University P2P-like applications are quickly gaining popularity in the Internet. Such applications are commonly modeled as graphs with nodes and edges. Usually nodes represent running processes that exchange information with each other through communication channels as represented by the edges. They often need to autonomously determine their suitable working mode or local status for the purpose of improving performance, reducing operation cost, or achieving system-level design goals. In order to achieve this objective, the concept of status con guration is introduced in this article and a mathematical correspondence is further established between status con guration and an optimization index (OI), which serves as a uni ed abstraction of any system design goals. Guided by this correspondence and inspired by the cross-entropy algorithm, a cross-entropy-driven selforganization mechanism (CESM) is proposed in this article. CESM exhibits the self-organization property since desirable status con gurations that lead to high OI values will quickly emerge from purely localized interactions. Both theoretical and experimental analysis have been performed. The results strongly indicate that CESM is a

Journal

ACM Transactions on Autonomous and Adaptive Systems (TAAS)Association for Computing Machinery

Published: Nov 1, 2010

There are no references for this article.