• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.269-274
• /
• 2001

This paper is study of buffering system for multimedia server. We propose the scheme that increasing the performance of multimedia sever by using the buffer sharing scheme and slot addressing algorithm to maximize fixed buffer utilization. Also, we calculate reference time about a used block and next stream reuse that stram. As a result, we propose the buffering system satisfy the users request using the extra bandwidth that reducing multimedia server I/O.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.656-665
• /
• 2000

A critical issue in the performance of a video-on-demand system is the I/O bandwidth required in order to satisfy client requests. Several approaches: batching, bridging, piggybacking are used ot reduce the I/O demand on the video server through sharing. Piggybacking is the policy for altering display rates of requests in progress fro the same object, for the purpose of merging their corresponding I/O streams into a single stream, which can serve the entire group of merged requests. In this paper, we propose a new policy called an adaptive reservation-based piggybacking that dynamically reserves the I/O stream capacity of video server for popular videos according to video server loads to immediately schedule the requests for popular videos. The performance of the proposed policy is evaluated through simulations, and is compared with that of simple piggybacking. As the result, we know that the adaptive reservation-based piggybacking provides better service probability, average waiting time and percentages saving in frames than simple piggybacking.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.27-30
• /
• 2002

In this paper, we propose a window-based congestion control algorithm to achieve a fair sharing of the available bandwidth in ECN capable heterogeneous TCP networks with a single bottleneck link. The proposed algorithm is based on extracting the network status from the successive binary congestion information provided by ECN. From the explicit network information, we estimate the fair window size proportional to the propagation delay. Through simulations, the effect and performance of the proposed algorithm are shown for the heterogeneous networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1103-1106
• /
• 2000

정체(congestion)가 발생한 네트워크에서 자원관리 시스템은 정체를 제어하고 프레임 상실(loss)을 최소화함으로써 리얼타임 트래픽에 대한 요구를 충족시키기 위해 절대적으로 요구된다. 그에 따라 본 논문에서는 외부출력 인터페이스(Outgoing Interface)를 통과한 각종 멀티미디어 프레임들의 정체나 상실을 최소화하는 것을 기본 목적으로 하여 임계작업(mission critical)의 애플리케이션이 요청한 트래픽이 삽입되는 큐에 프레임이 존재하는 한, 부 스케줄러(Child Scheduler)를 생성하여 연속적으로 처리를 해주는 한편, 다른 트래픽들은 주 스케줄러(Parent Scheduler)가 할당된 대역폭만큼 Round-Robin 방식으로 계속 처리를 해주도록 하여 기아(starvation)가 일어나지 않도록 하는 CQ(Custom Queuing) 기반의 대역폭 공유 큐잉 알고리즘을 설계하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• Journal of Power Electronics
• /
• v.15 no.4
• /
• pp.886-898
• /
• 2015

The design feasibility of a micro unidirectional DC transmission system based on an input-parallel output-parallel (IPOP) converter is analyzed in this paper. The system consists of two subsystems: an input-parallel output-series (IPOS) subsystem to step up the DC link voltage, and an input-series output-parallel (ISOP) subsystem to step down the output voltage. The two systems are connected through a transmission line. The challenge of the delay caused by the communication in the control system is addressed by introducing a ring communication structure, and its influence on the control system is analyzed to ensure the feasibility and required performance of the converter system under practical circumstances. Simulation and experiment results are presented to verify the effectiveness of the proposed design.

• Electronics and Telecommunications Trends
• /
• v.38 no.5
• /
• pp.100-113
• /
• 2023

This study was aimed to derive implications in terms of competition to establish a reasonable spectrum policy for fifth-generation (5G) spectrum allocation through an in-depth analysis of C-band spectrum auctions. As a result of examining auctions in five countries, namely, Belgium, Sweden, Canada, Brazil, and Hong Kong, we identified various characteristics. First, the minimum bandwidth that is essential for service competition is guaranteed. Second, in Brazil, the network construction cost of mobile network operators is regarded as a part of the spectrum price. Third, a joint allocation of spectrum is permitted in Sweden, and spectrum sharing after allocation for 5G services is allowed in Canada. Finally, the reserved spectrum is provided for new service providers in Belgium and Canada. Our findings may provide insights for establishing policies of 5G spectrum allocation and competition in the telecommunications service market in Korea.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.855-857
• /
• 2007

In recent years, Wireless Mesh Network (WMN) is a compelling topic to many network researchers due to its low cost in deployment, ease and simplicity in installation and scalability and robustness in operation. In WMN, Gateway nodes (Access Point-AP) are in charge of steering the traffic from the external network (e.g. Internet...) to client devices or mesh clients. The limited bandwidth of wireless links between Gateways and intermediate mesh routers makes the Gateways becomes the bottleneck of the mesh network in both uplink stream and downlink stream. In this paper, we propose a mechanism to permit Gateways collaboratively work to manipulate the traffic to fit our network. They will move the traffic from congested links to the unused capacity on other links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6B
• /
• pp.474-482
• /
• 2012

Mobile Gateway(MG) is a wireless LAN device to provide internet services to a passenger on vehicles like a bus. For using internet services, MG connects the Road Side Unit AP(RSU AP) based on WLAN .To provide a stable communication service on the moving vehicle, handoff changing MG's RSU must be handled fast and stably. However, it has a physical limits to remove a disconnection time of handoff process by reason of its technological features. In this paper, we suggest a MIMG(Multi-Interface Mobile Gateway) executing seamless handoff by using multiple wireless LAN interfaces for connecting RSU. In the detailed way to do stable handoff, we suggest the "Link Sharing Technique" to disconnection time of packet transmission for RSU to MIMG and the "Path Sharing Technique" to remove disconnection time of packet transmission for MIMG to RSU. we implemented the MIMG which performs the suggested handoff technique. We confirmed the superiority of our system by remove of the disconnection time(0 ms), and improved over 50 % of the communication bandwidth.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.