• Title/Summary/Keyword: QoS evaluation

Search Result 248, Processing Time 0.042 seconds

ATM Network Survivability Enhancement Scheme using Disjoint VP Groups (분리 VP 그룹을 이용한 ATM 망 생존도 향상 방안)

  • Lee, Gil-Heung;Choe, Yong-Hun;Park, Won-Seo;Lee, Jae-Yong;Lee, Sang-Bae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.949-956
    • /
    • 1999
  • 이 논문에서는 ATM (Asynchronous Transfer Mode) 방식의 초고속망의 장애 발생 시 이용자 연결의 QoS (Quality of Service)를 고려하여 복구할 수 있게 하는 보호 망 설계 방안을 제시한다. 제시한 설계 방안에 기초한 비용과 복구 특성을 분석과 모의 실험을 통해 알아본다. 제안하는 망에서의 복구는 분리 VP 그룹 (Disjoint Virtual Path Group, DVPG) 을 사용하는 상태 독립적 (State- independent) 방식으로 복구된다. ATM 망의 운용 및 보호 VP 할당과 용량 배정 문제를 정의하고 이를 바탕으로 최소의 비용을 갖는 VP 망을 설계한다. 망의 고장 시 기존 노드간의 VP 연결은 미리 할당된 링크 또는 노드 분리 보호 VP 경로를 따라 간단한 복구 알고리즘에 의해 빠르게 복구된다. QoS의 고려는 추가 비용을 필요로 하지만 정확한 이용자 연결의 복구를 실현하며, 분리 VP 그룹의 적용은 비용을 상승시키지만, 빠른 복구와 복수의 고장에 대처할 수 있는 방안이 된다.Abstract A cost evaluation of protection scheme for VP-based ATM network is presented here and its related characteristics are evaluated. The proposed and evaluated scheme is a state-independent restoration scheme using a disjoint path group. For fast and simple restoration of failed connections, link disjoint or node disjoint VP groups (DVPG) were utilized in this paper. A VP assignment and capacity planning problem is formulated. When failure occurs, the failed working VPs are switched to the protection VPs of disjoint path groups with a simple restoration scheme. And, cost evaluation and restoration characteristics are presented. The consideration of multiple QoS (Quality of Service) levels and disjoint path group protection scheme require additional network cost but acquire fit and fast restoration.

Sensitivity of the Pyrenophora teres Population in Algeria to Quinone outside Inhibitors, Succinate Dehydrogenase Inhibitors and Demethylation Inhibitors

  • Lammari, Hamama-Imene;Rehfus, Alexandra;Stammler, Gerd;Benslimane, Hamida
    • The Plant Pathology Journal
    • /
    • v.36 no.3
    • /
    • pp.218-230
    • /
    • 2020
  • Net blotch of barley caused by Pyrenophora teres (Died.) Drechsler, is one of the most destructive diseases on barley in Algeria. It occurs in two forms: P. teres f. teres and P. teres f. maculata. A total of 212 isolates, obtained from 58 fields sampled in several barley growing areas, were assessed for fungicide sensitivity by target gene analysis. F129L and G137R mitochondrial cytochrome b substitution associated with quinone outside inhibitors (QoIs) resistance, and succinate dehydrogenase inhibitors (SDHIs) related mutations (B-H277, C-N75S, C-G79R, C-H134R, and C-S135R), were analyzed by pyrosequencing. In vitro sensitivity of 45 isolates, towards six fungicides belonging to three chemical groups (QoI, demethylase inhibitor, and SDHI) was tested by microtiter technique. Additionally, sensitivity towards three fungicides (azoxystrobin, fluxapyroxad, and epoxiconazole) was assessed in planta under glasshouse conditions. All tested isolates were QoI-sensitive and SDHI-sensitive, no mutation that confers resistance was identified. EC50 values showed that pyraclostrobin and azoxystrobin are the most efficient fungicides in vitro, whereas fluxapyroxad displayed the best disease inhibition in planta (81% inhibition at 1/9 of the full dose). The EC50 values recorded for each form of net blotch showed no significant difference in efficiency of QoI treatments and propiconazole on each form. However, in the case of fluxapyroxad, epoxiconazole and tebuconazole treatments, analysis showed significant differences in their efficiency. To our knowledge, this study is the first investigation related to mutations associated to QoI and SDHI fungicide resistance in Algerian P. teres population, as well as it is the first evaluation of the sensitivity of P. teres population towards these six fungicides.

