• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.45-58
• /
• 2020

In the current trend of increasing network traffic due to the popularization of cloud service and mobile devices, WAN bandwidth is very low compared to LAN bandwidth. In a WAN environment, a WAN optimizer is needed to overcome performance problems caused by transmission protocol, packet loss, and network bandwidth limitations. In this paper, we analyze the data deduplication algorithm of WANProxy, an open source WAN optimizer, and evaluate its performance in terms of network latency and WAN bandwidth. Also, we evaluate the performance of the two-stage compression method of WANProxy and Zstandard. We propose a new method to improve the performance of WANProxy by revising its data deduplication algorithm and evaluate its performance improvement. We perform experiments using 12 data files of Silesia with a data segment size of 2048 bytes. Experimental results show that the average compression rate by WANProxy is 150.6, and the average network latency reduction rates by WANProxy are 95.2% for a 10 Mbps WAN environment and 60.7% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, the two-stage compression of WANProxy and Zstandard increases the average compression rate by 33%. However, it increases the average network latency by 2.1% for a 10 Mbps WAN environment and 5.27% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, our proposed method increases the average compression rate by 34.8% and reduces the average network latency by 13.8% for a 10 Mbps WAN and 12.9% for a 100 Mbps WAN, respectively. Performance analysis results of WANProxy show that its performance improvement in terms of network latency and WAN bandwidth is excellent in a 10Mbps or less WAN environment while superior in a 100 Mbps WAN environment.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1804-1820
• /
• 1997

In this paper, an efficient call control procedure is presented for next generation wireless ATM networks and its performance is mathematically analyzed using the open queueing network. This procedure is based on a new scheme called as the cell clustering. When we use the cell clustering scheme, at the time that a mobile connection is admitted to the network, a virtual cell is constructed by choosing a group of neighboring base stations to which the call may probabilistically hand over and by assigning to the call a collection of virtual paths between the base stations. Within a microcell/picocell environment, it is seen that the cell clustering can support effectively a very high rate of handovers, provides very high system capacity, and guarantees a high degree of frequency reuse over the same geographical region without requiring the intervention of the network call control processor each time a handover occurs. But since mobiles, once admitted, are free to roam within the virtual cell, overload condition occurs in which the number of calls to be handled by one base station to exceed that cell site's capacity of radio channel. When an overload condition happens, the quality of service is abruptly degraded. We refer to this as the overload state and in order to quantify the degree of degradation we define two metrics, the probability of overload and the normalized average time spent in the overload state. By using the open network queueing model, we derive closed form expressions for the maximum number of calls that can be admitted into the virtual cell such that the two defined metrics are used as the acceptance criteria for call admission control.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.422-435
• /
• 2005

Compared with analog broadcasting, digital broadcasting supports technical background to provide personalize the TV watching environment by offering broadcasting services that can adapt to viewers' preferences. However, current digital broadcasting shows limited services such as reservation recording, simple program guiding with an electronic program guide (EPG) on a personal video recorder system, and primitive data broadcasting by broadcasters. Therefore, the purpose of this paper is to suggest a new broadcasting environment which gives a person facility and a difference fur watching TV by serving enhanced personalized services. For that reason, we propose an intelligent broadcasting system which can minimize viewer's actions, and enhanced broadcasting services which are based on understanding of the semantics of broadcasting contents. To implement the system, agent technology as well as the MPEG-7 and TV-Anytime Forum (TVAF) are employed. For content-level services, real-time content filtering and personalized video skimming are designed and implemented. To verify the usefulness of the proposed system, we demonstrate it with a test-bed on which content-level personalized services are implemented.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.6-16
• /
• 2008

An instable wireless channel condition causes more packet losses and retransmissions due to interference, fading, station mobility, and so on. Therefore video streaming service over a wireless networks is a challenging task because of the changes in the wireless channel conditions and time-constraints characteristics of the video streaming services. To provide efficient video streaming over a wireless networks, QoS-enhanced MAC protocol, IEEE 802.11e, is standardized recently. Tn this paper, we propose a new network-adaptive H.264 video streaming mechanism in the IEEE 802.11e wireless networks. To improve the quality of video streaming services, video stream has to adapt to the changes in the wireless channel conditions. The wireless channel conditions are estimated by the packet loss probability and informed to the application layer by the cross-layering. According to the wireless channel information, the video streaming application filters out the low-priority data. This adaptation mechanism efficiently uses system resources because it drops the low-priority data in advance. Therefore, our cross-layer design can provide improved video streaming services to the end-user. Through the implementation and performance evaluation, we prove that the proposed mechanism improves the QoS of the video streaming by providing the smoothed playback.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.375-385
• /
• 2002

