• Title/Summary/Keyword: Network Adaptive QoS

Search Result 186, Processing Time 0.021 seconds

The Performance Experiments on the Tactical Data Communication over the Legacy Radio Systems (기존 전술 무전기를 이용한 전술 데이터 통신 성능 실험)

  • Sim, Dong-Sub;Kang, Kyeong-Sung;Kim, Ki-Hyung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.2
    • /
    • pp.243-251
    • /
    • 2010
  • The military has been putting great efforts into applying data communication on existing voice communication systems being used in NCW(Network Centric Warfare). Data communication will be an effective choice in one of many effort to yield a minimum kill chain, comparing to legacy voice communications, when tactical units conduct their missions. However, the required budget will be enormous, in case of the replacement of a lot of legacy communication systems with new one. As a cost-effective alternative, the tactical data communication systems using the conventional radio systems instead of the development of new radio systems has been proposed. It is mandatory, though, to ensure QoS while maintaining data communication by making use of legacy radio systems already in use. This paper focuses on the performance issues experimented and analyzed for tactical data communication through the legacy radio systems as the first step towards guaranteed QoS. We have conducted various experiments such as the transmission error rate on certain tactical messages, performance evaluation of redundant transfers, the relationship between the transmission frame size and rate of error, the identification of error points in the transmission frame, and techniques to reduce the errors in both hopping and non-hopping modes. As a result of the performance experiments, The adaptive communication module which decides the redundant transmission or the Forward Error Correction(FEC) technique by analyzing channel status and current transmission status(hopping/non-hopping) of the legacy radio should be designed. the FEC technique in non-hopping, and the redundant transmission technique in hopping mode was recommended from the result of experiment with the frame size is 20bytes in non-hopping and 10Bytes frame size in hopping mode.

An Adaptive FEC Mechanism Using Crosslayer Approach to Enhance Quality of Video Transmission over 802.11 WLANs

  • Han, Long-Zhe;Park, Sung-Jun;Kang, Seung-Seok;In, Hoh-Peter
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.3
    • /
    • pp.341-357
    • /
    • 2010
  • Forward Error Correction (FEC) techniques have been adopted to overcome packet losses and to improve the quality of video delivery. The efficiency of the FEC has been significantly compromised, however, due to the characteristics of the wireless channel such as burst packet loss, channel fluctuation and lack of Quality of Service (QoS) support. We propose herein an Adaptive Cross-layer FEC mechanism (ACFEC) to enhance the quality of video streaming over 802.11 WLANs. Under the conventional approaches, FEC functions are implemented on the application layer, and required feedback information to calculate redundancy rates. Our proposed ACFEC mechanism, however, leverages the functionalities of different network layers. The Automatic Repeat reQuest (ARQ) function on the Media Access Control (MAC) layer can detect packet losses. Through cooperation with the User Datagram Protocol (UDP), the redundancy rates are adaptively controlled based on the packet loss information. The experiment results demonstrate that the ACFEC mechanism is able to adaptively adjust and control the redundancy rates and, thereby, to overcome both of temporary and persistent channel fluctuations. Consequently, the proposed mechanism, under various network conditions, performs better in recovery than the conventional methods, while generating a much less volume of redundant traffic.

Adaptive Differentiated Integrated Routing Scheme for GMPLS-based Optical Internet

  • Wei, Wei;Zeng, Qingji;Ye, Tong;Lomone, David
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.269-279
    • /
    • 2004
  • A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

Design and Implementation of Network Adaptive Streaming through Needed Bandwidth Estimation (요구대역 측정을 통한 네트워크 적응형 스트리밍 설계 및 구현)

  • Son, Seung-Chul;Lee, Hyung-Ok;Kwag, Yong-Wan;Yang, Hyun-Jong;Nam, Ji-Seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3B
    • /
    • pp.380-389
    • /
    • 2010
  • Since the internet is intend to be the best effort service, the system that stream a large amount of high quality medias need a techniques to overcome the network status for implementation. In this paper, we design and implement a method that estimate quickly whether network permits the needed bandwidth of media and a method that control QoS through that. Presented system uses Relative One-Way Delay(ROWD) trend in the case of the former, and leverages temporal encoding among Scalable Video Coding(SVC) that is apt to apply real time comparatively in the case of the latter. The streaming server classifies the medias by real time to several rates and begins transmission from top-level and is reported ROWD trend periodically from the client. In case of the server reported only 'Increase Trend', the sever decides that the current media exceeds the available bandwidth and downgrades the next media level. The system uses probe packet of difference quantity of the target level and the present level for upgrading the media level. In case of the server reported only 'No Increase Trend' by the ROWD trend response of the probe packet from client, the media level is upgraded. The experiment result in a fiber to the home(FTTH) environment shows progress that proposed system adapts faster in change of available bandwidth and shows that quality of service also improves.

