• Electronics and Telecommunications Trends
• /
• v.33 no.3
• /
• pp.1-10
• /
• 2018

This article presents spectrum sharing policy trends both overseas and domestically. The Federal Communications Commission recently adopted rules for the commercial use of a 150 MHz bandwidth at 3.55 to 3.7 GHz, which has been utilized for defense and satellite services. This frequency band for spectrum sharing is called the citizens broadband radio service (CBRS) band. In Europe, the related regimes for licensed shared access application at 2.3 to 2.4 GHz has been organized, and interface standardization for sharing frequency information has been completed. In Korea, efforts are being made to establish spectrum-sharing policies to improve the efficiency of the frequency utilization. This article also introduces both the IEEE 802 local area network/metropolitan area network and 3GPP standardization activities with regard to frequency sharing technologies. To effectively solve the spectrum-sharing problem in IEEE 802, standardization activities on the CBRS and the mid-band (3.7-24 GHz) are underway. 3GPP is currently developing the standardization of a licensed assisted access technology, which extends mobile communication services provided in the licensed band to unlicensed bands.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.4
• /
• pp.32-39
• /
• 1999

Video-On-Demand servers have to provide timely processing guarantees and reduce the storage and reduce the storage and bandwidth requirements for continuous media However, compression techniques used in Video-On-Demand servers make the bit rates of compressed video data significantly variable from frame to frame Consequently, most pervious Video-On-Demand servers which use constant bit rate retrieval to guarantee deterministic service under-utilize the system resources and restrict the number of clients. In this paper, I propose a buffer management scheme called CAP(Caching And Prefetching) for Video-On-Demand server using variable bit rate continuous media. By caching and prefetching the data CAP reduces the variation of the compressed data and increases the number of clients simultaneously served and maximizes the utilization of system resources. Results of trace-driven simulations show the effectiveness of the scheme.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.651-658
• /
• 2006

Mobile computing environment is known to be quite difficult to provide user with a stable QoS(Qualify of Service) due to its mobility nature. In order to protect the inherent characteristics of wireless network such as low bandwidth and high transmission delay along with the user's mobility, many works are conducted to apply caching and prefetching methods. This paper presents a novel prefetching technique which is based on user's preference, that is, interest and Uuかity. It tries to improves the effectiveness of prefetching by separating and appling the interest with personal tendency of a given information, and the popularity with general tendency of the information. The proposed scheme shown relatively superior performance in terms of the utilization ratio of prefetched information and the failure ratio of information retrieval than the existing methods.

• Journal of Korea Multimedia Society
• /
• v.2 no.1
• /
• pp.22-29
• /
• 1999

In video-on-demand systems, movies are striped across the disks of the array in a video server to support multiple access. The blocks of the movies have to be placed carefully on the disks of the array in a video server in order to avoid load imbalance across these disks as well as to achieve maximum utilization of both space and bandwidth of these disks. This paper proposes a movie placement method called the GARR (group-alternation round-robin) that is based on the dynamic disk striping method considering the popularity of movie. The GARR uses group-alternation as movie selection policy and round-robin as data placement policy, where group-alternation allocates popular movie and unpopular movie groups to disks alternately. The performance of the GARR is evaluated by simulations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.3
• /
• pp.63-72
• /
• 1999

