• Title/Summary/Keyword: Throughput Fairness

Search Result 257, Processing Time 0.037 seconds

Adaptive Contention Window Mechanism for Enhancing Throughput in HomePlug AV Networks (HomePlug AV 네트워크에서의 성능 향상을 위한 적응적 Contention Window 조절 방식)

  • Yoon, Sung-Guk;Yun, Jeong-Kyun;Kim, Byung-Seung;Bahk, Sae-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.318-325
    • /
    • 2008
  • HomePlug AV(HPAV) is the standard for distribution of Audio/video content as well as data within the home by using the power line. It uses a hybrid access mechanism that combines TDMA with CSMA/CA for MAC technology. The CSMA/CA protocol in HPAV has two main control blobs that can be used for access control: contention window(CW) size and deferral counter(DC). In this paper, we extensively investigate the impacts of CW and DC on performance through simulations, and propose an adaptive mechanism that adjusts the CW size to enhance the throughput in HPAV MAC. We find that the CW size is more influential on performance than the DC. Therefore, to make controlling the network easier, our proposal uses a default value of DC and adjusts the CW size. Our scheme simply increases or decreases the CW size if the network is too busy or too idle, respectively, We compare the performance of our proposal with those of the standard and other competitive schemes in terms of throughput and fairness. Our simulation and analysis results show that our adaptive CW mechanism performs very well under various scenarios.

Performance Evaluation of a Dynamic Bandwidth Allocation Algorithm with providing the Fairness among Terminals for Ethernet PON Systems (단말에 대한 공정성을 고려한 이더넷 PON 시스템의 동적대역할당방법의 성능분석)

  • Park Ji-won;Yoon Chong-ho;Song Jae-yeon;Lim Se-youn;Kim Jin-hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.980-990
    • /
    • 2004
  • In this paper, we propose the dynamic bandwidth allocation algorithm for the IEEE802.3ah Ethernet Passive Optical Network(EPON) system to provide the fairness among terminals, and evaluate the delay-throughput performance by simulation. For the conventional EPON systems, an Optical Line Termination (OLT) schedules the upstream bandwidth for each Optical Network Unit (ONU), based on its buffer state. This scheme can provide a fair bandwidth allocation for each ONU. However, it has a critical problem that it does not guarantee the fair bandwidth among terminals which are connected to ONUs. For an example, we assume that the traffic from a greedy terminal increases at a time. Then, the buffer state of its ONU is instantly reported to the OLT, and finally the OW can get more bandwidth. As a result, the less bandwidth is allocated to the other ONUs, and thus the transfer delay of terminals connected to the ONUs gets inevitably increased. Noting that this unfairness problem exists in the conventional EPON systems, we propose a fair bandwidth allocation scheme by OLT with considering the buffer state of ONU as welt as the number of terminals connected it. For the performance evaluation, we develop the EPON simulation model with SIMULA simulation language. From the result of the throughput-delay performance and the dynamics of buffer state along time for each terminal and ONU, respectively, one can see that the proposed scheme can provide the fairness among not ONUs but terminals. Finally, it is worthwhile to note that the proposed scheme for the public EPON systems might be an attractive solution for providing the fairness among subscriber terminals.

A Fairness Control Scheme in Multicast ATM Switches (멀티캐스트 ATM 스위치에서의 공정성 제어 방법)

  • 손동욱;손유익
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.134-142
    • /
    • 2003
  • We present an ATM switch architectures based on the multistage interconnection network(MIN) for the efficient multicast traffic control. Many of these applications require multicast connections as well as point-to-point connections. Muiticast connection in which the same message is delivered from a source to arbitrary number of destinations is fundamental in the areas such as teleconferencing, VOD(video on demand), distributed data processing, etc. In designing the multicast ATM switches to support those services, we should consider the fairness(impartiality) and priority control, in addition to the overflow problem, cell processing with large number of copies, and the blocking problem. In particular, the fairness problem which is to distribute the incoming cells to input ports smoothly is occurred when a cell with the large copy number enters upper input port. In this case, the upper input port sends before the lower input port because of the calculating method of running sum, and therefore cell arrived into lower input port Is delayed to next cycle to be sent and transmission delay time becomes longer. In this paper, we propose the cell splitting and group splitting algorithm, and also the fairness scheme on the basis of the nonblocking characteristics for issuing appropriate copy number depending on the number of Input cell in demand. We evaluate the performance of the proposed schemes in terms of the throughput, cell loss rate and cell delay.

A Timer-based TCP Congestion Control Mechanism for Enhancing Throughput and Fairness (전송률과 공평성 향상을 위한 타이머 기반 TCP혼잡 제어)

  • Lee, Jong-Min;Cha, Ho-Jung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.154-156
    • /
    • 2005
  • 본 논문은 TCP의 무선 환경에서의 전송 성능 감소와 패킷 왕복 시간에 따른 대역폭 선점 문제를 해결하기 위한 타이머 기반의 혼잡 제어 방식을 제안한다. TCP는 패킷 손실 확률이 많은 무선 환경에서 네트워크 혼잡에 의한 패킷 손실을 방지하기 위한 느린 전송률 증가로 인해 전송 성능이 크게 떨어진다. 또한, TCP 송신자는 전송률을 결정하는 전송 윈도우를 수신자로부터 응답 메시지를 받을 때만 조정시키므로, 패킷의 왕복 시간의 차이에 따른 전송률 편중 현상과 다수개의 응답 메시지에 의한 과도한 트래픽 발생의 문제가 발생한다. 본 논문에서 제안하는 타이머 기반의 TCP 혼잡 제어 방식은 패킷의 전송 시간 간격을 타이머로 조정함으로써 무선 환경에서 전송 성능을 향상시키고 패킷의 왕복 시간 차이에 따른 전송률 편중 현상을 완화시키며 다수개의 응답 메시지에 의한 과도한 트래픽의 발생을 제한한다. 제안하는 방법은 실제 환경에서 구현되었으며, 다양한 네트워크 환경에서의 실험을 통해 그 성능을 입증하였다.

  • PDF

