Paper Titles
Design and Implementation of Dual-Channel and Dual-Mode Timing Module Based on Beidou & GPS
p.2402
The Design of RSSI Acquisition of Wireless Communication Network Based on ZigBee
p.2407
The Design of High Available Single Sign-On Server of Nginx-Based
p.2411
Karatsuba-ZOT Multiplication Algorithm and its Application in Cryptography
p.2417
Designing and Implementation of High Concurrent SSL VPN Server
p.2424
Modeling of MIMO Time-Varying Channel
p.2430
Confidentiality and Integrity Protection Method Based on One Time Encryption
p.2434
Research on Radio Frequency Assignment Mechanism of the RoFSO Network Based on Site-Specific Cognition and Utility Function
p.2439
TDMA-Based Time Slots Assignment Algorithm
p.2445

Designing and Implementation of High Concurrent SSL VPN Server

Article Preview

Abstract:

This paper focuses on improving concurrent performance of a practical SSL VPN server program. Several common technologies were been used to achieve this, including processing network flow effectively by using readiness notification mechanism, using appropriate data structure to deal with I/O buffers, and implementing timers management module by priority queue. Through combining these technologies properly, the performance of the SSL VPN server program has been improved dramatically.

You might also be interested in these eBooks
Industrial Instrumentation and Control Systems View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 241-244)

Pages:

2424-2429

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.241-244.2424

Citation:

Cite this paper

Online since:

December 2012

Authors:

Jie Chu

Keywords:

Binary Heap, High Concurrency, Network Programming, Priority Queue, SSL VPN, SSL/TLS

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

References

[1] Claude Castelluccia, Einar Mykletun, and Gene Tsudik. 2006. Improving secure server performance by re-balancing SSL/TLS handshakes. In Proceedings of the 2006 ACM Symposium on Information, computer and communications security (ASIACCS '06). ACM, New York, NY, USA, 26-34. DOI=10. 1145/1128817. 1128826 http: /doi. acm. org/10. 1145/1128817. 1128826.

DOI: 10.1145/1128817.1128826

Google Scholar

[2] Kegel, D. (2011, 7 21). The C10K problem. Retrieved from Dan Kegel's Web Hostel: http: /www. kegel. com/c10k. html.

Google Scholar

[3] Matt Welsh, David Culler, and Eric Brewer. 2001. SEDA: an architecture for well-conditioned, scalable internet services. In Proceedings of the eighteenth ACM symposium on Operating systems principles (SOSP '01). ACM, New York, NY, USA, 230-243. DOI=10. 1145/502034. 502057 http: /doi. acm. org/10. 1145/502034. 502057.

DOI: 10.1145/502034.502057

Google Scholar

[4] Maxwell Krohn, Eddie Kohler, and M. Frans Kaashoek. 2007. Events can make sense. In 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference (ATC'07), Jeff Chase and Srinivasan Seshan (Eds. ). USENIX Association, Berkeley, CA, USA, , Article 7 , 14 pages.

DOI: 10.1109/msp.2007.50

Google Scholar

[5] Wikipedia. (2011, 11 10). select (Unix). Retrieved from Wikipedia - The Free Encyclopedia: http: /en. wikipedia. org/wiki/Select_(Unix).

Google Scholar

[6] Strebelow Ronald, and Strebelow Ronald, 2012. Analysis of Event Processing Design Patterns and Their Performance Dependency on I/O Notification Mechanisms. In Multicore Software Engineering, Performance, and Tools. Springer Berlin and Heidelberg. Page 54. DOI=10. 1007/978-3-642-31202-1_6 http: /dx. doi. org/10. 1007/978-3-642-31202-1_6.

DOI: 10.1007/978-3-642-31202-1_6

Google Scholar

[7] Wikipedia. (2012, 4 14). epoll. Retrieved from Wikipedia - The Free Encyclopedia: http: /en. wikipedia. org/wiki/Epoll.

Google Scholar

[8] Martin Kalin. 2012. Three ways to web server concurrency. Linux J. 2012, 214, pages.

Google Scholar

[9] Wikipedia. (2012, 3 27). Kqueue. Retrieved from Wikipedia - The Free Encyclopedia: http: /en. wikipedia. org/wiki/Kqueue.

Google Scholar

[10] Jonathan Lemon. 2001. Kqueue - A Generic and Scalable Event Notification Facility. In Proceedings of the FREENIX Track: 2001 USENIX Annual Technical Conference, Clem Cole (Ed. ). USENIX Association, Berkeley, CA, USA, 141-153.

Google Scholar

[11] Wikipedia. (2012, 6 10). Priority queue. Retrieved from Wikipedia - The Free Encyclopedia: http: /en. wikipedia. org/wiki/Priority_queue.

Google Scholar

[12] R. Brown. 1988. Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem. Commun. ACM 31, 10 (October 1988), 1220-1227. DOI=10. 1145/63039. 63045 http: /doi. acm. org/10. 1145/63039. 63045.

DOI: 10.1145/63039.63045

Google Scholar

[13] Wikipedia. (2012, 5 30). Heap (data structure). Retrieved from Wikipedia - The Free Encyclopedia: http: /en. wikipedia. org/wiki/Heap_(data_structure).

Google Scholar

[14] M. D. Atkinson, J. -R. Sack, N. Santoro, and T. Strothotte. 1986. Min-max heaps and generalized priority queues. Commun. ACM 29, 10 (October 1986), 996-1000. DOI=10. 1145/6617. 6621 http: /doi. acm. org/10. 1145/6617. 6621.

DOI: 10.1145/6617.6621

Google Scholar

[15] Michael L. Fredman and Robert Endre Tarjan. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 3 (July 1987), 596-615. DOI=10. 1145/28869. 28874 http: /doi. acm. org/10. 1145/28869. 28874.

DOI: 10.1145/28869.28874

Google Scholar