Recent studies on the Constant Bit Rate and Variable Bit Rate transmissions have mainly focused on the frame by frame encoder rate control based on the quantization parameter. With the existing approaches it is difficult to guarantee a consistent video quality. Also, the rate control overhead is too high for the real-time video sources. In this paper, a channel rate allocation scheme based on the control period is proposed to transmit a real-time video, in which the control period is defined by a pre-specified number of frames or group of pictures. At each control period, video traffic information is collected to determine the channel rate at the next control period. The channel rate is allocated to satisfy various channel rate constraints such that the buffer occupancy at the decoder is maintained at a target level. If the allocated channel rate approaches the level at which the negotiated traffic descriptions may be violated, the encoder rate is decreased through adjusting quantization parameters in the MPEG encoder. In the experimental results, the video quality and the overflow and underflow probabilities at the buffer are compared at different control periods. Experiments show that the video quality and the utilization of network bandwidth resources can be optimized through the suitable selection of the control period.

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

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. As demand for services has expanded in the cellular segment, sever innovations have been made in order to increase the utilization of bandwidth. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. Hierarchical network design holds the public eye because of increasing demand and quality of service to mobile users. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. In addition, we know the avenue and demand as an assumption. We propose the network about the profit maximization. This study can apply to GSM(Global System for Mobile Communication) which has 70% portion in the world. Hierarchical network design using GA(Genetic Algorithm) is the first three-tier (Macro, Micro, Pico) model, We increase the reality through applying to EMC (Electromagnetic Compatibility Constraints). Computational experiments on 72 problem instances which have 15${\sim}$40 candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers more than 90% of the demand.

• Journal of Korea Multimedia Society
• /
• v.11 no.11
• /
• pp.1536-1546
• /
• 2008

RSVP-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. A RSVP-capable router based on the LOFQ (Latency optimized fair queuing) algorithm had been proposed to improve the performance of the WFQ-based RSVP-router, but it required not only the RESV message to be expanded but also its performance could be evaluated only through simulation. This paper proposed a LOFQ based RSVP-capable router using the conventional RESV message and developed an algorithm to analyze the performance of the LOFQ based RSVP-capable routers. The performance evaluation using the developed algorithm showed that in terms of performance improvement the proposed router is inferior to the one using the expanded RESV message under a small packet size, but on the range of a large packet size both routers provide the same improvement.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.177-182
• /
• 2007

무선 공유기란 사설 IP 여러 개를 생성하는 NAT(Network Address Translation) 기능을 사용하여 회선 하나를 여러 사용자가 무선을 통해 공유할 수 있는 장치이다. 사용자가 무선 공유기를 사용할 때 2가지 문제점을 가진다. 첫째는 사용자가 무선 공유기를 사용하려는 시점에 여러 개의 무선 공유기가 존재한다면, 어떤 공유기를 사용하여야 하는 가에 문제이다. 두 번째는 첫 번째 과정을 통해 선택된 무선 공유기가 무선 공유기 중에서 최대의 대역폭을 보장해주는가에 대한 문제이다. 이에 본 논문에서는 SSID Hiding을 이용한 무선 공유기의 성능 향상 기법을 제안한다. 제안된 기법은 여러 개의 무선 공유기가 존재하면 이중에 가장 좋은 성능을 가지는 공유기만을 사용자에게 보이게 함으로써 기존 무선 공유기가 가지는 2개의 문제를 해결한다. 실험을 통해 제안된 방법이 기존 방법에 비해 성능이 향상되었음을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.736-745
• /
• 2003

Resource allocation methods are proposed to address the problem of how flexibly allocate limited wireless resource to high bandwidth demanded realtime class with certain QoS guarantees in CDMA/TDD systems. In this method, A reserved access scheme is used for allocating the resource to realtime and non-realtime class respectively. We also propose a slot allocation algorithm for the CDMA/TDD system, which can prevent the performance degradation due to the interlink interference in each cell. Our framework is able to guarantee QoS continuity of realtime class and carry the maximum number of non-realtime subscriber. System performance of proposed method is evaluated by considering transmission delay, channel utilization and data loss, assuming a practical multi-cell environment and a multimedia service model. Our simulation results demonstrate the significant performance improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.641-649
• /
• 2004

We propose a dynamic traffic management model which uses adaptive priority reassignment algorithm to deliver service differentiation in home networks, and implement adaptive priority reassignment algorithm using FPGA. The proposed architecture is designed to handle home network traffic without the need for signaling protocol. We categorize home network traffic into three kinds of traffic class: control data traffic class, the Internet data and non-real-time data traffic class, and multimedia data traffic class (include non-real-time and real-time multimedia data traffic). To support differential service about these kinds of traffic class, we designed and implemented a traffic management framework that dynamically change each traffic class priority depending on bandwidth utilization of each traffic class.