• Title/Summary/Keyword: Priority-based control

Search Result 437, Processing Time 0.037 seconds

Task Priority Control Method based on the Characteristics of Applications in CFS (애플리케이션 특징에 따른 CFS 태스크 우선순위 제어 기법)

  • Jang, Joonhyouk;Lee, Yena;Hong, Jiman
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.6
    • /
    • pp.12-18
    • /
    • 2021
  • A proportional share scheduler allocates CPU time to tasks and determines which task will be dispatched according to their priorities. In this paper, we investigate the correlation between the characteristics of applications and task priorities in the Linux Completely Fair Scheduler(CFS), which is one of the representative proportional share schedulers. We also propose a method of controlling the granularity of priority assignments according to the characteristics of applications. We implemented the proposed technique in a Linux system and confirmed the meaningful experimental results.

A traffic control agent to manage flow usage in Differentiated Service Network (차별화서비스 네트워크에서 흐름 관리를 위한 트래픽 제어 에이전트)

  • 이명섭;박창현
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.69-72
    • /
    • 2003
  • This paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network.

  • PDF

QoS Priority Based Femtocell User Power Control for Interference Mitigation in 3GPP LTE-A HetNet

  • Ahmad, Ishtiaq;Kaleem, Zeeshan;Chang, KyungHi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.2
    • /
    • pp.61-74
    • /
    • 2014
  • In recent years, development of femtocells are receiving considerable attention towards increasing the network coverage, capacity, and improvement in the quality of service for users. In 3GPP LTE-Advanced (LTE-A) system, to efficiently utilize the bandwidth, femtocell and macro cell uses the same frequency band, but this deployment poses a technical challenge of cross-tier interference to macro users. In this paper, the novel quality of service based fractional power control (QoS-FPC) scheme under the heterogeneous networks environment is proposed, which considers the users priority and QoS-requirements during the power allocation. The proposed QoS-FPC scheme has two focal points: firs, it protects the macrocell users uplink communication by limiting the cross-tier interference at eNB below a given threshold, and second, it ensures the optimization of femtocell users power allocation at each power adjustment phase. Performance gain is demonstrated with extensive system-level simulations to show that the proposed QoS-FPC scheme significantly decreases the cross-tier intereference and improves the overall users throughput.

Congestion Control Mechanism for Efficient Network Environment in WMSN (무선 멀티미디어 센서 네트워크에서 효율적인 네트워크 환경을 위한 혼잡 제어 메커니즘)

  • Park, Jeong-Hyeon;Lee, Sung-Keun;Oh, Won-Geun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.2
    • /
    • pp.289-296
    • /
    • 2015
  • Wireless multimedia sensor network senses and transfers mass multimedia data. Also, it is sensitive to latency. This thesis proposes a routing technique based on traffic priority in order to improve the network efficiency by minimizing latency. In addition, it proposes a congestion control mechanism that uses packet service time, packet inter-arrival time, buffer usage, etc. In this thesis, we verified the reduction of packet latency in accordance with the quality level of packet as a result of the performance analysis through the simulation method. Also, we verified that the proposed mechanism maintained a reliable network state by preventing packet loss due to network overload.

Analysis of Threat Information Priorities for Effective Security Monitoring & Control (효과적인 보안관제를 위한 위협정보 우선순위 도출)

  • Kang, DaYeon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.26 no.5
    • /
    • pp.69-77
    • /
    • 2021
  • This study aims to identify security-based threat information for an organization. This is because protecting the threat for IT systems plays an important role for an corporate's intangible assets. Security monitoring systems determine and consequently respond threats by analyzing them in a real time situation, focusing on events and logs generated by security protection programs. The security monitoring task derives priority by dividing threat information into reputation information and analysis information. Reputation information consisted of Hash, URL, IP, and Domain, while, analysis information consisted of E-mail, CMD-Line, CVE, and attack trend information. As a result, the priority of reputation information was relatively high, and it is meaningful to increase accuracy and responsiveness to the threat information.

