• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.41-49
• /
• 2007

Ethernet passive optical network(EPON) is the next-generation technology for supporting services of high-quality at low-cost. In the EPON, all optical network units(ONUs) have to share a limited uplink channel for upstream data. In order to satisfy bandwidth demands of users on high-capacity local access networks(LANs), the optical line terminal(OLT) efficiently divides and allocates time slots of uplink channel to all ONUs. We discuss previous schemes for dynamic bandwidth allocation(DBA), such as interleaved polling with adaptive cycle time(IPACT) and sliding cycle time(SLICT). In this paper, dynamic right sizing of maximum-windows(DRSM), as a novel bandwidth allocation service, is proposed for more effective and efficient time slot allocation of the uplink channel. DRSM which is based on past information of bandwidth allocated by OLT calculates maximum available bandwidth and dynamically alters the maximum window size for the next ONU. This scheme does not only exert every effort to meet bandwidth demands of ONUs with the possible scope, it also seeks fairness of bandwidth allocation among ONUs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.89-94
• /
• 2003

Passive Optical Network(PON) architecture is a very simple. However media access protocol is necessary to the PON because the ONUs should share a channel in the upsteam direction. We propose the design of dynamic bandwidth allocation algorithm for improved bandwidth utilization in the broad bandwidth access network that uses Ethernet PON. The object of our study shall be to decrease a unused remainder bandwidth of granted timeslot for a upstream traffic transmission. We propose that OLT notifies ONU of maximum transmission window during discovery and ONU request a amount under maximum transmission window after it checks a frame length. We confirm that the proposed algorithm shown improving performance from bandwidth utilization and queueing delay point of view through the simulation result.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.166-172
• /
• 2020

Video streaming application such as YouTube is one of the most popular mobile applications. To adjust the quality of video for available network bandwidth, a streaming server provides multiple representations of video of which bit rate has different bandwidth requirements. A streaming client utilizes an adaptive bit rate scheme to select a proper video representation that the network can support. The download behavior of video streaming client player is governed by several parameters such as maximum buffer size. Especially, the size of the maximum playback buffer in the client player can greatly affect the user experience. To tackle this problem, in this paper, we propose the maximum buffer size optimization according to available network bandwidth and buffer status. Our simulation study shows that our proposed buffer size optimization scheme successfully mitigates playback stalls while preserving the similar quality of streaming video compared to existing ABR schemes.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.4
• /
• pp.263-271
• /
• 2013

A low dropout regulator (LDO) with fast transient responses is presented. The proposed LDO eliminates the trade-off between slew rate and unity gain bandwidth, which are the key parameters for fast transient responses. In the proposed buffer, by changing the slew current path, the slew rate and unity gain bandwidth can be controlled independently. Implemented in $0.18-{\mu}m$ high voltage CMOS, the proposed LDO shows up to 200 mA load current with 0.2 V dropout voltage for $1{\mu}F$ output capacitance. The measured maximum transient output voltage variation, minimum quiescent current at no load condition, and maximum unity gain frequency are 24 mV, $7.5{\mu}A$, and higher than 1 MHz, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.63-81
• /
• 2008

WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.765-775
• /
• 2012

The cross-validation is a popular method to select bandwidth in all types of kernel estimation. The maximum likelihood cross-validation, the least squares cross-validation and biased cross-validation have been proposed for bandwidth selection in kernel density estimation. In the case that the probability density function has a discontinuity point, Huh (2012) proposed a method of bandwidth selection using the maximum likelihood cross-validation. In this paper, two forms of cross-validation with the one-sided kernel function are proposed for bandwidth selection to estimate the location and jump size of the discontinuity point of density. These methods are motivated by the least squares cross-validation and the biased cross-validation. By simulated examples, the finite sample performances of two proposed methods with the one of Huh (2012) are compared.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5365-5380
• /
• 2016

Estimation of signal-to-noise ratio (SNR) is an important problem in wireless communication systems. It has been studied for various constellation types and channels using different estimation techniques. Maximum likelihood estimation is a technique which provides efficient and in most cases unbiased estimators. In this paper, we have applied maximum likelihood estimation for systems employing square or cross QAM signals which are undergoing slow flat Rayleigh fading. The problem has been considered under various scenarios like data-aided (DA), non-data-aided (NDA) and partially data-aided (PDA) and the performance of each type of estimator has been evaluated and compared. It has been observed that the performance of DA estimator is best due to usage of pilot symbols, with the drawback of greater bandwidth consumption. However, this can be catered for by using partially data-aided estimators whose performance is better than NDA systems with some extra bandwidth requirement.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.477-486
• /
• 2009

This paper proposes a dynamic bandwidth allocation (DBA) algorithm with adaptive maximum transmission window (DBA-AMTW) to increase channel utilization in Ethernet passive optical networks (EPONs). A polling mechanism in EPON determines channel utilization and puts constraints on DBA algorithm and scheduling. DBA algorithms based on interleaved polling with stop (IPS) allocate transmission windows to optical network units (ONU) considering requests of all ONUs. However channel idle time when any ONU does not transmit packets decreases channel utilization. Proposed DBA-AMTW improves efficiency of a network and allocates transmission windows effectively by appropriate DBA computation from REPORT messages of all ONUs. An adaptive maximum transmission window for each ONU determined by a DBA computation in the previous scheduling cycle. Simulation results show that the proposed DBA algorithm improves performance of throughput and average delay time.