• Title/Summary/Keyword: QoS Guarantees

Search Result 156, Processing Time 0.022 seconds

A Comprehensive Analysis of the End-to-End Delay for Wireless Multimedia Sensor Networks

  • Abbas, Nasim;Yu, Fengqi
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.6
    • /
    • pp.2456-2467
    • /
    • 2018
  • Wireless multimedia sensor networks (WMSNs) require real-time quality-of-service (QoS) guarantees to be provided by the network. The end-to-end delay is very critical metric for QoS guarantees in WMSNs. In WMSNs, due to the transmission errors incurred over wireless channels, it is difficult to obtain reliable delivery of data in conjunction with low end-to-end delay. In order to improve the end-to-end delay performance, the system has to drop few packets during network congestion. In this article, our proposal is based on optimization of end-to end delay for WMSNs. We optimize end-to-end delay constraint by assuming that each packet is allowed fixed number of retransmissions. To optimize the end-to-end delay, first, we compute the performance measures of the system, such as end-to-end delay and reliability for different network topologies (e.g., linear topology, tree topology) and against different choices of system parameters (e.g., data rate, number of nodes, number of retransmissions). Second, we study the impact of the end-to-end delay and packet delivery ratio on indoor and outdoor environments in WMSNs. All scenarios are simulated with multiple run-times by using network simulator-2 (NS-2) and results are evaluated and discussed.

QoS and Multi-Class Service Provisioning with Distributed Call Admission Control in Wireless ATM Networks (무선 ATM망에서 QoS와 다중 서비스를 지원하는 분산된 호 수락 제어 알고리즘과 성능 분석)

  • Jeong, Da-Ip;Jo, Yeong-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.2
    • /
    • pp.45-53
    • /
    • 2000
  • In wireless environment, due to the limited capacity of radio channels it is not easy to guarantee QoS provisioning to mobile users. Therefore, one of the key problems to support broadband multimedia multi-services in wireless ATM networks is to study an effective call admission control(CAC). The purpose of this paper is to propose a distributed CAC scheme that guarantees multi QoS and multi-class service. Control parameters of the proposed scheme are QoS threshold and channel overload probability. With these parameter control, we show that the scheme can guarantee the requested QoS to both new and handover calls. In the scheme, channels are allocated dynamically, and QoS measurements are made in a distributed manner. We show that by providing variable data rate to calls it can effectively prohibit the QoS degradation even if there are severe fluctuations of network traffic. We compare the proposed CAC scheme to the well-known schemes such as guard band call admission control scheme. Through numerical examples and simulations, the proposed scheme is shown to improve the performance by lowering the probability of handover call dropping

  • PDF

QoS-based P2P Streaming Protocol (QoS 기반이 P2P 스트리밍 프로토콜)

  • Park, Seung-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1571-1579
    • /
    • 2009
  • This paper proposes a P2P(Peer-to-Peer) streaming protocol which allows various QoS(Qualify of Service) requirements of video streaming to be supported for various personal IPTV applications in ubiquitous Internet environments. The proposed P2P streaming protocol takes fairly short startup delay, guarantees end-to-end delay bound and bandwidth requirements, and supports reliability level of video streaming for an IPTV application. The QoS-based P2P streaming protocol can properly use not only the advantages of scalability, availability, and ubiquity of P2P streaming but also complement its disadvantages of performance and reliability so that various types of personal IPTV applications can be properly implemented in the existing broadband Internet environments.

Implementation of SLA Management System for QoS Guarantee in Cloud Computing Environment (클라우드 환경에서 QoS 보장을 위한 SLA 관리시스템 구현)

  • Yoon, Ka-Ram;Lee, Bong-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.302-308
    • /
    • 2013
  • Internet is becoming more common with increasing cloud services have been spreading rapidly. A SLA is agreements between service providers and customers of service providers is how to ensure quality of service. SLA in cloud computing environments from the perspective of the IT service providers to customer satisfaction increase for service quality, it will need to differentiate between competing carriers QoS guarantees with SLA is a very important factor. However, the study of SLA in the cloud is staying in its infancy. In this paper, SLA indices for cloud services defining and use them SLA Management System for QoS guarantee has been implemented. The proposed system using monitoring-based migration policy an open source-based cloud computing platform which Cluster Nodes load distribution of virtual machines assigned to their availability, response time, throughput analysis of what affects and is compared with existing cloud.

