• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.3
• /
• pp.19-27
• /
• 2016

Advance in Information and Communication Technology (ICT) is intensely influenced to increase importance of Software on global ICT industries. The trend of technological development has been transformed from hardware-oriented environment to software-oriented environment. This industrial transformation brought novel trend to Software market. Open Source Software (OSS) has been widely distributed for private uses. At the same time, many governmental offices are planning to expand the use of OSS. In this paper, we analyze the strength and weaknesses of OSSs for both Web and WAS servers based on 4 types of testing environments which are created by the combination of 5 selected OSSs. We anticipated to learn the optimal system architecture design for the next generation of V-World through this research.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.3
• /
• pp.47-59
• /
• 2007

IPv4 NAT, which often used in households or under SOHO environments, is one of the factors that delays IPv6 propagation. As IPv4 NAT does not operate properly under the transition mechanism like ISATAP or 6to4 that acts as IPv6-in-IPv4 tunneling type, Microsoft proposed Teredo in order to resolve this issue. However, tunneling transition mechanism like Teredo has a security problem. That is, being tunneled packets have dual IP headers; general firewall systems apply the filtering rules only to the outer header but not inner header when these packets pass the firewall. Furthermore, attacks using unregistered server and relay can take place in Teredo. To resolve these problems, we propose a new packet filtering mechanism exclusively for Teredo. The proposed packet filtering mechanism was designed and implemented by using Linux Netfilter and ip6tables. Through functional and experimental performance tests, this packet filtering system was found operating properly and solving the Teredo packet filtering problems without serious performance degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.137-145
• /
• 2006

In this paper, we propose a multicast P2Patching technique in the application layer. The P2Patching technique serves VOD stream effectively with Patching in P2P environment. The P2Patching provides multicast tree construction technique that reduces the server load and minimizes the start delay with extended multicast technique. And we provide a fast recovery technique by tree failure and dynamic buffering scheme that guarantees the continuous streaming by frequent tree disconnections. Comparing the method with that of $P2Cast^{[12]}$, we obtained the better performance by our scheme in terms of average join count, service rejection probability, tree recovery failure and buffer starvation. The average about 16$\%$ of the improvement is shown by the simulation. Most of all, the performance of buffer starvation and average join count shows a significant improvement than that of P2Cast.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1141-1149
• /
• 2010

Next Generation Networks (NGN) is defined as IP-based networks with multi-services and with multi-access networks. A variety of services and access technologies are co-existed within NGN. Therefore there are numerous transport technologies such as Differentiated Services (DiffServ), Multi-protocol Label Switching (MPLS), and the combined transport technologies. In such an environment, flows are aggregated and de-aggregated multiple times in their end-to-end paths. In this research, a method for calculating end-to-end delay bound for such a flow, provided that the information exchanged among networks regarding flow aggregates, especially the maximum burst size of a flow aggregate entering a network. We suggest an admission control mechanism that can decide whether the requested performance for a flow can be met. We further verify the suggested calculation and admission algorithm with a few realistic scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.870-884
• /
• 2000

Among OLAP(On-Line Analytical Processing) approaches, ROLAP(Relational OLAP) based on the star, snowflake schema which offer the multidimensional analytical method has performance problem and MOLAP (Multidimensional OLAP) based on Multidimensional Database System has scalability problem. In this paper, to solve the limitaions of previous approaches, design and implementation of multidimensional data model based on Object-Relation DBMS was proposed. With the extensibility of Object-Relation DBMS, it is possible to advent multidimensional data model which more expressively define multidimensional concept and analysis functions that are optimized for the defined multidimensional data model. In addition, through the hierarchy between data objects supported by Object-Relation DBMS, the aggregated data model which is inherited from the super-table, multidimensional data model, was designed. One these data models and functions are defined, they behave just like a built-in function, w th the full performance characteristics of Object-Relation DBMS engine.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.441-450
• /
• 2009

