• Title/Summary/Keyword: QoS : Quality of Service

Search Result 1,467, Processing Time 0.03 seconds

SE-CAC: A Novel Call Admission Control Scheme for Multi-service IDMA Systems

  • Ge, Xin;Liu, Gongliang;Mao, Xingpeng;Zhang, Naitong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.5
    • /
    • pp.1049-1068
    • /
    • 2011
  • In this paper a simple and effective call admission control (CAC) scheme is proposed for the emerging interleave-division multiple-access (IDMA) systems, supporting a variety of traffic types and offering different quality of service (QoS) requirements and priority levels. The proposed scheme is signal-to-interference-plus-noise ratio (SINR) evolution based CAC (SE-CAC). The key idea behind the scheme is to take advantage of the SINR evolution technique in the process of making admission decisions, which is developed from the effective chip-by-chip (CBC) multi-user detection (MUD) process in IDMA systems. By virtue of this semi-analytical technique, the MUD efficiency can be estimated accurately. Additionally, the computational complexity can be considerably reduced. These features make the scheme highly suitable for IDMA systems, which can combat intra-cell interference efficiently with simple CBC MUD. Analysis and simulation results show that compared to the traditional CAC scheme considering MUD efficiency as a constant, the proposed SE-CAC scheme can guarantee high power efficiency and throughput for multimedia traffic even in heavy load conditions, illustrating the high efficiency of CBC MUD. Furthermore, based on the SINR evolution, the SE-CAC can make accurate estimation of available resource considering the effect of MUD, leading to low outage probability as well as low blocking and dropping probability.

Unified Model for Performance Analysis of IEEE 802.11 Ad Hoc Networks in Unsaturated Conditions

  • Xu, Changchun;Gao, Jingdong;Xu, Yanyi;He, Jianhua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.683-701
    • /
    • 2012
  • IEEE 802.11 standard has achieved huge success in the past decade and is still under development to provide higher physical data rate and better quality of service (QoS). An important problem for the development and optimization of IEEE 802.11 networks is the modeling of the MAC layer channel access protocol. Although there are already many theoretic analysis for the 802.11 MAC protocol in the literature, most of the models focus on the saturated traffic and assume infinite buffer at the MAC layer. In this paper we develop a unified analytical model for IEEE 802.11 MAC protocol in ad hoc networks. The impacts of channel access parameters, traffic rate and buffer size at the MAC layer are modeled with the assistance of a generalized Markov chain and an M/G/1/K queue model. The performance of throughput, packet delivery delay and dropping probability can be achieved. Extensive simulations show the analytical model is highly accurate. From the analytical model it is shown that for practical buffer configuration (e.g. buffer size larger than one), we can maximize the total throughput and reduce the packet blocking probability (due to limited buffer size) and the average queuing delay to zero by effectively controlling the offered load. The average MAC layer service delay as well as its standard deviation, is also much lower than that in saturated conditions and has an upper bound. It is also observed that the optimal load is very close to the maximum achievable throughput regardless of the number of stations or buffer size. Moreover, the model is scalable for performance analysis of 802.11e in unsaturated conditions and 802.11 ad hoc networks with heterogenous traffic flows.

A resource reservation method adjusting the delay budgets of a traffic flow allocated to the RSVP-capable routers (RSVP-라우터에 할당되는 트래픽 흐름의 지연규격을 조정하는 자원예약 방식)

  • Kim, Tae-Joon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.7
    • /
    • pp.966-976
    • /
    • 2008
  • Providing Quality-of-Service(QoS) guarantee requires the reservation of resource needed to accommodate the traffic flow of service for which resource reservation protocol(RSVP) was introduced. However, if any RSVP-capable router on the path fails to accommodate the traffic flow due to lack of resource, the flow is not allowed no matter how much surplus resources other routers on the path have. In order to solve this problem, this paper proposes a resource reservation method that can adjust adaptively the delay budget of traffic flow allocated to each RSVP-capable router in which the router uses the recently developed general-time fair queuing scheduler. The results of the simulation applying the proposed method to an evaluation network show that it may yield the gain of up to 90% compared to that in the original one in terms of the number of admitted flows.

  • PDF