Mobility and QoS Support in 4G Wireless Networks

  • Kim Taehyoun;Lee Jaiyong
    • Journal of Communications and Networks
    • /
    • v.7 no.2
    • /
    • pp.178-191
    • /
    • 2005
  • Fourth-generation (4G) wireless networks will be the IP-based cellular networks integrating Internet with the existing cellular networks. Two important issues should be concerned in the IP-based cellular networks, IP mobility, and quality-of-service (QoS) guarantees. In this paper, we proposed two mechanisms to solve the problems with IP mobility and RSVP-based QoS provisioning. First, virtual-IP (VIP) allocation scheme in areas with a large rate of handoff can minimize the wireless signaling overhead due to IP mobility. The access routers (ARs) create dynamically the VIP zone by using the measured handoff rate derived from the history of the handoff into neighboring ARs. We show that VIP allocation scheme reduces the binding update messages in the wireless link than hierarchical mobile IPv6. Second, the new advance resource reservation protocol called proportional aggregate RSVP (PA-RSVP) can minimize waste of bandwidth and soft state refresh overhead due to IP mobility. It allocates the bandwidth in advance between the mobility anchor point and neighboring ARs using proportional aggregate reservation. We also show that PA-RSVP provides an improved performance over existing protocols.

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.

Minority First Gateway for Protecting QoS of Legitimate Traffic from Intentional Network Congestion (인위적인 네트워크 혼잡으로부터 정상 트래픽의 서비스 품질을 보호하기 위한 소수자 우선 게이트웨이)

  • Ann Gae-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7B
    • /
    • pp.489-498
    • /
    • 2005
  • A Denial of Sewice (DoS) attack attempts to prevent legitimate users of a sewice from being adequately served by monopolizing networks resources and, eventually, resulting in network or system congestion. This paper proposes a Minority First (MF) gateway, which is capable of guaranteeing the Quality of Service (QoS) of legitimate service traffic under DoS situations. A MF gateway can rapidly determine whether an aggregated flow is a congestion-inducer and can protect the QoS of legitimate traffic by providing high priority service to the legitimate as aggregate flows, and localize network congestion only upon attack traffic by providing low priority to aggregate flows regarded as congestion-inducer. We verify through simulation that the suggested mechanism possesses excellence in that it guarantees the QoS of legitimate traffic not only under a regular DoS occurrence, but also under a Distributed DoS (DDoS) attack which brings about multiple concurrent occurrences of network congestion.

Flow Aggregation of Rate Controlled Round-Robin Scheduler

  • Kim, Ki-Cheon
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.351-359
    • /
    • 2004
  • Flow aggregation is a scalable method to provide quality of service (QoS) guarantees to a large number of flows economically. A round-robin scheduler is an efficient scheduling algorithm. We investigate flow aggregation using a round-robin scheduler and propose the use of periodic timer interrupts for rate control of the round-robin scheduler. The proposed flow aggregator is a single-stage scheduler compared to Cobb's two-stage flow aggregator consisting of an aggregator and non-aggregating scheduler. It is possible to implement flow aggregation in the existing routers with only a software upgrade. We also present a simulation study showing the delay behaviors of the proposed algorithm.

  • PDF

A Shared Buffer-Constrained Topology Reconfiguration Scheme in Wavelength Routed Networks

  • Youn, Chan-Hyun;Song, Hye-Won;Keum, Ji-Eun
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.725-732
    • /
    • 2005
  • The reconfiguration management scheme changes a logical topology in response to changing traffic patterns in the higher layer of a network or the congestion level on the logical topology. In this paper, we formulate a reconfiguration scheme with a shared buffer-constrained cost model based on required quality-of-service (QoS) constraints, reconfiguration penalty cost, and buffer gain cost through traffic aggregation. The proposed scheme maximizes the derived expected reward-cost function as well as guarantees the required flow's QoS. Simulation results show that our reconfiguration scheme significantly outperforms the conventional one, while the required physical resources are limited.

  • PDF

VoIP QoS Network Modeling using Network Simulator (네트워크 시뮬레이터를 이용한 PESQ 기반 VoIP QoS 보장 네트워크 조건 모델링)

  • Kim, Sun-mi;Kim, Jong-seong;An, Suk-hwan
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.5 no.3
    • /
    • pp.110-116
    • /
    • 2012
  • As rapid development of the Internet, there are increasing interests about quality of service of VoIP using the Internet network and established PSTN. There was some study going on to improve the quality of service from the point of view of supplier's mainly. However recently, the demand for setting up the objective standards that service provider can offer to customers is needed as the interests from customers has been going up. In this study, we analysed the results from the test using PESQ which is a parameter of quality of service. we offer the conditions of network which guarantees the minimum quality of phone call using VoIP.