• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.595-612
• /
• 2002

One of the most important issues in guaranteeing the high degree of QoS on mobile computing is how to reduce hand-off drops caused by lack of available bandwidth in a new cell. Each cell can request bandwidth reservation to its adjacent cells for hand-off calls. This reserved bandwidth can be used only for hand-offs, not for new calls. It is also important to determine how much of bandwidth should be reserved for hand-off calls because reserving too much would increase the probability of a new call being blocked. Therefore, it is essential to develop a new mechanism to provide QoS guarantee on a mobile computing environment by reserving an appropriate amount of bandwidth and call admission control. In this paper. bandwidth reservation and call admission control mechanisms are proposed to guarantee a consistent QoS for multimedia traffics on a mobile computing environment. For an appropriate bandwidth reservation, we propose an adaptive bandwidth reservation mechanism based on an MPP and a 2-tier cell structure. The former is used to predict a next move of the client while the latter to apply our mechanism only to the client with a high hand-off probability. We also propose a call admission control that performs call admission test only on PNC(Predicted Next Cell) of a client and its current cell. In order to minimize a waste of bandwidth caused by an erroneous prediction of client's location, we utilize a common pool and QoS adaptation scheme. In order evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT2, FR-CAT2, and AR-CAT2.

• Journal of Environmental Policy
• /
• v.14 no.1
• /
• pp.53-83
• /
• 2015

Recently, climate change risk assessment has been discussed as a medium process for making climate change adaptation policies in the research field of climate change adaptation. Climate change risk assessment has been understood to have an intermediary role among impact assessment, vulnerable assessment and policy, and is used in the process of devising adaptation policies in the United Kingdom (UK). This paper quantitatively assessed the risks of climate change in Korea, applied the methods used in the UK, underwent the classification process and suggested implications of Korean adaptation policies. A survey of experts, based on Delphi's method and the classification criterion developed by Klinke and Renn(2002), was also carried out. A list of climate risks was created from the climate change impact and vulnerability assessment report of Korea, first national adaptation policy of Korea, and general climate risks of the UK. From the results, 42 risks out of total 125 risks were selected based on their importance. The assessed risks with factors, such as high impact and urgency, are related to repeated and large scale damage from storms and floods caused by abnormal or extreme weather events. Ecological changes and social infrastructure risks were engaged as required as a policy response for medium to longer term. As for making the classification, types of climate risks were suggested to manage the basic capacity in relation to social trust, triggering mechanism and responsibility. Following suggestions are put forward as the base of autonomous adaptation: increasing the capacity of civil society, mutual trust and civil participation in adaptation policy process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.928-936
• /
• 2004

This paper proposes simple and effective Contention Window (CW) adjusting algorithm to solve the fairness problem of the IEEE 802.11 under the Distributed Coordination Function (DCF). This adjusting algorithm can support variable packet length as well as both RTS/CTS access method and hidden nodes. Simulation results show that fairness problem can be very severe in the original MAC protocol of the wireless network. In case of implement our algorithm, fair sharing was enlarged prominently and the fairness sharing was improved about maximum 30%.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.5
• /
• pp.80-87
• /
• 2003

Network reconfiguration in distribution systems is realized by changing the status of sectiona1izing switches, and is usually done for loss minimization or load balancing in the system This parer presents an approach for loss minization in distribution systems using reactive tabu search. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. Reactive tabu search can give convergence property by using reaction and escape mechanism. Therefore, it can find global optimal solution regardless of initial system configuration. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the 32 bus system models.

• Annual Conference of KIPS
• /
• 2000.10b
• /
• pp.1609-1612
• /
• 2000

무선망에서 기존의 회선 서비스뿐만 아니라 패킷 서비스 및 영상 서비스 등을 수용하는 데 있어서 고려되어야 할 것들 중 하나는 무선 자원의 활용이다. 특히 패킷 서비스의 경우 가변적인 패킷의 길이와 양으로 효율적인 무선 자원관리를 어렵게 하는 요소를 지니고 있다. 즉, 무선 자원을 효율적으로 운용하기 위해서는 동적인 무선 자원할당 메커니즘이 중요한 역할을 한다. UMTS 표준 문서에서는 계층 2 전송 프로토콜인 RLC (Radio Link Control) 버퍼의 양만을 측정하여 무선 자원 할당이 제어가 되도록 권고하고 있다. 하지만 트래픽 양의 변화가 큰 VBR 트래픽의 경우, 이와 같은 방법은 갑자기 증가하거나 감소하는 트래픽 양에 적응하기 힘들고 이는 무선 자원의 효율성을 저하시키며, QoS 제공도 어렵다. 본 논문에서는 먼저 트래픽 특성을 알 수 있는 토큰 버켓 모델을 RLC에 적용하고, 동적 무선 자원 할당을 위해 RLC 버퍼의 양뿐만 아니라 예상되는 유입 트래픽 양을 측정 및 보고하는 메커니즘을 제안한다.

