i-manager Publications

A Proposed ACO Routing In Peer-To-Peer Networks

Hanafy Mahmoud Ali*

Assistant Professor, Department of Computers and Systems Engineering, Faculty of Engineering, El-Minia University, El Minia, Egypt.

Periodicity:November - January'2017
DOI : https://doi.org/10.26634/jcs.6.1.10377

Abstract

With the rapid development of computer network techniques and novel concepts of distributed computing, many of the modifying researchers are now facing new challenges on how to merge some old protocols to take the advantage of each of them to create a new technique stack that has a lot of advantages in various directions providing us an effective use and solving complex problems. Peer-to-Peer (P2P) network based network technology is grabbing more attention due to its feasibility to build applications. In this paper, the author has focused on the development of a new improvement algorithm based on P2P network environment, and presented the details of implementations with some basic performance evaluations. The main goal of the paper is to present a new algorithm that provides us with a lot of facilities like shortest path, focusing on to the security problems. So the integrated architecture gives us good results as the choice of the shortest path with, more trust bath that is based on the reputation values of end nodes. The reputation is defined to express subjective trustable relationship among individuals and objective trust view. The recommended routing algorithm depends on the reputation values and metric value. Finally, by this routing algorithm, the P2P network performance is greatly enhanced.

Keywords

How to Cite this Article?

Ali, H. M. (2017). A Proposed ACO Routing In Peer-To-Peer Networks. i-manager’s Journal on Communication Engineering and Systems, 6(1), 9-21. https://doi.org/10.26634/jcs.6.1.10377

References

[1]. Project JXTA, (2005). Retrieved from http://www.jxta.org

[2]. The NS2 Simulator. Retrieved from http://www.isi.edu/ nsnam/ns/

[3]. Ian Taylor, (2010). AgentJ Java Network Simulations in NS-2- An Installation and User Manual. A PROTEAN Research Group Project, Naval Research Laboratory, Code 5522.

[4]. (JNI) Java TM Native Interface. Retrieved from http://docs.oracle.com/javase/6/docs/technotes/guides/jni/

[5]. Protolib. Retrieved from http://cs.itd.nrl.navy.mil/work/ protolib/

[6]. Ian Wang, (2005). “P2PS (Peer-to-Peer Simplified)”. In Proceedings of 13^thAnnual Mardi Gras Conference- Frontiers of Grid Applications and Technologies, Louisiana State University, pp.54-59.

[7]. K.M. Sim and W.H. Sun, (2003). “Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions”. IEEE Trans. Systems, Man, and Cybernetics-Part A: Systems and Humans, Vol.33, No. 5, pp. 560-572.

[8]. S.S. Dhillon, and P. Van Mieghem, (2007). “Performance analysis of the AntNet algorithm”. Computer Networks, Vol.51, No.8, pp. 2104–2125.

[9]. M. Strobbe, V. Verstraete, and E. V. Breusegem, (2005). “Implementation and Evaluation of AntNet - A Distributed Shortest-path Algorithm”. Proc. of Advanced Industrial Conference on Telecommunications/ Service Assurance with Partial and Intermittent Resources Conference/ e-Learning on Telecommunications Workshop. AICT/ SAPIR/ ELETE, pp. 320 – 325.

[10]. G.D. Caro, and M. Dorigo, (1998). “AntNet: Distributed Stigmergetic Control for Communication Networks”. J. Artif. Intell. Res., Vol. 9, pp. 317-365.

[11]. C. Zuo, R. Li, and Z. Lu, (2009). “A Novel Approach to Improve the Security of P2P File-Sharing Systems”. Int. J. Communications, Network and System Sciences, Vol.2, No.3, pp.229-236.

[12]. G.D. Caro, and M. Dorigo, (1997). “Mobile Agents for Adaptive Routing”.

[13]. L. Zhou, and Z. J. Haas, (1999). “Securing Ad Hoc Networks”. IEEE Network, Vol.13, No.6, pp.24-30.

[14]. F. Stajano, and R. Anderson, (2002). “The Resurrecting Duckling: Security Issues for Ubiquitous Computing”. IEEE Computer, Vol. 35, No.4, pp.22-26.

