International Journal of Applied Science and Engineering
Published by Chaoyang University of Technology

Shu-Ching Wanga*, Wei-Ling Lina, Hsin-Hung Panb and Po-Chien Lina
aDepartment of Information Management, Chaoyang University of Technology, Taiwan, R.O.C.
bDepartment of M-Commerce and Multimedia Applications, Asia University, Taiwan, R.O.C.


Download Citation: |
Download PDF


Because Peer-to-Peer (P2P) has the characteristics of providing scalable network services, related applications of P2P are one of the hot topics of network services today. However, too many P2P applications may lead to inefficient use of network resources or extremely poor application execution performance. At the same time, it may also occupy a large amount of bandwidth, causing an increase in the load of Internet Service Providers (ISPs). In order to avoid excessive network traffic burden, ISPs often use a flow control mechanism to prevent P2P from generating excessive traffic, which leads to the degradation of P2P software service quality. Since P4P (Proactive network Provider Participation for P2P) is one of the technologies used for P2P network optimization, it provides communication between ISPs and P2P service providers in a cooperative manner to reduce P2P traffic and ISP operating costs. Therefore, in order to reduce the operating costs of ISPs and the bandwidth required for P2P application services, a three-layer architecture combining location awareness with interest clustering and P4P framework is proposed in this study, which is called ICP4P (interest clusters based P4P ). Using the ICP4P proposed by this research will reduce Internet traffic and increase the robustness of the network. In addition, this study provides a candidate peer election mechanism to improve the service quality of P2P. When super peer fails, leaves or overloads, the backup super peer or cooperative peers will be enabled to maintain the stability of whole network.

Keywords: Peer-to-peer network; P4P; quality of service; internet service provider; interest cluster; location awareness.

Share this article with your colleagues



  1. [1] Nobre, J. C., Melchiors, C., Marquezan, C. C., Tarouco, L. M. R., and Granville, L. Z. 2018. A survey on the use of P2P technology for network management. Journal of Network and Systems Management, 26, 1: 189–221. [Publisher Site]

  2. [2] Ijaz, H., Welzl, M., and Jamil, B. 2019. A survey and comparison on overlay‐underlay mapping techniques in peer‐to‐peer overlay networks. International Journal of Communication Systems, 32, 3: e3872. [Publisher Site]

  3. [3] Neumann, C., Chandrashekar, J., and Le Merrer, E. 2019. S. Patent Application, No. 16/025: 175. 

  4. [4] Steinmetz, R., and Wehrle, K. 2005. What Is This “Peer-to-Peer” About?. Peer-to-peer systems and applications. Springer, Berlin, Heidelberg: 9–16. [Publisher Site]

  5. [5] Yang, J., Zhong, Y., and Zhang, S. 2003. An efficient interest-group based search mechanism in unstructured peer-to-peer networks. In Proceeding of IEEE 2003 International Conference on Computer Networks and Mobile Computing: 247–252. 

  6. [6] Hu, J. J. 2007. Hybrid P2P interest clustering system with location awareness. Master's Thesis, Department of Information Engineering, National Central University, Taoyuan County, Taiwan

  7. [7] Sahhaf, S., Tavernier, W., Colle, D., and Pickavet, M. 2016. Resilient availability and bandwidth-aware multipath provisioning for media transfer over the internet. In Proceeding of IEEE 2016 8th International Workshop on Resilient Networks Design and Modeling: 134–141. [Publisher Site]

  8. [8] Guo, Y., Liu, L., Wu, Y., and Hardy, J. 2018. Interest-aware content discovery in peer-to-peer social networks. ACM Transactions on Internet Technology,18, 3: 1–21. [Publisher Site]

  9. [9] Xie, H., Yang, Y. R., Krishnamurthy, A., Liu, Y. G., and Silberschatz, A. 2008. P4P: Provider portal for applications. ACM SIGCOMM Computer Communication Review, 38, 4: 351–362. [Publisher Site]

  10. [10] Li, L., Wang, F., Yu, W., Mao, X., Yang, M., and Li, Z. 2018. An improved design of P4P based on distributed tracker. International Journal of Information and Communication Technology, 13, 3: 340–350. [Publisher Site]

  11. [11] Ying, Z., Sining, W., Zhiyong, L., and Qiuhong, S. 2017. Research on P4PCDN automatic construction strategy based on network measurement. Procedia Computer Science, 107: 490–497. [Publisher Site]

  12. [12] Gupta, R., Singha, N., and Singh, Y. N. 2016. Reputation based probabilistic resource allocation for avoiding free riding and formation of common interest groups in unstructured P2P networks. Peer-to-Peer Networking and Applications, 9, 6: 1101–1113. [Publisher Site]

  13. [13] Hauge, M., and Landmark, L. 2018. Limiting the flooding of simplified multicast forwarding to a defined scope. In Proceeding of IEEE 2018 International Conference on Military Communications and Information Systems: 1–8. [Publisher Site]

  14. [14] Tu, Z., Jiang, W., and Jia, J. 2017. Hierarchical hybrid DVE-P2P networking based on interests clustering. In Proceeding of IEEE 2017 International Conference on Virtual Reality and Visualization: 378–381. [Publisher Site]

  15. [15] Huang, X. M., Chang, C. Y., and Chen, M. S. 2006. PeerCluster: a cluster-based peer-to-peer system. IEEE Transactions on Parallel and Distributed Systems, 17, 10: 1110–1123. [Publisher Site]

  16. [16] Lin, Z. J. 2011, Three-tier peer network with location perception and interest grouping. Master's Thesis, Department of Information Engineering, Truth University, New Taipei City, Taiwan.

  17. [17] Tussyadiah, I. P., and Zach, F. 2017. Identifying salient attributes of peer-to-peer accommodation experience. Journal of Travel & Tourism Marketing, 34, 5: 636–652. [Publisher Site]


Received: 2020-02-07
Revised: 2020-02-18
Accepted: 2020-02-18
Publication Date: 2020-03-01

Cite this article:

WangS.C., LinW.L., Pan, H.H., Lin, P.C. 2020. Performance improvement of P2P using location awareness and interest clustering. International Journal of Applied Science and Engineering, 17, 45–58.

We use cookies on this website to improve your user experience. By using this site you agree to its use of cookies.