• Title/Summary/Keyword: quality-of-service, QoS

Search Result 1,469, Processing Time 0.029 seconds

Resource Reservation for Hose model in Virtual Private Networks (VPN Hose 모델을 지원하기 위한 자원 예약 방안)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.328-330
    • /
    • 2005
  • 현재의 RSVP-TE는 VPN hose provisioning 메커니즘들을 고려하여 자원예약을 수행하지 못한다. 이 논문에서는 Provider Provisioned-Virtual Private Network(PP-VPN)에서 Quality of Service(QoS)를 제공하는 Hose 모델 기반의 provisioning 메커니즘들을 네트워크에 적용하여 자원예약을 수행하도록 하기 위해 Resource Reservation Protocol Traffic Engineering(RSVP-TE)의 확장방안에 대해 설명한다. 동일한 VPN을 서비스하는 LSP들 간 자원을 공유할 수 있게 함으로써 네트워크 상에 요구되는 자원을 최적화하였으며, VPN 고객을 서비스하기 위한 효율적이고 자동적인 자원예약이 가능하도록 하였다. 이 논문에서는 솔루션의 프로토콜 elements와 procedure에 대하여 설명한다.

  • PDF

A Flexible Multi-Threshold Based Control of Server Power Mode for Handling Rapidly Changing Loads in an Energy Aware Server Cluster (에너지 절감형 서버 클러스터에서 급변하는 부하 처리를 위한 유연한 다중 임계치 기반의 서버 전원 모드 제어)

  • Ahn, Taejune;Cho, Sungchoul;Kim, Seokkoo;Chun, Kyongho;Chung, Kyusik
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.9
    • /
    • pp.279-292
    • /
    • 2014
  • Energy aware server cluster aims to reduce power consumption at maximum while keeping QoS(quality of service) as much as energy non-aware server cluster. In the existing methods of energy aware server cluster, they calculate the minimum number of active servers needed to handle current user requests and control server power mode in a fixed time interval to make only the needed servers ON. When loads change rapidly, QoS of the existing methods become degraded because they cannot increase the number of active servers so quickly. To solve this QoS problem, we classify load change situations into five types of rapid growth, growth, normal, decline, and rapid decline, and apply five different thresholds respectively in calculating the number of active servers. Also, we use a flexible scheme to adjust the above classification criterion for multi threshold, considering not only load change but also the remaining capacity of servers to handle user requests. We performed experiments with a cluster of 15 servers. A special benchmarking tool called SPECweb was used to generate load patterns with rapid change. Experimental results showed that QoS of the proposed method is improved up to the level of energy non-aware server cluster and power consumption is reduced up to about 50 percent, depending on the load pattern.

A Protocol Interface for Energy-efficient Network Management in Ubiquitous Sensor Networks (유비쿼터스 센서네트워크에서 에너지 효율적인 망관리 프로토콜 인터페이스)

  • Kim, Byoung-Kug;Hur, Kyeong;Eom, Doo-Seop
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1221-1234
    • /
    • 2010
  • MANET(Mobile Ad-hoc Network)s have been researched primary at routing protocols and at the guarantees of QoS(Quality of Service) for mobile environments. Otherwise the Ubiquitous Sensor Networks (USNs) have some limitations in power energies and in processing of sensing data, as well as their network topologies are frequently changed by fading off and node failures. Thus we should redesign network protocols with concerning to energy efficiency for the USNs above all. In this paper, we focus on the protocol interface for managing for USNs based on the surveys. And then we figure the topology of USNs out and design the network protocol interface to make power saved, with data gathering and processing more efficient using our designed packet structures.

Performance Analysis of a Congestion cControl Mechanism Based on Active-WRED Under Multi-classes Traffic (멀티클래스 서비스 환경에서 Active-WRED 기반의 혼잡 제어 메커니즘 및 성능 분석)

  • Kim, Hyun-Jong;Kim, Jong-Chan;Choi, Seong-Gon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.125-133
    • /
    • 2008
  • In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.

A Method of Data Transmission for Performance Improvement of Real Time GNSS Data Processing in Multi-Reference Network Station (다중 수신국 실시간 위성항법데이터 처리 성능향상을 위한 데이터 송·수신 설계)

  • Kim, Gue-Heon;Son, Minhyuk;Lee, Eunsung;Heo, Moon-Beom
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.20 no.4
    • /
    • pp.39-44
    • /
    • 2012
  • This paper propose a transmission method for "Transportation system" that can decide precise position under wide area road traffic environment. For precise position detecting, central station collect multiple receiver station's satellite navigation data and generate correction information. In this process, we need efficient real time transmission method for satellite navigation message that has variable data size. We propose real time data transmission method. This real time transmission method offer efficient processing structure for multiple receiver station's satellite navigation message. This paper explains proposed real time transmission method and proofs this transmission method.