An Extensible Transaction Model for Real-Time Data Processing (실시간 데이타 처리를 위한 확장 가능한 트랜잭션 모델에 관한 연구)

  • 문승진
    • Journal of Internet Computing and Services
    • /
    • v.1 no.2
    • /
    • pp.11-18
    • /
    • 2000
  • In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

  • PDF

Cooperative Priority-based Resource Allocation Scheduling Scheme for D2D Communications Underlaying 5G Cellular Networks (5G 셀룰러 네트워크 하의 D2D통신을 위한 협력적 우선순위 기반의 자원할당 스케줄링)

  • Lee, Chong-Deuk
    • Journal of Digital Convergence
    • /
    • v.18 no.10
    • /
    • pp.225-232
    • /
    • 2020
  • The underlaying communication scheme in 5G cellular network is a very promising resource sharing scheme, and it is an effective scheme for improving service performance of 5G and reducing communication load between a cellular link and a device to device (D2D) link. This paper proposes the algorithm to minimize the resource interference that occurs when performing 5G-based multi-class service on gNB(gNodeB) and the cooperative priority-based resource allocation scheduling scheme (CPRAS) to maximize 5G communication service according to the analyzed control conditions of interference. The proposed CPRAS optimizes communication resources for each device, and it optimizes resource allocation according to the service request required for 5G communication and the current state of the network. In addition, the proposed scheme provides a function to guarantee giga-class service by minimizing resource interference between a cellular link and a D2D link in gNB. The simulation results show that the proposed scheme is better system performance than the Pure cellular and Force cellular schemes. In particular, the higher the priority and the higher the cooperative relationship between UE(User Equipment), the proposed scheme shows the more effective control of the resource interference.

Dynamic QoS Control Algorithm of Real-time Transfer Protocol based on Delay and Loss Priority (지연과 손실우선순위에 따른 실시간 멀티미디어 전송 프로토콜의 동적 QoS 제어 알고리즘)

  • 김정철;이성섭;김체훤;남지승
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.149-152
    • /
    • 2000
  • In the Internet, multimedia data transfer is hard to guarantee the characteristics of the Real-Time because of the Best-Effort of the nature of IP, then additional mechanism is applied to multimedia application for real-time data. In this paper, we introduce the nature of multimedia and the necessary facility for real-time protocol. We propose protocol layer, which has necessary function above mentioned and offer the end-to-end transfer far real-time data. Also, the proposed protocol perform a next low operation: 1) a required information for QoS control by using Feedback mechanism is obtained from sender, 2) divided a transferred packet by delay and loss priority. 3) recognized the low service models, and 4) decided a bandwidth and QoS according to a network state

  • PDF

A Medium Access Control Protocol for Voice/Data Integrated Wireless CDMA Systems

  • Lim, In-Taek
    • ETRI Journal
    • /
    • v.23 no.2
    • /
    • pp.52-60
    • /
    • 2001
  • In this paper, a medium access control protocol is proposed for integrated voice and data services in wireless local networks. Uplink channels for the proposed protocol are composed of time slots with multiple spreading codes per slot based on slotted code division multiple access (CDMA) systems. The proposed protocol uses spreading code sensing and reservation schemes. This protocol gives higher access priority to delay-sensitive voice traffic than to data traffic. The voice terminal reserves an available spreading code to transmit multiple voice packets during a talkspurt. On the other hand, the data terminal transmits a packet without making a reservation over one of the available spreading codes that are not used by voice terminals. In this protocol, voice packets do not come into collision with data packets. The numerical results show that this protocol can increase the system capacity for voice service by applying the reservation scheme. The performance for data traffic will decrease in the case of high voice traffic load because of its low access priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.

  • PDF

Congestion Control Scheme for Multimedia Traffic over ATM ABR Service

  • Kim, Jung-Youp;Lee, Sang-Heok;Park, Young-Bok
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.525-528
    • /
    • 2000
  • According to the development of B-ISDN on ATM network, the uses of Multimedia service is growing. Although ABR service uses the network resource most effectively because it is able to change the transfer rate, it is not used for multimedia service until recently. In this paper, we set priority queue and non-priority queue in the ATM switch and each queue has threshold so is can be adopted in different transfer rate method. We propose the real-time traffic transfer method over ABR service based on an effective traffic control method.

  • PDF