Cross-Layer Combining of Adaptive Wireless Multicast Transmission with Truncated HARQ (적응 무선 멀티캐스트 전송과 차단 하이브리드 자동 재전송 기법의 계층간 결합)

  • Do, Tan Tai;Park, Jae-Cheol;Kim, Yun-Hee;Song, Iick-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8A
    • /
    • pp.610-617
    • /
    • 2009
  • This paper proposes a cross-layer design combining adaptive modulation and coding (AMC) with truncated hybrid automatic repeat request (HARQ) for wireless multicast transmission, in order to increase the spectral efficiency while meeting the target quality-of-service (QoS). In the design, we provide the selection criterion of AMC so as to satisfy the target packet error rate (PER) of all users when the multicast data is received through the common channel and the number of retransmission is limited by the delay constraint of the service. The analytically derived results show that the cross-layer design using HARQ provides a better spectral efficiency than the AMC without HARQ by allowing retransmission and code combining. It is also observed that the design for multicast outperforms that for unicast in the mid to high signal-to-noise ratio region.

A Resource Reservation Method with Available Resource Migration between RSVP-Capable Routers to Improve the Resource Utilization (RSVP-라우터간 가용자원 이동을 통해자원 이용 효율을 높이는 자원예약 방식)

  • Kim, Tae-Joon
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.253-262
    • /
    • 2008
  • Providing Quality-of-Service (QoS) guarantee requires the reservation of resource needed to accommodate the traffic flow of service for which resource reservation protocol (RSVP) was introduced. However, if any RSVP-capable router on the path fails to accommodate the traffic flow due to lack of resource, the flow is not allowed no matter how much surplus resources other routers on the path have. In order to solve this problem, this paper proposes a resource reservation method with available resource migration between RSVP-capable routers in which the routers use the recently developed latency optimized fair queuing scheduler. The results of the simulation applying the proposed method to an evaluation network show that it may yield the gain of up to 165% compared to that in the original one in terms of the number of admitted flows.

Fast UAV Deployment in Aerial Relay Systems to Support Emergency Communications (위급상황 통신 지원용 공중 통신중계기의 빠른 배치 기법)

  • Sang Ik, Han
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.27 no.1
    • /
    • pp.62-68
    • /
    • 2023
  • An aerial relay system utilizing an unmanned aerial vehicle(UAV) or drone is addressed for event-driven operations such as temporary communication services for disaster affected area, military and first responder support. UAV relay system (URS) targets to provide a reliable communication service to a remote user equipment or an operator, therefore, a fast UAV placement to guarantee a minimum quality of service(QoS) is important when an operation is requested. Researches on UAV utilization in communication systems mostly target to derive the optimal position of UAV to maximize the performance, however, fast deployment of UAV is much more important than optimal placement under emergency situations. To this end, this paper derives the feasible area for UAV placement, investigates the effect of performance requirements on that area, and suggests UAV placement to certainly guarantee the performance requirements. Simulation results demonstrate that the feasible area derived in this paper matches that obtained by an exhaustive search.

Robust Inter-MAP Binding Update Scheme in HMIPv6 (HMIPv6 네트워크에서 Robust 한 Inter-MAP 바인딩 업데이트 기법)

  • Jinwook Park;Jongpil Jeong;Hyunseung Choo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1387-1390
    • /
    • 2008
  • In a wireless network, handover latency is very important in supporting user mobility with the required quality of service (QoS). In view of this many schemes have been developed which aim to reduce the handover latency. The Hierarchical Mobile IPv6 (HMIPv6) approach is one such scheme which reduces the high handover latency that arises when mobile nodes perform frequent handover in Mobile IPv6 wireless networks. Although HMIPv6 reduces handoff latency, failures in the mobility anchor point (MAP) results in severe disruption or total disconnection that can seriously affect user satisfaction in ongoing sessions between the mobile and its correspondent nodes. HMIPv6 can avoid this situation by using more than one mobility anchor point for each link. In [3], an improved Robust Hierarchical Mobile IPv6 (RH-MIPv6) scheme is presented which enhances the HMIPv6 method by providing a fault-tolerant mobile service using two different MAPs (Primary and Secondary). It has been shown that the RH-MIPv6 scheme can achieve approximately 60% faster recovery times compared with the standard HMIPv6 approach. However, if mobile nodes perform frequent handover in RH-MIPv6, these changes incur a high communication overhead which is configured by two local binding update units (LBUs) as to two MAPs. To reduce this communication overhead, a new cost-reduced binding update scheme is proposed here, which reduces the communication overhead compared to previous schemes, by using an increased number of MAP switches. Using this new proposed method, it is shown that there is a 19.6% performance improvement in terms of the total handover latency.

A Possible Path per Link CBR Algorithm for Interference Avoidance in MPLS Networks

  • Sa-Ngiamsak, Wisitsak;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.772-776
    • /
    • 2004
  • This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

  • PDF

