Research ArticleOpen AccessGoogle Scholar indexed
Design and Implementation of Peer-to-Peer Service Routing Algorithm
Department of Computer Science, North China Institute of Science and Technology, Beijing, China
- 1 Department of Computer Science, North China Institute of Science and Technology, Beijing, China
Journal of Software Engineering and Applications·Volume 08 (2015)·Pages 575–580·Published 16 November 2015·DOI10.4236/jsea.2015.811054
Copy link · social · email
Abstract
Due to the lack of QoS (quality of service) guarantee in current Peer-to-Peer services routing network, it is difficult to apply Peer-to-Peer network to business successfully. Therefore, a service guarantee routing model is proposed in this paper, and an ant colony algorithm is designed for this routing model. Finally, the experimental analysis of the Peer-to-Peer services routing algorithm is presented. The experimental result shows the effectiveness of the service routing algorithm.
KeywordsPeer-to-PeerServices RoutingAnt Colony Algorithm
- Seet, B.C. (2009) Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications. IGI Global Press, New York. http://dx.doi.org/10.4018/978-1-60566-715-7
- Psillassa, B., Yawut, C. and Dhaou, R. (2011) Network Awareness and Dynamic Routing: The Ad Hoc Network Case. Computer Networks, 55, 2315-2328.
- Zhao, B., Kubiatowicz, J. and Joseph, A. (2001) Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. Technical Report UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley, Berkeley, 106-115.
- Maymounkov, P. and Kademlia, M.D. (2002) A Peer-to-Peer Information System Based on the XOR Metric. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS 2002), Cambridge, 7-8 March 2002, 53-65. http://dx.doi.org/10.1007/3-540-45748-8_5
- Karger, D.R., Lehman, E., Leighton, T., Levine, M., Lewin, D. and Panigrahy, R. (1997) Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the Worldwide Web. ACM Symposium on Theory of Computing, 5, 654-663. http://dx.doi.org/10.1145/258533.258660
- Gambardella, L.M. and Dorigo, M. (1995) Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem. Proceedings of the 12th International Conference on Machine Learning, Tahoe City, 9-12 July 1995, 252-260. http://dx.doi.org/10.1016/b978-1-55860-377-6.50039-6
- Boschetti, M., Jelasity, M. and Maniezzo, V. (2004) A Local Approach to Membership Overlay Design. Working Paper, Department of Computer Science, 16, 250-360
- Tsai, C.F. and Tsai, C.W. (2002) A New Approach for Solving Large Traveling Salesman Problem Using Evolution Ant Rules. Proceedings of the 2002 International Joint Conference on Neural Networks, 2, 1540-1545.
- Lv, K.C. (1999) Single Objective, Multi-Objective and Integer Programming. Tsinghua University Press, Beijing.
- Lei, D.M. and Yan, X.P. (2009) Multi-Objective Intelligent Optimization Algorithm and Its Application. Science Press, Beijing.
- Wu, J., Cheng, B., Yuen, C., Cheung, N.-M. and Chen, J. (2015) Trading Delay for Distortion in One-Way Video Communication over the Internet. IEEE Transactions on Circuits and Systems for Video Technology, PP, 1. http://dx.doi.org/10.1109/TCSVT.2015.2412774
- Wu, J., Cheng, B., Yuen, C., Shang, Y. and Chen, J. (2015) Distortion-Aware Concurrent Multipath Transfer for Mobile Video Streaming in Heterogeneous Wireless Networks. IEEE Transactions on Mobile Computing, 14, 688-701. http://dx.doi.org/10.1109/TMC.2014.2334592