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

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.939-948
• /
• 1999

주문형 비디오나 원격 회의 그리고 원격 강의와 같은 멀티미디어 애플리케이션들은 비디오나 오디오와 같은 멀티미디어 트래픽을 유발한다. 이러한 멀티미디어 트래픽의 가장 큰 특성은 폭주성이다. 폭주성은 통신망의 효율을 떨어뜨리는 매우 중요한 요인이며, 따라서 폭주성에 대처할 수 있는 효율적인 대역폭 할당 정책이 통신망 관리에서 매우 중요하다. 본 논문에서는 멀티캐스팅 방식의 온라인 비디오 애플리케이션에 대해서 대역폭 완화 작업이라고 불리우는 효율적이고 유용한 대역폭 할당 방안을 설계하였다. 본 논문에서 제시하는 새로운 대역폭 완화 기법은 비디오 서버에서 이미 전송된 데이타의 특성을 이용하여 대역폭 완화창의 크기를 조절하는 동적인 기법이다. 몇 가지 MPEG 트레이스들로 실험했을 때 기존의 온라인 대역폭 완화 기법과 비슷한 성능을 보이고, 특히 멀티캐스팅 방식의 온라인 비디오 서비스에 대해서는 서버의 자원 효율성을 향상시킴을 알 수 있었다. Abstract All of the multimedia applications such as VOD, teleconferencing, and tele-lecturing invoke multimedia traffic like video or audio traffic. The most important characteristic of these multimedia traffic is the burstiness property. So, bandwidth management is becoming the major part of network management. In this paper, we propose a new and efficient bandwidth management technique called bandwidth smoothing for the multicasting on-line video applications. Our bandwidth smoothing technique reduces as much of the network bandwidth required to transmit on-line video traffic as previously proposed methods, and improves the server's resource utilization especially for the multicast on-line video services.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.126-134
• /
• 2006

Traditional TCP implementations have the under-utilization problem in large bandwidth delay product networks especially during the startup phase. In this paper, we propose a delay-based congestion control(DCC) mechanism to solve the problem. DCC is subdivided into linear and exponential growth phases. When there is no queueing delay, the congestion window grows exponentially during the congestion avoidance period. Otherwise, it maintains linear increase of congestion window similar to the legacy TCP congestion avoidance algorithm. The exponential increase phase such as the slow-start period in the legacy TCP can cause serious performance degradation by packet losses in case the buffer size is insufficient for the bandwidth-delay product, even though there is sufficient bandwidth. Thus, the DCC uses the RTT(Round Trip Time) status and the estimated queue size to prevent packet losses due to excessive transmission during the exponential growth phase. The simulation results show that the DCC algorithm significantly improves the TCP startup time and the throughput performance of TCP in large bandwidth delay product networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1254-1260
• /
• 2009

This paper proposes history-aware random early detection (HRED), a modified version of RED, to lessen bandwidth monopoly by a few of stations employing multiple parallel TCP flows. Stations running peer-to-peer file sharing applications such as BitTorrent use multiple TCP flows. If those stations share a link with other stations with only a small number of TCP flows, the stations occupy most of link bandwidth leading to undesirable bandwidth monopoly. HRED like RED determines whether to drop incoming packets according to probability which changes based on queue length. However it adjusts the drop probability based on bandwidth occupying ratio of stations, thus able to impose harder drop penalty on monopoly stations. The results of simulations assuming various scenarios show that HRED is at least 60% more effective than RED in supporting the bandwidth fairness among stations and at least 4% in utilization.

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

• International Journal of Knowledge Content Development & Technology
• /
• v.7 no.3
• /
• pp.29-48
• /
• 2017

