• Journal of Convergence Society for SMB
• /
• v.6 no.4
• /
• pp.17-23
• /
• 2016

With the advance of ICT, the Internet has been creating new services in various fields. However, due to the architectural problem of the Internet, it may inhibit the development of network architectures and various services. Network virtualization is being investigated as an alternative to overcome the architectural problem of the Internet and a virtual network resource allocation algorithm is a very important issue. In this paper, we propose a multiple path resource allocation algorithm with shared backup bandwidth in order to overcome single link failure. It will be improved survivability of the virtual networks. Through our experiments, we confirmed that the multi-path creation time of the proposed algorithm has about 50% performance improvement than previous works.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.181-187
• /
• 2020

In this paper, we proposed a register allocation algorithm and resource allocation algorithm in the high level synthesis process for the SoC design synthesis system of high performance vehicles We have analyzed to the operator characteristics and structure of datapath in the most important high-level synthesis. We also introduced the concept of virtual operator for the scheduling of multi-cycle operations. Thus, we demonstrated the complexity to implement a multi-cycle operation of the operator, regardless of the type of operation that can be applied for commonly use in the resources allocation algorithm. The algorithm assigns the functional operators so that the number of connecting signal lines which are repeatedly used between the operators would be minimum. This algorithm provides regional graphs with priority depending on connected structure when the registers are allocated. The registers with connecting structure are allocated to the maximum cluster which is generated by the minimum cluster partition algorithm. Also, it minimize the connecting structure by removing the duplicate inputs for the multiplexor in connecting structure and arranging the inputs for the multiplexor which is connected to the operators. In order to evaluate the scheduling performance of the described algorithm, we demonstrate the utility of the proposed algorithm by executing scheduling on the fifth digital wave filter, a standard bench mark model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1001-1008
• /
• 2010

In this paper, we propose the dynamic spectrum allocation (DSA) algorithm using spectrum sharing method considering the long-term priority between NOs and service classes for the maritime communication system environment where a ship locates at either near shore (or land) or off-shore. It was shown that the proposed algorithm using spectrum sharing with priorities could deliver better satisfaction ratio (SR) than the fixed allocation schemes, in the context of provision of required bandwidth (or spectrum) for each users. Therefore, we conclude that the proposed DSA with priorities could apply to the maritime communication environment and exploit the under-used (or unused, idle) spectrum of terrestrial communication networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.631-633
• /
• 2003

인터넷 가반 분산/병렬 처리 프레임 워크 PDP(Parallel/Distributed Processing Scheme on Web)는 네트워크 내 유휴 상태 호스트들을 활용하여 대용량 작업을 병렬로 처리한다. 본 논문에서는 이러한 서브 작업을 할당받는 자원이 동작하는 네트워크 환경을 모니터링 함으로써 수시로 변화하는 네트워크 환경에 대처하는 방안을 제시한다. 특히 네트워크 환경 모니터링 예측 결과를 PDP의 작업 할당 알고리즘에 적용하여 네트워크 과부하 및 결함 등으로 인해 발생되는 작업 지연 요소에 적응적 대처함으로써 전체 작업 수행 처리율 향상을 도모하는 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.148-150
• /
• 2003

본 논문에서는 인터넷 종단 호스트에서 공유 자원의 대역폭 제약조건과 종료시한 제악조건 모두를 만족시킬 수 있는 자원 할당 구조를 제안한다. 제안된 구조는 두 단계로 구성된다. 상위 단계에서는 비례 분배 스케줄러(proportional share scheduler)인 EFT-C/D (Earliest Finish Time Credit/Debit) 스케줄러가 수행된다. 이 스케줄러는 CPU와 같은 시분할 공유 자원을 하위 단계 스케줄러들에게 지정된 비율로 분배하는 역할을 한다. 그리고 하위 단계에서는 서로 다른 시간 제약조건이 부여된 태스크들을 스케줄링 하기위해 다양한 실시간 스케줄러가 수행된다. 본 연구의 주요 성과는 두 가지로 요약된다. 첫째, 이상적인 GPS (Generalized Processor Sharing) 서버와 거의 동등한 수준으로 자원을 공평하게 분배하는 EFT-C/D 알고리즘을 개발하였다. 둘째, 하위 단계에서 수행되는 EDF 스케줄러에 대해 이용율(utilization)에 기반한 스케룰링 가능성 분석 방법을 개발하였다. 이 방법은 주어진 태스크 집합에 대해 단순히 이용율만을 계산하여 스케줄링 가능성을 판별할 수 있다. 따라서 새로운 태스크가 생성될 때 수락 여부를 시스템 수행 중에 제어할 수 있는 장점이 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.370-379
• /
• 2014

