
	Information Technology Journal
	Year: 2011 \| Volume: 10 \| Issue: 12 \| Page No.: 2242-2251 DOI: 10.3923/itj.2011.2242.2251

Incentive Mechanism for P2P Networks Based on Markov Chain

Hongwei Chen, Hui Xu, Chunzhi Wang and Ke Zhou

Abstract: Due to node’s behavioral analysis, grasping the inertia psychology of its behavior choice and considering whole influences of the network such as group selection, this study establishes the forecast mechanism in P2P network. In the process of network running and node communication, this mechanism carries on real-time surveillance to all nodes, according to the differences of network states and takes the corresponding incentive and penalty measure to the node, thus drives node well serve for the P2P network. This mechanism uses the Markov chain to forecast future development state of the network, combines the forecast of future node state shift situation and adopts more prompt and more effective measure to the network ahead of time. Summarizing the types of network state, each network state mechanism will have a correspond model which will carry on the drive to the node behavior.

PDF Fulltext XML References Citation Report Citation

RELATED ARTICLES:

•	Fast-Flux Botnet Detection Based on Weighted SVM

•	An Anonymous Authentication Scheme Based on Fully Homomorphic Encryption in P2P Networks

How to cite this article:

Hongwei Chen, Hui Xu, Chunzhi Wang and Ke Zhou, 2011. Incentive Mechanism for P2P Networks Based on Markov Chain. Information Technology Journal, 10: 2242-2251.

DOI: 10.3923/itj.2011.2242.2251

URL: https://scialert.net/abstract/?doi=itj.2011.2242.2251

COMMENT ON THIS PAPER

Navigation


		Online First
		Current Issue
		Previous Issues
		Editorial Board
		Submit a Manuscript
		Guide to Authors
		Subscribe to E-alerts

Indexed In


		ASCI-Database
		Asian Digital Library
		Google Scholar

Science Alert