• Title/Summary/Keyword: QoS Class

Search Result 158, Processing Time 0.033 seconds

QoS aware Multi-class scheduler in WiMAX System (WiMAX 시스템에서 QoS에 기반한 Multi-Class 스케줄러)

  • Lee, Ju-Hyeon;Park, Hyung-Kun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.4
    • /
    • pp.820-822
    • /
    • 2010
  • Mobile WiMAX system provides various classes of traffic such as real-time and non-realtime services. These services have different QoS requirements and the QoS aware scheduling has been an important issue. Although many of scheduling algorithms for various services in OFDMA system have been proposed, it is needed to be modified to be applied to Mobile WiMAX system. Since Mobile WiMAX supports five kinds of service classes, it is important to take QoS characteristics of each class into consideration. In this paper, we propose an efficient packet scheduling algorithm to support QoS of each class. Proposed scheme selects a service class first considering QoS Characteristics of each class and choose an appropriate user in the selected class. Simulation results show that the proposed algorithm has better performance than the other algorithm.

Price-Based Quality-of-Service Control Framework for Two-Class Network Services

  • Kim, Whan-Seon
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.319-329
    • /
    • 2007
  • This paper presents a price-based quality-of-service (QoS) control framework for two-class network services, in which circuit-switched and packet-switched services are defined as "premium service class" and "best-effort service class," respectively. Given the service model, a customer may decide to use the other class as a perfect or an imperfect substitute when he or she perceives the higher utility of the class. Given the framework, fixed-point problems are solved numerically to investigate how static pricing can be used to control the demand and the QoS of each class. The rationale behind this is as follows: For a network service provider to determine the optimal prices that maximize its total revenue, the interactions between the QoS-dependent demand and the demand-dependent QoS should be thoroughly analyzed. To test the robustness of the proposed model, simulations were performed with gradually increasing customer demands or network workloads. The simulation results show that even with substantial demands or workloads, self-adjustment mechanism of the model works and it is feasible to obtain fixed points in equilibrium. This paper also presents a numerical example of guaranteeing the QoS statistically in the short term-that is, through the implementation of pricing strategies.

User Request Filtering Algorithm for QoS based on Class priority (등급 기반의 QoS 보장을 위한 서비스 요청 필터링 알고리즘)

  • Park, Hea-Sook;Baik, Doo-Kwon
    • The KIPS Transactions:PartA
    • /
    • v.10A no.5
    • /
    • pp.487-492
    • /
    • 2003
  • To satisfy the requirements for QoS of Users using multimedia content stream service, it is required to control mechanism for QoS based on class priority, URFA classifies the user by two classes (super class, base class) and controls the admission ratio of user's requests by user's class information. URFA increases the admission ratio class and utilization ratio of stream server resources.

An Adjustment Algorithm for Bandwidth Grant Interval of UGS Class in IEEE 802.16/WiBro Systems (IEEE 802.16/WiBro 시스템에서의 UGS 클래스 대역폭 할당 주기 조정 알고리즘)

  • Baek, Joo-Young;Yoon, Jong-Pil;Lee, Jeong-Yoon;Suh, Young-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.5
    • /
    • pp.370-374
    • /
    • 2009
  • In this paper we propose an adjustment algorithm for bandwidth grant interval of UGS class flows the overload status of certain frames occurs due to the pre-defined grant interval mechanism of UGS class. In IEEE 802.16/WiBro systems, UGS class is the highest priority to guaranteed QoS Parameters. However, existing grant interval mechanisms of UGS class do not consider the condition that the grant interval of multiple UGS class flows overlaps with certain frames, and thus it causes the overload status in the system. Therefore, the system cannot be guaranteed QoS for UGS class flows. In this paper, we show the occurrence of the problem through simulation studies and propose an adjustment algorithm to solve the problem. Our simulation results show that there is performance improvement in the proposed algorithm. We expect that the real system in which the proposed scheme is applied can provide more stable QoS services by reducing the delay problem that occurs due to the occurrence of the existing grant interval problem of UGS class.

