• Title/Summary/Keyword: Information Priority

Search Result 2,396, Processing Time 0.031 seconds

A Multi-Priority Service Differentiated and Adaptive Backoff Mechanism over IEEE 802.11 DCF for Wireless Mobile Networks

  • Zheng, Bo;Zhang, Hengyang;Zhuo, Kun;Wu, Huaxin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3446-3464
    • /
    • 2017
  • Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB algorithm.

A Traffic Control Algorithm in Home Networks through Priority Reassignment (홈 네트웍에서의 Priority 재배정을 통한 트래픽 제어 알고리즘)

  • 임승옥;정광모
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.622-624
    • /
    • 2002
  • 네트웍 기술이 급속도로 발달함에 따라, 다수의 PC를 보유하고 인터넷 서비스를 사용하는 가정이 늘어나고 있다. 이렇게 가정에서의 네트웍 환경이 변함에 따라, 가정 내에서의 원활한 네트웍 서비스의 제공과 가전기기들 간의 통신을 연결하는 기술이 홈 네트워킹에서 주된 관심사가 되고 있다. 이렇게 홈 네트웍이 확장됨에 따라 홈 네트웍 내에서의 트래픽 증가가 예상되는데, 증가된 트래픽을 어떻게 관리하고 서비스를 제공할 것인가가 홈 네트웍 발전에 큰 영향을 미칠 것이라고 예견된다. 홈 네트웍에서 존재할 수 있는 트래픽은 크게 3가지 정도로 나누어 볼 수 있는데, 제어 트래픽, 인터넷이나 non-real-time 트래픽, 그리고 real-time multimedia 트래픽이다. 이러한 복합적인 홈 네트웍에서의 트래픽을 처리하기 위해, 사용자가 많이 사용한 트래픽에 대해 우선권을 부여하는 방식과 각 트래픽의 고유한 성질을 보존하는 priority-based 트래픽 제어 구조를 설계하였다. 시뮬레이션 결과로는 사용자가 빈번히 사용한 트래픽 class에 대해서는 priority가 높게 할당되며, 각 트래픽의 특성이 감안된 priority 변화를 보여주고 있다.

  • PDF

Reagent Cabinet Management System Using Danger Priority

  • Cao, Kerang;Kang, Inshik;Choi, Hyungwook;Jung, Hoekyung
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.4
    • /
    • pp.227-231
    • /
    • 2017
  • Recently, as the number of safety accidents caused by reagents increases, researches on a system that can reduce safety accidents are underway. Existing systems managed reagent cabinet through various sensors. On the other hand, there are disadvantages in that countermeasures against simultaneous danger situations are insufficient at multi-reagents cabinet. In order to solve this problem, this paper proposes a system to manage the reagents cabinet through danger priority. Danger priorities are selected through domestic chemical accident cases and the Chemical Safety Management Act. If a danger situation occurs in the reagent cabinet, make sure it is from a single or multiple reagent cabinets. For multiple reagent cabinets, compare the reagent cabinet priorities and run the device sequentially from the reagent cabinet with the highest priority. Thus, by operating the device according to the danger priority, the chain reaction can be prevented in advance and the reagent cabinet can be safely managed.

Delay Performance of Multi-Service Network with Strict Priority Scheduling Scheme

  • Lee, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.2B
    • /
    • pp.11-20
    • /
    • 2005
  • Strict priority scheduling scheme is a good candidate for the implementation of service differentiation in an Internet because of simplicity in implementation and the capability to guarantee the delay requirement of the highest class of traffic. However, it is also blown that strict priority starves the lower-class traffic at the cost of prioritizing the higher-class traffic. The purpose of this work is to propose an analytic method which can estimate the average delay performance of Diffserv service architecture and shows that strict priority scheme does not sacrifice the lower class traffic over a diverse condition of the load. From the numerical experiments for three-class Diffserv network we validate our argument that strict priority scheme may be applied to a service differentiation scheme for the future Internet.

