• Title/Summary/Keyword: QoS Guarantees

Search Result 156, Processing Time 0.018 seconds

Self-Interference Cancellation and Turbo Equalizer Design for the Single-band Full Duplex System using Single Antenna (단일 안테나를 사용하는 단일대역 전이중 통신을 위한 자기간섭신호제거와 터보 등화기 설계)

  • Choi, Jinkyu;An, Changyoung;Ryu, Heung-Gyoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.2
    • /
    • pp.7-17
    • /
    • 2015
  • In this paper, we propose a single antenna SSD(simultaneous single band duplex) system using turbo equalizer. The proposed system communicates simultaneously on single band. That is the proposed system is full-duplex system. The proposed system uses balanced feed network circuit to improve isolation in single antenna structure. Also, the proposed system uses RF(radio frequency) cancellation and digital cancellation to cancel self-interference. Additionally, the proposed system uses turbo equalizer to equalize ISI(inter-symbol interference) by harsh multipath fading and to collect bit errors by residual self-interference signals. By using turbo equalizer, the proposed system guarantees QoS(quality of service). In this paper, we uses Simulink simulation program to analyze performance of the proposed system. The simulation results confirm that proposed system can communicate simultaneously by using balanced feed network, RF cancellation, digital cancellation and turbo equalizer in harsh multipath channel on single band.

One-Time Overlay Multicast Techniques Considering Receipt Quality for m-to-n Comunication over Large Internet (다자간의 통신환경에서 다양한 수신품질을 고려한 One-Time 오버레이 멀티캐스트 기법에 관한 연구)

  • Yoon Mi-youn;Kim Ki-Young;Kim Dae-Won;Shin Yong-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1B
    • /
    • pp.27-38
    • /
    • 2005
  • IP Multicast has not been deployed because of hardware problems. So a new scheme that is called Overlay Multicast for group communication has been emerged. It supports IP Multicast functions, which is located on application level. For developing it, we have been focused on efficient overlay tree construction among group members with low stretch and stress. However, we should consider a variety of transmission or receipt condition since a real internet environment has users with various transmission/receipt rates. Thus, we make one-time source specific tree depending on required bandwidth informationof group members when a member requests data transmission. Our mechanism provides satisfied data quality limited maximum transmission rate of the source to each group members. Furthermore, we manage a large group enough as distributing control information to cores that are designated membersfor maintaining host member information. Lastly, we prove that our tree guarantees data quality to each group members, and show low tree consruction time is required. In addition, for evaluating group scalability, we analyze control information increasing rate via group size, and validate its scalability.

A Modified-DWRR Cell Scheduling Algorithm improved the QoS of Delay (지연 특성을 개선한 Modified-DWRR 셀 스케쥴링 알고리즘)

  • Gwak, Ji-Yeong;Nam, Ji-Seung
    • The KIPS Transactions:PartC
    • /
    • v.8C no.6
    • /
    • pp.805-814
    • /
    • 2001
  • In this paper, we propose a new scheduling algorithm that guarantees the delay property of real-time traffic, not considered in previous DWRR(Dynamic Weighted Round Robin) algorithm and also transmits non-real-time traffic efficiently. The proposed scheduling algorithm is a variation of DWRR algorithm to guarantee the delay property of real-time traffic by adding cell transmission method based on delay priority. It also uses the threshold to prevent the cell loss of non-real-time traffic due to cell transmission method based on delay priority. Proposed scheduling algorithm may increase some complexity over conventional DWRR scheme because of cell transmission method based on delay priority. However, the consideration of delay priority can minimize cell delay and require less size of temporary buffer. Also, the results of our performance study shows that the proposed scheduling algorithm has better performance than conventional DWRR scheme due to reliable ABR service and congestion avoidance capacity.

  • PDF

An Efficient Game Theory-Based Power Control Algorithm for D2D Communication in 5G Networks

  • Saif, Abdu;Noordin, Kamarul Ariffin bin;Dimyati, Kaharudin;Shah, Nor Shahida Mohd;Al-Gumaei, Yousef Ali;Abdullah, Qazwan;Alezabi, Kamal Ali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2631-2649
    • /
    • 2021
  • Device-to-Device (D2D) communication is one of the enabling technologies for 5G networks that support proximity-based service (ProSe) for wireless network communications. This paper proposes a power control algorithm based on the Nash equilibrium and game theory to eliminate the interference between the cellular user device and D2D links. This leadsto reliable connectivity with minimal power consumption in wireless communication. The power control in D2D is modeled as a non-cooperative game. Each device is allowed to independently select and transmit its power to maximize (or minimize) user utility. The aim is to guide user devices to converge with the Nash equilibrium by establishing connectivity with network resources. The proposed algorithm with pricing factors is used for power consumption and reduces overall interference of D2Ds communication. The proposed algorithm is evaluated in terms of the energy efficiency of the average power consumption, the number of D2D communication, and the number of iterations. Besides, the algorithm has a relatively fast convergence with the Nash Equilibrium rate. It guarantees that the user devices can achieve their required Quality of Service (QoS) by adjusting the residual cost coefficient and residual energy factor. Simulation results show that the power control shows a significant reduction in power consumption that has been achieved by approximately 20% compared with algorithms in [11].

Software Architecture of IEEE1394 Based Home Network for Guaranteeing Real-Time Characteristics of Isochronous Service and Event (IEEE1394 기반의 홈 네트웍에서 이벤트와 등시성 서비스의 실시간성 보장을 위한 소프트웨어 구조)

  • Park, Dong-Hwan;O, Bong-Jin;Gang, Sun-Ju
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.181-190
    • /
    • 2002
  • IEEE1394 is a de facto standard for the home network interfaces of digital multimedia home devices including digital A/V systems, digital camcorders, and PCs. Recently, it has been used in applications to guarantee the real-time characteristics such as home automation system and IICP (Instrument and Industrial Control Protocol). In order to guarantee real-time requirements in these IEEE1394-based real-time applications, this thesis proposes the software architecture of an IEEE1394 based home network that supports the guarantee for service's react-time characteristics. The proposed architecture has a real-time IEEE1394 device driver and event service architecture for guarantee real-time characteristics. The real-time device driver supports priority-based queueing of packets and mechanism to reduce the interrupt latency time in ISR. The event service architecture supports a real-time events delivery based on home network service using real-time event channel. This architecture can accommodate the real-time requirements of various applications and services such as digital multimedia services with QoS guarantees. home automation system required real-tine characteristics.

Improvement of F-GCRA Algorithm for ATM-GFR Service (ATM-GFR 서비스를 위한 F-GCRA 알고리즘 개선)

  • Park, In-Yong
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.889-896
    • /
    • 2006
  • ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.