• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.312-316
• /
• 2010

In this paper, we propose a game theoretic channel sharing model that allocates resources of a base station between MNO(Mobile Network Operator) and MVNO(Mobile Virtual Network Operator) in a fair and efficient manner. Considering the input traffic loads of MNO and MVNO, the proposed model uses the bargaining game theory to allocate channel resources between MNO and MNVO. When the input loads of the carriers are asymmetric, the proposed model increases the resource utilization by allocating more channel resources to the operator with high input load. In addition, the proposed model prevents the quality of service of an operator from degrading even if the input load of the other operators increases excessively.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1367-1374
• /
• 2004

For sharing XML data by many users, a way of concurrency and access control is required for isolating update actions such as inserting and deleting subtrees. Exisiting locking mechanisms as 2PL or MGL suffer low concurrency when applied to tree structures. In this paper, list data subtrees model is proposed based on the semantics expressed in DTD. In this model, tree updating actions such as inserting and deleting subtrees are considered only for the repetitive parts of XML trees. The proposed model guarantees that the result XML tree after applying a tree updating action is always valid, even when multiple users access the tree at the same time. Also, a new locking mechanism called list lock-ing protocol is proposed. The new locking protocol is expected to show better accessility with less number of locking objects compared to the Helmer's OO2PL model. Since update actions on a shared XML tree usually applied to the repetitive parts of the tree, the proposed model is expected to provide a useful way for efficient data sharing when combined with previous locking methods on terminal node data.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 1998.10a
• /
• pp.137-144
• /
• 1998

데이터베이스 공유 시스템에서는 동일한 페이지가 여러 처리노드에 의해 동시에 캐싱 될 수 있으므로, 각 처리노드가 항상 최신의 내용을 참조하기 위해서는 캐싱 된 데이 터의 일관성이 유지되어야 한다. 본 논문에서는 로킹 오버헤드를 줄이기 위해 주사본 권한 을 이용하여 데이터베이스를 논리적으로 분할한 데이터베이스 공유 시스템 환경에서 필요한 캐쉬 일관성 기법들을 제안한다. 제안한 기법들인 DPCA_P와 DPCA_U는 PCA를 동적으로 할당하여 캐쉬 일관성을 위해 소요되는 메시지 전송량과 디스크 입출력 오버헤드를 줄임으 로써 성능을 향상시키며, 데이터베이스 부하가 동적으로 변하는 경우에도 효율적으로 동작 한다는 장점을 갖는다.

• Proceedings of the KIPE Conference
• /
• 2008.06a
• /
• pp.61-63
• /
• 2008

본 논문에서는 새로운 부스트 하프브릿지 컨버터를 제안하고 그 정상상태 해석결과를 보고한 것이다. 특히 부스트 하프브릿지 컨버터의 기본형과 한 개의 코어를 사용하여 인덕터를 공유 결합 시킨 인덕터 공유결합형 부스트 하프브릿지 컨버터를 동시에 제안하였다. 제안된 컨버터는 반도체 스위치와 주요 소자를 이상적으로 가정하여 내부손실을 무시한 등가회로를 유도하였고 등가회로로부터 스위치의 상태에 따른 상태별 등가회로로부터 주요 소자에 대한 특성식을 나타내었고 최종적으로는 컨버터의 정상상태 특성식을 유도하였으며 특성의 타당성을 확인하기 위해서 회로 시뮬레이션을 수행하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.6
• /
• pp.256-262
• /
• 2017

This study examined the peer and gender effects in knowledge-sharing behavior. More specifically, this paper examined how coworker social loafing is related to knowledge sharing and how gender differences moderate the relationship between coworker social loafing and knowledge-sharing behavior. Drawing on economic and social exchange theory, this study predicts that coworker social loafing will decrease the knowledge-sharing behavior. In addition, this paper hypothesized that men will be more likely to withdraw knowledge-sharing behavior than women when they faced coworker social loafing. To test these hypotheses, this paper conducted a hierarchical regression test with the supervisor-employee dyad samples. The empirical results showed that in the relationship between coworker social loafing and knowledge-sharing behavior, coworker social loafing decreased the knowledge-sharing behavior, and the negative effect was larger in the case of men rather than women. In the discussion section, this paper proposes the theoretical and practical implications based on theoretical arguments and empirical findings.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.51-58
• /
• 2007