A Study on an Adaptive UPC Algorithm Based on Traffic Multiplexing Information in ATM Networks (ATM 망에서 트래픽 다중화 정보에 의한 적응적 UPC 알고리즘에 관한 연구)

  • Kim, Yeong-Cheol;Byeon, Jae-Yeong;Seo, Hyeon-Seung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2779-2789
    • /
    • 1999
  • In this paper, we propose a new neural Buffered Leaky Bucket algorithm for preventing the degradation of network performance caused by congestion and dealing with the traffic congestion in ATM networks. We networks. We justify the validity of the suggested method through performance comparison in aspects of cell loss rate and mean transfer delay under a variety of traffic conditions requiring the different QoS(Quality of Service). also, the cell scheduling algorithms such as DWRR and DWEDF used for multiplexing the incoming traffics are induced to get the delay time of the traffics fairly. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate is changed by the predicted values. The prediction of traffic loss rate by neural networks can effectively reduce the cell loss rate and the cell transfer delay of next incoming cells and be applied to other traffic control systems. Computer simulation results performed for traffic prediction show that QoSs of the various kinds of traffics are increased.

  • PDF

A Novel Adaptive Routing Scheme for the QoS-Based Multimedia Services in Mobile Ad-Hoc Networks

  • Lee, Chang-Bum;Kim, Young-Woong;Soh, Surng-Ryurl;Kim, Yung-Kwon
    • Journal of IKEEE
    • /
    • v.4 no.2 s.7
    • /
    • pp.281-287
    • /
    • 2000
  • A mobile ad-hoc network is composed of only mobile nodes, which are distributed dynamically, without any wired backbone or centralized entities. Since the existing works on ad-hoc routing protocol are mostly biased toward a military application, we need a new routing scheme for a support of multimedia services in mobile ad-hoc networks. Therefore, we propose a novel scheme that can support a variety of traffic attributes and can be applicable to high-speed and multimedia data services in mobile ad-hoc networks by using adaptive transmission power level. As a result of simulation, the proposed scheme has better performance than conventional method, which is performed with uniform transmission power level, in view of route query delay time.

  • PDF

Packet Loss Fair Scheduling Scheme for Real-Time Traffic in OFDMA Systems

  • Shin, Seok-Joo;Ryu, Byung-Han
    • ETRI Journal
    • /
    • v.26 no.5
    • /
    • pp.391-396
    • /
    • 2004
  • In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short-term fairness as well as long-term fairness for various real-time traffic.

  • PDF

A Context-based Adaptive Multimedia Streaming Scheme in IoT Environments (IoT 환경에서 컨텍스트 기반 적응적 멀티미디어 스트리밍 기법)

  • Seong, Chaemin;Hong, Seongjun;Lim, Kyungshik
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.7
    • /
    • pp.1166-1178
    • /
    • 2016
  • In Internet of Things (IoT) environments, billions of interconnected devices and multimedia sensors generate a huge amount of multimedia traffic. Since the environment are in general deployed as a server-centric architecture wireless sensor networks could be bottlenecks between IoT gateways and IoT devices. The bottleneck causes high power consumption of the device and triggers very heavy network overload by transmission of sensing data. The deterioration could decrease the quality of multimedia streaming service due to delay, loss, and waste of device power. Thus, in this paper, we propose a context-based adaptive multimedia streaming scheme to support enhanced QoS and low power consumption in IoT environments. The goal of the scheme is to increase quality score per voltage of the streaming service, given an adaptation algorithm with context that are classified network and hardware such as throughput, RTT, and CPU usage. From the both context, the quality score per voltage is used in the comparison of a only network context-based adaptive multimedia streaming scheme, a fixed multimedia streaming and our scheme. As a result, we achieves a high improvement that means the quality score per voltage is increased up to about 4, especially in case of resolution change.

Performance Analysis of Random Early Dropping Effect at an Edge Router for TCP Fairness of DiffServ Assured Service

  • Hur Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.255-269
    • /
    • 2006
  • The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

Role-based Self-Organization Protocol of Clustering Hierarchy for Wireless Sensor Networks (무선 센서 네트워크를 위한 계층형 클러스터링의 역할 기반 자가 구성 프로토콜)

  • Go, Sung-Hyun;Kim, Hyoung-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.6
    • /
    • pp.137-145
    • /
    • 2008
  • In general, a large-scale wireless sensor network(WSNs) is composed of hundreds of or thousands of sensor nodes. In this large-scale wireless sensor networks, it is required to maintain and manage the networks to lower management cost and obtain high energy efficiency. Users should be provided with sensing service at the level of quality for users through an efficient system. In evaluating the result data quality provided from this network to users, the number of sensors related to event detection has an important role. Accordingly, the network protocol which can provide proper QoS at the level of users demanding quality should be designed in a way such that the overall system function has not to be influenced even if some sensor nodes are in error. The energy consumption is minimized at the same time. The protocol suggested in this article is based on the LEACH protocol and is a role-based self-Organization one that is appropriate for large-scale networks which need constant monitoring.

  • PDF