• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1229-1240
• /
• 1998

In this paper, we provide a design of DAVIC VOD service system with proxy servers which perform caching of video streams. Proxy servers are placed between a service provider system and service consumer systems. They provide video services to consumers on behalf of the service provider, therefore they reduce the loads of service providers and network. The operation of a proxy server depends on whether the requested program is in its storage. If this is the case, the prosy servere takes all the controls, but if the proxy does not have the program, it forwards the service request the proxy server takes all the controls, but if the prosy does not have the program, it forwards the service request to a service provider. While the service provider system provides the program to the consumer, the proxy copies and caches the program. The proxy server executes cache replacement, if necessary. We show by simultion that the LFU is the most efficiency caching replacement algorithm among the typical algorithms such as LRU, LFU, FIFO.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1493-1503
• /
• 1999

ATM Clustering System과 같이 SAN(System Area Network) 환경에서 동작하는 시스템은 낮은 지연시간과 넓은 대역폭의 네트워크가 필수적이나 기존의 에러 복구 프로토콜들은 이러한 요구를 충족시키기에는 큰 오버헤드를 가지고 있다. 제안된 새로운 에러 복구 프로토콜은 ATM Clustering System 환경에서 최적의 성능을 나타내는 light-weight 프로토콜로 에러가 없는 상황과 에러 복구가 진행중인 상황에 따라 acknowledgement 주기를 적응적으로 변화시키는 adaptive acknowledgement scheme를 제안하여 적용하였다. 제안된 프로토콜은 상용 툴인 SDT를 이용한 논리 검증 받았고, DEVSim++ 환경에서의 성능 분석을 통해 프로토콜이 최상의 성능을 보이기 위한 파라메터 값을 찾았고, 이 값을 적용하였을 때의 성능을 기존의 프로토콜과 비교하여 제안된 프로토콜이 더 우수함을 확인하였다.Abstract While a system working with SAN, such as ATM Clustering System, requires a network with low latency and wide bandwidth, the previous error recovery protocols have a serious network overhead to satisfy this requirement. The suggested error recovery protocol is a light-weight protocol which can shows its best performance at ATM Clustering System and uses a newly suggested adaptive acknowledgement scheme. In the adaptive acknowledgement scheme, the period of acknowledgement is dynamically changed depending on the state of the network. We proved the logical correctness of our protocol with SDT and did performance analysis with DEVSim++. From the analysis, we found the optimal parameter values for best performance and showed that our protocol works better than the previous error recovery protocols.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1273-1287
• /
• 2009

PEGASIS, a chain-based protocol, forms chains from sensor nodes so that each node transmits and receives from a neighbor. In this way, only one node (known as a HEAD) is selected from that chain to transmit to the sink. Although PEGASIS is able to balance the workload among all of the nodes by selecting the HEAD node in turn, a considerable amount of energy may be wasted when nodes which are far away from sink node act as the HEAD. In this study, DERP (Distance-based Energy-efficient Routing Protocol) is proposed to address this problem. DERP is a chain-based protocol that improves the greedy-algorithm in PEGASIS by taking into account the distance from the HEAD to the sink node. The main idea of DERP is to adopt a pre-HEAD (P-HD) to distribute the energy load evenly among sensor nodes. In addition, to scale DERP to a large network, it can be extended to a multi-hop clustering protocol by selecting a "relay node" according to the distance between the P-HD and SINK. Analysis and simulation studies of DERP show that it consumes up to 80% less energy, and has less of a transmission delay compared to PEGASIS.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.974-981
• /
• 2014

These days, use of multimedia streaming service and demand of QoS (Quality of Service) improvement have been increased because of development of network. QoS of streaming service is influenced by a jitter, delay, throughput, and loss rate. For guaranteeing these factors which are influencing QoS, the role of transport layer is very important. But existing TCP which is a typical transport layer protocol increases the size of congestion window slowly and decreases the size of a congestion window drastically. These TCP characteristic have a problem which cannot guarantee the QoS of UHD multimedia streaming service. In this paper, we propose a router buffer based congestion control method for improving the QoS of UHD streaming services. Our proposed scheme applies congestion window growth rate differentially according to a degree of congestion for preventing an excess of available bandwidth and maintaining a high bandwidth occupied. Also, our proposed scheme can control the size of congestion window according to a change of delay. After comparing with other congestion control protocols in the jitter, throughput, and loss rate, we found that our proposed scheme can offer a service which is suitable for the UDH streaming service.

• KIISE Transactions on Computing Practices
• /
• v.23 no.7
• /
• pp.428-433
• /
• 2017

Recently, the demand for high performance non-volatile memory storage devices that can replace existing hard disks has been increasing in environments requiring high performance computing such as data-centers and social network services. The performance of such non-volatile memory can greatly depend on the interface between the host and the storage device. With the evolution of storage interfaces, the non-volatile memory express (NVMe) interface has emerged, which can replace serial attached SCSI and serial ATA (SAS/SATA) interfaces based on existing hard disks. The NVMe interface has a higher level of scalability and provides lower latency than traditional interfaces. In this paper, an evaluation and analysis are conducted of the performance of NVMe storage devices through various workloads. We also compare and evaluate the cost efficiency of NVMe SSD and SATA SSD.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.4
• /
• pp.839-847
• /
• 2015

To seamlessly provide content through the Internet, it is generally considered to use distributed processing for content requests converged on original content providers like P2P, CDN, and ICN. That is, after other nodes temporally save content, they handle content requests instead of original content providers. However, in this case, it may be possible that a content sender is different from the original provider of the content. In this case, users may be exposed to various risks. To solve such a problem, it is highly recommended to verify received contents before using them, but it can cause network traffic increases as well as a serious service delay. This paper proposes an efficient content verification scheme for distributed networking/data store environments and analyzes its performance.

• Journal of Navigation and Port Research
• /
• v.37 no.3
• /
• pp.263-267
• /
• 2013

This paper describes the progress and the plan of 'Wide Area Differential GPS (WA-DGPS) Development' project supported by Korean Ministry of Oceans and Fisheries. The project develops the main algorithms of the WA-DGPS which guarantees the improved accuracy, availability, and integrity all over the Korean peninsula. After the establishment of WA-DGPS ground infrastructure system, a real-time demonstration using pseudolite installed on the ground will be conducted in the final year. Also, the development of Korean Satellite-based Augmentation System (SBAS) is expected to be started from 2014, and the algorithms and the results in the WA-DGPS project will be used in the SBAS development.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1320-1326
• /
• 2017

Recently, IoT has been studying a lightweight protocol to satisfy device communication in a limited network environment. MQTT is a typical lightweight protocol. It supports small fixed headers to minimize overhead, and adopts publish/subscribe structure to guarantee real-time performance. However, MQTT does not support prioritization of important data and can not provide QoS in a specific IoT service. In this paper, we propose a message processing method to consider the priority of various IoT services in MQTT. In the proposed method, the priority flag is added to the fixed header of the MQTT in the node to transmit the message, and the broker confirms the priority of the corresponding message and processes it preferentially. Through experiment and evaluation, we confirmed the reduction of end-to-end delay between nodes according to priority.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.8
• /
• pp.674-682
• /
• 2013

Along with increasing of its subscribers and traffic for high-speed LTE service, it is widely expected to bring about the 2nd data explosion and results in any inconvenience of users. This paper proposes a smart traffic management scheme and its system design based on user's participating with the mobile application, in order to provide a fast and stable service for end users as well as to resolve the network overhead with increasing traffic. By making use of a time shift by users who want to reduce data usage amount and communication cost, the proposed scheme tries to reduce the peak traffic by shifting the delay-tolerant services, such as file sharing and software download, into the other time line. It also reduces the high volumed video traffics by transforming them into a user customized one. In addition, we suggest a mechanism to select video size and service time, then proposes an overall system design and its user service scenarios.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.193-202
• /
• 2004

Handoff if the most Important feature for the user's mobility in a cellular communication system, which is related to resource reservation at nearby cells. For efficient resource reservation, mobility prediction has been reported as an effective means to decrease call dropping probability and to shorten handoff latency in wireless cellular environments. Several early proposed handoff schemes making use of tile user's movement history on a cell-by-cell basis work on the assumption that the user's movements are restricted to the indoor locations such as an office or a building. However, those algorithms cannot be applied to a micro-cell structure or a metropolis with complicated structure of roads. In this paper, to overcome those drawbacks we propose a new mobility prediction algorithm, which stores and uses the history of the user's positions within the current cell to predict the next cell.