• Title/Summary/Keyword: Priority Control

Search Result 936, Processing Time 0.024 seconds

An Efficient Priority Based Adaptive QoS Traffic Control Scheme for Wireless Access Networks

  • Kang Moon-sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9A
    • /
    • pp.762-771
    • /
    • 2005
  • In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

Efficient Concurrency Control Method for Firm Real-time Transactions (펌 실시간 트랜잭션을 위한 효율적인 병행수행제어 기법)

  • Shin, Jae-Ryong
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.7
    • /
    • pp.115-121
    • /
    • 2010
  • It always must guarantee preceding process of the transaction with the higher priority in real-time database systems. The pessimistic concurrency control method resolves a conflict through aborting or blocking of a low priority transaction. However, if a high priority transaction is eliminated in a system because of its deadline missing, an unnecessary aborting or blocking of a low priority transaction is occurred. In this paper, the proposed method eliminates a transaction that is about to miss its deadline. And it prevents needless wastes of resources and eliminates unnecessary aborting or blocking of a low priority transaction. It is shown through the performance evaluation that the proposed method outperforms the existing methods in terms of the deadline missing ratio of transactions.

Performance Analysis of an Multiplexer for Guaranteed QoS in ATM Networks (ATM망에서 보장된 QoS을 위한 다중화기의 성능분석)

  • 음호식;이명호
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.4
    • /
    • pp.82-89
    • /
    • 2000
  • This study analyzes the cell loss probability of an ATM multiplexer with real time and non-real time bursty traffics. It is assumed that an ATM multiplexer with loss priority control for the analysis. The loss priority control uses the CLP Reld of cell header. For easy analysis and less computation. the multiplexed traffic of the ATM multiplexer was modeled by the MMDP. The ATM multiplexer is simulated by the MMDP/MMDP/l/K queueing system. From the above results, The connection admission of an ATM multiplexer with loss priority control is determined by the cell loss probability with low priority as well as the size of threshold buffer. Therefore, to increase the statistical multiplexing gain it will be good to utilize the loss priority control in order.

  • PDF

Direct Load Control Using Priority Based Dynamic Programming (우선순위기반 동적 프로그래밍을 이용한 직접부하제어)

  • Kim, Tae-Hyun;Lee, Seung-Youn;Shin, Myong-Chul;Cha, Jae-Sang;Suh, Hee-Seok;Kim, Jong-Boo;Choi, Sang-Yul
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.6
    • /
    • pp.78-83
    • /
    • 2004
  • Currently used DLC(Direct Load Control) algorithm is only focused on ON/OFF load control not concerning about reliving participated customer's inconvenience and load priority. Therefore, that is a major obstacle to attract customer participating in demand response program. To overcome the above defects, the authors represent direct load control algorithm using priority based dynamic programming. the proposed algorithm is that participant customer send E-mail to DLC center about priority of load before executing DLC, then DLC algorithm decide which load to be OFF by using priority and off time constraint of the load. By using dynamic programming based on the order of priority for DLC algorithm it is possible to maximize participating customer's satisfaction and it will help to attract more customer's participating in demand response program.

Adaptive and Prioritized Random Access and Resource Allocation Schemes for Dynamic TDMA/TDD Protocols

  • Choi, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.1
    • /
    • pp.28-36
    • /
    • 2017
  • The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

Establishment and Effectiveness Analysis of Emergency Vehicle Priority Signal Control System in Smart City and Directions for ISMS-P Technical Control Item Improvement (스마트시티 내 긴급차량 우선신호 제어시스템 구축과 효과성 분석 및 ISMS-P 기술적 통제항목 개선 방향성 연구)

  • Yoon, TaeSeok;Park, Yongsuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.9
    • /
    • pp.1166-1175
    • /
    • 2021
  • We investigate the current situation and development trend of domestic smart city and emergency vehicle priority signal control system analyzing the existing effectiveness of 1) emergency vehicle priority signal control system and 2) control emergency vehicle priority signal, based on domestic and foreign prior research for signal control system security. The effectiveness of time reduction was analyzed through actual application and test operation to emergency vehicles after establishing the system. In addition, for security management and stable service of real-time signal system control we propose improvement for the technical control items of the ISMS-P certification system to secure golden time to protect citizens' precious lives and property in case of emergency by classifying and mapping the existing ISMS-P certification system and the Korea Internet & Security Agency's cyber security guide according to the items of security threats.

A Study on the Performance of Priority Mechanisms in ATM Multiplexer (ATM 멀티플렉서에서의 우선순위 메카니즘에 관한 연구)

  • 윤성호;박광채;이재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.6
    • /
    • pp.779-792
    • /
    • 1993
  • In a switching node or an ATM multiplexer of the ATM network, a good bandwidth utilization can be achieved by the priority control using the 1-bit(Cell Loss priority) in ATM cell header. In this paper, the mixed mechanism is proposed to make up for shortcomings of existing space priority control mechanisms and to decrease the loss probability of high priority cell and its performance is analyzed about the cell loss probability. To estimate the performance of proposed mixed mechanism, its cell loss probability is compared with those of non-priority mechanism, push-out mechanism and partial buffer sharing mechanism. The cell loss probability is analyzed using a M/D/1/N modeling and a 2-state MMPP/D/1/N modeling and also comparison between two modelings is made. To verify this result of numerical analysis, the computer simulation is performed for each mechanism using the simulation language, SIMSRIPT II.5.

  • PDF

Direct Load Control using Priority Based Dynamic Programming Technique (동적 프로그래밍 기법을 이용한 직접부하제어 알고리즘 개발)

  • Kim, Tae-Hyon;Lee, Jong-Soo;Shin, Myong-Chel;Choi, Sang-Yeol
    • Proceedings of the KIEE Conference
    • /
    • 2003.11a
    • /
    • pp.463-465
    • /
    • 2003
  • This paper adopts the methods of dynamic programming based on priority and the objective function is to maximize the amount of priority. The Purpose of this work is to schedule the direct load control with approciate constrints. To demonstrate the effectiveness of the study, sample data is used about 54 load. And the results of sample are described in this.

  • PDF

Priority Control Using Cell and Windows Counter in ATM Switchs (ATM 교환기에서 셀 및 윈도우 카운터를 이용한 우선순위 제어)

  • Kim Byun-Gon;Seo Hae-Young;Jang Ting-Ting;Park Ki-Hong;Han Cheol-Min;Kim Nam-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.3
    • /
    • pp.1-11
    • /
    • 2006
  • With the improvement of information telecommunication technology, the various service in broadband integrated services digital networks have a wide range of delay, delay jitter and cell loss probability requirements according to traffic specification. Therefore, the design of appropriate control schemes that can satisfy the cell loss, delay requirements with various traffic specification for B-ISDN is an extremely important challenging problem. In this paper, we propose a priority control scheme using a window counter and a cell counter per each type of class. In the proposed priority control scheme, for satisfying required service quality, we performed the priority control scheme using the delay/loss factors obtained by comparing window counter with cell counter. The performance of proposed control scheme is estimated by computer simulation. In the results of simulation, we verified that the proposed method satisfied per class requirements as the results showed that cell loss probability has a order of video, data, voice and delay time has a order of video, voice and data.

  • PDF

A Usage Parameter Control based on Cell Loss Priority (셀 손실 우선순위 기반의 사용 변수 제어)

  • 조태경;최병욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1296-1304
    • /
    • 1999
  • In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks. Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can eliminate the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP = 0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. For the performance evaluation, we simulate the proposed algorithm with discrete time input traffic model, the results show that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.

  • PDF