The aim of this paper was to determine the utilization of online information resources by undergraduate students in the University of Nigeria, Nsukka. It was undertaken specifically with the objectives of identifying the online information resources used; academic purposes for their use, extent, problems and strategies for improving the academic use of the resources by undergraduate students. Descriptive survey was used as the research design. The population of this study comprises of all 25,657 regular registered undergraduate students in University of Nigeria, Nsukka. The sample for this study comprises 2500 students which is 10% of the population. The results of the study shows that most of the online information resources are not used by the undergraduate students. Just a few of them are highly used. Some of the academic purposes for the use of the resources include to do course assignment and project works and to stay up-to-date on social events. The major problems responsible for the low utilisation of the resources include incessant power failure, limited available computers in the university library, and server's low bandwidth. Based on the findings, maintenance of uninterrupted power supply, provision of enough computers in the library; constant upgrade of server's bandwidth and many more were recommended as the strategies for improving the use of online information resources by undergraduate students in UNN. The implication of this study lies in the fact that solutions to the problems raised would be helpful to the university management, librarians and students in ensuring maximum and adequate provision and effective utilisation of online information a resources in the library.

• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.83-93
• /
• 2007

WFQ (Weighted Fair Queuing) is the most popular fair queuing algorithm, but it had the inherent drawback of a poet bandwidth utilization, particularly under the traffic requiring a low rate but tight delay bound such as internet phone. It was recently identified that the poor utilization is mainly due to the non-optimized latency of a flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. In this paper, we improve the performance of LOFQ by introducing an occupied resource optimization function and reduce the implementation complexity of recursive resource transformation by revising the transformation scheme. We also prove the superiority of LOFQ over WFQ in terms of utilization. The simulation result shows that the improved LOFQ provides $20{\sim}30%$ higher utilization than that in the legacy LOFQ.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.688-693
• /
• 2014

With the advent of ubiquitous environments, the smart phone has come into wide use and the demand for various content increases. Thus, in order to efficiently utilize limited resources cognitive radio technology is regarded as a possible solution. Besides spectrum sensing or access schemes, the provision of VoIP traffic service for secondary users with limited spectrum resources is a very important issue. In this paper, a resource allocation and control system for VoIP QoS provision in cognitive radio networks is proposed. Firstly, as the system model, the time structure of the network is addressed and, according to the structure, a bandwidth broker is proposed. In addition, based on available bandwidth estimated by the bandwidth broker, a connection admission control for secondary users is developed. It is demonstrated that the provision of VoIP QoS is greatly affected by channel utilization, the number of channels, and the length of timeslot.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1828-1829
• /
• 2006

In this paper, we propose sliding mode congestion controller for differentiated-services network. Two important issue in differentiated-services architecture are bandwidth guarantee and fair sharing of unsubscribed bandwidth among TCP flows with and without bandwidth reservation. We use tight upper and lower bounds for various settings of differentiated-services parameters using the loss-bounded model. The Sliding mode congestion controller scheme is designed using nonlinear control theory based on a nonlinear model of the network that is generated using fluid flow consideration. The methodology used is general and independent of technology, as for example TCP/IP or ATM. The sliding mode congestion controller methodology has been applied to an TCP network. We use NS-2 simulation to demonstrate that the proposed control methodology achieves the desired behavior of the network, and possesses important attributes. as e.g, stable and robust behavior, high utilization with bounded delay and loss, together with good steady-state and transient behavior.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.8
• /
• pp.45-53
• /
• 2004

This paper proposes and analyzes a new media access control (MAC) scheduling algorithm, “Interleaved Polling with Deficit Round Robin (IPDRR)” that supports weighted fairness among ONUs in Ethernet Passive Optical Network (PON). The purpose of the proposed IPDRR algerian is not only to eliminate the unused bandwidth of upstream ONU traffic, but also to provide weighted fair sharing of upstream bandwidth among ONUs in Ethernet PON systems. Simulation results show that the IPDRR improves the utilization of upstream channel by removing the unused bandwidth and provides weighted fairness among ONUs, although the IPACT scheduling is unfair according to traffic characteristics.