A Study on Dynamic Provisioning Mechanism for QoS guarantee in DiffServ Networks (DiffServ 망에서 QoS 보장을 위한 동적 프로비저닝 메카니즘 연구)

  • Rhee, Woo-Seop;Lee, Jun-Hwa;Yang, Mi-Jeong;Lee, Il-Woo;Yu, Jae-Hoon;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2B
    • /
    • pp.105-116
    • /
    • 2003
  • The differentiated service architecture is based on a simple model by applying a per-class service in the core node of the network. However, due to the simplified network behavior, the network structure and provisioning were more complicated. If a service provider wants the dynamic provisioning or better bandwidth guarantee, signaling protocol with QoS parameters or admission control method should be deployed in DiffServ network. However, these methods increase the complexity. Therefore, we proposed DPM2 mechanism for admission control in the DiffServ network. In this paper, we describe and survey the admission control methods that are applicable to IP networks and propose also the dynamic provisioning mechanism based on the bandwidth broker and distributed measurement based admission control and movable boundary bandwidth management to support heterogeneous QoS services in differentiated service networks. For the performance evaluation for proposed mechanism, we used ns-2 simulator.

A Priority Allocation Scheme Considering Virtual Machine Scheduling Delays in Xen Environments (Xen 환경에서 스케줄링 지연을 고려한 가상머신 우선순위 할당 기법)

  • Yang, Eun-Ji;Choi, Hyun-Sik;Han, Sae-Young;Park, Sung-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.4
    • /
    • pp.246-255
    • /
    • 2010
  • There exist virtual machine scheduling delays in virtualized environment in which virtual machines share physical resources. Many resource management systems have been proposed to provide better application QoS through monitoring and analyzing application performance and resource utilization of virtual machines. However, those management systems don't consider virtual machine scheduling delays, result in incorrect application performance evaluation and QoS violations In this paper, we propose an application behavior analysis considering the scheduling delays, and a virtual machine priority allocation scheme based on the analysis to improve the application response time by minimizing the overall virtual machine scheduling delays.

Performance Analysis of Adaptive Separated-Queueing ATM Switch for multimedia Services (멀티미디어 서비스를 지원하는 적응적 분리 큐잉 ATM 스위치의 성능분석)

  • Im, Cheol-Su;Park, Byeong-Seop
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.167-174
    • /
    • 1999
  • In this paper, we propose the adaptive separated-queueing ATM switching model for the effective processing of the various types of multimedia traffic by virtue of ATM switching network with multiple outlets which is the essential part of B-ISDN. This proposed model employs the dynamically separated buffering mechanism in the processing of two classes of cell, realtime service traffic and non-realtime service traffic, at the output buffer to enhance the overall QoS(Quality of Service). The adopted ATM switch architecture has Batcher-banyan based network, but it uses different topologies and control techniques 6to resolve the cell contention. For the performance evaluation of our proposed method, we have done both analytical modeling and simulation. The both results show that our proposed queueing strategy is quite appropriate to the ATM switch with multiple outlets and can quarantee the QoS requirements of the incoming multimedia traffic.

  • PDF

Adaptive Admission Control Mechanism in Differentiated Services Network (인터넷 차별 서비스 망에서 적응적 연결 수락 제어 메커니즘)

  • 이준화;양미정;이우섭;김상하
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.83-93
    • /
    • 2003
  • Differentiated service networks, based on bandwidth broker, perform the control and management of QoS provisioning for the QoS guaranteed services, However, the centralized bandwidth broker model has a scalability problem since it has centralized resource management for the admission control function of all call attempts, Therefore, in this paper, we proposea novel adaptive admission control mechanism according to the attempted call status for enhancing the scalability under the centralized bandwidth broker model in IP differentiated service networks, The proposed mechanism decouples the function of admission control from the bandwidth broker, So, the ingress edge node performs the admission control and the bandwidth broker performs the resource management and QoS provisioning, We also introduce an edge-to-edge path concepts and the ingress edge node performs the admission control under the allocated bandwidth to eachpath. The allocated bandwidth per path adaptively varies according to the status of the attempted calls, This mechanism can significantly reduce the number of communication message between the bandwidth broker and each edge node in the network and increase the bandwidth utilization via adaptable resource allocation, In this paper we study the adaptive admission control operation and show the efficient and extensive improvement through the performance evaluation.