The shared-nothing multiprocessor architecture has advantages in scalability, this architecture has been adopted in many multiprocessor database system. But, if the data are not uniformly distributed across the processors, load will be unbalanced. Therefore, the whole system performance will deteriorate. This is the data skew problem, which usually occurs in processing parallel hash join. Balancing the load before performing join will resolve this problem efficiently and the whole system performance can be improved. In this paper, we will present an algorithm using merit of very large memory to reduce disk access overhead in performing load balancing and to efficiently solve the data skew problem. Also, we will present analytical model of our new algorithm and present the result of some performance study we made comparing our algorithm with the other algorithms in handling data skew.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.497-498
• /
• 2009

본 논문에서는 YouFree에서 콘텐츠 관리 시스템을 기반으로 한 콘텐츠 공유 시스템을 제안한다. 이 시스템은 YouFree Basic의 개인용 서버를 이용하므로 손쉽게 P2P 기반의 콘텐츠 공유를 지원할 수 있으며, 모든 Basic이 Center 에 연결되어 ID를 가지므로 이를 이용해서 접근 제어 메커니즘을 제공한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.322-324
• /
• 2001

분산 환경에서 여러 호스트들간의 자료를 공유하는 것은 네트워크에 부하를 줄이고 가용도를 높일 수 있지만 복제된 공유 자료들의 일치성을 유지하는 것이 필요하다. 전통적으로 분산된 공유자료의 일치성을 위해서 무효화방식(invalidate protocol), 갱신방식(update protocol) 그리고 이주방식(migratory protocol)등이 사용되었다. 분산 환경뿐만 아니라 이동컴퓨팅 환경에서도 분산된 호스트들간에 공유자료의 일치성을 유지하기 위해서 적절한 프로토콜을 선택하는 것은 중요하다. 본 논문에서는 이동 컴퓨팅 환경에 효과적으로 적용 할 수 있는 공유자료의 일치성 유지하기 위한 프로토콜을 제안하고 성능 분석을 하였다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.3
• /
• pp.136-142
• /
• 2006

Existing buffer management schemes for shared-memory output queueing switches can be classified into two types: In the first type, some constant amount of memory space is guaranteed to each virtual queue using static queue thresholds. The static threshold method (ST) belongs to this type. On the other hand, the second type of approach tries to maximize the buffer utilization in 머 locating buffer memories. The complete sharing (CS) method is classified into this type. In the case of CS, it is very hard to protect regular traffic from mis-behaving traffic flows while in the case of ST the thresholds can not be adjusted according to varying traffic conditions. In this paper, we propose a new buffer management method called weighted dynamic thresholds (WDT) which can process packet flows based on loss priorities for quality-of-service (QoS) functionalities with fairly high memory utilization factors. We verified the performance of the proposed scheme through computer simulations.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.264-271
• /
• 2004

A load-sharing algorithm must deal with load imbalance caused by characteristics of a network and heterogeneity of nodes in Internet-based clustering systems. This paper has proposed the Efficient Load-Sharing algorithm. Efficient-Load-Sharing algorithm creates a scheduler based on the WF(Weighted Factoring) algorithm and then allocates tasks by an adaptive granularity strategy and the refined fixed granularity algorithm for better performance. In this paper, adaptive granularity strategy is that master node allocates tasks of relatively slower node to faster node and refined fixed granularity algorithm is to overlap between the time spent by slave nodes on computation and the time spent for network communication. For the simulation, the matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 75%, 79% and 17%, respectively.