Performance Evaluation of Scheduling Algorithm for VoIP under Data Traffic in LTE Networks (데이터 트래픽 중심의 LTE망에서 VoIP를 위한 스케줄링 알고리즘 성능 분석)

  • Kim, Sung-Ju;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.12
    • /
    • pp.20-29
    • /
    • 2014
  • Recently, LTE is preparing to make a new leap forward LTE-A all over the world. As LTE privides high speed service, the role of mobile phones seems to change from voice to data service. According to Cisco, global mobile data traffic will increase nearly 11-fold between 2013 and 2018. Mobile video traffic will reach 75% by 2018 from 66% in 2013 in Korea. However, voice service is still the most important role of mobile phones. Thus, controllability of throughput and low BLER is indispensable for high-quality VoIP service among various type of traffic. Although the maximum AMR-WB, 23.85 Kbps is sufficient to a VoIP call, it is difficult for the LTE which can provide tens to hundreds of MB/s may not keep the certain level VoIP QoS especially in the cell-edge area. This paper proposes a new scheduling algorithm in order to improve VoIP performance after analyzing various scheduling algorithms. The proposal is the technology which applies more priority processing for VoIP than other applications in cell-edge area based on two-tier scheduling algorithm. The simulation result shows the improvement of VoIP performance in the view point of throughput and BLER.

ETSI BRAN(Broadband Radio Access Network)의 무선 ATM 및 광대역 무선 액세스 네트워크 표준화 및 기술동향

  • 이우용;김용진;강충구
    • Information and Communications Magazine
    • /
    • v.15 no.11
    • /
    • pp.124-142
    • /
    • 1998
  • ETSI BRAN (Broadband Radio Access Network)는 고속 무선 LAN 또는 고정 광대역 무선액세스 네트워크에서의 무선 접촉 계층과 ATM 및 IP(Internet Protocol) 코어 네트워크와의 연동을 위한 일부 기능을 표준화하기 위한 과제이다. 특히, BRAN의 HIPERLAN type-2(HIPERLAN/2)의 경우에는 과제의 범위는 무선 접속면, 무선 부시스템에서의 서비스 인터페이스, 서비스 구현에서 요구되는 연동 및 각종 지원 기능을 표준화하며, 무선 접속면의 경우에는 다수 벤더간의 상호 호환성을 제공할 수 있는 인터페이스를 구현하는 것이다. HIPERLAN/2의 기술 규격은 코어 네트워크와 독립적인 물리계층 및 데이터 링크 제어 (DATA Link Control: DLC) 계층과 서로 상이한 코어 네트워크와의 연동을 위한 네트워크 수렴 부계층을 다루게 될 것이며, 초기 단계에서는 ATM과 IP 코어 네트워크와의 연동 기능을 제시하게 될 것이다. 따라서 HIPERLAN/2기반의 시스템 규격을 제시하기 위해서는 네트워크 계층 및 기타 상위 계층에 대한 규격이 요규되며, 이는 ATM Forum에서의 무선 ATM 신호 방식 규격, IETF(Internet Engineering Task Force)의 IP규격, 그리고 ETSI의 SMG (Special Mobile Group) 프로젝트에서 표준화되고 있는 UMTS (Universal Mobile Telecommunication Service) 규격 등과 접목될 것이다. 결과적으로 무선 ATM 관점에서는 완전한 시스템 규격 작성은 ETSI BRAN과 ATM Forum에서 무선 접속 규격과 이동성 관리 및 신호 방식으로 각각 이원화되어 진행되고 있다. 현재 물리 계층에서의 전송 방식은 OFDM(Orthogonal Frequency Division Multiplexing)으로 확정되었으며, DLC 계층에서는 고정 길이의 TDD (Time Division Duplexing) TDMA 프레임 구조를 기반으로 AP (Access Point)에 의해 동적으로 상향 링크 자원을 예약 할당하는 매체 접근 제어 (Medium Access Control: MAC) 프로토콜이 고려되고 있다. 이와 같은 DLC 계층에서는 기본적으로 짧은 길이의 패킷을 통해 다양한 대역폭의 멀티미디어 트래픽을 효율적으로 수용하면서 ATM 네트워크뿐만 아니라 향후 IP 네트워크에서 요구하는 각 서비스별 QoS (Quality of Service)를 개별적으로 보장할 수 있는 기능을 구현하고자 한다. 향후 이 부문에 대한 표준화가 본격적으로 진행될 것으로 예상되며 HIPERLAN/2의 경우에는 1999년 중반까지 1차 기능 규격을 완료할 예정이며, BRAN 전반에 대한 완전한 규격을 2002년까지 완성하는 것을 목표로 하고 있다.

  • PDF