• Annual Conference of KIPS
• /
• 2001.04a
• /
• pp.479-482
• /
• 2001

인터넷에서 이질적인 QoS(Quality of Service)를 보장하기 위한 현재까지의 연구는 크게 망 차원에서의 자원 예약방법과 계층적 멀티캐스트를 이용한 적응 방법으로 구분된다. 첫번째 방법의 경우 RSVP(resource ReSerVation Protocol) 시그널링을 사용하므로 정량적인 QoS 보장은 가능하나 각 라우터에서 각 세션 플로우 상태 정보를 유지해야 하는 확장성 문제점이 있다. 두번째 방법의 경우 계층적 인코딩을 사용하여 응용 플로우를 여러 계층의 서브스트림으로 분리하고 각각을 멀티캐스트 채널을 통하여 전송한다. 그러나 이 메커니즘은 라우터가 각 계층간의 중요도를 인식할 수 없을 뿐만 아니라 멀티 캐스트 그룹 관리와 주소 할당 문제에 있어서 복잡성을 가진다. 본 논문에서는 제안된 메커니즘들의 문제점을 해결하고자 계층적 인코딩에 의해 생성된 스트림들간의 차별화를 통해 라우터에서 대역폭이 부족한 수신자에게는 기본적인 품질의 스트림만을 제공하는 반면에 대역폭이 충분한 수신자에게는 최상의 품질을 제공할 수 있는 이질적 QoS 방안을 제안한다.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.741-744
• /
• 2007

데스크탑 그리드 시스템에서 각 자원에서 수행한 작업 결과에 대한 정확성 검증은 중요한 문제이다. 작업 결과에 대한 정확성을 보장하기 위해서 결과 검증 기법으로 투표기반 기법이나 신뢰기반 기법이 사용되어 왔다. 그러나 이러한 기법들은 동적인 연산 환경에 효과적으로 대처하지 못하여 낮은 확장성과 높은 연산 지연을 초래할 수 있는 단점을 갖고 있다. 이러한 단점을 해결하고자 본 논문에서는 자원제공자에 의해 초래될 수 있는 잘못된 연산 결과에 대해 각 자원제공자의 신용도(credibility)를 동적으로 평가하여 연산 결과의 정확성을 판단하는 적응적 결과 검증 메커니즘(Adaptive Result Verification Mechanism: ARVM)을 제안한다. 또한, 제안하는 ARVM 은 자원제공자의 가용성(availability) 정보를 이용하여 결과 검증 시에 요구되는 연산 지연을 최소화한다.

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.1-14
• /
• 2011

This paper analyzes the fairness and efficiency of channel sharing when heterogeneous wireless networks that have different transmission power and/or coverage coexist with the contention-based channel access protocol. First, we show that the existing CSMA (carrier sensing multiple access) protocol, that is a prevailing contention-based mechanism, results in significant unfairness of channel access because of (1) the asymmetric capability of carrier sensing and (2) the blindness of binary exponential backoff and link adaptation mechanisms to the interference-driven transmission failures. Next, we derive the feasible region of carrier sensing thresholds that assures spatial reuse and fair channel sharing simultaneously. Moreover, we establish an analytical model for per-system throughput and investigate the effect of contention window size and transmission rate on the fairness and efficiency of channel sharing. Finally, we compare the performance of several approaches for fair channel sharing via simulations under various network configurations.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2497-2504
• /
• 2000

This paper is aimed at defining items of fault, and then constructing rules of fault diagnosis and recovery using INBANCA technology for the purpose of managing the weh server. The fault items of web server consist of the process fault, server overload, network interface fault, configuration and performance fault. Based on these items, the actual fault management is carried out fault referencing. In order to reference the fault, we have formulated the system-level fault diagnosis production rule and the service-level fault diagnosis rule, conjunction with translating management knowledge into active network. Also, adaptive recovery mechanism of web server is applied to defining recovery rule and constructing case library for case-based web server fault recovery. Finally, through the experiment, fault environment and applicability of each proposed production rule and recovering scheme are presented to verify justification of proposed diagnosis rules and recovery mechanism for fault management. An intelligent case-based fault management scheme proposed in this paper can minimize an effort of web master to remove fault incurred web administration and operation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.1
• /
• pp.143-156
• /
• 2024

Federated Learning (FL) has emerged as a potent methodology for decentralized model training across multiple collaborators, eliminating the need for data sharing. Although FL is lauded for its capacity to preserve data privacy, it is not impervious to various types of privacy attacks. Differential Privacy (DP), recognized as the golden standard in privacy-preservation techniques, is widely employed to counteract these vulnerabilities. This paper makes a specific contribution by applying an existing, task-specific adaptive DP mechanism to the FL environment. Our comprehensive analysis evaluates the impact of this mechanism on the performance of a shared global model, with particular attention to varying data distribution and partitioning schemes. This study deepens the understanding of the complex interplay between privacy and utility in FL, providing a validated methodology for securing data without compromising performance.