The IETF has defined the Intserv model and the RSVP signaling protocol to improve QoS capability for a set of newly emerging services including voice and video streams that require high transmission bandwidth and low delay. However, since the current Intserv model requires each router to maintain the states of each service flow, the complexity and the overhead for processing packets in each rioter drastically increase as the size of the network increases, giving rise to the scalability problem. This motivates our work; namely, we investigate and devise new control schemes to enhance the scalability of the Intesev model. To do this, we basically resort to the SCORE network model, extend it to fairly well adapt to the three services presented in the Intserv model, and devise schemes of the QoS scheduling, the admission control, and the edge and core node architectures. We also carry out the computer simulation by using ns-2 simulator to examine the performance of the proposed scheme in respects of the bandwidth allocation capability, the packet delay, and the packet delay variation. The results show that the proposed scheme meets the QoS requirements of the respective three services of Intserv model, thus we conclude that the proposed scheme enhances the scalability, while keeping the efficiency of the current Intserv model.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.319-330
• /
• 2001

In virtual memory system, when a process attempts to access a page that is not resident in memory, the system generates and handles a page fault that causes unpredictable delay. So virtual memory system is not appropriate for the real-time system, because it can increase the deadline miss ratio of real-time task. In multimedia system, virtual memory system may degrade the QoS(quality of service) of multimedia application. Furthermore, in general-purpose operating system, whenever a new task is dynamically loaded, virtual memory system suffers from extensive page fault that cause transient overloading state. In this paper, we present efficient overloading control mechanism called RBPFH (Rate-Based Page Fault Handling). A significant feature of the RBPFH algorithm is page fault dispersion that keeps page fault ratio from exceeding available bound by monitoring current system resources. Furthermore, whenever the amount of available system resource is changed, the RBPFH algorithm dynamically adjusts the page fault handling rate. The RBPFH algorithm is implemented in the Linux operating system and its performance measured. The results demonstrate RBPFH\`s superior performance in supporting multimedia applications. Experiment result shows that RBPFH could achieve 10%∼20% reduction in deadline miss ratio and 50%∼60% reduction in average delay.

• Information Systems Review
• /
• v.17 no.3
• /
• pp.135-157
• /
• 2015

Mobile giving platform is a new type of giving platform which offers donation service through mobile application. Mobile giving platform has developed differently from offline giving platform in the way that induces continuous donation. The purpose of this study is to investigate why mobile giving platform has adopted different strategy, and how it leads to continuous contribution. We conducted a case study with two successful mobile giving platforms; Bigwalk and Tree Planet. The analysis of the strategy is based on the construal level theory which explains the relationship between psychological distance and construal level. The result shows that the users' psychological distance toward giving platform has decreased with the environmental change, offline to mobile. Consequently the mobile giving platform offers services which form low level of construal for encouraging continuous participation. This finding suggests the importance of offering suitable construal level in services, and design guideline for mobile giving platforms.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.1
• /
• pp.113-119
• /
• 2013

Despite rapid changes in the structure of industry, manufacturing remains a key industry for economic progress, promotion of trade, increased employment, and the creation of new industries. Production technologies are essential for strengthening the competitiveness of small- and medium-sized manufacturing industries. However, it is very difficult to standardize and systematically propagate production technology from an experienced worker to an inexperienced worker because these technologies are generally improved by the skilled people in a workshop. In this study, we introduce a Web-based platform system consisting of a knowledge authoring tool, technology database, semantic database, and Web portal service for sharing production technologies for the exterior housing parts of mobile products. By investigating various cellular phone designs, reference form factors for three types of mobile phone housings were designed based on the standard features. In addition, several manufacturing technologies and considerable information such as reference mold designs and molding conditions optimized using CAE and recent R&D outputs are stored in this system.

• Journal of Gifted/Talented Education
• /
• v.26 no.3
• /
• pp.493-514
• /
• 2016

Since the Gifted and Talented Education Promotion Law was enacted 15 years ago, in Korea, gifted education in Korea has continued rapid and quantitative growth. The number of gifted classes or institutes for the gifted have increased, as well as the number of gifted education teachers increasing their participation in professional development training and educational activities. However after 2014, gifted education is somewhat shrinking. Due to the controversy of private education and expansion of social welfare in Korea, administrative and financial support for gifted education is being reduced. This study reviewed the gifted education policies promoted by successive governments and analyzed the relationship between politics and support for gifted education efforts by the government. In addition, the phenomenon of the recently shrinking gifted education in Korean society was analyzed in various aspects. These aspects include: decreasing quantitative growth due to the weakening of administrative and financial support from central and local governments on gifted education, regulations on suppressing private education, social inequality to gifted education access, and lack of solidarity in the gifted education scholastic community. Based on this analysis of gifted phenomenon, ways of developing the ideological and practical aspects of future-oriented gifted education were suggested. In the ideological dimension, it was emphasized that gifted education must move away from insularity and the adhesive perspective of Korean society on the concept of giftedness, the concept of intelligence and the recognition of the legitimacy of gifted education. On the other hand, in the practical dimension, the following points were identified: the collection of empirical data on the economic impact of gifted education, gifted education amendment of the statutes, adaptation of the gifted education program with gifted identification, diversification of gifted education service system, and actively promoting new research topics in relation to the Gifted and Talented Education.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.