• Title/Summary/Keyword: dynamic bandwidth allocation

Search Result 164, Processing Time 0.042 seconds

Performance Evaluation of Dynamic Bandwidth Allocation Algorithm of TWDM PON for Power Saving (TWDM PON의 전력절감용 동적대역할당 성능평가)

  • Hong, Sung Hark;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.150-151
    • /
    • 2014
  • This paper evaluates performance of a dynamic wavelength and bandwidth allocation algorithm of TWDM PON (time and wavelength division multiplexed passive optical network) which consists of an OLT (optical line termination) and multiple ONU (optical network unit). The allocation algorithm reduces the number of upstream wavelengths to save power. Using self-similar traffic, we simulate TWDM PON systems and measure the average packet delay and the average number of upstream wavelengths.

  • PDF

Class Gated Dynamic Bandwidth Allocation Algorithm for supporting QoS in the EPON (EPON 시스템에서 효율적인 QoS 제공을 위한 Class Gated 동적 대역 할당 알고리즘)

  • Hwang Jun-Ho;Kim Hyo-Won;Yoo Myung-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.5 s.347
    • /
    • pp.94-103
    • /
    • 2006
  • Ethernet passive optical network (EPON) has drawn many attention as a promising access network technology for FTTH because it can provide a high bandwidth with a low cost. Since the uplink bandwidth in the EPON system is shared by many users, it is necessary for an EPON system to have an efficient bandwidth allocation mechanism. To support QoS in EPON, the previous bandwidth allocation schemes employ strict priority queueing (SPQ). Since SPQ gives unlimited priority to higher service class, the QoS of lower service classes gets worse. In this paper, we propose Class Gated DBA (Dynamic Bandwidth Allocation) algorithm in which the bandwidth is requested / granted in a service class basis. To avoid the monopoly in bandwidth usage by higher classes the maximum bandwidth that is allocate to each service class is limited (fairness between services classes). In addition, to avoid the monopoly in bandwidth usage by some particular users, each ONU runs fairness bandwidth allocation algorithm within each service classes. Through computer simulations, it is verified that the proposed algorithm achieves a good level of QoS, and at the same time maintains a good level of fairness between both service classes and users.

Performance Evaluation of Dynamic Bandwidth Allocation Algorithm for XG-PON with Traffic Monitoring (Traffic Monitoring 방식의 XG-PON 동적대역할당의 성능평가)

  • Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.449-450
    • /
    • 2015
  • This paper describes performance evaluation results of a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system without using an explicit request. An ONU (optical network unit) does not send its request to an OLT (optical line termination). The OLT monitors the upstream bandwidth usage of the ONU to estimate the request of the ONU.

  • PDF

Dynamic Bandwidth Allocation Algorithm of XG-PON using Traffic Monitoring (Traffic Monitoring을 이용한 XG-PON 동적대역할당 알고리즘)

  • Hong, Sung Hark;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.152-153
    • /
    • 2014
  • This paper proposes a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system in which an ONU (optical network unit) does not explicitly send its request to an OLT (optical line termination). To estimate the request of the ONU, the OLT monitors the upstream bandwidth usage of the ONU and periodically allocates a probe slot to the ONU.

  • PDF

Dynamic Sub-carrier Multiplexed channel allocation and efficient frame distribution scheme in optical access networks (광가입자망 SCM 채널 동적할당 및 효율적 프레임 분배 방안)

  • 김남욱;윤현호;김태연;유정주;김병휘;강민호
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.113-116
    • /
    • 2003
  • In this paper, we propose a dynamic parallel channel allocation mechanism that dynamically controls total number of allocation channels of each subscriber to effectively service user bandwidth demands while high utilization and fairness are guaranteed in WDM based optical access networks. The logical performance gain of statistical multiplexing by dynamic channel allocation is validated with analytic method as well as simulations. We also introduce the adaptive padding scheme in order to efficiently distribute forwarded frames to aggregated multi-link channels which are formed by parallel channel allocation mechanism. The proposed scheme shows the performance enhancement by minimizing unnecessary padding size and the processing time.

  • PDF