Preventing Communication Disruption in the Urban Environment Using RRPS (RSU Request Priority Scheduling) (도심환경에서 통신 단절 예방을 위한 RRPS(RSU Request Priority Scheduling)설계)

  • Park, Seok-Gyu;Ahn, Heui-Hak;Jeuong, Yi-Na
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.6
    • /
    • pp.584-590
    • /
    • 2016
  • This paper proposed "Priority Scheduling and MultiPath Routing Protocol (RRPS) for preventing communication disruption in the urban environment" to minimize the disconnection or disruption of V2I and V2V communication in the urban environment where communication is frequently disconnected according to density. The flow of the RRPS is explained as follows. RSU Request Priority Scheduling (RRPS) is used to apply the priority of the request message prior to reaching the end line by using the Start Line and End Line, which are the management areas of the RSU). This paper also proposed MPRP (Multi Path Routing Protocol) design to set up the multipath to the destination. As a result, the proposed RRPS improves the processing efficiency of V2I by applying priority scheduling to the message of the vehicle requesting the information in the RSU, and can prevent the communication disconnection. Thereby, it is improved the transmission success probability.

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.

C4I Maintenance Priority Decision using Maintenance Metric

  • Kim, Kiwang;Kang, Dongsu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.12
    • /
    • pp.145-153
    • /
    • 2017
  • Systemic management is required at each phase of the C4I system life cycle to achieve information advantage in the battlefield through stable operation of the C4I system under the NCOE. In particular, the maintenance phase is the longest period of the C4I system life cycle, and it is easy to utilize and analyze data such as faults that occur during system operation. However, according to the previous research, the maintenance is evaluated as a phase in which the definition and management of comprehensive indicators are insufficient compared to other phase. In this paper, we propose the method of C4I Maintenance Priority decision using Maintenance metric. As a result of modifying the Naval Tactical C4I System's preventive maintenance cycle according to the priority, the total number of faults is reduced and the maintenance efficiency is improved.

Adaptive Priority-Based Downlink Scheduling for WiMAX Networks

  • Wu, Shih-Jung;Huang, Shih-Yi;Huang, Kuo-Feng
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.692-702
    • /
    • 2012
  • Supporting quality of service (QoS) guarantees for diverse multimedia services are the primary concerns for WiMAX (IEEE 802.16) networks. A scheduling scheme that satisfies QoS requirements has become more important for wireless communications. We propose a downlink scheduling scheme called adaptive priority-based downlink scheduling (APDS) for providing QoS guarantees in IEEE 802.16 networks. APDS comprises two major components: Priority assignment and resource allocation. Different service-type connections primarily depend on their QoS requirements to adjust priority assignments and dispatch bandwidth resources dynamically. We consider both starvation avoidance and resource management. Simulation results show that our APDS methodology outperforms the representative scheduling approaches in QoS satisfaction and maintains fairness in starvation prevention.

A Dynamic Wavelength and Bandwidth Allocation Algorithm with Dynamic Framing under Ring-based EPON Architecture

  • Bang, Hak-Jeon;Park, Chang-Soo
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2009.02a
    • /
    • pp.307-308
    • /
    • 2009
  • To reduce delay for high priority packets in the ring-based EPON, the EPON packet classifier groups services as their priorities and frames for services are dynamically framed as their priorities. Since dynamic framing for a packet priority dynamically changes assignment spaces in the maximum framing packet size as network traffics, it makes services with high priority to improve quality of services with relative low threshold time for transmitting.

  • PDF

Implementation of Semaphores to Prevent Priority Inversion (우선순위 역전을 해결하기 위한 세마포어의 구현)

  • 양희권;윤기현;성영락;이철훈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04a
    • /
    • pp.199-201
    • /
    • 2003
  • 실시간 운영체제(Real-Time OS)는 우선순위 기반의 선점형 스케줄링을 제공하는 운영체제로서 시간 결정성 (Determinism)을 보장하는 특징이 있다. 그러나, 우선순위가 높은 태스크가 우선순위가 낮은 태스크에 의해 CPU를 점유 당하는 우선순위 역전(Priority Inversion)이 발생하여 시간 결정성이 보장되지 못하면 시스템의 심각한 결함을 야기할 수 있다. 본 논문에서는 우선순위 역전을 해결하기 위하여 Priority Inheritance Protocol 을 적용한 세마포 (Semaphore)의 구현에 대해 기술한다.

  • PDF