Performance Analysis and evaluation of the IEEE 802.11e EDCF (IEEE 802.11e EDCF 성능 분석과 평가)

  • Kim Jong Deok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1356-1366
    • /
    • 2004
  • Recently, the IEEE 802.11 working group has announced a new distributed MAC called EDCF to provide service differentiation among traffic classes. With the increasing demand for supporting Quality of Service in IEEE 802.11 wireless LANs, the EDCF is now attracting many researchers' attention due to its practical worth as a standard mechanism. In this paper, we focus on the analytical approach to evaluate the performance of the EDCF. An analytical model is developed to estimate the throughput of the EDCF in saturation (asymptotic) conditions. Extensive simulation studies have been carried out for the validation of the analysis, and they show that it estimates the throughput of the EDCF accurately By utilizing the analytical model, we evaluate the performance of the EDCF. Specifically, we concentrate on discovering the characteristics of the EDCF Parameters, such as CW/Sub min/, CW/Sub max/ and AIFS, in the way that they influence on the performance of the EDCF.

An Efficient Smoothing Algorithm for Video Transmission at Variable Bit Rate (가변 비트율 비디오 전송을 위한 효율적인 스무딩 알고리즘)

  • Lee Myoun-Jae;Lee Junyong;Park Do-Soon
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.1009-1022
    • /
    • 2004
  • Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. Among them are CHA, MCBA. MVBA, e-PCRTT and others. E-PCRTT algorithm, which was improved from PCRTT, restricts the number of rate changes with fixed-size run. This causes unnecessary rate changes and may not guarantee QoS when buffer size is small. In this paper. a smoothing algorithm is pro-posed, where the number of rate changes are not limited and the size of run can be flexible, in order to overcome the shortcomings of e-PCRTT. Experiments demonstrated that the proposed algorithm such as e-PCRTT. In order to show the performance, var-ious evaluation factors were used such as the nember of rate changes, buffer size to maintain QoS, and so on.

A Performance Evaluation of CF-Poll Piggyback Algorithm for HCCA (HCCA의 CF-Poll 피기백 알고리즘의 성능평가)

  • Lee Hyun-Jin;Kim Jae-Hyun;Cho Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9B
    • /
    • pp.785-791
    • /
    • 2006
  • A CF-Poll frame which contains the channel reservation time can be piggybacked in QoS-Data frame to increase the channel efficiency in HCCA. However, if any QSTA in the network uses the low physical transmission rate, the QoS-Data frame which includes the CF-Poll frame must be transmitted by the minimum transmission rate. Therefore, it can cause the decrease of the channel efficiency and the increase of the frame transmission delay for other traffic streams when any QSTA has the low physical transmission rate. In this paper, we define this phenomenon as the piggyback problem at the low physical transmission rate and evaluate the effect of this problem. In the simulation results, when a CF-Poll piggyback is used, the delay is increased about 25% if any QSTA has the low physical transmission rate, while the delay is decreased about 7.8% if all QSTA has the high physical transmission rate. We also found that the gain of the CF-Poll piggyback mechanism is achieved when all QSTA has higher physical transmission rate than 24 or 36Mbps.

Traffic-based Caching Algorithm and Performance Evaluation for QoS-adaptive Streaming Proxy Server in Wireless Networks (무선 환경에서 QoS 적응적인 스트리밍 프락시 서버를 위한 트래픽 기반 캐싱 알고리즘 및 성능 분석)

  • Kim, HwaSung;Kim, YongSul;Hong, JungPyo
    • Journal of Broadcast Engineering
    • /
    • v.10 no.3
    • /
    • pp.313-320
    • /
    • 2005
  • The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. Multimedia streams typically experience the high start-up delay due to the large protocol overhead, the delay, and the loss properties of the wireless networks. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.