• Title/Summary/Keyword: Fair QoS

Search Result 112, Processing Time 0.027 seconds

A Computationally-Efficient of Fair Queueing without Maintaining the System Virtual Time (시스템 가상시간을 사용하지 않는 효율적인 Fair Queueing)

  • 이준엽;이승형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.9C
    • /
    • pp.836-841
    • /
    • 2002
  • Packet scheduling is an essential function to guarantee a quality of service by differentiating services in the Internet. Scheduling algorithms that have been suggested so far can be devided into Round-Robin methods and Fair Queueing methods Round-Robin methods have the advantage of high-speed processing through simple implementations, while Fair Queueing methods offer accurate services. Fair queueing algorithms, however, have problems of computational overheads and implementation complexity as their schedulers manage the states of every flow. This paper suggests a new method in which each flow performs the calculation in a distributed way to decide the service order. Our algorithm significantly reduces the scheduler's computational overheads while providing the same level of accuracy with the previous Fair Queueing algorithms.

A RSVP-capable Router to improve the bandwidth utilization efficiency in resource reservation (자원 예약에 있어 대역폭 이용 효율을 높일 수 있는 RSVP-라우터)

  • Kim, Tae-Joon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.7
    • /
    • pp.997-1006
    • /
    • 2008
  • SVP-capable router supporting guaranteed services on the internet generally uses a packet scheduler based on the Weighted Fair Queuing(WFQ) algorithm to secure required qualities of traffic flows. In this paper we proposed a RSVP-capable router based on the LOFQ(Latency optimized fair queuing) algorithm that improves the efficiency in bandwidth utilization with keeping the compatibility with the original RSVP procedure. The proposed router reserves the optimal amount of resource for each flow to secure its required quality-of-service with the recently introduced LOFQ scheduler. The results of the simulation applying the proposed router to an evaluation network showed that it may yield the gain of up to 30% compared to that in the original one in terms of the number of admitted flows.

  • PDF

A Weighted Fair Packet Scheduling Method Allowing Packet Loss (패킷 손실을 허용하는 가중치 기반 공정 패킷 스케줄링)

  • Kim, Tae-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1272-1280
    • /
    • 2010
  • WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in condition of no packet loss, and the WFQ guarantees those QoS requirements with the allocated resource. In a practice, however, most QoS-guaranteed services, specially the Voice of IP, allow a few percent of packet loss, so it is strongly desired that the RSVP and WFQ make the best use of this allowable packet loss. This paper enhances the WFQ to allow packet loss and investigates its performance. The performance evaluation showed that allowing the packet loss of 0.4% can improve the flow admission capability by around 40 percent.

Comprehensive Investigations on QUEST: a Novel QoS-Enhanced Stochastic Packet Scheduler for Intelligent LTE Routers

  • Paul, Suman;Pandit, Malay Kumar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.2
    • /
    • pp.579-603
    • /
    • 2018
  • In this paper we propose a QoS-enhanced intelligent stochastic optimal fair real-time packet scheduler, QUEST, for 4G LTE traffic in routers. The objective of this research is to maximize the system QoS subject to the constraint that the processor utilization is kept nearly at 100 percent. The QUEST has following unique advantages. First, it solves the challenging problem of starvation for low priority process - buffered streaming video and TCP based; second, it solves the major bottleneck of the scheduler Earliest Deadline First's failure at heavy loads. Finally, QUEST offers the benefit of arbitrarily pre-programming the process utilization ratio.Three classes of multimedia 4G LTE QCI traffic, conversational voice, live streaming video, buffered streaming video and TCP based applications have been considered. We analyse two most important QoS metrics, packet loss rate (PLR) and mean waiting time. All claims are supported by discrete event and Monte Carlo simulations. The simulation results show that the QUEST scheduler outperforms current state-of-the-art benchmark schedulers. The proposed scheduler offers 37 percent improvement in PLR and 23 percent improvement in mean waiting time over the best competing current scheduler Accuracy-aware EDF.

Load Distribution Method based on Transcoding Time Estimation on Distributed Transcoding Environments (분산 트랜스코딩 환경에서 트랜스코딩 시간 예측 기반 부하 분산 기법)

  • Kim, Jong-Woo;Seo, Dong-Mahn;Jung, In-Bum
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.4
    • /
    • pp.195-204
    • /
    • 2010
  • Due to improved wireless communication technologies, it is possible to provide multimedia streaming service for mobile device clients like PDAs and cellphones. Wireless networks are serviced on low bandwidth channels and mobile devices work on limited hardware specifications. In these conditions, transcoding technologies are needed to adapt the media for streaming services to given mobile environments. To transcode from the source media to the target media for corresponding grades, transcoding servers perform transcoding jobs as exhausting their resources. Since various transcoding loads occur according to the target transconding grades, an effective transcoding load balancing policy is required among transcoding servers. In addition to transcoding process, servers should maintain QoS streams for mobile clients for total serviced times. It requires real-time requirements to support QoS for various mobile clients. In this paper, a new transcoding load distribution method is proposed. The proposed method can be driven for fair load balance between distributed transcoding servers. Based on estimated transcoding time, movie information and target transcoding bit-rate, it provides fair transcoding load distribution and also performs admission control to support QoS streams for mobile clients.

