• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.97-106
• /
• 2002

Grid makes it possible to cooperate with other network area by sharing and using distributed resources. In order to manage effectively large-scale Grid network resources, Grid NOC needs monitoring architecture that can manage distributed resources in one time. Being restricted within specific managing area, conventional network management system has limitation in extension of managing area and in general management of heterogeneous resource. In this paper, we design a monitoring architecture that can take in the situation and has scalability. In the monitoring architecture the network areas publish information in a common directory service, and then Grid NOC can connect to the network areas directly by using this information. Therefore, it makes us possible to manage overall large-scale resource of Grid network reducing load.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.4
• /
• pp.90-99
• /
• 2002

Grid makes it possible to cooperate with other network area by sharing and using distributed resources. In order to manage effectively large-scale Grid network resources, Grid NOC needs monitoring architecture that can manage distributed resources in one time. Being restricted within specific managing area conventional network management system has limitation in extension of managing area and in general management of heterogeneous resource. In this paper, we design a monitoring architecture that can take in the situation and has scalability. In the monitoring architecture the network areas publish information in a common directory service, and then Grid NOC can connect to the network areas directly by using this information. Therefore, it makes us possible to manage overall large-scale resource of Grid network reducing load.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.1
• /
• pp.53-64
• /
• 2010

In this paper, we tried to enable a mobile device as a resource to access to mobile grid networks. By advanced Internet techniques, the use of mobile devices has been rapidly increased. Some researches in mobile grid computing tried to combine grid computing with mobile devices. However, according to intrinsic properties of mobile environments, mobile devices have many considerations, such as mobility management, disconnected operation, device heterogeneity, service discovery, resource sharing, security, and so on. To solve these problems, there are two trends for mobile grid computing: a proxy-based mobile grid architecture and an agent-based mobile grid architecture. We focus on a proxy-based mobile grid architecture with IP-paging, which can easily manage idle mobile devices and grid resource status information. Also, we use SIP(Session Initiation Protocol)to support mobility management, mobile grid services. We manage variation of mobile device state and power by paging cache. Finally, using the candidate set and the reservation set of resources, we perform task migration. The performance evaluation by simulation, shows improvement of efficiency and stability during execution.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.29-34
• /
• 2017

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.4
• /
• pp.103-109
• /
• 2008

Many Internet application provide the PKI(public key infrastructure)-based service to provide authentication and message integrity. Several researchers proposed PKI-based p2p network framework. However, in the real world, the use of PKI is not suitable for peer to peer network, because the peer-to-peer network is an open and dynamic network. Moreover, currently there is no nation-to-nation interoperable certificate. In this paper, we designed reliable p2p file sharing application without public key infrastructure. To do this we propose reliable public key distribution mechanism to distribute public key safely without PKI infrastructure for two-tier super-peer architecture. In our system, each peer generates and distributes its public/private key pairs, and the public key is securely distributed without PKI. The proposed mechanism is safe against MITM attack. This mechanism can be applied various P2P applications such as file sharing, IPTV, distributed resource sharing and so on

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.221-224
• /
• 2000

The issue of supporting TCP traffic over ATM networks is currently one of the most important issues in the field of data networks. One important part of this issue is congestion control. In general, congestion control uses method such as packet drop to relieve network resource when the network is congested so as to maintain high throughput and low delay. In addition, congestion control is required to ensure fair sharing of resources among all users during congestion. In this paper we propose a new congestion control method using WRED & per-VC accounting mechanism. This packet discard scheme is proposed with the goal to provide both good performance in terms of throughput and fairness in terms of bandwidth exploitation of the output link among all virtual circuits.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

• Information Systems Review
• /
• v.25 no.1
• /
• pp.75-91
• /
• 2023

Thanks to information technologies, sharing economy services offer a new way of consumption. Carsharing appeared as a novel type of service that transformed the conventional way of personal transportation, from owning a vehicle to using an on-demand service. Allowing users to use a vehicle without owning a car, carsharing provides various social benefits such as the reduction of resource allocation inefficiencies and the alleviation of transportation problems. To strengthen such positive aspects of carsharing service, it is essential to understand an individual's service usage pattern and reveal factors that affect users' reuse behavior. This study investigates the factors that have an influence on carsharing reuse of users applying RFMC (Recency, Frequency, Monetary, and Clumpiness) model, the popular model for understanding the reuse likelihood of customers. Using data from a leading carsharing service provider in South Korea, we empirically analyze the effect of RFMC on carsharing reuse behavior. The findings show that recency and monetary values are negatively related to reuse while frequency is positively related to carsharing service reuse. Moreover, the impact of recency and monetary value are more salient whereas the impact of frequency is smaller among users with higher clumpiness. Based on these findings, this study elaborates on theoretical and practical implications.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.487-498
• /
• 1995

For the purpose of the sharing and reusability of software systems in an integrated CASE environment, it is necessary to develope the repository-based integrated software environment. In this paper, we designed and implemented the repository interface between CASE tools and IRDS service interface. We have already implemented the IRDS service interface system according to ANSI IRDS standard in order to develop a repository of an integrated CASE environment. We implemented the repository interface using the CLI(Call Level Interface) method that is composed callable run-time libraries.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.946-952
• /
• 2014

Mobility prediction is one of hot topics using location history information. It is useful for not only user-level applications such as people finder and recommendation sharing service but also for system-level applications such as hand-off management, resource allocation, and quality of service of wireless services. Most of current prediction techniques often use a set of significant locations without taking into account possible location information changes for prediction. Markov-based, LZ-based and Prediction by Pattern Matching techniques consider interesting locations to enhance the prediction accuracy, but they do not consider interesting location changes. In our paper, we propose an algorithm which integrates the changing or emerging new location information. This approach is based on Active LeZi algorithm, but both of new location and all possible location contexts will be updated in the tree with the fixed depth. Furthermore, the tree will also be updated even when there is no new location detected but the expected route is changed. We find that our algorithm is adaptive to predict next location. We evaluate our proposed system on a part of Dartmouth dataset consisting of 1026 users. An accuracy rate of more than 84% is achieved.