• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.361-364
• /
• 2005

As increasing the Internet traffic, many researches on access network are reported for end-to-end high-speed broadband network, where E-PON(Ethernet-Passive Active Network) is one of reasonable candidate fur the network with respect to cost and bandwidth utilization. For the high-speed access network, E-PON need an efficient bandwidth allocation method. This paper suggests a WFA(Water-Filling Allocation) algorithm for the efficient bandwidth allocation with various simulation test.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1020-1029
• /
• 2006

Realization of high-capacity quality-of-service router needs fair packet schedulers with a lower complexity. Timestamp based fair packet schedulers have the ideal complexity of O(log V), where V is the maximum number of admitted flows, but it has been recently reduced to O(1) using bin concept. However, the latency property was deteriorated and the bandwidth utilization was also declined. In addition, traffic flows requiring strong delay bound may not be admitted. To overcome these problems, this paper proposes a Mini-Bin based Start-Time (MBST) scheduler with variable complexity and evaluates its performance. The MBST scheduler uses the timestamp calculation scheme of start-time based schedulers to enhance the bandwidth utilization and also introduces mini-bin concept to improve the latency, The performance evaluation shows that the proposed scheduler can reduce the complexity of the legacy start-tine based schedulers by $1.8{\sim}5$ times without deteriorating the bandwidth utilization property.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.593-603
• /
• 1997

Connection admission decision in ATM networks requires decision made in real time using fast algorithm. It is difficult to construct a model of the multiplexed traffic and thus, approximation of the traffic load is necessary. In this paper, we propose a measurement-based dynamic CAC(Connection admission Control) in ATM(Asynchronous Transfer Mode) networks, which observes current traffic by the moving window and set the window size to the value which is computed from the measured cell loss amount. It is based on the measurements of the traffic load over an admission period that is load enough to reflect the current traffic behavior instead of analytic modeling. And, the dynamic reallocation of bandwidth for each class leads to effective bandwidth utilization. The performance of proposed method is analyzed through computer simulation. The performance of proposed method is analyzed by using SIMAN simulation package and FORTRAN language. As can be seen in the simulation result, cell loss performance and bandwidth utilization have been increased.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.997-1006
• /
• 2008

SVP-capable router supporting guaranteed services on the internet generally uses a packet scheduler based on the Weighted Fair Queuing(WFQ) algorithm to secure required qualities of traffic flows. In this paper we proposed a RSVP-capable router based on the LOFQ(Latency optimized fair queuing) algorithm that improves the efficiency in bandwidth utilization with keeping the compatibility with the original RSVP procedure. The proposed router reserves the optimal amount of resource for each flow to secure its required quality-of-service with the recently introduced LOFQ scheduler. The results of the simulation applying the proposed router to an evaluation network showed that it may yield the gain of up to 30% compared to that in the original one in terms of the number of admitted flows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.316-325
• /
• 2002

This paper investigates the restoration schemes which are applied to the MPLS domain upon a network failure. We define the following three restoration service models by combining the various restoration schemes: "FIS-based protection service" (FIS: failure indication signal), "inversion traffic protection service" and "1+1 protection service". After a qualitative analysis of the performance in them, we have analyzed it on quantitative basis by the simulation. According to the simulation results, "1+1 protection service" guarantees the fastest and most lossless restoration service among them; however, it results in consuming considerable bandwidth and producing an amount of control traffic, which means poor network utilization. On the other hand, "FIS-based protection service" spends less bandwidth and generates less control traffic, which means better network utilization, but produces poor restoration service. "Inversion traffic protection service" provides the medium restoration service and utilization between "1+1 protection service" and "FIS-based protection service."

• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.415-420
• /
• 2014

Another crucial issue is a providing secondary user(SU) with the its guaranteed quality of service(QoS) in cognitive radio systems, from the SU view to be allowed to opportunistically utilize the primary user(PU) spectrum on non-interfering. In this paper, we propose a bandwidth reallocation scheme for reducing SU dropping rate through renegotiation of requested channel numbers when available bandwidth is not enough for accepting the spectrum handoff SUs. We categorize SU calls into two types : the first priority and the second priority SU, and the first SU' service is supported by bandwidth reservation based on ARMA prediction model for PU arrivals, while the second SU's bandwidth demands for spectrum handoff is to be reallocated through their renegotiation. Simulation results show that our scheme can improve SU dropping rate and system resource utilization efficiency by bandwidth reallocation.

• The KIPS Transactions:PartC
• /
• v.15C no.2
• /
• pp.111-118
• /
• 2008

A wireless router is a device which allows several wireless clients to share an internet line using NAT (Network Address Translation). In a school or a small office environment where many clients use multiple wireless routers, a client may select any one of wireless routers so that most clients can be clustered to a small set of the wireless routers. In such a case, there exists load unbalancing problem between clients and wireless routers. One of its result is that clients using the busiest router get poor service. The other is that the resource utilization of the whole wireless routers becomes very low. In order to resolve the problems, we propose a load sharing scheme to maximize network bandwidth utilization based on SSID(Service Set IDentifier) hiding. The proposed scheme keeps checking the available bandwidth of all the possible wireless routers in a time interval and select the most available one. If a new client appears, the most available router is visible to him or her whereas the others are not visible. This is handled by SSID hiding in the proposed scheme. We implemented the proposed scheme with ASUS WL 500G wireless router and performed experiments. Experimental results show the bandwidth utilization improvement compared to the existing method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.15-21
• /
• 2009

An Ethernet passive optical network (EPON) is an economical and efficient access network that received significant research attention in recent year. A MAC protocol of the PON, the next generation access network, is based primarily on TDMA (Time Division Multiple Access). In this paper, we addressed the problems of a dynamic bandwidth allocation (DBA) in Fairness and QoS Performance. We augmented the advanced bandwidth allocation algorithms to support efficient resource utilization by reducing the unused remaining bandwidth made by idle state ONUs. Our new proposed advanced bandwidth allocation algorithm can allocate effectively and fairly the bandwidths between end-users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.609-614
• /
• 2008

Upstream data frame of TDM-PON includes various types of overheads, and there exist guard bands between consecutive frames from different ONUs. Although they are indispensible in synchronization and performance, they cause bandwidth waste at the same time. To solve this problem, a new TDM-PON that uses two types of wavelengths in upstream transmission is suggested. By even distribution of two wavelengths among ONUs and overhead overlap between frames that use different wavelengths, almost 100% bandwidth efficiency could be achieved. A serializer that multiplexes signals from two wavelengths is implemented for this purpose.