• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.3
• /
• pp.537-548
• /
• 2000

ATM is the effective information transmission method which multiply statistical and can accept effective the traffic of the various transmission rate. However, it can happen excessive cell loss probability and cell delay when it have temporarily overload. Therefore, it is required the effective traffic control and network resource management for which guarantee QoS(Quality of Service) in terms of users and bandwidth utilization maximization in terms of networks. In this paper, we proposed POBP(PushOut BP) scheme which mixed pushout scheme with BP(Back Pressure), reactive control scheme recommended at the ATM Forum, to guarantee QoS in two stages ATM switch networks. In proposed method, we have to understand exactly using bandwidth information in real-time and become traffic shaping. Thorough these processes, we can not only use effectively unused bandwidth, but also guarantee the fair bandwidth utilization and then can improve cell-loss possibility happened by congestion states in two stage ATM networks.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.351-355
• /
• 2010

The service which is required wide bandwidth is growing in these days, so building up High Speed communication system is being required. The Task Force team of IEEE 802.3ah set the EPON as a standard; next generation subscriber access network. For offering a high quality service, 10G EPON that is changed from 1Gbps uplink downlink bandwidth to 10Gbps is come up. Although Kramer had studied 10G EPON there was a QoS limitation, when load is low, End-to-End maximum delay is increased. This paper is suggesting time synch ronization method, resource reservation method, band width allocation method. We confirmed that 10EPON was able to offer quality service by the result of the OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.142-155
• /
• 2000

In this paper, we propose an efficient policing mechanism for Markov model-based traffic descriptors of VBR MPEG video traffic. A VBR video sequence is described by a set of traffic descriptors using a scene-basedMarkov model to the network for the effective resource allocation and accurate QoS prediction. The networkmonitors the input traffic from the source using a proposed new policing method. for policing the steady statetransition probability of scene states, we define two representative monitoring parameters (mean holding andrecurrence time) for each state. For frame level cell rate policing of each scene state, accumulated average cellrates for the frame types are compared with the model parameters. We propose an exponential bounding functionto accommodate dynanic behaviors during the transient period. Our simulation results show that the proposedpolicing mechanism for Markovian traffic descriptors monitors the sophisticated traffic such as MPEG videoeffectively and well protects network resources from the nalicious or misbehaved traffic.

• Environmental and Resource Economics Review
• /
• v.29 no.2
• /
• pp.219-246
• /
• 2020

From the Phase II (2018~2020) of K-ETS, the offset credit from 'CDM projects that domestic companies and others have carried out in foreign countries' can be used in the K-ETS. As a result, stakeholders in the K-ETS market are actively developing overseas CDM projects, such as the 'high-efficiency cook stove project'. which can secure a large amount of credits while marginal cost is relatively low. This paper develops the investment decision-making model of offset project for the 'high-efficiency cook stove project' using the real option approach. Under the uncertainty of the emission allowance price, the optimal investment threshold (p^⁎) is derived and sensitivity analysis is conducted. As a result, in the standard scenario (PoA-S), the optimal investment threshold is 29,054won/ton, which is lower than the stock price (p^⁎_spot). However, allocation entities are not only economics in the CDM project, but also CDM risk factors such as non-renewable biomass ratio, cook stove replacement ratio, equity ratio with host country, investment period and submission limitation of emission allowance. In addition, offset project developers will be able to derive the optimal investment threshold for each business stage and use it for economic feasibility checks.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.685-691
• /
• 2008

