• Journal of Korea Game Society
• /
• 제14권6호
• /
• pp.59-68
• /
• 2014

Memory bandwidth requirements of UHD (Ultra High Definition $4096{\times}2160$) game scenes have been much more increasing. This paper presents a lossless DPCM-GR based compression algorithm using CUDA for solving the memory bandwidth problem without sacrificing image quality, which is modified from DDPCM-GR [4] to support bit parallel pipelining. The memory bandwidth efficiency increases because of using the shared memory of CUDA. Various asynchronous transfer configurations which can overlap the kernel execution and data transfer between host and CUDA are implemented with the page-locked host memory. Experimental results show that the maximum 31.3 speedup is obtained according to CPU time. The maximum 30.3% decreases in the computation time among various configurations.

• Journal of Internet Computing and Services
• /
• 제9권6호
• /
• pp.179-188
• /
• 2008

Even though a lot of researches to improve the performance of TCP over wireless networks have been performed, the performance of TCP cannot satisfy users under high packet loss rate of wireless networks. This paper addresses the problem of TCP Westwood under high packet loss rate and reveals the reasons through the extensive simulation analysis. The ABE(Available Bandwidth Estimation) of TCP westwood becomes incorrect due to TCP dynamics of loss recovery. Based on this observation, we propose two algorithms for enhancing the correctness of ABE. We have evaluated the effects of the proposed algorithms through simulation. The proposed algorithms have achieved more correct ABE under the packet loss rate less than 1%.

• Journal of Digital Contents Society
• /
• 제5권4호
• /
• pp.306-310
• /
• 2004

In this paper, we proposed a capacity enhancement method using TCM-128QAM modulation and bandwidth extension of 25MHz in HDR-WPAN (high data rate wireless personal area network) system. In case using TCM-128 QAM modulation scheme, we can obtain maximum 66Mbps transmission rate in bandwidth of 15MHz. If extend bandwidth by 25MHz and roll-off coefficient ${\alpha}=0.35$, we can obtain maximum 110Mbps transmission rate. These results are confirmed through PSD(power spectrum density) analysis and BER (bit error rate) performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2017년도 춘계학술대회
• /
• pp.61-62
• /
• 2017

In this study, a circular polarization patch antenna operates at the wide bandwidth of 1.5GHz~1.7GHz was designed. To obtain the wide bandwidth and high gain, the high air substrate was applied. The impedance bandwidth is improved by adjusting the sizes of patch, the distance between main patch and ground plate, the length of internal slots, the position of feeding point, the length of external stub, etc. The antenna is designed by simulation for an operation in the frequency range of 1.5GHz~1.7GHz band, and the antenna characteristics such as return loss, gain, radiation patterns are examined.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.291-304
• /
• 2019

This paper proposes a dynamic-tiling-based bandwidth-efficient (DTBE) virtual reality (VR) streaming scheme. We consider 360-degree VR contents with multiple view points such as the front, back, upper, and bottom sides. At a given time, the focus of a client is always bound to a certain view among multiple view points. By utilizing this perspective, under our proposed scheme, tiles with high encoding rates are selectively assigned to the focused view where multiple view points consist of multiple tiles with different encoding rates. The other tiles with low encoding rates are assigned to the remaining view points. Furthermore, for reducing view adaptation delay, we design a novel rapid view adaptation mechanism that selectively delivers an I-frame during view point updates by using frame indexing. We implement the proposed scheme on a commercial VR test bed where we adopt the MPEG media transport (MMT) standard with high-efficiency video coding (HEVC) tile modes. The measurement-based experiments show that the proposed scheme achieves an average data usage reduction of almost 65.2% as well as average view adaptation delay reduction of almost 57.7%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제13권8호
• /
• pp.1549-1560
• /
• 2009

In the TDMA PON system, the DBA is essential for ONUs to send data efficiently to the upstream. In this paper, we implement a DBA processor for the G-PON OLT with downstream and upstream rate, 2.5 and 1.25 Gbps, respectively, The processor collects bandwidth request messages from ONUs at every cycle time and allocates properly bandwidth to each Alloc-ID with considering priority and fairness for traffics. In the proposed DBA algorithm, one cycle time consists of multiple G-PON frames ($m{\times}125{\mu}s$) for high link efficiency. In particular, the link efficiency is higher because the algorithm adopts a method that an additional overhead is eliminated when an allocated bandwidth is laid between two G-PON frames for an ONU. This enables that the processor flexibly allocates the bandwidth from zero to the maximum link capacity for an ONU. The proposed DBA processor is implemented with the FPGA and shows bandwidth allocating processes for ONUs with logic analyzer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.2920-2939
• /
• 2012

Enterprises that develop online games have to deploy supporting infrastructures, including hardware and bandwidth resources, in order to provide a good service to users. First Person Shooter games generate high rates of small UDP packets from the client to the server, so the overhead is significant. This work analyzes a method that saves bandwidth, by the addition of a local agent which queues packets, compresses headers and uses a tunnel to send a number of packets within a multiplexed packet. The behavior of the system has been studied, showing that significant bandwidth savings can be achieved. For certain titles, up to 38% of the bandwidth can be saved for IPv4. This percentage increases to 54% for IPv6, as this protocol has a bigger overhead. The cost of these bandwidth savings is the addition of a new delay, which has an upper bound that can be modified. So there is a tradeoff: the greater the added delays, the greater the bandwidth savings. Significant reductions in the amounts of packets per second generated can also be obtained. Tests have been deployed in an emulated scenario matching an access network, showing that if the number of players is big enough, the added delays can be acceptable in terms of user experience.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1311-1326
• /
• 2010

Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.

• Journal of the Korea Society of Computer and Information
• /
• 제15권3호
• /
• pp.73-80
• /
• 2010

The advancement of communication and networking technologies has enabled e-science and commercial application that often require the transport of large volume of data over wide-area network. Schedulable high-bandwidth low-latency connectivity is required to transport the large volume of data. But the public Internet does not provide predictable service performance. Especially, if data providers and users are far away, dedicated bandwidth channels are needed to support remote process efficiently. Currently several network research projects are in progress to develop dedicated connectionsy sA bandwidth scheduler computes an user requested path based on network topology information and link bandwidth allocationsy In this paper, we have proposed an efficient algorithm for finding the earliest time interval when minimum bandwidth and duration are giveny Our algorithm is experimentally compared with the known algorithm.