• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.268-281
• /
• 2008

It is difficult to construct streaming services based on the overlay networks without any loss of scalability. DONet is one of the most representative streaming overlay network protocols without managing any specific structure. Since DONet does not support the nodes on private networks, it can be considered that the performance of the overlay is not the best. Hole Punching is one of the famous techniques participating the nodes on private networks to streaming overlay networks by using a rendezvous server. However, using only a single rendezvous server cannot be suggested in P2P environment, because it can cause problems in terms of scalability and so on. In this paper, we propose DONet-p, an extension of DONet with Distributed Hole Punching techniques. It supports the nodes on private networks without toss of scalability. The experimental results show the better performance and scalability than DONet with a minimum overhead for additional control messages.

• KIISE Transactions on Computing Practices
• /
• v.23 no.4
• /
• pp.199-209
• /
• 2017

Recently, there has been growing interest in workload consolidation via virtualization for real-time systems. Meanwhile, due to virtualization, additional overhead from intervention of hypervisor increases the execution time of applications running on virtual machine. The increase in execution time decreases the performance of workloads on virtual machines, thus satisfying real-time requirements are not easy. To resolve the problem, we designed and implemented a hypervisor (the K-Hypervisor) that allows programs on virtual machines to access the physical resources, without intervention of the hypervisor. Experimental results show that programs running on K-Hypervisor increase their execution time by about 3% on an average, compared to the native environment. Moreover, it is suitable for real-time workload execution because of its uniform performance degradation, regardless of the resources accessed from tasks, and the frequency it is accessed.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.729-736
• /
• 2003

With the rapid growth of the Internet, popular Web sites are visited so frequently that these cannot be constructed with a single server or mirror site of high performance. The rapid increase of Internet uses and uses raised the problems of overweighted transmission traffic and difficult load balancing. To solve these, various schemes of server clustering have been surveyed. Especially, in order to fully utilize the performance of computer systems in a cluster, a good scheduling method that distributes user requests evenly to servers in required. In this paper, we propose a new method for reducing the service latency. In our method, each Web server in the cluster has different content. This helps to reduce the complexity of load balancing algorithm and the service latency The Web server that received a request from the load balancer responds to the client directly without passing through the load balancer. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 16%, 14% respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.238-248
• /
• 2007

As the demand of employing various PC software on mobile embedded devices which have limited storages has been increased, software streaming services are needed. However it takes too much time to launch software on them because it is transferred through wireless networks. To address this problem, prefetch algorithms are needed. We examined 'Last successor (LS)' algorithm and PPM-based prefetch algorithm as prefetch algorithms for software streaming services. We present 'Probability-base Multi Successor (PMS)' algorithm which is contrived through analyzing evaluations of previous algorithms and characteristics of software streaming services. While LS has one successor per each block, PMS has N successors based on probability which is calculated by PPM-based prefetch algorithm. The hit rate of PMS is similar to that of PPM-base prefetch algorithm and the space overhead is similar to that of LS. We can get good efficiency at the point of memory usage when PMS is applied to software streaming services.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.675-684
• /
• 2009

Internet worm can cause a traffic problem through DDoS(Distributed Denial of Services) or other kind of attacks. In those manners, it can compromise the internet infrastructure. In addition to this, it can intrude to important server and expose personal information to attacker. However, current detection and response mechanisms to worm have many vulnerabilities, because they only use local characteristic of worm or can treat known worms. In this paper, we propose a new framework to detect unknown worms. It uses macroscopic characteristic of worm to detect unknown worm early. In proposed idea, we define the macroscopic behavior of worm, propose a worm detection method to detect worm flow directly in IP packet networks, and show the performance of our system with simulations. In IP based method, we implement the proposed system and measure the time overhead to execute our system. The measurement shows our system is not too heavy to normal host users.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.8 no.2
• /
• pp.10-17
• /
• 2004