Recently, the interest in optical network with multifiber link is continuing to rise since the network traffic has been growing exponentially. However, growing traffic in network leads to increasing the energy consumption of the network equipment. In this paper, we propose a dynamic routing and wavelength assignment (RWA) algorithm based on V-like cost function and layered graph to improve energy efficiency in IP over WDM network with multifiber link. The V-like cost function is used to decide the fiber cost according to the number of used wavelengths. The layered graph with multifiber link is used to select the energy efficient route and wavelength. The proposed RWA algorithm is compared and analyzed with conventional algorithm in view of average power consumption and blocking probability through OPNET modeler.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.1-7
• /
• 2002

Since multimedia data such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms could not be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm is a scheduling algorithm considered the time constraint of the multimedia data. This scheduling algorithm uses a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and the reduction in the number of context switching. Furthermore, a new evaluation method is proposed which can evaluate the flexibility of scheduling algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.1-7
• /
• 2020

In modern society, as technology has advanced and human life area has expanded, there has been an increasing demand for high-quality voice and video communications services without restrictions on time and place. In response to this demand, satellite communications systems that provide a wide range of communications and that offer multiple access are evolving day by day. In satellite communications systems such as Digital Video Broadcasting - Return Channel Via Satellite (DVB-RCS) and Warfighter Information Network-Tactical (WIN-T), the multi-frequency time division multiple access (MF-TDMA) demand assigned multiple access (DAMA) scheme is used for efficient resource allocation. In this scheme, since the satellite terminals periodically request resources from the network controller, and the network controller dynamically allocates resources, it is necessary to arrange resource allocation information from time to time. Shortening of the alignment time is a more important factor in a satellite communications system in which a long transmission delay occurs due to long-distance transmission and reception. In this paper, we propose a sorting algorithm variable-selection scheme that shortens the sorting time by cross-selecting the sorting algorithm based on a threshold value, while setting the number of frames in the MF-TDMA DAMA satellite communications system as the threshold value.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.769-772
• /
• 2012

가상화 환경은 한 대의 서버에 여러 개의 가상 머신을 생성하여 독립적인 운영체제를 실행시킨다. 이러한 서버는 가상 머신에 서버의 자원을 할당하여 작업을 처리하고, 작업의 증가로 인해 가상 머신의 자원이 부족하게 되면 서버의 자원을 재할당 한다. 그러나 서버 자원의 확장이 어려운 경우 과부하 상태가 되어 가상 머신의 자원 부족을 해결할 수 없다. 또한 가상 머신을 다른 서버에 재배치 시킴으로써 서버의 과부하 문제를 해결하고자 하였으나, 서버 선정 과정이 단순하여 유휴자원을 확보하기가 어렵다. 따라서 본 논문에서는 가상 머신을 재배치시키는 기법을 제안한다. 또한 기존 재배치 알고리즘과 제안한 알고리즘에 대한 성능평가를 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.50-52
• /
• 2017

클라우드 컴퓨팅 시장의 지속적 성장과 가상화의 인기로 세계적 VDI 시장은 꾸준한 성장률을 보이고 있다. 또한 의료, 교육, 금융 등의 폭넓은 분야에서 VDI 서비스가 활용될 전망이다. 하지만 기존 VDI 서비스는 고정적인 자원 할당으로 사용자 워크로드 맞춤형 자원이 제공되지 못하는 문제점이 있다. 따라서 본 논문에서는 기존 VDI에 비해 실행속도가 빠른 컨테이너의 장점을 살려 VDI를 컨테이너화 하고, 사용자 워크로드 맞춤형으로 자원을 분배하기 위해 VDI 컨테이너 자원 사용량 데이터로 K-means 알고리즘을 통한 군집 분석 기반의 워크로드 분류 방법을 제시하였다.