Dynamic Bandwidth Allocation Algorithm with Two-Phase Cycle for Ethernet PON (EPON에서의 Two-Phase Cycle 동적 대역 할당 알고리즘)

  • Yoon, Won-Jin;Lee, Hye-Kyung;Chung, Min-Young;Lee, Tae-Jin;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.14C no.4
    • /
    • pp.349-358
    • /
    • 2007
  • Ethernet Passive Optical Network(EPON), which is one of PON technologies for realizing FTTx(Fiber-To-The-Curb/Home/Office), can cost-effectively construct optical access networks. In addition, EPON can provide high transmission rate up to 10Gbps and it is compatible with existing customer devices equipped with Ethernet card. To effectively control frame transmission from ONUs to OLT EPON can use Multi-Point Control Protocol(MPCP) with additional control functions in addition to Media Access Control(MAC) protocol function. For EPON, many researches on intra- and inter-ONU scheduling algorithms have been performed. Among the inter-ONU scheduling algorithms, IPS(Interleaved Polling with Stop) based on polling scheme is efficient because OLT assigns available time portion to each ONU given the request information from all ONUs. Since the IPS needs an idle time period on uplink between two consecutive frame transmission periods, it wastes time without frame transmissions. In this paper, we propose a dynamic bandwidth allocation algorithm to increase the channel utilization on uplink and evaluate its performance using simulations. The simulation results show that the proposed Two-phase Cycle Danamic Bandwidth Allocation(TCDBA) algorithm improves the throughput about 15%, compared with the IPS and Fast Gate Dynamic Bandwidth Allocation(FGDBA). Also, the average transmission time of the proposed algorithm is lower than those of other schemes.

Dynamic Bandwidth Request-Allocation Algorithm for Real-Time Service in Mobile WiMAX Networks (Mobile WiMAX 통신망에서 실시간 서비스를 위한 동적인 대역폭 요청/할당 알고리즘)

  • Park, Eun-Chan;Kim, Jay-Young;Kim, Han-Seok
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.3-4
    • /
    • 2008
  • We propose an efficient uplink bandwidth request-allocation algorithm for variable-rate real-time service in IEEE 802.11 broadband wireless access networks. By introducing a notion of target delay under the framework of dual feedback, the proposed algorithm can assure the desired level of QoS while minimizing wastage of bandwidth allocation.

  • PDF

The Efficient Bandwidth Control Method for Variable Data using ATM-GFR Service (ATM-GFR 서비스를 이용한 가변 데이터의 효과적인 대역폭 관리)

  • Kim Jung-Gyu;Lee Young-Dong
    • Journal of Digital Contents Society
    • /
    • v.2 no.2
    • /
    • pp.129-138
    • /
    • 2001
  • With the explosive growth and pervasive of the Internet, dynamic bandwidth allocation is nessary for ATM streams that carry various traffic. In order to provide quality of service(QoS) guarantees and to give the minimum cell rate, new bandwidth allocation scheme requires to be implemented. DFBA(Differential Fair Buffer Allocation) scheme is one of the methods for ATM GFR(Guaranteed Frame Rate) services. DFBA scheme treats cells selectively in a region between low buffer occupancy threshold and high buffer occupancy threshold. A big unbalance is introduced when the value being selected by DFBA scheme is greater than minimum rate. In a try to reduce the unbalance modified DFBA scheme is proposed. Selecting parameter according to the situation of network, this scheme is very effective to control the bandwidth in the various network situation.

  • PDF

Low Complexity Subcarrier Allocation Scheme for OFDMA Systems (OFDMA 시스템을 위한 저 복잡도 부반송파 할당기법)

  • Woo, Choong-Chae;Wang, Han-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.13 no.2
    • /
    • pp.99-105
    • /
    • 2012
  • The focus of this paper is a proposal for a computationally efficient dynamic subcarrier allocation (DSA) algorithm for orthogonal frequency-division multiple access (OFDMA) systems. The proposed DSA algorithm considerably reduces the computational complexity and the amount of channel quality information (CQI) compared to amplitude craving greedy (ACG) algorithms, which use full CQI. At the same time, the performance of the proposed algorithm closely appear to ACG algorithms. Moreover, the authors present a new bandwidth-assignment algorithm produced by modifying bandwidth assignment based on the signal-to-noise ratio (BABS). This modified BABS algorithm enables the proposed DSA algorithm to produce a strong outage performance gain over the conventional scheme.

Dynamic Allocation Method of CPU Bandwidth for Hard Real-Time Task and Multimedia Task Based on MPEG Video Stream (경성 실시간 태스크와 MPEG 비디오 스트림 기반 멀티미디어 태스크를 위한 CPU 대역폭의 동적 할당 기법)

  • Kim, Jin-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.7
    • /
    • pp.886-895
    • /
    • 2004
  • In this paper, we propose the dynamic allocation scheme of the CPU bandwidth to efficiently integrate and schedule these tasks in the same system, where multimedia tasks and hard real-time tasks can coexist simultaneously. Hard real-time tasks are guaranteed based on worst case execution times, whereas multimedia tasks modeled as soft real-time tasks are served based on mean parameters. This paper describes a server-based allocation scheme for assigning the CPU resource to two types of tasks. Especially for MPEG video streams, we show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task. The primary purpose of the proposed method is to minimize the mean tardiness of multimedia tasks while satisfying the timing constraints of hard real-time tasks present in the system. We showed through simulations that the tardiness experienced by multimedia tasks under the proposed allocation scheme is much smaller than that experienced by using other scheme.

  • PDF