• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1040-1045
• /
• 2002

This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.3
• /
• pp.19-31
• /
• 2004

The purpose of this study is to show a case integration of web programming with database using Visual InterDev as a conceptual client and Web Server as server, Through this case study, we can see how easily dynamic web database programming used in Internet and Interanet can be developed in one integrated design environment such as Visual InterDev eliminating the inconvenience of developing database file and web page separately. Some literature survey and experimental practices were done to provide future developers with the principles and methodologies of developing web database programing using Visual InterDev with much less coding efforts and more convenient and easy way compared to other web developing tools.

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.149-160
• /
• 2019

Web applications typically interact with databases. Therefore, it is very crucial to understand which web components access which database resources when maintaining web apps. Existing research identifies interactions between Java web components, such as JavaServer Pages and servlets but does not extract dependencies between the web components and database resources, such as tables and attributes. This paper proposes a dynamic analysis of Java web apps, which extracts such dependencies from a Java web app and represents them as a graph. The key responsibility of our analysis method is to identify when web components access database resources. To fulfill this responsibility, our method dynamically observes the database-related objects provided in the Java standard library using the proxy pattern, which can be applied to control access to a desired object. This study also experiments with open source web apps to verify the feasibility of the proposed method.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1163-1176
• /
• 2005

The Web is the largest distributed information space but, the individual's capacity to read and digest contents is essentially fixed. In these Web environments, mining traversal patterns is an important problem in Web mining with a host of application domains including system design and information services. Conventional traversal pattern mining systems use the inter-pages association in sessions with only a very restricted mechanism (based on vector or matrix) for generating frequent K-Pagesets. We extend a family of novel algorithms (termed WebPR - Web Page Recommend) for mining frequent traversal patterns and then pageset to recommend. We add a WebPR(A) algorithm into a family of WebPR algorithms, and propose a new winWebPR(T) algorithm introducing a window concept on WebPR(T). Including two extended algorithms, our experimentation with two real data sets, including LadyAsiana and KBS media server site, clearly validates that our method outperforms conventional methods.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.63-72
• /
• 2007

This paper introduces a load-balancing algorithm focusing on distributing web requests evenly into the web cluster servers. The load-balancing algorithms based on conventional periodic load-information update mechanism are not suitable for dynamic page applications, which are common in Cyber Foraging services, due to the problems caused by periodic synchronized load-information updating and the difficulties of work load estimation caused by embedded executing scripts of dynamic pages. Update-on-Finish algorithm solves this problem by using non-periodic load-update mechanism, and the web switch knows the servers' real load information only after their reporting and then distributes new loads according to the new load-information table, however it results in much communication overhead. Our proposed mechanism improve update-on-finish algorithm by using K-Percents-Finish mechanism and thus largely reduce the communication overhead. Furthermore, we consider the different capabilities of servers with a threshold Ti value and propose a load-balancing algorithm for servers with various capabilities. Simulation results show that the proposed K-Percents-Finish Reporting mechanism can at least reduce 50% communication overhead than update-on-finish approach while sustaining better load balancing performance than periodic mechanisms in related work.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.187-198
• /
• 2004

The World-Wide Web is the largest distributed Information space and has grown to encompass diverse information resources. However, although Web is growing exponentially, the individual's capacity to read and digest contents is essentially fixed. From the view point of Web users, they can be confused by explosion of Web information, by constantly changing Web environments, and by lack of understanding needs of Web users. In these Web environments, mining traversal patterns is an important problem in Web mining with a host of application domains including system design and Information services. Conventional traversal pattern mining systems use the inter-pages association in sessions with only a very restricted mechanism (based on vector or matrix) for generating frequent k-Pagesets. We develop a family of novel algorithms (termed WebPR - Web Page Recommend) for mining frequent traversal patterns and then pageset to recommend. Our algorithms provide Web users with new page views, which Include pagesets to recommend, so that users can effectively traverse its Web site. The main distinguishing factors are both a point consistently spanning schemes applying inter-pages association for mining frequent traversal patterns and a point proposing the most efficient tree model. Our experimentation with two real data sets, including Lady Asiana and KBS media server site, clearly validates that our method outperforms conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1251-1264
• /
• 2002

