• Title/Summary/Keyword: Service Priority

Search Result 1,192, Processing Time 0.026 seconds

Adaptive Priority Queue-driven Task Scheduling for Sensor Data Processing in IoT Environments (사물인터넷 환경에서 센서데이터의 처리를 위한 적응형 우선순위 큐 기반의 작업 스케줄링)

  • Lee, Mijin;Lee, Jong Sik;Han, Young Shin
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.9
    • /
    • pp.1559-1566
    • /
    • 2017
  • Recently in the IoT(Internet of Things) environment, a data collection in real-time through device's sensor has increased with an emergence of various devices. Collected data from IoT environment shows a large scale, non-uniform generation cycle and atypical. For this reason, the distributed processing technique is required to analyze the IoT sensor data. However if you do not consider the optimal scheduling for data and the processor of IoT in a distributed processing environment complexity increase the amount in assigning a task, the user is difficult to guarantee the QoS(Quality of Service) for the sensor data. In this paper, we propose APQTA(Adaptive Priority Queue-driven Task Allocation method for sensor data processing) to efficiently process the sensor data generated by the IoT environment. APQTA is to separate the data into job and by applying the priority allocation scheduling based on the deadline to ensure that guarantee the QoS at the same time increasing the efficiency of the data processing.

Priority Rule Based Heuristics for the Team Orienteering Problem

  • Ha, Kyoung-Woon;Yu, Jae-Min;Park, Jong-In;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • v.17 no.1
    • /
    • pp.79-94
    • /
    • 2011
  • Team orienteering, an extension of single-competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics-serial and parallel ones-that are especially suitable for practically large-sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small-to-medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short computation time.

Delphi studies on the operational problems of the Emergency Vehicle Priority Signal System and improvement measures (긴급차량 우선신호시스템 운영상의 문제점 도출과 개선방안에 관한 델파이 연구)

  • Jin-hyeon, Kim
    • The Korean Journal of Emergency Medical Services
    • /
    • v.26 no.3
    • /
    • pp.185-199
    • /
    • 2022
  • Purpose: Prompt arrival of emergency vehicles at the scene is important. Therefore, special cases for emergency vehicles are being applied. However, there remain obstacles that obstruct the prompt arrival during dispatch. Methods: First, a literature review revealed five categories of problems with the emergency vehicle priority signal system. Then, the first Delphi survey was conducted to confirm the validity of the five categories. Further, a second Delphi survey was conducted to identify additional problems, and we used a 5-point Likert scale for a third Delphi survey. Results: A total of 92 items were extracted from preceding studies. The validity of the five categories was confirmed in the first Delphi survey. Then, 123 additional items were derived from the second Delphi survey, and the final 50 items were selected from 93 items obtained from the third Delphi survey. Conclusion: This study revealed problems and improvement measures for improving the operation of the emergency vehicle priority signal system that were not proposed in previous studies.

Development of a Social Network Service Closely Coupled with Local Broadcasting Media

  • Kim, Hyeon Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.11
    • /
    • pp.129-137
    • /
    • 2021
  • Recently, local broadcast companies are experiencing financial shortages and business deterioration due to difficulties in securing income sources. This is due to the continuous decrease in viewership ratings as the contents of the broadcast companies do not attract the interest and participation of local residents. To resolve this issue, this paper presents a social network service closely coupled with local broadcasting. In the proposed service, the exposure range of articles is limited to a region so that reporters could easily find the interests of local residents. In addition, among the articles written by local residents, the articles requested to be broadcast by reporters are placed at the top section of the main page. From this UI configuration, local residents can easily recognize that their opinions can be directly connected to the broadcast, which is intended to activate their participation. The proposed service was implemented in the form of a prototype system with JCN, a broadcasting company in Ulsan, and this paper discusses its user interfaces, system structure, and an algorithm to estimate the priority of the written articles.

Suggestion about Bringing Competition and Development in Directory Assistance Service (전화가입자 번호안내 사업의 경쟁 도입 및 서비스 개선 방안)

  • 김낙철;임종식;이기태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.6B
    • /
    • pp.1143-1152
    • /
    • 2000
  • As being various user telephone number after entry of new telecommunication enterprise, management of systematic Directory Assistance Service is required. Also through providing competition of Directory Assistances Service, enhancement of Service quality and development of new Service are induced. In this study, there is researched the overall view of present Directory Assistance Service in priority Korean Telecom and the oversea's Directory Assistance Service for U.S.A, England, Australia, Japan. As result of study, we want to suggest the appointment of unified Directory Database Management Company and outsourcing of Directory Assistance Service to that company but in reality, there may be other idea also with regard to various circumstances.

  • PDF

