• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.730-737
• /
• 2003

In this paper, we present an efficient authentication proxy for IEEE 802.1x systems based on the port-based access control mechanism. An IEEE 802.1x system consists of PC supplicants, a bridge with authentication client functions, and an authentication server. For the network security and user authentication purposes, a supplicant who wants to access Internet should be authorized to access the bridge port using the Extended Authentication Protocol (EAP) over LAN. The frame of EAP over LAN is then relayed to the authentication server by the bridge. After several transactions between the supplicant and the server via the bridge, the supplicant may be either authorized or not. Noting that the transactions between the relaying bridge and the server will be increased as the number of supplicants grows in public networks, we propose a scheme for reducing the transactions by employing an authentication proxy function at the bridge. The proxy is allowed to cache the supplicant's user ID and password during his first transaction with the server. For the next authentication procedure of the same supplicant, the proxy function of the bridge handles the authentication transactions using its cache on behalf of the authentication server. Since the main authentication server handles only the first authentication transaction of each supplicant, the processing load of the server can be reduced. Also, the authentication transaction delay experienced by a supplicant can be decreased compared with the conventional 802.1x system.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.603-608
• /
• 2005

Disk I/O is a major performance bottleneck of web proxy server. Today's most web proxy sowers are design to run on top of a general purpose file system. But general purpose file system can not efficiently handle web cache workload, small files, leading to the performance degradation of entire web proxy servers. In this paper we evaluate the performance potential of raw disk to reduce disk I/O overhead of web proxy servers. To show the performance potential of raw disk, we design a storage management system called Block-structured Storage Management System (BSMS). And we also actually implement web proxy server that incorporate BSMS in Squid. Comprehensive experimental evaluations show that raw disk can be a good solution to improve disk I/O performance significantly for web proxy servers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.178-188
• /
• 2016

The traffic in the wired and wireless networks has increased exponentially because of increase of smart phone and improvement of PC performance. Multimedia services and file transmission such as Facebook, Youtube occupy a large part of the traffic. CDN is a technique that duplicates the contents on a remote web server of content provider to local CDN servers near clients and chooses the optimal CDN server for providing the content to the client in the event of a content request. In this paper, the content request message between CDN servers and the client used the SCRP algorithm utilizing the MST algorithm and the traffic throughput was optimized. The average response time for the content request is reduced by employing HC_LRU cache algorithm that improves the cache hit ratio. The proposed SCRP and HC_LRU algorithm may build a scalable content delivery network system that efficiently utilizes network resources, achieves traffic localization and prevents bottlenecks.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.323-325
• /
• 1999

서버의 공간데이터가 클라이언트 캐쉬에 중복 저장되어 있는 클라이언트-서버 GIS환경에서 동시에 수행될 수 있는 대화식 클라이언트 트랜잭션의 변경은 일관성 제어를 위해 서버와 다른 클라이언트에 전파되어야 한다. 이때 한 클라이언트의 캐쉬 변경이 다른 클라이언트의 변경과 충돌이 될 수 있는데, 클라이언트 트랜잭션은 기존의 기법으로는 동시성과 캐시 일관성이 제어 될 수 없다. 지도 수정 트랜잭션은 기 트랜잭션이며 공간 관련성에 의한 종속성을 가지기 때문이다. 또한 캐쉬 변경 내용의 전파는 캐쉬 사용의 이점을 잃기 않기 위해 통신 부하 최소화 대책이 고려되어야 한다. 이 논문은 클라이언트-서버 GIS 환경에서 클라이언트 수정 트랜잭션의 동시성과 캐쉬 일관성 제어를 위하여 기존의 잠금 기법을 확장하고, 통신 부하의 최소화를 고려한 새로운 변경 전파 프로토콜을 설계하고 구현한 결과를 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.397-399
• /
• 2003

CDN(Content Delivery Network)은 기존의 중앙 집중형 구조를 갖는 multimedia streaming 서비스의 서버 과부하 문제와 서버 주위의 네트웍 전송 속도 급감 문제를 해결하기 위해 서버와 클라이언트 사이에 컨텐츠 캐시 역할을 하는 edge server를 둠으로써 원래 서버로의 요청을 분산 처리하는 컨텐츠 전송 기술이다. 그러나 여전히 대규모 전송이 필요할 경우 원하는 수준만큼의 scalability를 보장할 수 없다. 이에 대한 근본적인 해결방법으로 본 논문에서는 P2P 기반의 CDN 시스템 구축을 위한 첫 단계로서 참여 노드간의 네트워크 토폴로지와 전송 성능간의 관계를 분석해보고자 한다. 이를 위해 다양한 구조의 전송 성능을 평가할 수 있는 환경을 구축하였으며 이를 이용하여 설러 구조에서의 전송 성능 측정 결과를 제시하여 최적의 P2P 전송 네트워크를 결정할 수 있도록 한다.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.29-36
• /
• 2004