Currently, audio streaming services such as on-demand service and live service support only a limited number of clients. They also suffer from a lack of stability and degradation of service quality due to their inefficient use of network resources. Futhermore, since the streaming services usually do not consider dynamic services, they are very inconvenience to use. In order to resolve these drawbacks, we propose a novel audio streaming system based on MPEG-2 AAC file format which are facilitated with the network bandwidths efficiently. The proposed system supports QoS for audio streaming as well as guarantees a stability while streaming service is undergoing. Moreover, the system provides a dynamic interface which enables us to use the streaming service more easily and to manage streaming servers with convenient manner. On the contrary, most of the current available static interface streaming services are mainly depending only on a single fixed web page between client and server, which in consequence lead us to use unflexible static service environment. Our implementation results show the proposed system improves the performance compared to those of the currently existing systems that use MP3 file format. It also provides some benefits such as a stability of service and a easy to management of streaming servers.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.1
• /
• pp.167-174
• /
• 2009

A Tile Map Service is a regular map service that has been enhanced to serve maps very quickly using a cache of static images. The map cache is a directory that contains image tiles of a map extent at specific scale levels. Returning a tile from the cache takes the server much less time than drawing the map image on demand. Use of a Tile Map Service can dramatically improve the time that clients take to display complex base-maps. Using Tile Map Services thus eliminate the need to trade quality for performance. This study provides a way to construct Tile Map Service System using Open Source GIS. We used GDAL(Geospatial Data Abstraction Library) which is one of the Open Source GIS Softwares to make Tile Map Image and OpenLayers to publish Web Page. Moreover, We conducted a performance test on Tile Map System and Dynamic Map System and evaluated the results of it. As a result, the proposed method makes it easier to construct high performance Tile Map Service using Open Source GIS without commercial products.

• Journal of Intelligence and Information Systems
• /
• v.20 no.1
• /
• pp.195-211
• /
• 2014

Cloud computing services provide IT resources as services on demand. This is considered a key concept, which will lead a shift from an ownership-based paradigm to a new pay-for-use paradigm, which can reduce the fixed cost for IT resources, and improve flexibility and scalability. As IT services, cloud services have evolved from early similar computing concepts such as network computing, utility computing, server-based computing, and grid computing. So research into cloud computing is highly related to and combined with various relevant computing research areas. To seek promising research issues and topics in cloud computing, it is necessary to understand the research trends in cloud computing more comprehensively. In this study, we collect bibliographic information and citation information for cloud computing related research papers published in major international journals from 1994 to 2012, and analyzes macroscopic trends and network changes to citation relationships among papers and the co-occurrence relationships of key words by utilizing social network analysis measures. Through the analysis, we can identify the relationships and connections among research topics in cloud computing related areas, and highlight new potential research topics. In addition, we visualize dynamic changes of research topics relating to cloud computing using a proposed cloud computing "research trend map." A research trend map visualizes positions of research topics in two-dimensional space. Frequencies of key words (X-axis) and the rates of increase in the degree centrality of key words (Y-axis) are used as the two dimensions of the research trend map. Based on the values of the two dimensions, the two dimensional space of a research map is divided into four areas: maturation, growth, promising, and decline. An area with high keyword frequency, but low rates of increase of degree centrality is defined as a mature technology area; the area where both keyword frequency and the increase rate of degree centrality are high is defined as a growth technology area; the area where the keyword frequency is low, but the rate of increase in the degree centrality is high is defined as a promising technology area; and the area where both keyword frequency and the rate of degree centrality are low is defined as a declining technology area. Based on this method, cloud computing research trend maps make it possible to easily grasp the main research trends in cloud computing, and to explain the evolution of research topics. According to the results of an analysis of citation relationships, research papers on security, distributed processing, and optical networking for cloud computing are on the top based on the page-rank measure. From the analysis of key words in research papers, cloud computing and grid computing showed high centrality in 2009, and key words dealing with main elemental technologies such as data outsourcing, error detection methods, and infrastructure construction showed high centrality in 2010~2011. In 2012, security, virtualization, and resource management showed high centrality. Moreover, it was found that the interest in the technical issues of cloud computing increases gradually. From annual cloud computing research trend maps, it was verified that security is located in the promising area, virtualization has moved from the promising area to the growth area, and grid computing and distributed system has moved to the declining area. The study results indicate that distributed systems and grid computing received a lot of attention as similar computing paradigms in the early stage of cloud computing research. The early stage of cloud computing was a period focused on understanding and investigating cloud computing as an emergent technology, linking to relevant established computing concepts. After the early stage, security and virtualization technologies became main issues in cloud computing, which is reflected in the movement of security and virtualization technologies from the promising area to the growth area in the cloud computing research trend maps. Moreover, this study revealed that current research in cloud computing has rapidly transferred from a focus on technical issues to for a focus on application issues, such as SLAs (Service Level Agreements).