• Title/Summary/Keyword: Priority service networks

Search Result 168, Processing Time 0.038 seconds

Priority-based Differentiated Service in Spectrum Mobility Game

  • Lu, Bingxian;Qin, Zhenquan;Wang, Lei;Sun, Liang;Zhu, Ming;Shu, Lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1324-1343
    • /
    • 2014
  • In recent years, the problem of spectrum mobility in Cognitive Radio (CR) Networks has been widely investigated. In order to utilize spectrum resources completely, many spectrum handoff techniques based on game theory have been proposed, but most studies only concern that users how to achieve better payoffs, without much attention to the diverse needs of users. In this paper, we propose a new channel-switching model based on game theory, using a prioritized approach to meet the diverse needs of users in two different modes (CQ and PS). At the same time, this paper proposes some acceleration techniques to reach the Nash equilibrium more efficiently. We evaluate the performance of the proposed schemes depending on priority using real channel availability measurements, and conclude that the channel quality function (CQ) mode provide better service for priority user but the plan-sorting (PS) mode can be more suitable in multiple priority users exist scene.

The Analysis of an Opportunistic Spectrum Access with a Strict T-preemptive Priority Discipline (엄격한 T-축출 우선순위 대기행렬을 이용한 기회 주파수 접근 방식의 성능 분석)

  • Kim, Kilhwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.4
    • /
    • pp.162-170
    • /
    • 2012
  • We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

A Congestion Control Method for Real-Time Communication Based on ATM Networks

  • Zhang, Lichen
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1831-1834
    • /
    • 2002
  • In this paper, we present results of a study of congestion control for real-time communication based on ATM networks. In ATM networks, congestion usually results in cell loss. Based on the time limit and priority, the cells that compete for the same output line could be lined according to the character of real-time service. We adopt priority control algorithm for providing different QoS bearer services that can be implemented by using threshold methods at the ATM switching nodes, the cells of different deadline and priority could be deal with according to the necessity. Experiments show the proposed algorithm is effective in the congestion control of ATM real-time networks

  • PDF

An Enhanced Transmission Mechanism for Supporting Quality of Service in Wireless Multimedia Sensor Networks

  • Cho, DongOk;Koh, JinGwang;Lee, SungKeun
    • Journal of Internet Computing and Services
    • /
    • v.18 no.6
    • /
    • pp.65-73
    • /
    • 2017
  • Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

A Study on the Performance Analysis for Partial Buffer Sharing Priority Mechanism with Two Thresholds (두개의 임계치를 갖는 부분 버퍼공유 우선도 방식의 성능 분석에 관한 연구)

  • 박광채;이재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.2
    • /
    • pp.381-389
    • /
    • 1994
  • In the communication network, multimedia service such as high quality voice, high speed data, image etc. will be added to the existing service. This service generates new requirements for the communication networks. The priority control mechanism can be used to control multimedia traffics generated by many communication systems. The priority mechanism which assigns prioirities to generated cells according to service quality is one of the traffic control. The priority assignment can be divided by priority criterion for each traffic characteristics such as loss sensitivity and delay sensitivity. In this paper, we alnalyzed the partial buffur sharing (PBS) mechani느 as a traffic control reducing the cell loss, and proposed analysis method. We analyzed the PBS mechanism using classical approach as a Markov chain. In order to validata proposed analysis method, simulation is performed using simulation package SIMSCRIPT 11.5. From this results, we confirmed that proposed analysis method can be verified. Also, we presented cell loss probability of ATM network when this results are to be applied to ATM networks.

  • PDF

Ayymptotic performance analysis and adaptive control of large scale limited service token-passing networks with priorities (우선순위 및 제한 서어비스를 갖는 대규모 토큰-패싱 네트워크의 점근적 성능해석 및 적응제어)

  • 심광현;임종태
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.1000-1005
    • /
    • 1993
  • In this paper asymptotic formulate for performance characteristics throughput, delay) of large scale token-passing networks with priorities and limited service are given. In particular, adaptive control procedures for obtaining optimal buffer capacity with respect to each priority and optimal limited service are shown. All results obtained are supported by simulations.

  • PDF