The results of the combustion performance tests of gas generator which supplies hot gas into the turbine of turbo-pump for liquid rocket engine and uses LOx and kerosene as propellant are described. The gas generator consists of a injector head with F-O-F impinging injector, a water cooled combustion chamber, a gas torch igniter, a turbulence ring and an instrument ring. The effect of turbulence ring and combustion chamber length on performance of gas generator are investigated. The ignition and combustion at design point are stable and the pressure and gas temperature at gas generator exit meets the target. The turbulence ring installed at middle of chamber effectively mixes hot gas with cold gas and the effect of residence time of hot gas in gas generator on combustion efficiency is small. Test results show that the main parameter controlling the gas temperature at gas generator exit is overall O/F ratio.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.6
• /
• pp.3403-3409
• /
• 2014

Hot-firing tests were carried out using a mixing head with 19 swirl coaxial injectors and a combustion chamber with internal cooling channels. The propellants of liquid oxygen and kerosene(Jet A-1) were burned in a range of chamber pressures (59~82 bar) and mixture ratios (2.0~3.0). The temperature of water used as the cooling fluid was measured at the inlet and outlet of the cooling channels, and the heat flux was calculated. The aim of this study was to examine the effect of combustion instability on heat transfer in a subscale thrust chamber, and detect the temperature variation of cooling water. During several hot-firing tests, combustion instability was encountered which caused a 5~20% increase in heat flux. The peak heat flux took place in the initial stages of combustion instability.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.35-41
• /
• 2010

Since the ad-hoc network allow nodes to communicate each other without infrastructure system and predefined configuration, it comes into the spotlight that is suitable to ubiquitous society. In ad-hoc network, route recovery mechanism is considered important. Normally route recovery is needed to solve the link failure problem because there is no route maintaining system like a router in ad-hoc networks. In this paper we propose BS-AODV(Bidirectional Searching-AODV) route recovery method. The proposed method is a local repair method that can be applied in all of the network area. Unlike a limited local repair method in AODV. the proposed method adopts the bidirectional searching method where the upstream/downstream nodes can send the route maintenance messages. Restricting the flooding of route request messages, the proposed scheme attempts to minimize the costs of local repair, the performance of the proposed scheme is evaluated through the simulations. In two scenarios which variate the node numbers and node speed, the comparison among the proposed scheme, AODV and AOMDV is shown in terms of the control traffic and data delivery ratio.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.553-558
• /
• 2007

In this paper, we introduce a set of structures and algorithms for communication efficient public key revocation in wireless sensor networks. Unlike the traditional networks, wireless sensor network is subjected to resources constraints. Thus, traditional public key revocation mechanisms such like the ordinary certificate revocation list is unsuitable to be used. This unsuitability is due to the huge size of required representation space for the different keys' identifiers and the revocation communication as the set of revoked keys grow. In this work, we introduce two communication-efficient schemes for the certificate revocation. In the first scheme, we utilize the complete subtree mechanism for the identifiers representation which is widely used in the broadcast encryption/user revocation. In the second scheme, we introduce a novel bit vector representation BVS which uses vector of relative identifiers occurrence representation. We introduce different revocation policies and present corresponding modifications of our scheme. Finally, we show how the encoding could reduce the communication overhead as well. Simulation results and comparisons are provided to show the value of our work.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.4
• /
• pp.9-17
• /
• 2010

The mobility of nodes are different in wireless ad hoc networks. Routes have to be refreshed frequently due to the mobility of the nodes acting as routers. Path consists of a few highly mobile nodes should be avoided to forward packets, because even only one highly mobile node may result in the break of path. We develop a mobility aware method to evaluate path stability for multipath routing in wireless Ad Hoc networks. Specifically, we extend it to a well-studied multipath routing protocol known as ad hoc on-demand multipath distance vector (AOMDV). The resulting protocol is referred to as path stability evaluation (PSE). Performance comparison of AOMDV with PSE are studied through ns-2. Simulation shows that PSE has optimistic results in performance metrics such as packet delivery, end-to-end delay, routing overhead and throughput.