• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.52-66
• /
• 2010

Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.135-142
• /
• 2008

Recently, the mobile Internet is rapidly changing environment in a user's web server performance requires frequent connection is difficult because the proper response is needed to improve the performance of web services engine. Therefore, the goal of this paper is to improve the performance of web services for the installation of additional access to users regardless of tomcat servlet container and process the request and to shorten processing time of SOAP (Simple Object Access Protocol) message of the server structure to of for web mobile services. The web-sever structure is consists of user demand receiver, web document processor, SOAP protocol processor, NBTM(Non-Blocking and Thread Manager) manager, session manager. The system fully supports a standard web-service protocol, reduces the message processing time and communication overhead of mobile web-service system in Web 2.0 and overhead of server, and confirms the improvement of capability by comparing and evaluating Web 2.0 standard mobile web-service system through delaying achievement evaluation by the experiment of realization in Web 2.0 environment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.1-10
• /
• 2002

According to the rapid evolution of internet, the number of internet users has greatly increased, so that the web servers are getting more important. If there are a great number of users trying to connect to a popular web server, the load of the web server will increase rapidly, so that failures may occur or web services may stop. An efficient load monitoring technique is required for the available web services and the performance management. The traditional techniques for load monitoring of web server using the client-server method have the problem that the server programs in client-server method must be pre-installed to all web servers. This paper implements web server load monitoring system using the mobile agent in order to overcome the problem of client-server computing. The system based on the mobile agent has no need to install the program in advance and it reduces the network traffic and the additional overheads in web servers.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.11
• /
• pp.269-274
• /
• 2018

MMORPG is a role-playing game that tens of thousands of people access it online at the same time. Users connect to the server through the game client and play with their own characters. If the user moves to a management area of another server beyond the area managed by the server, the user information must be transmitted to the server to be moved. In an actual game, the user is required to synchronize the established and the transferred information. In this paper, we propose a migration agent server in the virtual systems. We implement a seamless virtual server using the grid method to experiment with seamless server architecture for virtual systems. We propose a method to minimize the delay and equalize the load when the user moves to another server region in the virtual environment. Migration Agent acts as a cache server to reduce response time, the response time was reduced by 50% in the case of 70,000 people.

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.199-210
• /
• 2008

A Clustering based wireless internet proxy server needs a layer-7 load balancer with URL hashing methods to reduce the total storage space for servers. Layer-4 load balancer located in front of server cluster is to distribute client requests to the servers with the same contents at transport layer, such as TCP or UDP, without looking at the content of the request. Layer-7 load balancer located in front of server cluster is to parse client requests in application layer and distribute them to servers based on different types of request contents. Layer 7 load balancer allows servers to have different contents in an exclusive way so that it can minimize the total storage space for servers and improve overall cluster performance. However, its scalability is limited due to the high overhead of parsing requests in application layer as different from layer-4 load balancer. In order to overcome its scalability limitation, in this paper, we propose a distributed layer-7 load balancer by replacing a single layer-7 load balancer in the conventional scheme by a single layer-4 load balancer located in front of server cluster and a set of layer-7 load balancers located at server cluster. In a clustering based wireless internet proxy server, we implemented the conventional scheme by using KTCPVS(Kernel TCP Virtual Server), a linux based layer-7 load balancer. Also, we implemented the proposed scheme by using IPVS(IP Virtual Server), a linux-based layer-4 load balancer, installing KTCPVS in each server, and making them work together. We performed experiments using 16 PCs. Experimental results show scalability and high performance of the proposed scheme, as the number of servers grows, compared to the conventional scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.813-826
• /
• 1999

