• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.372-378
• /
• 1999

The main purpose of this paper is a study on the automatically implementing a Multi user server education system and homepage via web browser from toolkit embedded Multi user server unix server Perl programming language and c language was used to make this toolkit. With using window based web browsers, the user can make they own classroom homepage. In this paper, we propose the single user server version and Multi user server version of this toolkit. With use of ftp, the Multi user server version of this toolkit can make homepage to other unix server workstation

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.119-131
• /
• 2013

With the explosive growth of computer networks, many remote service providing servers and multi-server network architecture are provided and it is extremely inconvenient for users to remember numerous different identities and passwords. Therefore, it is important to provide a mechanism for a remote user to use single identity and password to access multi-server network architecture without repetitive registration and various multi-server authentication schemes have been proposed in recent years. Recently, Tsaur et al. proposed an efficient and secure smart card based user authentication and key agreement scheme for multi-server environments. They claimed that their scheme satisfies all of the requirements needed for achieving secure password authentication in multi-server environments and gives the formal proof on the execution of the proposed authenticated key agreement scheme. However, we find that Tsaur et al.'s scheme is still vulnerable to impersonation attack and many logged-in users' attack. We propose an extended scheme that not only removes the aforementioned weaknesses on their scheme but also achieves user anonymity for hiding login user's real identity. Compared with other previous related schemes, our proposed scheme keeps the efficiency and security and is more suitable for the practical applications.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1858-1867
• /
• 1996

This paper describes a platform for video conferencing on Information Super Highway. In this paper we de-sign a Multi-Multicast Server(MCS) and the platform. The platform uses Multi-MultiCast Server for multitasking IP Multicast data on IP over ATM. Based on Multicast Address Resolution Server (AMRS) which was proposed in this paper the platform maps from D class IP addresses to ATM addresses. MARS handles a recovery in case of MCS down. This paper also presents a solving mechanism for handling botteneck by using the MCS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3B
• /
• pp.399-407
• /
• 2000

Recently, supporting ATM networks under LINUX operating systems environment has been actively studied. An ATMARP server in a conventional LINUX environment was designed under the ATMARP single-server to operate independently within a Local IP Subnet(LIS). In this paper, an ATMARP multi-server is introduced and implemented an ATMARP-server managing multiple LIS's on the LINUX-based IPOA. The ATMARP protocol processing functions and addition/deletion functions on management tables are required to implement the ATMARP multi-server. These functions can solve the problem of increasing the number of ATMARP servers in ATMARP single-server environment. The file transmission experiment with a connection configuration between LIS's shows that multiple LIS' con be managed by an ATMARP-server. As the results, the ATMARP multi-server scheme yields a smaller number of servers than that of the conventional ATMARP single-server scheme, and the network composition can be improved substantially.

• 대한공업교육학회지
• /
• v.33 no.1
• /
• pp.265-281
• /
• 2008

The objective of this study is to show practice example let student experience about concurrent servers based multi-processes and multi-thread among the principles of data communication in ICT(information and communications technology). For this, we first implement multi-process server(fork server) and multi-thread server(thread server), and multi-thread client(thread client), Secondly, for experimental environment, we developed small ethernet networks and measure data transfer time with relation to the number of users. Experimental results show that mean transfer time of thread server is less than that of fork server by 20~61 % on average. Furthermore, it is found that the difference of data transfer time between fork server and thread server is proportional to that of the number of users. Main reason of performance difference dues to the difference between process forking time and thread creation time. We can also find that context switching for process and thread affects the load of web server. Our presentation and experimental results can be applied to used as the educational practice materials with which student can experience data communication principles.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.340-344
• /
• 2009

Multi-server password authentication schemes enable remote users to obtain service from multiple servers with single password without separately registering to each server. In 2007, Hu-Niu-Yang proposed an improved efficient password authenticated key agreement scheme for multi-server architecture based on Chang-Lee's scheme proposed in 2004. This scheme is claimed to be more efficient and is able to overcome a few existing deficiencies in Chang-Lee's scheme. However, we find false claim of forward secrecy property and some potential threats such as offline dictionary attack, key-compromise attack, and poor reparability in their scheme. In this paper, we will discuss these issues in depth.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.811-829
• /
• 2015

One-way authenticated key agreement protocols, aiming at solving the problems to establish secure communications over public insecure networks, can achieve one-way authentication of communicating entities for giving a specific user strong anonymity and confidentiality of transmitted data. Public Key Infrastructure can design one-way authenticated key agreement protocols, but it will consume a large amount of computation. Because one-way authenticated key agreement protocols mainly concern on authentication and key agreement, we adopt multi-server architecture to realize these goals. About multi-server architecture, which allow the user to register at the registration center (RC) once and can access all the permitted services provided by the eligible servers. The combination of above-mentioned ideas can lead to a high-practical scheme in the universal client/server architecture. Based on these motivations, the paper firstly proposed a new one-way authenticated key agreement scheme based on multi-server architecture. Compared with the related literatures recently, our proposed scheme can not only own high efficiency and unique functionality, but is also robust to various attacks and achieves perfect forward secrecy. Finally, we give the security proof and the efficiency analysis of our proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5572-5595
• /
• 2016

Multi-server authentication enables the subscribers to enjoy an assortment of services from various service providers based on a single registration from any registration centre. Previously, a subscriber had to register from each service provider individually to avail respective services relying on single server authentication. In the past, a number of multi-server authentication techniques can be witnessed that employed lightweight and even computationally intensive cryptographic operations. In line with this, Zhu has presented a chaotic map based multi-server authentication scheme recently, which is not only vulnerable to denial-of-service attack, stolen-verifier attack, but also lacks anonymity. This research aims at improving the Zhu's protocol in terms of cost and efficiency. Moreover, the comparative study is presented for the performance of improved model against the existing scheme, and the security of proposed model is formally proved using BAN Logic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5465-5480
• /
• 2018

Energy-efficient task scheduling on multi-core server is a fundamental issue in green cloud computing. Multi-core processors are widely used in mobile devices, personal computers, and servers. Existing energy efficient task scheduling methods chiefly focus on reducing the energy consumption of the processor itself, and assume that the cores of the processor are controlled independently. However, the cores of some processors in the market are divided into several voltage islands, in each of which the cores must operate on the same status, and the cost of the server includes not only energy cost of the processor but also the energy of other components of the server and the cost of user waiting time. In this paper, we propose a cost-aware scheduling algorithm ICAS for computation intensive tasks on multi-core server. Tasks are first allocated to cores, and optimal frequency of each core is computed, and the frequency of each voltage island is finally determined. The experiments' results show the cost of ICAS is much lower than the existing method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.2
• /
• pp.83-103
• /
• 1993

This paper addresses an optimization problem faced by a multi-server and multi-class customer system in manufacturing facilities and service industries. This paper presents a model of an integrated problem of server allocation and customer type partitioning. We approximate the problem through two types of models to make it tractable. As soution approach, the simulated annealing heuristic is constructed based on the general simulated annealing method. Computational results are presented.