A Fast Restoration Method for the High Priority Traffics in MPLS Networks (MPLS 망에서 우선 순위가 높은 트래픽을 위한 빠른 복구 방법)

  • Lee Bong-Ha;Kim Eung-Ha;Song Jung-Gil
    • Journal of Internet Computing and Services
    • /
    • v.4 no.2
    • /
    • pp.1-9
    • /
    • 2003
  • Path restoration, which is needed to increase network survivability in MPLS networks, is a technology of supplying reliable service by delivering the traffics through restoring the paths when links or nodes of a working path are failed. In this paper, we propose a path restoration method using duplication of working paths for link failure as a method of restoring paths for the high priority traffics. The existing path restoration method transmits the traffics to the path restoration uniformly in regardless of the priority while link obstacle. It has a problem to take a long time to restore the connection of the high priority traffics. On the other hand, the suggested restoration method establishes the duplication path for the working path, which transmits the high priority traffics and transmit the traffics through the duplication path. It has a strong point to restore the connection quickly. Also, through simulation we analyze the performance of the restoration system using the duplication path and prove that the proposed restoration method is superior in performance to the existing restoration methods regarding to the high priority traffics.

  • PDF

Method for Message Processing According to Priority in MQTT Broker (MQTT Broker에서 우선순위에 따른 메시지 처리를 위한 방법에 관한 연구)

  • Kim, Sung-jin;Oh, Chang-heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1320-1326
    • /
    • 2017
  • Recently, IoT has been studying a lightweight protocol to satisfy device communication in a limited network environment. MQTT is a typical lightweight protocol. It supports small fixed headers to minimize overhead, and adopts publish/subscribe structure to guarantee real-time performance. However, MQTT does not support prioritization of important data and can not provide QoS in a specific IoT service. In this paper, we propose a message processing method to consider the priority of various IoT services in MQTT. In the proposed method, the priority flag is added to the fixed header of the MQTT in the node to transmit the message, and the broker confirms the priority of the corresponding message and processes it preferentially. Through experiment and evaluation, we confirmed the reduction of end-to-end delay between nodes according to priority.

Multiple Rotating Priority Queue Scheduler to Meet Variable Delay Requriment in Real-Time Communication (실시간 통신에서 가변 지연을 만족하기 위한 Multiple Rotating Priority Queue Scheduler)

  • Hur, Kwon;Kim, Myung-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2543-2554
    • /
    • 2000
  • Packet schedulers for real-time communication must provide bounded delay and efficient use of network resources such as bandwidth, buffers and so on. In order to satisfy them, a large number of packet scheduling methods have been proposed. Among packet scheduling methods, an EDF (Earliest Deadline First) scheduling is the optimal one for a bounded delay service. A disadvantage of EDF scheduling is that queued packets must be sorted according to their deadlines, requiring a search operation whenever a new packet arrives at the scheduler. Although an RPQ (Rotating Priority Queue) scheduler, requiring large size of buffers, does not use such operation, it can closely approximate the schedulability of an EDF scheduler. To overcome the buffer size problem of an RPQ scheduler, this paper proposes a new scheduler named MRPQ (Multiple Rotating Priority Queue). In a MRPQ scheduler, there are several layers with a set of Queues. In a layer, Queues are configured by using a new strategy named block Queue. A MRPQ scheduler needs nearly half of buffer size required in an RPQ scheduler and produces schedulability as good as an RPQ scheduler.

  • PDF

Performance Analysis of a Dynamic Priority Control Scheme for Delay-Sensitive Traffic (음성 트래픽을 위한 동적우선권제어방식의 성능분석)

  • 김도규;김용규;조석팔
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.8
    • /
    • pp.3-11
    • /
    • 2000
  • This paper considers the performance of a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme. Loss-sensitive and delay-sensitive traffics are applied to a system with a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Loss-sensitive and delay-sensitive traffics represent sound and data, respectively. Under the TBPJ scheme, the first packet of the loss-sensitive traffic buffer goes into the delay-sensitive traffic buffer with Bernoulli probability p according to system states which represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. TBPJ scheme shows also better performance than that of HOL scheme.

  • PDF

Performance Analysis of Threshold-based Bernoulli Priority Jump Traffic Control Scheme (동적우선권제어함수 기반 TBPJ 트래픽 제어방식의 성능분석)

  • Kim, Do-Kyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.11S
    • /
    • pp.3684-3693
    • /
    • 2000
  • In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

  • PDF