Self-Organized Resource Allocation for Femtocell Network to Mitigate Downlink Interference

  • Sable, Smita;Bae, Jinsoo;Lee, Kyung-Geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2410-2418
    • /
    • 2015
  • In this paper, we consider the femto users and their mutual interference as graph elements, nodes and weighted edges, respectively. The total bandwidth is divided into a number of resource blocks (RBs) and these are assigned to the femto user equipment (FUEs) using a graph coloring algorithm. In addition, resources blocks are assigned to the femto users to avoid inter-cell interference. The proposed scheme is compared with the traditional scheduling schemes in terms of throughput and fairness and performance improvement is achieved by exploiting the graph coloring scheme.

Performance Analysis of Buffer Allocation Schemes for Controlled Transfer Service in ATM Networks (ATM 망에서 CT 서비스를 위한 버퍼 할당 방식의 성능 분석)

  • 김병철;조유제안윤영권율
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.261-264
    • /
    • 1998
  • Controlled transfer (CT) capability, a new ATM transfer capability (ATC) for high-speed data applications which using credit-based flow control, has recently been proposed and studied in ITU-T. In this paper, we review the existing dyanmic buffer allocation schemes and propose an improved scheme. Also, we compare the performances of the existing buffer allocation methods such as static allocation, flow controlled virtual channels (FCVC), and zero queueing flow control (ZQFC) with the proposed method through simulation. Simulation results show that the proposed scheme exhibits a better performance than the existing schemes in terms of throughput, fairness, queue length and link utilization.

  • PDF

OFEX Controller to Improve Queueing and User Performance in Multi-bottleneck Networks

  • Liu, Jungang;Yang, Oliver W.W.
    • ETRI Journal
    • /
    • v.36 no.3
    • /
    • pp.396-406
    • /
    • 2014
  • We have designed and investigated a new congestion control scheme, called optimal and fully explicit (OFEX) controller. Different from existing relatively explicit controllers, this new scheme can provide not only optimal bandwidth allocation but also a fully explicit congestion signal to sources. It uses the congestion signal from the most congested link instead of the cumulative signal from the flow path. In this way, it overcomes the drawback of relatively explicit controllers exhibiting bias toward multi-bottlenecked users and significantly improves their convergence speed and source throughput performance. Furthermore, our OFEX-controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based multi-access networks. Compared with former works/controllers, this remedy also effectively reduces the instantaneous queue size in a router and thus significantly improves queuing delay and packet loss performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison with the existing relatively explicit controllers verifies the superiority of our new scheme.

Performance Analysis of Packet Scheduling Algorithm Based on Delay and Fairness (지연과 공정성을 고려한 패킷 스케쥴링 알고리즘 성능분석)

  • Lim Seog-Ku
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.6 no.6
    • /
    • pp.513-520
    • /
    • 2005
  • High-speed Portable Internet system provides 1-3 Mbps data transmission speed to terminals moving up to 60 km/sec. Since High-speed Portable Internet system supports services requiring different QoS, it needs an efficient scheduling method based on those different QoSs. This paper shows the performance comparisons of several different packet scheduling schemes for minimizing the mean delay over the downlink of High-speed Portable Internet system to support the packet data service. Simulation results show that proposed scheme superior to other schemes at side throughput and data loss rate.

  • PDF

A Packet Scheduling Algorithm and Efficient Framing Method for Next Generation Wireless Communication System and its Performance (차세대 이동통신시스템을 위한 패킷 스케쥴링 알고리즘과 효율적인 프레임 구성 방법 및 성능 분석)

  • Baek Jang Hyun;Kim Dong Hoi
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.2
    • /
    • pp.29-40
    • /
    • 2005
  • In this research, we propose packet scheduling algorithm considering different QoS characteristics of real-time traffic and non-real-time traffic in the next generation wireless communication system serving the multimedia traffic and a new efficient framing method cooperated with this packet scheduler. When the selected traffic classes of the selected users are transmitted, our proposed framing method can increase the number of serviced traffic classes by mixing the many different traffic classes within one frame considering data rate decided by the allocated AMC (Adaptive Modulation and Coding) option. Using this proposed method, the fairness among the traffic classes can be achieved and the system performance for total throughput and delay can be enhanced. Simulations are performed to analyze the performance of the proposed framing method. Our proposed packet scheduler and framing method will be applied to the next generation multimedia wireless communication system serving many traffic classes.

ABR Service Control Algorithms For Improving Performance of TCP/IP: Simulation Evaluation (TCP/IP 성능개선을 위한 ABR 서비스 제어 알고리즘: 시뮬레이션 평가)

  • Park, Hui-Dae;Park, Seung-Seop
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11S
    • /
    • pp.3390-3398
    • /
    • 1999
  • To achieve high-speed communication and to improve QoS characteristics, ATM is now being used as underlying transfer mechanism of Internet protocols, or TCP/IP. When TCP uses the ABR service in ATM networks, the ABR service control is important to improve the performance of TCP/IP traffic as long as there is no interaction between ABR rate control and TCP flow control. In such environment, the interoperability of EFCI and ER switches becomes unavoidable in order to more effectively control ABR traffic in ATM network. In this paper, we use the model of mixed EFCI-ER environment and discuss the performance issues, e.g., the fairness of bandwidth allocation, drop rate, throughput by using various ER switch algorithms. Among various ERSwitch algorithms, we present one algorithm that have a less network topology and allocate the fair share of VC bandwidth by simulation results.

  • PDF