As the number of Internet users and the amount of web contents have increased very fast, reducing the load of web servers and providing web services more rapidly have been great issues. A web-cache system, which is located between the user and the web server, has been used by many web service providers as an effective way to reduce the load of web servers and the web service response time. In this paper, we have developed a web-cache system which is based on the Squid cache and has a compression capability. The web-cache system in which compression capability reduces the amount of network traffic and the web service response time by transfering the web contents in the compressed format over the network between the web-cache system and the user. The performance enhancement is greater in the reverse-cache system than in the forward-cache system because in the case of the reverse-cache system, the cache reduces the amount of traffic on the Internet which is the bottleneck in the network path between the user and the web server. The experimentation result shows that the amount of data traffic has reduced from 2 to 8 times depending on the size of the web contents. The web server response time has reduced 37% on the average and when the size of the web content is greater than 10Kbyte, the response time has reduced 87% on the average.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.371-375
• /
• 2010

SSD is a storage medium based on NAND Flash memory. Because of its short latency, low power consumption, and resistance to shock, it's not only used in PC but also in server computers. Most SSDs use FTL to overcome the erase-before-overwrite characteristic of NAND flash. There are several types of FTL, but page mapped FTL shows better performance than others. But its usefulness is limited because of its large memory footprint for the mapping table. For example, 64MB memory space is required only for the mapping table for a 64GB MLC SSD. In this paper, we propose a novel caching scheme for the mapping table. By using the mapping-table-meta-data we construct a fully associative cache, and translate the address within O(1) time. The simulation results show more than 80 hit ratio with 32KB cache and 90% with 512KB cache. The overall memory footprint was only 1.9% of 64MB. The time overhead of cache miss was measured lower than 2% for most workload.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1314-1321
• /
• 2015

Mobile devices employ buffer cache mechanisms, just as in computer systems such as desktops or servers, to mitigate the performance gap between main memory and secondary storage. However, DRAM has a problem in that it accelerates battery consumption by performing refresh operations periodically to maintain the stored data. In this paper, we propose a novel buffer cache scheme to increase the battery lifecycle in mobile devices based on a hybrid main memory architecture consisting of DRAM and non-volatile PCM. We also suggest a new buffer cache policy that allocates buffers based on process states to optimize the performance and endurance of PCM. In particular, our algorithm allocates each page to the appropriate position corresponding to the state of the application that owns the page, and tries to ensure a rapid response of foreground applications even with a small amount of DRAM memory. The experimental results indicate that the proposed scheme reduces the elapsed time of foreground applications by 58% on average and power consumption by 23% on average without negatively impacting the performance of background applications.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.12
• /
• pp.319-328
• /
• 2021

With popularization of services for massive content, the fundamental limitations of TCP/IP networking were discussed and a new paradigm called Information-centric networking (ICN) was presented. In ICN, content is addressed by the content identifier (content name) instead of the location identifier such as IP address, and network nodes can use the cache to store content in transit to directly service subsequent user requests. As the user request can be serviced from nearby network caches rather than from far-located content servers, advantages such as reduced service latency, efficient usage of network bandwidth, and service scalability have been introduced. However, these advantages are determined by how actively content stored in the cache can be utilized. In this paper, we 1) introduce content access schemes in Named-data networking, one of the representative ICN architectures; 2) in particular, review the schemes that allow access to cached content away from routing paths; 3) conduct comparative study on the performance of the schemes using the ndnSIM simulator.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.448-464
• /
• 2007

Location-Based Services (LBSs) provide results to queries according to the location of the client issuing the query. In LBS, techniques such as caching and prefetching are effective approaches to reducing the data transmission from a server and query response time. However, they can lead to cache inefficiency and network overload due to the client's mobility and query pattern. To solve these drawbacks, we propose a semantic prefetching (SP) scheme using prefetching segment concept and improved cache replacement policies. When a mobile client enters a new service area, called semantic prefetching area, proposed scheme fetches the necessary semantic information from the server in advance. The mobile client maintains the information in its own cache for query processing of location-dependent data (LDD) in mobile computing environment. The performance of the proposed scheme is investigated in relation to various environmental variables, such as the mobility and query pattern of user, the distributions of LDDs and applied cache replacement strategies. Simulation results show that the proposed scheme is more efficient than the well-known existing scheme for range query and nearest neighbor query. In addition, applying the two queries dynamically to query processing improves the performance of the proposed scheme.