실시간 멀티미디어 응용의 등장으로 멀티캐스트와 QoS(Quality of Service) 지원이 필수적인 망 서비스로 부각되고 있다. 이에, ATM 기반의 인터넷에서 IP 멀티캐스트의 효율적인 처리를 위하여 MARS(Multicast Address Resolution Server)가 제안되었고, 기존의 최선 서비스 기반의 인터넷에서 QoS(Quality of Service)를 지원하기 위하여 RSVP(Resource Reservation Protocol)가 제안되었다. 본 논문에서는 ATM 망에서 QoS가 지원되는 IP 멀티캐스트 서비스를 제공하기 위하여 MARS 구조에서 RSVP를 지원하는 두 가지 방안을 제안하고, 시뮬레이션을 통하여 그 성능을 분석하였다. 제안하는 두 가지 방법은 각각 'RSVP 전 홉 노드 방식'과 'MARS 서버 방식'이라 명명하였다. RSVP 전 홉 노드 방식은 송신원으로부터 ATM 망으로 진입하는 노드와 수신원을 향하여 ATM 망을 진출하는 노드 간에 각각 일대일 양방향 VC를 설정하여 멀티캐스트 그룹에 속하는 수신원들이 보내는 자원 예약 메시지를 ATM 망에서 전송하는 방안이다. MARS 서버 방식은 ATM 망을 진출하는 노드와 MARS 서버간에 MARS 제어 메시지 교환을 위해 존재하는 ATM VC를 사용하여 RSVP의 자원 예약 메시지를 전송하고, MARS 서버가 RSVP 자원 예약 메시지를 처리하도록 그 기능을 확장함으로써 ATM 망에서 필요로 하는 제어 VC 수를 절약할 수 있는 방안이다. 시뮬레이션을 통하여, MARS 서버 방식은 ATM 제어 VC의 수를 절약할 수 있을 뿐 아니라 경우에 따라 RSVP 자원 예약 메시지 전달 지연을 줄일 수도 있음을 볼 수 있었다. 그러나, MARS 클러스터 내에 동시에 존재하는 RSVP 흐름이 많을 때에는 MARS 서버 방식의 경우 MARS 서버에서의 병목 현상으로 인해 성능이 저하될 수 있다.Abstract Emerging real time multimedia applications require multicast service with a QoS(Quality of Service) support. An overlay service architecture MARS(Multicast Address Resolution Server) is proposed to support IP multicast over an ATM network, and a resource reservation protocol RSVP is proposed to provide QoS support in the Internet which is originally based upon best effort service only. In this paper, we propose two schemes to support IP multicast service with QoS support over ATM networks: 'RSVP Previous Hop Node(RPHN) scheme' and 'MARS server based scheme'. In RPHN scheme, the RSVP reservation messages are transported via one-to-one ATM control VC from the egress nodes to the ingress nodes of the the multicast flow set up between each pair of nodes. The RSVP message processing occurs at the ingress nodes of the multicast flow. Whereas, in the MARS server based scheme, the RSVP reservation messages are transported via the MARS control VCs between the egress nodes and the MARS server. The RSVP message processing burden is imposed at MARS server in this scheme. For MARS server based scheme, no additional ATM VC is required for RSVP reservation message transmission, while the processing burden at the MARS server is high. Simulation results show that the MARS server based scheme, may accomplish RSVP reservation message delivery with smaller delay as well as saving of the number of ATM VCs. When the number of simultaneous RSVP flows in the MARS cluster is large, however, MARS based scheme may suffer performance degradation since MARS server becomes a performance bottleneck.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.6
• /
• pp.470-476
• /
• 2020

In this paper, we present the design of modular replaceable AI server for image deep learning that separates the server from the Edge Device so as to drive the AI block and the method of data transmission and reception. The modular replaceable AI server for image deep learning can reduce the dependency between social robots and edge devices where the robot's platform will be operated to improve drive stability. When a user requests a function from an AI server for interaction with a social robot, modular functions can be used to return only the results. Modular functions in AI servers can be easily maintained and changed by each module by the server manager. Compared to existing server systems, modular replaceable AI servers produce more efficient performance in terms of server maintenance and scale differences in the programs performed. Through this, more diverse image deep learning can be included in robot scenarios that allow human-robot interaction, and more efficient performance can be achieved when applied to AI servers for image deep learning in addition to robot platforms.

• Journal of the Korea Society for Simulation
• /
• v.12 no.3
• /
• pp.69-81
• /
• 2003

To manage a cluster of distributed server systems, a number of management aspects should be considered in terms of configuration management, fault management, performance management, and user management. System performance monitoring and reporting take an important role for performance and fault management. In this paper, we present distributed system architecture modeling of a performance monitoring and reporting tool. Modeling architecture of four subsystems are introduced: node agent, data collection, performance management & report, and DB schema. The performance-related information collected from distributed servers are categorized into performance counters, event data for system status changes, service quality, and system configuration data. In order to analyze those performance information, we use a number of ways to evaluate data corelation. By using some results from a real site of a company and from simulation of artificial workload, we show the example of performance collection and analysis. Since our report tool detects system fault or node component failure and analyzes performances through resource usage and service quality, we are able to provide information for server load balancing, in short term view, and the cause of system faults and decision for system scale-out and scale-up, in long term view.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.2061-2080
• /
• 2013

Roaming authentication protocol is widely used in wireless network which can enable a seamless service for the mobile users. However, the classical approach requires the home server's participation during the authentication between the mobile user and the foreign server. So the more the roaming requests are performed the heavier burden will be on the home server. In this paper, we propose a new roaming authentication framework for wireless communication without the home server's participation. The new roaming authentication protocol in the new framework takes advantage of the ID-based cryptography and provides user anonymity. It has good performance compared with the roaming authentication protocols whose authentication do not need the home server's participation in terms of security and computation costs. Moreover, a new User-to-User authentication protocol in the new framework is also present. All the authentications proposed in this paper can be regarded as a common construction and can be applied to various kinds of wireless networks such as Cellular Networks, Wireless Mesh Networks and Vehicle Networks.

• 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.