Recently with the rapid evolution of the mobile computing and communication technologies, mobile VOD service becomes increasingly important for wireless mobile users. The VOD service is being widely used in various areas of application, such as education, entertainment and business, because it provides users convenience in easily having access to video information at any time in any places. However, in reality, the mobile system has many difficulties in providing the smooth VOD service owing to frequent transfers and cutoffs of clients. The importance of a technique to transmit broadcasting is being stressed as a method for providing stabler mobile VOD service to a large number of clients. This paper is aimed at showing how to reduce demands for server bandwidth and delay of earlier service through performance analysis by suggesting an effective VOD broadcasting transmission technique through channel division in the mobile atmosphere. Many researches have been made about regular broadcasting techniques in particular. This study divides the methods used for assigning channels which have been decided by the size of segments into a group of regular channels and assistant channels using wireless gap-fillers to provide effective VOD services to a large number of clients at the mobile environment using small bandwidth resources. The regular channels transfer regular streams, while assistant channels repeatedly transfer the first segment to reduce early service delay time to receive regular streams. In this way, the study suggests a technique to reduce server bandwidth demand and early service delay time. Through the proposed technique, the server bandwidth demand could be reduced by more than 30 percent and the study continuously shows reduced early service delay time through conducting performance analysis.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.2
• /
• pp.345-354
• /
• 2005

Mobile grid can provide the grid service to grid users regardless of space and time. There are many restrictions to use grid service in mobile environment such as battery power of mobile device, movement pattern of mobile device etc. So it is difficult to apply the grid technologies of wired network to wireless network environments. Therefore, to provide the mobile grid service, we suggested the mobile grid architecture using ad-hoc network. Also we showed that hybrid routing protocol is efficient for mobile grid service by considering the battery power of mobile device and simulations of evaluating the delay time of three routing protocols using NS-2. We will study the methods of resource allocations and network reliability to provide the mobile grid service.

• Journal of the Korea Computer Graphics Society
• /
• v.14 no.1
• /
• pp.27-33
• /
• 2008

Mobile systems have relatively limited resources such as low memory, slow CPU, or low power comparing to desktop systems. In this paper, we present a new 3D mesh connectivity coding algorithm especially optimized for mobile systems(i.e., mobile phones). By using adaptive octree data structure for vertex positions, a new distance-based connectivity coding is proposed. Our algorithm uses fixed point arithmetic and minimizes dynamic memory allocation, appropriate for mobile systems. We also demonstrate test data to show the utility of our mobile 3D mesh codec.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.7
• /
• pp.304-318
• /
• 2007

Grid computing is a service that share geographically distributed computing resources through high speed network. In this paper, we propose hybrid scheduling scheme which considers not only meta-scheduling scheme to distribute the job between the nodes of grid computing system but also the job scheduling to distribute the job within the local nodes. According to the number of processors needed and expected execution time, the job with high priority is allocated to job queue while the one with low priority and remote job are allocated to backfill queue. We evaluate the proposing scheme through the various experiments and the results show that the utilization of grid computing system increases and the job slowdown decreases.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.294-298
• /
• 2010

슈퍼컴퓨터는 스케줄러를 이용하여 사용자의 작업(task) 실행 및 자원할당 요청을 관리하고, 사용자는 배치 프로세스 형태로 스케줄러에 작업을 제출한다. 스케줄러에 배치 프로세스 형태로 작업을 제출하는 방식은 사용자의 작업이 비동기적으로 수행되어 작업의 상태가 변경될 경우 확인할 수 있는 서비스를 필요로 한다. 이를 위해 대부분의 슈퍼컴퓨터는 작업이 완료되거나 오류가 발생하여 중단되었을 때 전자메일을 발송하여 사용자에게 정보를 제공하는 이벤트 알림 서비스를 제공하지만, 장기간 수행되는 작업의 경우 주기적으로 전자메일을 확인해야 하는 불편함이 있고, 다수의 작업을 동시에 수행하는 경우 각각의 이벤트 정보를 포함한 전자메일을 관리하는데 어려움이 따른다. 본 논문에서는 슈퍼컴퓨터에서 제공하는 전자메일 기반 이벤트 알림 서비스를 이용하여 이벤트를 통지받을 때 지정된 방식으로 후처리 작업이 실행될 수 있는 자동화된 후처리 시스템의 설계 및 구현 방법을 제시한다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.463-468
• /
• 2016

The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach.