• Title/Summary/Keyword: 우선순위 할당

Search Result 200, Processing Time 0.024 seconds

Dynamic Spectrum Allocation Algorithm for Maritime Communications using Spectrum Sharing and Priority (해상무선통신환경에서 스펙트럼 공유와 우선순위를 적용한 동적스펙트럼할당 알고리즘 기술연구)

  • Lim, Moo-Sung;Kim, Kyung-Sung;Lee, Yeon-Woo;Lee, Seong-Ro
    • 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.

A Design of Bandwidth Allocation Scheme with Priority Consideration for Upstream Channel of Ethernet PON (Ethernet PON에서 서비스 클래스별 우선 순위를 고려한 상향 채널 대역 할당 기법)

  • 이호숙;유태환;문지현;이형호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11A
    • /
    • pp.859-866
    • /
    • 2003
  • In this paper, we designed the bandwidth allocation scheme with priority consideration for upstream channel access of EthernetPON. The objective of our scheme is to control the multi services in more effective way according to their CoS(Class of Service) or QoS(Quality of Service). The designed scheme considers transmission priority in the both side of OLT and ONU. In the OLT's view, the Two-step scheduling algorithm is applied with which we can support multiple bandwidth allocation policies simultaneously, i.e. SBA for the time-sensitive, constant rate transmission services and DBA for the best-effort services. This Two-step scheduling algorithm reduces the scheduling complexity by separating the process of transmission start time decision from the process of grant generation. In the ONU's view, the proposed scheme controls 8 priority queues of the 802.1d recommended 8 service classes. Higher priority queue is serviced in prior during the allowed GATE time from OLT. The OPNET modeling and simulation result compares the performance of each bandwidth allocation policy with SBA or DBA only approach.

Frequency Allocation Mechanism for Device-to-Device (D2D) Communication in the L TE-Advanced Networks (LTE-Advanced 망에서 디바이스간 직접통신울 위한 주파수 할당 메커니즘)

  • Lee, Jong-Min;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06d
    • /
    • pp.219-220
    • /
    • 2011
  • 본 논문은 LTE-Advanced 망에서의 D2D(Device-to-Device) 통신을 효율적으로 하기 위한 주파수 할당 절차를 소개하고 그 메커니즘을 제안하였다. 제안한 메커니즘은 기지국에서 셀 내 주파수의 상태에 따라 주파수에 우선순위를 적용한 뒤, 높은 우선순위를 가지는 주파수를 D2D 통신에 할당한다. 성능평가에서는 D2D 통신, 주파수 할당 메커니즘을 적용하지 않은 D2D 통신, 주파수 할당 메커니즘을 적용한 D2D 통신의 처리량을 비교하여 제안한 메커니즘의 우수성을 증명하였다.

Multi-Channel Scheduling for On-Demand Data Broadcasting (주문형 데이터 방송을 위한 멀티채널 스케줄링)

  • Park, Jae-Hyeong;Park, Mee-Hwa;Lee, Yong-Kyu
    • Annual Conference of KIPS
    • /
    • 2008.05a
    • /
    • pp.219-222
    • /
    • 2008
  • 본 논문에서는 주문형 데이터 방송 환경에서 다양한 정보를 요청하는 클라이언트에게 원하는 정보를 보다 빠르게 제공하며, 우수 사용자 그룹이 일반 사용자 그룹보다 신속하게 서비스를 제공받을 수 있도록 하는 멀티채널 스케줄링 알고리즘을 제시하였다. 제안하는 스케줄링 방법은 클라이언트의 요청데이터를 요청 빈도와 클라이언트의 우선순위에 따라 등급별 큐에 적재하고 채널 할당 알고리즘에 따라 채널을 할당한 후 주기적으로 방송하는 것이다. 우선순위 큐를 이용함으로써 일반 클라이언트 그룹과 우선순위 클라이언트 그룹에 대한 차별화된 서비스를 제공할 수 있었으며, 동적인 채널 할당 비율실험을 통해 각 사용자 그룹에 대한 평균 접근 시간의 변화를 비교 분석할 수 있었다.

A Novel Processor Allocation Policy for List Scheduling in Distributed Heterogeneous Computing System (분산 이기종 시스템에서 리스트 스케줄링 알고리즘을 위한 새로운 프로세서 할당 정책)

  • Yoon, Wan-Oh;Song, In-Seong;Yoon, Jun-Chol;Choi, Sang-Bang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.2
    • /
    • pp.76-89
    • /
    • 2010
  • The performance of Distributed Heterogeneous Computing System depends on the algorithm which schedules input DAG graph. Among various scheduling algorithms, list scheduling algorithm provides superior performance with low complexity. List scheduling consists of task prioritizing phase and processor allocation phase, but most studies only focus on task prioritizing phase. In this paper, we propose LIP policy which has the same complexity with traditional allocation policies but has superior performance. The performance of LIP has been observed by applying them to task prioritizing phase of traditional list scheduling algorithms, HCPT, HEFT, GCA, and PETS. The results show that LIP has better performance than insertion-based policy and non-insertion-based policy, which are traditional processor allocation policies.

A Priority-based Time Slot Allocation Protocol for Hybrid MAC in WSNs (WSN에서 하이브리드 MAC을 위한 우선순위기반 타임 슬롯 할당 프로토콜)

  • Nam, Jae-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1435-1440
    • /
    • 2014
  • Nodes in WSNs must operate under limited energy resource. Controlling access to the channel in WSNs plays a key role in determining channel utilization and energy consumption. This paper introduces a priority-based time slot allocation protocol for hybrid TDMA/CSMA MAC in WSNs. This protocol combines both TDMA and CSMA techniques while introducing prioritization by (m,k)-firm constraint. The performance of this protocol is obtained through simulations for various number of nodes and show significant improvements in delay and packet delivery ratio compared to S-MAC.

An Extended Real-Time Synchronization Protocols for Shared Memory Multiprocessors (공유메모리 다중 프로세서 실시간 시스템에서의 동기화 프로토콜)

  • Kang, Seung-Yup;Ha, Rhan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.136-138
    • /
    • 1998
  • 작업들이 자원을 공유하는 경우 예측하기 어려운 지연시간이 발생한다. 다중 프로세서 시스템에서의 자원공유로 인한 지연시간은 더욱 예측하기 어렵다. 실기간 시스템의 스케줄 가능성 검사를 위해서는 이러한 지연시간을 정확히 예측해야한다. 선점가능한 우선순위 구동 CPU 스케줄링 알고리즘에 의해서 다른 우선순위의 작업과의 동기화는 우선순위 역전 문제를 야기한다. 본 논문에서는 다중 프로세서에서의 동기화 프로토콜을 제안하고 작업의 지연시간을 분석한다. 다른 프로세서에 할당된 작업들이 수행중인 자원을 요구할 때, 자원을 수행하는 작업의 우선순위를 높여줌으로써 자원수행을 빠르게 종료하게 한다. 이로 인해 자원에 의한 지연을 최소화한다. 특히, 높은 우선순위 작업의 경우 더욱 작은 지연시간을 갖게한다. 시뮬레이션을 통한 Shared Memory Protocol [5]과의 비교, 분석 결과 성능의 향상을 보임을 알 수 있다. 다양한 작업집합에 대한 지연시간을 분석하였다.

  • PDF

Service Class Priority Controlled DBA Scheduling Method and Performance Evaluation in Ethernet PONs (Ethernet PONs에서 서비스 클래스별 전송 우선순위를 적용한 DBA 스케쥴링 방식 및 성능 분석)

  • Nam Yoon-Seok
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.679-686
    • /
    • 2005
  • Because EPON access network shares a medium and aggregates the traffic from EPON subscribers, scheduling media access control on EPON bandwidth allocation is very important. Furthermore DBA mechanism of EPON based on TDMA is out of specification and up to implementation. This paper deals with a DBA method to guarantee the QoS of the delay sensitive traffic on the base of best-effort service and delay priority queue management. The proposed method performs virtual scheduling algorithm for the integrated traffic. It uses the same MAC messages and tries to guarantee the QoS of higher priority traffic first with a simple DBA architecture. We evaluate the algorithm for traffic delay according to polling interval and traffic load of upstream and downstream. The results show that the proposed method can guarantee the QoS of the delay sensitive traffic with priority of the service classes.

A Fair Contention Channel Assignment Scheme for Emergency data -First-Priority MAC in Wireless Body Area Networks (WBAN에서 응급데이타 퍼스트 우선순위 MAC을 위한 공정한 경쟁 채널 할당 방법)

  • Lee, Jung-Jae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.5
    • /
    • pp.995-1002
    • /
    • 2018
  • A Contention Access Period(: CAP) with high contention in priority-based MAC protocols can result in higher number of collisions and retransmissions. High-Priority traffic dominates low-priority traffic during CAP depleting low-priority traffic, adversely affecting WBAN throughput, delay, and energy consumption. This paper proposes a Emergency data-First-Priority MAC(: EFP-MAC) superframe structure that is able to reduce contention in the CAP period, and provides a fair chance for low-priority traffic. As a result, the proposed Emergency data-First Priority MAC(; EFP-MAC) The Simulation results show that the proposed MAC achieves lower energy consumption, higher throughput and low latency than the IEEE 802.15.4 standard.

The Effect Analysis on the Container Terminal Productivity according to Combination of YT Pooling and Dispatching Rules (이송장비 풀링(Pooling)과 우선순위 규칙(Dispatching rule) 조합에 따른 컨테이너 터미널 생산성 효과분석)

  • Chun, Seoyoung;Yoon, SungWook;Jeong, Sukjae
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.3
    • /
    • pp.25-40
    • /
    • 2019
  • Today, container terminals are fiercely competing to attract an increasing number of containers. As a way to improve terminal productivity, this study proposes two dispatching rules for yard truck allocation priorities. First, Multi-Attribute Dispatching Rule(MADR) is an allocation method to calculate the weighted sum of multiple factors affecting container terminal productivity and priority them. Especially, the workload of the quay crane was considered one of the factors to reduce the residence time of the ship. Second, Cycling Dispatching Rule(CDR) is the effective way to increase the number of double cycles that directly affect terminal productivity. To identify the effects of combinations of pooling and dispatching, a comparative experiments was performed on 8 scenarios that combined them. A simulation environment has been developed for experiments and the results have demonstrated that the combination of terminal level pooling and Multi-attribute Dispatching could be an excellent combination in KPIs consisting of GCR and delayed departure of ships, etc.