• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.917-920
• /
• 2007

무선 Ad-hoc 네트워크에서는 주로 IEEE 802.11 MAC 프로토콜을 이용한다. IEEE 802.11 MAC 프로토콜은 제어 메시지인 RTS-CTS를 통해서 채널 예약을 하고 데이터를 전송하는 방식으로 모든 통신에 Omni-directional 안테나를 이용하여 전송한다. 본 논문에서는 기존 IEEE 802.11 MAC 프로토콜보다 성능을 향상시키기 위해서 directional 안테나를 이용한 MAC 프로토콜을 사용한다. Directional 안테나를 사용한 MAC 프로토콜은 IEEE 802.11 MAC 프로토콜에 비해서 Spatial Reuse를 증가함으로서 채널 자원을 더욱 효율적으로 사용하는 것이 가능하다. 또한 Directional 안테나의 사용은 안테나의 지향성에 따른 안테나 이득 및 전송 범위의 증가 그리고 전송 범위를 Omni-directional 안테나와 동일하게 적용할 경우에는 저 전력 통신이 가능하다는 장점을 가지고 있다. 그러나 Directional 안테나의 사용은 IEEE 802.11 MAC보다 좋은 성능을 갖기는 하지만 새로운 문제들이 발생한다. 이러한 문제들로는 New Hidden Terminal, Deafness, Capture, 그리고 위치 인식에 관련된 문제들이 발생한다. 본 논문에서서 위에서 언급한 Directional 안테나의 이점과 그리고 문제점에 대해서 설명하고, 이러한 문제들 중에 Deafness 문제를 완화시킬 수 있는 방법을 제안한다. 그리고 QualNet 4.0을 이용한 시뮬레이션을 통해서 제안된 프로토콜의 성능을 평가한다.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.4
• /
• pp.455-470
• /
• 2001

This paper is focused on the traffic characterization for the efficient transmission of the VBR video source in the ATM network. For the traffic characterization, low traffic monitoring technique is applied and the dynamic VBR characterization method is suggested to satisfy the delay requirement. The dynamic VBR method uses the token bucket algorithm buffering though Cumulative Constraint Function. According to the Cumulative Constraint Function, the packet initially started transferring at the peak rate and the token bucket provided proper amount of buffer for traffic after a certain period of monitoring. It also reduced the network resource bandwidth through renewal of the cumulative frame and changed the rate from the previous frame information. It requires only small amount of monitoring and causes little overhead. In addition, it lowered the complexity of Deterministic Constraint Function to 0(n) and mapped the token rate and token depth to the token bucket. This study shows less network resource consumed than the previous method, comparing and analyzing the result of simulations.

• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.415-420
• /
• 2014

Another crucial issue is a providing secondary user(SU) with the its guaranteed quality of service(QoS) in cognitive radio systems, from the SU view to be allowed to opportunistically utilize the primary user(PU) spectrum on non-interfering. In this paper, we propose a bandwidth reallocation scheme for reducing SU dropping rate through renegotiation of requested channel numbers when available bandwidth is not enough for accepting the spectrum handoff SUs. We categorize SU calls into two types : the first priority and the second priority SU, and the first SU' service is supported by bandwidth reservation based on ARMA prediction model for PU arrivals, while the second SU's bandwidth demands for spectrum handoff is to be reallocated through their renegotiation. Simulation results show that our scheme can improve SU dropping rate and system resource utilization efficiency by bandwidth reallocation.

• Journal of Advanced Navigation Technology
• /
• v.20 no.5
• /
• pp.440-445
• /
• 2016

There is a scheme where secondary users (SU) use predicted spectrum holes for primary users (PU) not to utilize for efficient utilization of the limited spectrum resources in cognitive radio networks. In this paper, we propose an adaptive call admission control framework that minimizes spectrum hopping call dropped probability (SHDP) for satisfying SU quality of service (QoS). The scheme is based on a call admission control (CAC), bandwidth prediction and adaptive bandwidth assignment. The prediction model predicts not only the number of spectrum holes, but requested bandwidth of SU spectrum hopping call, and then the CAC minimizes SHDP via an adaptive bandwidth assignment in resources not being enough for reservation. We bring Wiener prediction model to predict the resources. Simulations are conducted to compare the performance of proposed scheme with an existing, and show its ability of minimizing the SHDP.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1015-1024
• /
• 2005

A delegation of privileges is one of important processes that empower authority to relevant node to process job that user wants in large-stale distributed environment such as Grid Computing. However, existing delegation methods do not give suitable privilege about Job, and do not atomize range of delegation and exists delegation of access privilege for only resources itself that is not delegation about executing process of job itself. Also, they do not apply about process that needs delegation before and after. execution of job such as reservation of system resources or host access before and after execution. Therefore, this paper proposes a method and specification for restricted delegation in distributed environment. Proposed method separates delegation for job side and privilege side, and express specification and procedure of delegation using XML schema and UML and present restricted delegation scenario in distributed computing environment.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.5
• /
• pp.19-28
• /
• 2012