A User Class-based Service Filtering Policy for QoS Assurance (QoS 보장을 위한 사용자 등급 기반 서비스 수락 정책)

  • Park, Hea-Sook;Ha, Yan;Lee, Soon-Mi
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.4
    • /
    • pp.293-298
    • /
    • 2004
  • To satisfy the requirements for QoS and acceptance ratio of the users using multimedia content service, it is required to control mechanism for QoS assurance and allocation of the stream server' resources based on CoS(Class of Service). To compare performance of the algorithm, we have classified the user by two classes (super class, base class) and control the acceptance ratio of user's requests by user's class information. We have experimented the test of network resources and test of processing time under server/client environment and agent environment. MA-URFA based on agent increases the acceptance ratio of super class and utilization ratio of network resources.

Class Gated Dynamic Bandwidth Allocation Algorithm for supporting QoS in the EPON (EPON 시스템에서 효율적인 QoS 제공을 위한 Class Gated 동적 대역 할당 알고리즘)

  • Hwang Jun-Ho;Kim Hyo-Won;Yoo Myung-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.5 s.347
    • /
    • pp.94-103
    • /
    • 2006
  • Ethernet passive optical network (EPON) has drawn many attention as a promising access network technology for FTTH because it can provide a high bandwidth with a low cost. Since the uplink bandwidth in the EPON system is shared by many users, it is necessary for an EPON system to have an efficient bandwidth allocation mechanism. To support QoS in EPON, the previous bandwidth allocation schemes employ strict priority queueing (SPQ). Since SPQ gives unlimited priority to higher service class, the QoS of lower service classes gets worse. In this paper, we propose Class Gated DBA (Dynamic Bandwidth Allocation) algorithm in which the bandwidth is requested / granted in a service class basis. To avoid the monopoly in bandwidth usage by higher classes the maximum bandwidth that is allocate to each service class is limited (fairness between services classes). In addition, to avoid the monopoly in bandwidth usage by some particular users, each ONU runs fairness bandwidth allocation algorithm within each service classes. Through computer simulations, it is verified that the proposed algorithm achieves a good level of QoS, and at the same time maintains a good level of fairness between both service classes and users.

Study on VoIP QoS Standardization (인터넷전화 서비스 품질 기준 연구)

  • 정옥조;강신각
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.884-887
    • /
    • 2003
  • The standardization of QoS is recently becoming a major issue in VoIP market. This research is to look into the trend of the world and specification about QoS standadization, and present the needs for domestic VoIP QoS standardization.

  • PDF

Clustering and Routing Algorithm for QoS Guarantee in Wireless Sensor Networks (무선 센서 네트워크에서 QoS 보장을 위한 클러스터링 및 라우팅 알고리즘)

  • Kim, Soo-Bum;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.17C no.2
    • /
    • pp.189-196
    • /
    • 2010
  • The LEACH does not use flooding method for data transmission and this makes low power consumption. So performance of the WSN is increased. On the other hand, QoS based algorithm which use restricted flooding method in WSN also achieves low power consuming rate by reducing the number of nodes that are participated in routing path selection. But when the data is delivered to the sink node, the LEACH choose a routing path which has a small hop count. And it leads that the performance of the entire network is worse. In the paper we propose a QoS based energy efficient clustering and routing algorithm in WSN. I classify the type of packet with two classes, based on the energy efficiency that is the most important issue in WSN. We provide the differentiated services according to the different type of packet. Simulation results evaluated by the NS-2 show that proposed algorithm extended the network lifetime 2.47 times at average. And each of the case in the class 1 and class 2 data packet, the throughput is improved 312% and 61% each.

Optimum QoS Classes in Interworking of Next Generation Networks

  • Khoshnevis, Behrouz;Khalaj, Babak H.
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.438-445
    • /
    • 2007
  • In this paper, we consider the problem of optimum selection of quality-of-service(QoS) classes in interworking between the networks in a next-generation-network(NGN) environment. After introducing the delay-cost and loss-cost characteristics, we discuss the time-invariant(TI) and time-variant(TV) scenarios. For the TI case, we show that under nearly lossless transmission condition, each network can make its own optimization regardless of other networks. For the TV case, we present sufficient conditions under which the optimum QoS class of each network can be considered fixed with respect to time without considerable degradation in the optimization target. Therefore, under the conditions presented in this paper, the QoS of a flow in each network can be determined solely by considering the characteristics of that network and this QoS class can be held fixed during the flow period.

Delay-Margin based Traffic Engineering for MPLS-DiffServ Networks

  • Ashour, Mohamed;Le-Ngoc, Tho
    • Journal of Communications and Networks
    • /
    • v.10 no.3
    • /
    • pp.351-361
    • /
    • 2008
  • This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.