• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.693-694
• /
• 2014

This paper proposes a new pipelined dynamic bandwidth allocation algorithm for XG-PON (10-Gbps-capable passive optical network) passive optical networks) system. The pipelined algorithm is used when a dynamic bandwidth allocation algorithm cannot finished in an unit time. In the proposed mechanism, the request is immediately transferred to each pipeline block to improve performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.705-706
• /
• 2014

This paper proposes a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system. In the XG-PON system, an ONU (optical network unit) does not explicitly send it request to an OLT (optical line termination). The OLT monitors the upstream bandwidth usage of the ONU to estimate the request of the ONU. Then the OLT performs a dynamic bandwidth allocation process based on the estimated requests.

• 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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.51-60
• /
• 1997

In this paper, A Connection Admission Control(CAC) algorithm by Dynamic Bandwidth Allocation is proposed. The B-ISDN will be required to carry traffic generated by a various traffic sources. These source will have all traffic flow characteristics and quality of services requirements. When a connectionless message with burstiness arrives at a node during a renewal period, CAC will be dynamically determined connection request by using the predetermined connection admission bounds in estimating the number of input arriving cells. The proposed algorithm estimates the available bandwidth by observing cell streams of the aggregate traffic. A connection request is accepted if the available bandwidth is larger than declared peak rate, and otherwise rejected. The proposed CAC scheme is shown to be promising and practically feasible in obtaining efficient transmission of burst traffic with guaranteed quality of services.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.441-446
• /
• 2003

Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. The PON architecture is very simple but it requires a MAC protocol for control of upstream traffic. The MAC protocol must support QoS (Quality of Service) administration function by various traffic class, efficient dynamic bandwidth assignment function, CDV (Ceil Delay Variation) minimization function etc. This paper proposes a dynamic bandwidth assignment algorithm of the MAC protocol for a broadband access network using an Ethernet Passive Optical Network supporting various traffic class. We compare our proposed with MDRR algorithm using simulation, and confirmed that our proposed Request-Counter algorithm produces shorter average cell delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1A
• /
• pp.59-66
• /
• 2008

This paper presents a spectrum sharing and allocation problem in multiple network operators(NOs). Most of previous works as to dynamic spectrum allocation(DSA) schemes have presented the DSA gain achieved by utilizing the time or regional variations in traffic demand between multi-network operators(NOs). In this paper, we introduce the functionalities required for the entities related with the spectrum sharing and allocation and propose a spectrum allocation algorithm while considering the long-term priority(or fairness) between NOs, the prioritybetween multiple class services, and the urgent bandwidth request. It was shown that the proposed algorithm with priorities between multiple class services could sustain better satisfaction ratio(SR) than the fixed allocation schemes or one without priority under different traffic patterns. Therefore, we conclude that the proposed DSA with priorities between multiple class services and network operators could provide the fairness between service classes of network operators and effective negotiation procedure for urgent bandwidth request by users.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.457-465
• /
• 2003

In this paper, we analyze the performances of variable MAC (Medium Access Control) protocols and present an efficient MAC protocol for Ethernet PON (Passive Optical Network). We consider three MAC protocols: static TDMA, dynamic TDMA, and Interleaved polling. Static TDMA assigns an equal amount of bandwidth to all ONUs regardless of the request information but Dynamic TDMA dynamically allocates the bandwidth to each ONU considering its request. Interleaved Polling operates a cycle with variable time period and a polling method for informing a uplink transmission chance to each ONU. This paper theoretically analyzes the available bandwidth for each of three protocols. We also implement the simulation models for them by using OPNET and evaluates the performances under various bursty traffic environments. The results are compared and analyzed in terms of channel utilization and queueing delay.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.127-130
• /
• 2006

EPON의 상향 전송 방식에서는 다수의 ONU가 OLT로부터 공유된 채널에 대한 권한을 할당받아 데이터를 전송하게 되므로 EPON에서는 각각의 ONU들에게 공유된 대역폭을 공평하고 효율적으로 할당하기 위한 DBA 알고리즘이 필수적이다. 우리는 본 논문에 앞서 기존의 DBA알고리즘들의 문제점을 보안하여 Request-Counter Dynamic Bandwidth Assignment 알고리즘을 새롭게 제안하여 성능평가 및 비교 분석을 하였다. 본 논문에서는 제안된 RC-DBA 알고리즘을 적용하여 OLT의 MAC 스케줄러를 설계하고 Corebell 사의 LDS2000 FPCA ver.1.0 보드에 구현하였다. 또한 이를 검증하기 위해서 임베디드 리눅스 기반의 검증 시스템을 개발하였다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.638-651
• /
• 2000

When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.