This paper describes the design and implementation of Personal Mobile Broadcasting Service which bases on embedded Linux and it supports personal broadcasting in wireless network environments. Recently, with the advent of various wireless networks and the increased use of high performance mobile devices, the demand for personal mobile broadcasting is being increased. The personal mobile broadcasting service makes it possible that mobile users create contents using their own mobile devices while they are moving or they are in any place. And then, it sends the created contents to server in real-time where their blogs are. Users connected to the content creator's blog can play the contents in real-time. With the implemented personal mobile broadcasting service, mobile users can share multimedia contents in real-time through wireless networks. And, it also helps users to construct their own broadcasting stations where they can broadcast the scene of the accident or public performance in real-time.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.865-874
• /
• 2002

HTTP (HyperText Transfer Protocol) is a transfer protocol used by the World Wide Web distributed hypermedia system to retrieve the objects. Because HTTP is a connection oriented protocol, it uses TCP (Transmission control Protocol) as a transport layer. But it is known that HTTP interacts with TCP badly. it is discussed about factors affecting the performance or HTTP over TCP, the transaction time obtained by the per-transaction TCP connections for HTTP access and the TCP slow-start overheads, and the transaction time for T-TCP (Transaction TCP) which is one or methods improving the performance or HTTP over TCP. Average waiting time and average turnaround time are important parameters to satisfy QoS (Quality of Service) of end users. Formulas for calculating two parameters are derived. Such formulas can be used for the environment in which each TCP or T-TCP transaction time is same or different. Some experiments and computational experiences indicate that the proposed formulas are well acted, can be applied to the environment which the extension of bandwidth is necessary, and time characteristics of T-TCP are superior to that of TCP. Also, the load distribution method of web server based on the combination of bandwidths is discussed to reduce average waiting time and average turnaround time.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2092-2105
• /
• 1997

In this paper, we propose a load sharing scheme in distributed systems. In the proposed scheme, the state of each host is classified as a server or a source by its current load and, to prevent excessive state changes of each host, we used three threshold values for identifying the current state of each host. Based on the threshold values, some hosts, called brokers, manage the servers registered to them. The brokers, whose number is determined by the system utilization factor and the total number of hosts, support task migration processes from overloaded sources to lightly loaded servers. Also they can hand over the broker's role to another host when it is overloaded. Simulation studies were performed for examining the sensitivity of each system parameters such as threshold values, utilization factor, the number of hosts, and the number of brokers to the system performance indices including mean response time, mean queue length.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.445-452
• /
• 2004

Zoning technology of disk improved the performance of disk subsystem with increase of storage capacity and average transfer bandwidth. SCAN disk scheduling with double buffering is used to utilize the performance of zoned disk in multimedia system. However, this method has a problem that generates jitter when the number of steams increases. In this article, we propose the novel approach, pre-buffering policy, to overcome this problem. Pre-buffering avoids jitter by buffering the lack of data before starting service, which is estimated from the current cycle length and the maximum cycle length. We can calculate cycle length, data sire needed in each cycle and the possible lack of data caused by the increase of the number of streams using the numerical model of disk subsystem. Pre-buffering can be applied for multimedia systems and contribute to provide clients with high quality service without jitter.

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

Recently, LINUX cluster file systems based on the storage area network (SAN) have been developed. In those systems, without using a central file server, multiple clients sharing the whole disk storage through Fibre Channel can freely access disk storage and act as file servers. Accordingly, they can offer advantages such as availability, load balancing, and scalability. In this paper, we describe metadata management schemes designed for a new SAN-based LINUX cluster file system. First, we present a new inode structure which is better than previous ones in disk block access time. Second, a new directory structure which uses extendible hashing is described. Third, we describe a novel scheme to manage free disk blocks, which is suitable for very large file systems. Finally, we present how we handle metadata journaling. Through performance evaluation, we show that our proposed schemes have better performance than previous ones.