Algorithm of GTS Time Slots Allocation Based on Weighted Fair Queuing in Environments of WBAN (WBAN 환경에서 Weighted Fair Queuing 기반의 GTS 타임 슬롯 할당 알고리즘)

  • Kim, Kyoung-Mok;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.45-56
    • /
    • 2011
  • WBAN is short range wireless communication technology which is consists of several small devices close to, attached to or implanted into the human body. WBAN is classified into between medical and non-medical by applications based on technology and medical data with periodic characteristics is used the GTS method for transmitting data to guarantee the QoS. In this paper we proposed algorithm that resolve lack of GTSs while data transmit GTS method in superframe structure of WBAN. Coordinator dynamically allocates GTSs according to the data rate of devices and make devices share GTSs when lack of GTSs. We compared delay bounds, throughput for performance evaluation of the proposed algorithm. In other words, we proposed algorithm adaptive WFQ scheduling that GTS allocation support differential data rate in environments of WBAN. The experiment results show the throughput increased and the maximum delay decreased compared with Round Robin scheduling.

A Game Theoretic Cross-Layer Design for Resource Allocation in Heterogeneous OFDMA Networks

  • Zarakovitis, Charilaos C.;Nikolaros, Ilias G.;Ni, Qiang
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.1
    • /
    • pp.50-64
    • /
    • 2012
  • Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

  • PDF

A Study of the Method for Subscriber-Aware and Fair Aggregation Scheme in Ethernet (이더넷에서 가입자 구별 및 공평한 접선에 관한 연구)

  • Kwon Tae-Hyun;Park Jong-Su;Park Dae-Geun;Lee Yong-Surk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7B
    • /
    • pp.602-607
    • /
    • 2006
  • A subscriber-oriented service became necessary for the QoS management due to the development of network. BcN(Broadband convergence Network) which incorporates communication, broadcasting and internet not only improves the quality of the communication and broadcasting service but also. aims at broadband service. Therefore, QoS management for each subscriber becomes more important. Not yet, however, the discussion for the subscriber oriented QoS management is not activated. Although, there are several techniques for subscriber distinction using flow information, IP information or MAC information, but they are only processed in layer 3 network. Actually, it is impossible to manage QoS of all subscriber's in layer 3 network. In this paper, we propose a method for QoS management scheme that does not need additional processes or large hardware in layer 2 network and analyze efficiency and overheads. We propose the first subscriber-oriented service method in layer 2 network that is applicable to either existing network or BcN.

Throughput-based fair bandwidth allocation in OBS networks

  • Le, Van Hoa;Vo, Viet Minh Nhat;Le, Manh Thanh
    • ETRI Journal
    • /
    • v.40 no.5
    • /
    • pp.624-633
    • /
    • 2018
  • Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.

A Study on the Performance Analysis and synthesis for a Differentiated Service Networks (차등 서비스 네트워크에 대한 성능 분석과 합성에 대한 연구)

  • Jeon, Yong-Hui;Park, Su-Yeong
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.123-134
    • /
    • 2002
  • The requirement for QoS (Quality of Service) has become an important Issue as real-time or high bandwidth services are increasing, such as Internet Telephony, Internet broadcasting, and multimedia service etc. In order to guarantee the QoS of Internet application services, several approaches are being sought including IntServ (Integrated Service) DiffServ(Differentiated Srvices), and MPLS(Multi-Protocol Label Switching). In this paper, we describe the performance analysis of QoS guarantee mechanism using the DiffServ. To analyze how the DiffServ performance was affected by diverse input traffic models and the weight value in WFQ(Weighted Fair Queueing), we simulated and performed performance evaluation under a random, bursty, and self-similar input traffic models and for diverse input parameters. leased on the results of performance analysis, it was confirmed that significant difference exist in packet delay and loss depending on the input traffic models used. However, it was revealed that QoS guarantee is possible to the EF (expedited Forwarding) class and the service separation between RF and BE (Best Effort) classes may also be achieved. Next, we discussed the performance synthesis problem. (i. e. derived the conservation laws for a DiffServ networks, and analysed the performance variation and dynamic behavior based on the resource allocation (i.e., weight value) in WFQ.