• 전자공학회논문지 IE
• /
• v.45 no.3
• /
• pp.50-55
• /
• 2008

In CDMA system, the number of mobile stations which can be served simultaneously in a base station is limited by the amount of total interference received. Considering the facts, the call admission control method using the effective bandwidth concept is employed in this paper. The bandwidth for a new call and a handoff call is allocated by considering the number of mobile station being served and dynamically assigned by taking account of the blocking rate of new calls and the dropping rate of handoff calls. Also, there is reserved resource for handoff call. We analyze the performance of system according to reserved resource by a simulation study. The more a resource reserved, the less it is the dropping rate of handoff.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.84-90
• /
• 2000

This paper presents a design of an access control mechanism that can resolves the complicated problems of access control requirements in internet environment. In this paper, we proposed an access control mechanism which can satisfy the combined goals of confidentiality integrity and availability of any resource. We defined an access control mechanism from the viewpoints of identity-based, rule-based and role-based policy and implemented 6 access control operations. The Proposed access control mechanism can protect resources from unauthorized accesses based on the multi-level security policies of security label, integrity level, role and ownership.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.64-71
• /
• 1999

본 논문에서는 공중 광역 ATM망 환경에서 비연결형 서비스 제공에 사용되는 CLS에 적용될 수 있는 홉 카운터를 이용한 우선 순위 제어 알고리즘(Priority Control Algorithm using Hop-Count : HC-PC)의 망 자원 손실 비용을 분석하였다. 분석을 통해 우선 순위가 없을 경우 (No Priority Controls Algorithm: NO-Pc) 의 평균 셀 손실률이 HC-PC 의 평균 셀 손실률의 가중 평균보다 크거나 같은 경우 항상 NO-PC 이 평균 망 자원 손실 비용이 HC-PC 의 평균 망 자원 손실 비용에 비해 크다는 사실을 보였다. 시뮬레이션 결과는 분석에 의해 찾아진 조건이 만족됨을 보여주며 HC-PC가 NO-PC에 비해 어떠한 환경에서든지 항상 낮은 평균 망 자원 손실 비용을 가짐을 보여 준다.

• Proceedings of the Korean Institute of Resources Recycling Conference
• /
• 2001.05a
• /
• pp.490-493
• /
• 2001

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.487-492
• /
• 2003

To satisfy the requirements for QoS of Users using multimedia content stream service, it is required to control mechanism for QoS based on class priority, URFA classifies the user by two classes (super class, base class) and controls the admission ratio of user's requests by user's class information. URFA increases the admission ratio class and utilization ratio of stream server resources.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.359-367
• /
• 2005

This paper presents a scheduling approach for synthesizing pipelined datapaths under resource constraints. The proposed approach evaluates whether or not a scheduling solution can exist in case an operation temporarily is assigned to the earliest or latest control step among the assignable steps for the operation. If a solution cannot be found, it is impossible to assign the operation to that control step due to a violation against resource constraints, and so we can eliminate that control step among candidate assignable control steps. The proposed algorithm builds up a schedule based on gradual mobility reduction and finds a solution that yields high performance by evaluating on the impact on register assignment. Experiments on benchmarks show that this approach gains a considerable improvement over previous approaches.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1609-1612
• /
• 2000

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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.233-242
• /
• 2009

The security of medical information need continued research about steady and flexible security model because of privacy of patient's as well as directly relation in the patient's life. In particular, u-healthcare environment is need flexible and detailed access control by variety changes of context. Control model analyzed relation of resource and authority, and analyzed authority about all accessible resource from access point using K2BASE. The context-based access control model can change flexibly authority change and role, and can obtain resource of authority granted and meaningly connected resource. As a result, this thesis can apply flexible and adaptive access control model at u-healthcare domain which context change various.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.3
• /
• pp.35-40
• /
• 2010

In this paper, we propose a hardware resource sharable camera control processor (CCP) for low-cost and low-power camera cell phones. The main idea behind the proposed architecture is that adds direct access paths in the CCP to share its hardware resources so that the baseband processor expands its capabilities and boosts its performance by utilizing CCF's hardware resources. In addition, we applied a module grain dock-gating method to reduce power dissipation. Hence, the CCP can realize low-power and low-cost camera cell phones with greater hardware efficiency. This chip was fabricated in a 0.18um CMOS process with an active area of $3.8mm\;{\times}\;3.8mm$.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1994.11a
• /
• pp.245-254
• /
• 1994

본 논문은 네트워크에서 불법적 사용자에 의한 정보의 보호를 위해, 강제적 액세스제어 정책(MAC)과 임의적 액세스 제어 정책(DAC)에 기초하여 네트워크에서의 액세스 제어 정책을 수립하고 이를 UNIX하에서 액세스 제어 리스트(ACL)와 보안 레이블에 기초하여 수행될 수 있도록 설계하고 구현하였다.