Design and Implementation of Authentication Server with High Concurrency

Article Preview

Abstract:

With increasing problems of network security, a server with high concurrency is designed here to deal with identity authentication. In the general design of the server, RSA and DES algorithm are used. RSA algorithm is used to encrypt or decrypt users identity information. DES algorithm is used to ensure the information will not be stolen. In order to ensure the server has high concurrency, the technology of epoll and thread pool is applied to design the server in the Linux system. In the end , integration testing and stress testing are performed to test its reliability and stability. The testing result shows that the server can run properly under heavy concurrent load.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 834-836)

Pages:

1791-1794

Citation:

Online since:

October 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Information on http: /en. wikipedia. org/wiki/Network_security.

Google Scholar

[2] Qi Xiong, Qiusheng Rong. The Design of Serial Server Based on Semaphore under Linux, 2010 2ND IEEE International Conference on Information Management and Engineering. VOL. 1 398-400.

DOI: 10.1109/icime.2010.5478106

Google Scholar

[3] Xiong Qi, Zhang Hongbo, et . al. Design of Streaming Media Cluster Server Based on MPI. Applied Mechanics and Materials, v 63-64, pp.643-646, (2011).

DOI: 10.4028/www.scientific.net/amm.63-64.643

Google Scholar

[4] Xing Qi, Tang Jiaming: submitted to Journal of Computer System & Applications (2013).

Google Scholar

[5] Information on http: /en. wikipedia. org/wiki/Thread_pool_pattern.

Google Scholar

[6] Tang Fuqiang, Yu Hongyang, Zhang Ping: Computer Engineering and Applications, 2012, 48(28): 77-83.

Google Scholar

[7] Liang Minggang, Chen Xiqu: Journal of Wuhan Polytechnic University, 2012, 31(3): 54-59.

Google Scholar