• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.489-498
• /
• 2012

Recently, as the interest in Green IT is exponentially increased, EPON with sleep mode has been studied to reduce energy consumption in access network. In oder to guarantee cyclic sleep for ONU(Optical Network Units), EPON with sleep mode transmits upstream and downstream data at the same time. However, since conventional algorithms for sleep mode in EPON allocate bandwidth to each ONU according to upstream bandwidth request, the QoS of downstream data is not guaranteed when the offered load of OLT is larger than that of ONU. In this paper, we propose a bandwidth allocation algorithm for improving QoS in EPON with sleep mode. The proposed algorithm compares its size with an upstream request of ONU when a downstream buffer in the OLT exceeds a QoS threshold. And then it allocates selectively a bandwidth that satisfies the required QoS between the bandwidth request of ONU and OLT. Therefore, the proposed algorithm can save energy through cyclic sleep of ONUs while guaranteeing the QoS of up/downstream data. In order to evaluate the proposed algorithm, we perform simulation in terms of total sleep time of ONUs, queueing delay between OLT and ONU, and the utilization of allocated bandwidth at OLT through OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1113-1119
• /
• 2006

For a multi-user OFDM system in mobile channels which requires low-complexity in adaptive resource allocations, resource allocation algorithm using multi-threshold is proposed. The allocation scheme, which is performed by the multi-threshold values in descending order, considers only subcarriers over each threshold level. Moreover, some subcarriers with the lowest channel gain can be· removed in the present threshold level within the constraint of satisfaction of the required data rate, in order to allocate them to the other users when the allocation process of next threshold is executed. As a result, the proposed bandwidth and subcarrier algorithm has better system performances than the conventional allocation schemes in terms of required power and processing time, which is expected as a technique that improves the spectral efficiency of OFDM systems in a mobile environment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.404-410
• /
• 1999

A scheme of more exact overflow probability analysis is proposed for traffic regulated by dual leaky bucket. To each regulated traffic stream is allocated bandwidth and buffer independent of other traffic stream and overflow occurs when total bandwidth or buffer allocated to each traffic exceed link capacity or physical buffer size. Ratio of buffer and bandwidth allocated to each traffic stream is assumed to be constant, and this ratio is larger than the ratio of physical buffer and bandwidth due to buffer sharing effect. Numerical experiments show that this sharing effect have significant influence on overflow probability and effective bandwidth.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.205-206
• /
• 2008

We propose load balancing algorithm based on cross layer designing for MIMO OFDM system. When there are many users using data service, base station(BS) should distribute traffic. Moreover, cross layer design gives benefit managing radio resource and network bandwidth management. Proposed cross layer load balancing technique manages both BS's bandwidth allocation and MS’s power control. One BS request bandwidth to other BSes and other BSes reduce each bandwidth. And BSes reduce power of sub carriers for reserving available bandwidth of backhaul. MSes that didn't get service can be served by obtaining bandwidth from other BSes. The simulation result shows more users can be served and cell throughput was increased

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.402-407
• /
• 2007

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3011-3018
• /
• 2000

On ATM networks, ABR services are provided using the remained bandwidth after allocating CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR and VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. This paper proposes an efficient bandwidth allocation algorithm to transfer real-time data using ABR service. The proposed algorithm guarantees MCR and allocates bandwidth to each connection proportional to its MCR. The proposed algorithm divides the connections in two groups - a satisfied state group and a bottlenecked state group - and enhances bandwidth utilization by allowing the remained bandwidth after allocating the connections in the satisfied state to be allocated to the connections in the bottlenecked state. Our algorithm uses a Queue control function proposed by Ghani[5] to keep the Queue length within some boundary, which makes the transmission delay constant. We simulate and compare the performance of the proposed algorithm with that of the algorithms proposed by ATM Forum[1] and Kalampoukas[2].

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.641-649
• /
• 2005

Metro networks use the existing circuit-switching technology like SONET/SDH. Such circuit-switching based networks are inefficient in tarrying Internet traffic with bursty nature. Therefore, metro networks can become a bottleneck In order to resolve this problem, the IEEE 802.17 working group has proposed the RPR (Resilient Packet Ring) technology. In addition to this, the RPR fairness mechanism has been defined to provide fairness among the stations in the RPR network. However, the current RPR fairness mechanism has the problem of inefficient use of the available bandwidth after when the congestion at a node is resolved. In this paper, we propose an improved bandwidth allocation mechanism in which, after the congestion resolution at a node, the node estimates the number of nodes transmitting data and measures the remaining bandwidth and fairly allocates the available bandwidth to active nodes. To show the performance of our proposed mechanism, we have performed simulation and showed that the proposed mechanism offers higher bandwidth utilization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.113-116
• /
• 2007

T-DMB (Terrestrial-DMB) service is now available in the metropolitan area, but due to the bandwidth limitation, it is allowed to provide up to CIF resolution. As users' requests for high-quality mobile multimedia services are rapidly increasing and additional bandwidth can be provided by adopting the hierarchical modulation transmission technology, the research on the Advanced Terrestrial-DMB(AT-DMB) service using the SVC(Scalable Video Coding) scheme is being actively studied. In this paper, through computer simulations, first, while keeping the current T-DMB service unchanged, the visual qualities of AT-DMB services are investigated by varying the additional bandwidth. Then, by considering the cases that the overall bandwidth can be allowed to dynamically allocate to the T-DMB/AT-DMB video services, the performance characteristics between two layers are compared over the different kinds of video sequences.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.200-214
• /
• 2000

In general, it is difficult to transmit a VBR video like MPEG efficiently since MPEG fames are construct with various size. To solve this problem, some bandwidth smoothing techniques are proposed which is based on the prefetching video data into the client buffer with low bandwidth allocation. However these techniques do not provide efficient bandwidth smoothing technology and transmission technique for interactive video services like VCR-like functionality. In this paper, we propose and evaluated a new bandwidth allocation mechanism for interactive video services which has VBR traffic characteristics such a MPEG. This technique provides VCR-like functionality which is not supported on previous techniques and also maximizes the bandwidth utilization when interactive video services are provided. Through our experimental, we prove that the proposed technique dramatically decreases a traffic and guarantee the continuous playback simulaneously.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.55-58
• /
• 2007

An adaptive subcarrier allocation scheme based on comparative superiority of opportunity cost between groups is proposed for the enhancement of system capacity and its simple implementation at the base station of a multiuser OFDM system. The proposed algorithm is similar to the blockwise or the decentralized subcarrier allocation algorithm proposed by Xiaowen et al and Alen et al, respectively. In the proposed algorithm, however, all subcarriers are grouped according to the coherence bandwidth and the comparative superiority concept, which swaps the groups between users if the system capacity is increased, is adopted for the enhancement of system capacity. In addition, the proposed algorithm provides a simple solution for the conflict problem among users by reallocating only the conflicted groups and unassigned groups instead of reallocating entire groups. Simulation results demonstrate that the proposed algorithm increases the system capacity effectively over a static, an adaptive blockwise, and a decentralized subcarrier allocation algorithms.