• ETRI Journal
• /
• v.37 no.4
• /
• pp.685-695
• /
• 2015

This paper proposes a novel video delivery scheme that reduces the bandwidth consumption cost from a video server to terminals in Long-Term Evolution networks. This proposed scheme combines optimized hybrid multicast with a segment-based caching strategy for use in environments where the maximum number of multicast channels is limited. The optimized hybrid multicast, allocation of multicast channels, and cache allocation are determined on the basis of a video's request rate, the related video's length, and the variable cost per unit size of a segment belonging to the related video. Performance evaluation results show that the proposed scheme reduces a video's delivery costs. This work is applicable to on-demand TV services that feature asynchronous video content requests.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.507-513
• /
• 2008

In Digital Contents Computing Environment, information such as register, cache memory, and network information are hard to make certain of a real-time collection because such information collection are easily modified or disappeared. Thus, a collection of information is one of important step for computer forensics system on Digital Contents computing. In this paper, we propose information collection module, which collects variable information of server system based on memory mapping in real-time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1341-1344
• /
• 2002

클러스터링을 이용한 웹 서버 구축 시 각 노드에 적절한 부하 분산이 이루어지도록 하는 것은 매우 중요하다. 부하 분배 알고리즘은 서버의 성능에 많은 영향을 미치며 부하 분배에 이용되는 기준은 간단하고 빨리 계산될 수 있어야 한다. 본 논문에서는 고가용도 및 확장성을 제공하는 클러스터링 웹 서비스를 대상으로 문서 접근 확률과 문서 크기 정보를 이용하는 동시에 캐쉬 적중률을 향상시키는 알고리즘을 제안한다.

• Journal of Information Processing Systems
• /
• v.18 no.3
• /
• pp.389-401
• /
• 2022

The business of Internet of Vehicles (IoV) is growing rapidly, and the large amount of data exchange has caused problems of large mobile network communication delay and large energy loss. A strategy for resource allocation of IoV communication based on mobile edge computing (MEC) is thus proposed. First, a model of the cloud-side collaborative cache and resource allocation system for the IoV is designed. Vehicles can offload tasks to MEC servers or neighboring vehicles for communication. Then, the communication model and the calculation model of IoV system are comprehensively analyzed. The optimization objective of minimizing delay and energy consumption is constructed. Finally, the on-board computing task is coded, and the optimization problem is transformed into a knapsack problem. The optimal resource allocation strategy is obtained through genetic algorithm. The simulation results based on the MATLAB platform show that: The proposed strategy offloads tasks to the MEC server or neighboring vehicles, making full use of system resources. In different situations, the energy consumption does not exceed 300 J and 180 J, with an average delay of 210 ms, effectively reducing system overhead and improving response speed.

• Journal of Information Processing Systems
• /
• v.18 no.6
• /
• pp.741-754
• /
• 2022

Openstack is widely used as a representative open-source infrastructure of the service (IaaS) platform. The Openstack Identity Service is a centralized approach component based on the token including the Memcached for cache, which is the in-memory key-value store. Token validation requests are concentrated on the centralized server as the number of differently encrypted tokens increases. This paper proposes the practical Byzantine fault tolerance (PBFT) blockchain-based Openstack Identity Service, which can improve the performance efficiency and reduce security vulnerabilities through a PBFT blockchain framework-based decentralized approach. The experiment conducted by using the Apache JMeter demonstrated that latency was improved by more than 33.99% and 72.57% in the PBFT blockchain-based Openstack Identity Service, compared to the Openstack Identity Service, for 500 and 1,000 differently encrypted tokens, respectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.237-241
• /
• 2010

Energy conservation of server systems has become important. Though storage subsystem is one of the biggest power consumers, development of energy conservation techniques is challenging problem due to striping techniques like RAID and physical characteristics of hard disks. According to our observation, the size of footprint for a day or for hours is much smaller compared to the size of whole data set. In this paper, we describe a design of a novel architecture for RAID that uses an SSD as a large cache to conserve energy by holding such a footprint. We incorporate these approaches into a real implementation of a RAID 5 system that consists of four hard disks and an SSD in a Linux environment. Our preliminary results in actual performance measurements using the cello99 and SPC traces show that energy consumption is reduced by a maximum of 14%.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.181-199
• /
• 2000

In this paper, we implemented and tested MPOA(MutiProtocol Over ATM) standardized in ATM Forum, which provides service for various layer 3 protocols as well as legacy LAN applications over ATM networks. The functions of MPCs(MPOA Clients) and MPSs(MPOA Servers) which are the components in MPOA systems are implemented. MPCs are located at the edge device and MPOA hosts and MPSs exist in routers. The implemented MPCs have the functions such as exchances of primitives between an LEC(LAN Emulation Client) and an MPC, management and maintenance of Egress/Ingress cache, default transmission through LECs and shortcut transmission. Assuming that routing, convergence and NHRP(Next Hop Resolution Protocol) functions exist in routers, the implemented MPSs have the functions such as exchanges of primitives between an LEC and an MPC, conversion and exchanges of frames between MPOA and NHRP, and management and maintenance of Egress/Ingress cache. All of the possible scenarios are made up to test whether they run correctly. The implemented system is tested by simulation according to the scenarios.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.132-144
• /
• 2001

The broadcast environment is asymmetric communication aspect that is typically much greater communication capacity available from server to clients than in the opposite direction. In addition, most of mobile computing systems only allow the generation of read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when those schemes are applied to the broadcast environment having quite a high data contention. In this paper, we propose OCC/2VTS (Optimistic Concurrency Control based on 2-Version and TimeStamp) that is most appropriate for broadcast environment. OCC/2VTS lets each client process and commit query transactions for itself by using two version data in cache. If the values of appropriate data items are not changed twice by invalidation report after a query transaction starts, the query transaction is committed safely independent of commitment of update transactions. OCC/2VTS decreases the number of informing server for the purpose of commitment. Due to broadcasting the validation reports including updated recent values, it reduces the opportunity of requesting a recent data values of server as well. As a result, OCC/2VTS makes full use of the asymmetric bandwidth. It also improves transaction throughput by increasing the query transaction commit ratio as much as possible.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.5
• /
• pp.36-46
• /
• 2019

The number of hosts connected to the Internet has increased dramatically, introducing the Domain Name System(DNS) in 1984. DNS is now an important key point for all users of the Internet by allowing them to use a convenient character address without memorizing a series of numbers of complex IP address. However, relative to the importance of DNS, there still exist many problems such as the authorization allocation issue, the disputes over public registration, security vulnerability such as DNS cache poisoning, DNS spoofing, man-in-the-middle attack, DNS amplification attack, and the need for many domain names in the age of hyper-connected networks. In this paper, to effectively improve these problems of existing DNS, we proposed a method of implementing DNS using distributed ledger technology, blockchain, and implemented using a Ethereum-based platform. In addition, the qualitative analysis performance comparative evaluation of the existing domain name registration and domain name server was conducted, and conducted security assessments on the proposed system to improve security problem of existing DNS. In conclusion, it was shown that DNS services could be provided high security and high efficiently using blockchain.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.