QUEUEING ANALYSIS OF THE HOL PRIORITY LEAKY BUCKET SCHEME

  • Choi, Doo-Il
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.7 no.1
    • /
    • pp.15-23
    • /
    • 2003
  • ATM networks provide the various kinds of service which require the different Quality of Services(QoS) such as loss and delay. By statistically multiplexing of traffics and the uncertainty and fluctuation of source traffic pattern, the congestion may occur. The leaky bucket scheme is a representative policing mechanism for preventive congestion control. In this paper, we analyze the HOL(Head-of-Line) priority leaky bucket scheme. That is, traffics are classified into real-time and nonreal-time traffic. The real-time traffic has priority over nonreal-time traffic for transmission. For proposed mechanism, we obtain the system state distribution, finally the loss probability and the mean waiting time of real-time and nonreal-time traffic. The simple numerical examples also are presented.

  • PDF

Exploring the Feasibility of Differentiating IEEE 802.15.4 Networks to Support Health-Care Systems

  • Shin, Youn-Soon;Lee, Kang-Woo;Ahn, Jong-Suk
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.132-141
    • /
    • 2011
  • IEEE 802.15.4 networks are a feasible platform candidate for connecting all health-care-related equipment dispersed across a hospital room to collect critical time-sensitive data about patient health state, such as the heart rate and blood pressure. To meet the quality of service requirements of health-care systems, this paper proposes a multi-priority queue system that differentiates between various types of frames. The effect of the proposed system on the average delay and throughput is explored herein. By employing different contention window parameters, as in IEEE 802.11e, this multi-queue system prioritizes frames on the basis of priority classes. Performance under both saturated and unsaturated traffic conditions was evaluated using a novel analytical model that comprehensively integrates two legacy models for 802.15.4 and 802.11e. To improve the accuracy, our model also accommodates the transmission retries and deferment algorithms that significantly affect the performance of IEEE 802.15.4. The multi-queue scheme is predicted to separate the average delay and throughput of two different classes by up to 48.4% and 46%, respectively, without wasting bandwidth. These outcomes imply that the multi-queue system should be employed in health-care systems for prompt allocation of synchronous channels and faster delivery of urgent information. The simulation results validate these model's predictions with a maximum deviation of 7.6%.

A Fast and Scalable Priority Queue Hardware Architecture for Packet Schedulers (패킷 스케줄러를 위한 빠르고 확장성 있는 우선순위 큐의 하드웨어 구조)

  • Kim, Sang-Gyun;Moon, Byung-In
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.10
    • /
    • pp.55-60
    • /
    • 2007
  • This paper proposes a fast and scalable priority queue architecture for use in high-speed networks which supports quality of service (QoS) guarantees. This architecture is cost-effective since a single queue can generate outputs to multiple out-links. Also, compared with the previous multiple systolic array priority queues, the proposed queue provides fast output generation which is important to high-speed packet schedulers, using a special control block. In addition this architecture provides the feature of high scalability.

Delay Fairness Using the Burst Assembly for Service Differentiation

  • Vo, Viet Minh Nhat;Le, Van Hoa;Le, Manh Thanh
    • ETRI Journal
    • /
    • v.40 no.3
    • /
    • pp.347-354
    • /
    • 2018
  • Using various offset times to separate differential services is the most common form of service differentiation in optical burst switching networks. In this approach, a larger offset time is given to a higher priority burst, but it causes this burst to have a longer delay. One solution to this problem is to adjust the burst assembly time so that the buffering delay of the higher priority burst is always shorter than that of the lower priority burst. However, this adjustment causes another problem, called delay unfairness, for bursts with differential priorities that share the same path to their destination. This article proposes a new solution for delay fairness using the burst assembly.