Recently a grid and cloud computing collaboration have become a social issue. These collaborative network system, the P2P system based on this system. Distingui shed from the client/server systems, P2P systems in order to exchange information, its purpose and functions are divided according to the morphological Category. In accordance with the purposes and functions of information and data retrieval, remote program control and integration services for the offers. Most P2P systems client/server scalability, and management takes the form, but to overcome the disadvantages in terms of applying the mixed-mode system is increasing. And recently the distributed computing aspects of the service to users in order to provide suitable to accommodate the diverse needs of various types of mobile agent technology is needed. In this paper, as required by the mobile agent access to a remote resource access control and agent for the execution and management capabilities and improve the reliability of the mobile agent system designed to suggest.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.101-111
• /
• 2000

Resource managing is very difficult because the multimedia data compressed by a VBR shows a bit rate change within high range, Therefore, the VOD server should use the prefetch method in order to improve system utilization, such as prefetching data in the overload period by a meta table that is the reference pattern of MPEG data which is analyzed off line. This prefetch method will not result in a failure to display at overload, however, this method can not keep a minimum loading time and low costs, because the prefetched section is being maximizes. In this paper, we suggest another method that the system utilization can be improved using the fixed prefetched section to keep loading time and costs under a constant range at overload. But this technique will result in a failure to display, due to fixed prefetched section. Rut, in this paper we suggest a drop module that drops only the B frame in the GOP, consistently distributes a lower drop in media quality for the user.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2010

VoD(Video-on-Demand) servers have to provide timely processing guarantees for continuous media and reduce the storage and bandwidth requirements for continuous media. The compression techniques make the bit rates of compressed video data significantly variable from frame to frame. A VoD system should be able to provide the client with interactive operations such as fast forward and fast rewind in addition to normal playback of movie. However, interactive operations require additional resources such as storage space, disk bandwidth, memory and network bandwidth. In a stored video application such as VoD system, it is possible that a priori disk access patterns can be used to reserve the system resources in advance. In addition, clients of VoD server spend most of their time in playback mode and the period of time spent in interactive mode is relatively small. In this paper, I present the new buffer management scheme that provides efficient support for interactive operations in a VoD server using variable bit rate continuous media. Simulation results show that our strategy achieves 34% increase of the number of accepted clients over the LRU strategy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

• Information and Communications Magazine
• /
• v.15 no.11
• /
• pp.124-142
• /
• 1998

ETSI BRAN (Broadband Radio Access Network)는 고속 무선 LAN 또는 고정 광대역 무선액세스 네트워크에서의 무선 접촉 계층과 ATM 및 IP(Internet Protocol) 코어 네트워크와의 연동을 위한 일부 기능을 표준화하기 위한 과제이다. 특히, BRAN의 HIPERLAN type-2(HIPERLAN/2)의 경우에는 과제의 범위는 무선 접속면, 무선 부시스템에서의 서비스 인터페이스, 서비스 구현에서 요구되는 연동 및 각종 지원 기능을 표준화하며, 무선 접속면의 경우에는 다수 벤더간의 상호 호환성을 제공할 수 있는 인터페이스를 구현하는 것이다. HIPERLAN/2의 기술 규격은 코어 네트워크와 독립적인 물리계층 및 데이터 링크 제어 (DATA Link Control: DLC) 계층과 서로 상이한 코어 네트워크와의 연동을 위한 네트워크 수렴 부계층을 다루게 될 것이며, 초기 단계에서는 ATM과 IP 코어 네트워크와의 연동 기능을 제시하게 될 것이다. 따라서 HIPERLAN/2기반의 시스템 규격을 제시하기 위해서는 네트워크 계층 및 기타 상위 계층에 대한 규격이 요규되며, 이는 ATM Forum에서의 무선 ATM 신호 방식 규격, IETF(Internet Engineering Task Force)의 IP규격, 그리고 ETSI의 SMG (Special Mobile Group) 프로젝트에서 표준화되고 있는 UMTS (Universal Mobile Telecommunication Service) 규격 등과 접목될 것이다. 결과적으로 무선 ATM 관점에서는 완전한 시스템 규격 작성은 ETSI BRAN과 ATM Forum에서 무선 접속 규격과 이동성 관리 및 신호 방식으로 각각 이원화되어 진행되고 있다. 현재 물리 계층에서의 전송 방식은 OFDM(Orthogonal Frequency Division Multiplexing)으로 확정되었으며, DLC 계층에서는 고정 길이의 TDD (Time Division Duplexing) TDMA 프레임 구조를 기반으로 AP (Access Point)에 의해 동적으로 상향 링크 자원을 예약 할당하는 매체 접근 제어 (Medium Access Control: MAC) 프로토콜이 고려되고 있다. 이와 같은 DLC 계층에서는 기본적으로 짧은 길이의 패킷을 통해 다양한 대역폭의 멀티미디어 트래픽을 효율적으로 수용하면서 ATM 네트워크뿐만 아니라 향후 IP 네트워크에서 요구하는 각 서비스별 QoS (Quality of Service)를 개별적으로 보장할 수 있는 기능을 구현하고자 한다. 향후 이 부문에 대한 표준화가 본격적으로 진행될 것으로 예상되며 HIPERLAN/2의 경우에는 1999년 중반까지 1차 기능 규격을 완료할 예정이며, BRAN 전반에 대한 완전한 규격을 2002년까지 완성하는 것을 목표로 하고 있다.