The Implementation of Communication Protocol for Semiconductor Equipments with Priority of Data Traffic (데이터 트래픽의 우선 순위를 갖는 반도체 장비 통신 프로토콜 구현)

  • Kim, Doo Yong;Kim, Kiwan;Cho, Hyun Chan
    • Journal of the Semiconductor & Display Technology
    • /
    • v.11 no.4
    • /
    • pp.13-18
    • /
    • 2012
  • The semiconductor equipments generate a lot of data traffic via communication channels for the effective manufacturing processes of semiconductors and for the automation of semiconductor equipments. These data should be sent to a host computer in order to keep in a safe. The IEEE 802.11e specification gives differentiated and distributed access to a wireless communication medium with four access categories. These four access categories use different priority parameters which lead to quality of service in data traffic. In this paper, it is shown that the throughput of data depends upon the priority parameters provided by IEEE802.11e. We implement the usage of priority parameters in the SECS protocol for semiconductor equipments. It is necessary that the data from semiconductor equipments should be classified with certain priority for the effective use of our proposed method. Therefore, our scheme will contribute to improving the performance of the manufacturing processes of semiconductors.

A Novel Cross-Layer Dynamic Integrated Priority-Computing Scheme for 3G+ Systems

  • Wang, Weidong;Wang, Zongwen;Zhao, Xinlei;Zhang, Yinghai;Zhou, Yao
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.15-20
    • /
    • 2012
  • As Internet protocol and wireless communications have developed, the number of different types of mobile services has increased gradually. Existing priority-computing schemes cannot satisfy the dynamic requirements of supporting multiple services in future wireless communication systems, because the currently used factors, mainly user priority, are relatively simple and lack relevancy. To solve this problem and provide the desired complexity, dynamic behavior, and fairness features of 3G and beyond 3G mobile communication systems, this paper proposes a novel cross-layer dynamic integrated priority-computing scheme that computes the priority based on a variety of factors, including quality of service requirements, subscriber call types, waiting time, movement mode, and traffic load from the corresponding layers. It is observed from simulation results that the proposed dynamic integrated priority scheme provides enhanced performance.

Resource allocation in downlink SWIPT-based cooperative NOMA systems

  • Wang, Longqi;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.20-39
    • /
    • 2020
  • This paper considers a downlink multi-carrier cooperative non-orthogonal multiple access (NOMA) transmission, where no direct link exists between the far user and the base station (BS), and the communication between them only relies on the assist of the near user. Firstly, the BS sends a superimposed signal of the far and the near user to the near user, and then the near user adopts simultaneous wireless information and power transfer (SWIPT) to split the received superimposed signal into two portions for energy harvesting and information decoding respectively. Afterwards, the near user forwards the signal of the far user by utilizing the harvested energy. A minimum data is required to ensure the quality of service (QoS) of the far user. We jointly optimize power allocation, subcarrier allocation, time allocation, the power allocation (PA) coefficient and the power splitting (PS) ratio to maximize the number of data bits received at the near user under the energy causality constraint, the minimum data constraint and the transmission power constraint. The block-coordinate descent method and the Lagrange duality method are used to obtain a suboptimal solution of this optimization problem. In the final simulation results, the superiority of the proposed NOMA scheme is confirmed compared with the benchmark NOMA schemes and the orthogonal multiple access (OMA) scheme.

Study on a Neural UPC by a Multiplexer Information in ATM (ATM 망에서 다중화기 정보에 의한 Neural UPC에 관한 연구)

  • Kim, Young-Chul;Pyun, Jae-Young;Seo, Hyun-Seung
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.7
    • /
    • pp.36-45
    • /
    • 1999
  • In order to control the flow of traffics in ATM networks and optimize the usage of network resources, an efficient control mechanism is necessary to cope with congestion and prevent the degradation of network performance caused by congestion. In this paper, Buffered Leaky Bucket which applies the same control scheme to a variety of traffics requiring the different QoS(Quality of Service) and Neural Networks lead to the effective buffer utilization and QoS enhancement in aspects of cell loss rate and mean transfer delay. And the cell scheduling algorithms such as DWRR and DWEDF for multiplexing the incoming traffics are enhanced to get the better fair delay. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate and buffer threshold are changed by the predicted values. The prediction of traffic loss rate by neural networks can enhance efficiency in controlling the cell loss rate and cell transfer delay of next incoming cells and also be applied for other traffic controlling schemes. Computer simulation results performed for random cell generation and traffic prediction show that QoSs of the various kinds of traffcis are increased.

  • PDF

Pareto Optimized EDCA Parameter Control for Wireless Local Area Networks

  • Kim, Minseok;Oh, Wui Hwan;Chung, Jong-Moon;Lee, Bong Gyou;Seo, Myunghwan;Kim, Jung-Sik;Cho, Hyung-Weon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3458-3474
    • /
    • 2014
  • The performance of IEEE 802.11e enhanced distributed channel access (EDCA) is influenced by several interactive parameters that make quality of service (QoS) control complex and difficult. In EDCA, the most critical performance influencing parameters are the arbitration interframe space (AIFS) and contention window size (CW) of each access category (AC). The objective of this paper is to provide a scheme for parameter control such that the throughput per station as well as the overall system throughput of the network is maximized and controllable. For this purpose, a simple and accurate analytical model describing the throughput behavior of EDCA networks is presented in this paper. Based on this model, the paper further provides a scheme in which a Pareto optimal system configuration is obtained via an appropriate CW control for a given AIFS value, which is a different approach compared to relevant papers in the literature that deal with CW control only. The simulation results confirm the effectiveness of the proposed method which shows significant performance improvements compared to other existing algorithms.