[15]. Kan, G. Gnutella, (2001). In A. Oram, (ed.), Peer- to- Peer: Harnessing the Benefits of a Disruptive Technology. O'Reilly and Associates, Inc. California, pp.94-121.

[16]. Dingledine, R., (2000). The Free-Haven Project: Design and Deployment of an Anonymous Secure Data Haven. (Unpublished Masters Thesis, Massachusetts Institute of Technology).

[17]. Dingledine, B., Mathewson, N., Syverson, P. (2003). "Reputation in P2P anonymity systems". In: Workshop on Economics of Peer-to-Peer Systems, Vol. 92.

[18]. Reiter, M K., and Rubin, A.V., (1997). “Anonymity for Web Transactions”. DIMACS Technical Report, Vol.97, No.15.

[19]. I. Clarke, et. al., (2000). “A Distributed Anonymous Information Storage and Retrieval System”. The ICSI Workshop on Design Issues in Anonymity and Unobservability, pp.1-21.

[20] Cyber-Rights and Cyber-Liberties, (2001). Echelon Watch. Rerieved from http://www.cyber-rights.org/ interception/echelon

[21]. Clip2 Distributed Search Solutions, (2000). Bandwidth Barriers to Gnutella Network Scalability. Retrieved from http://dss.clip2.com/dss_barrier.html “ Proceedings of the Thirty-First Hawaii International Conference on System Sciences, IEEE, Vol.7, pp. 74-83.

[22]. Jansen. II., Hopper, N., Kim, Y., (2010). Recruiting new th Tor relays with BRAIDS . In: Proc. of the 17^th ACM Conference on Computer and Communications Security, pp.. 319 328.

[23]. Rita Hanna Wouhaybi, (2006). Algorithms for Reliable Peer-to-Peer Networks. Columbia University.

[24]. E. Damiani, De C. di Vimercati, S. Paraboschi, P. Samarati, and F. Violante, (2002). “A Reputation-based Approach for choosing Reliable Resources in peer-to-peer th networks”. In CCS '02, The 9^th ACM Conference on Computer and Communications Security, New York, NY, USA, ACM Press, pp.207-216.

[25]. Ernesto Damiani, Sabrina De Capitani di Vimercati, Stefano Paraboschi, and Pierangela Samarati (2003). “Managing and Sharing Servents' Reputations in P2P Systems”. IEEE Transactions on Knowledge and Data Engineering, Vol.15, No.4, pp.840–854.

[26]. Prashant Dewan, and Partha Dasgupta, (2004). “Pride: Peer-to-Peer Reputation Infrastructure for Decentralized Environments”. In: The 13^th International World Wide Web Conference on Alternate Track Papers & Posters, New York, NY, USA, ACM Press, pp.480-481.

[27]. Sepandar D. Kamvar, Mario T. Schlosser, and Hector Garcia-Molina, (2003). “The Eigen Trust Algorithm for Reputation Management in P2P networks”. The 12^th International Conference on World Wide Web, New York, NY, USA, 2003. ACM Press, pp.640-651.

[28]. Zhengqiang Liang, and Weisong Shi, (2005). “PET: A Personalized Trust model with reputation and risk evaluation for P2P resource sharing”. In: HICSS '05, The 38^th Annual Hawaii International Conference on System Sciences, IEEE Computer Society, Washington DC, USA, pp.201.

[29]. Runfang Zhou, and Fellow-Kai Hwang, (2007). “Power trust: A robust and scalable reputation system for trusted peer-to-peer computing”. IEEE Transactions on Parallel and Distributed Systems, Vol.18, No.4, pp.460–473.

[30]. Rappaport, Theodore S., (2002). Wireless Communications,- Principles and Practice. Second edition, Prentice Hall, ISBN 0130422320. Hanafy M. Ali, Mohamed Z. Abdelmegid, and Mohamed M. Ali, (2009). “Secure Active Routing for Peer-to- Peer Networks”. Journal of Engineering Sciences, Assiut University, Vol. 37, No. 5, pp. 1099-1108.

A Proposed ACO Routing In Peer-To-Peer Networks

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content:

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25