• Journal of Satellite, Information and Communications
• /
• v.6 no.1
• /
• pp.19-27
• /
• 2011

In this paper, we propose the data stream allocation algorithms for maximizing sum capacity of downlink multiuser MIMO (Multiple-input Multiple-output) systems with BD (Block Diagonalization). The conventional BD precoding algorithms maximize the capacity by controlling power against channel gain of each user. In multiuser MIMO systems, however, the number of data streams for each user can be used to as another control parameter, which determines the capacity. This paper proposes the data stream allocation algorithm of BD for increasing capacity in multiuser MIMO systems. The proposed algorithm allocates unequal bit stream to each user based on channel matrix of each user for maximizing sum capacity. It is proved that proposed algorithm can achieve the significantly improved sum capacity by computer simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.05a
• /
• pp.233-237
• /
• 1998

다중의 연속 미디어 데이타를 출력 마감시간(playout deadline)전에 검색 및 전송하여 자연스럽게 처리하기 위한 가장 효율적인 처리방안은 메모리 버퍼를 이용하는 것이다. 본 논문에서는 다중 스트림의 데이타 전송 요구 및 해제시의 버퍼 상태를 파악하여 버퍼를 동적으로 할당하고 물리작인 버퍼를 윈도우 크기의 논리버퍼로 분할하여 동적으로 관리하는 매핑관리자를 설계하여 버퍼이용률을 높일 수 있는 방안을 제시하였다. 또한, 서로 다른 소비율로 발생된 여분의 버퍼 공간을 활용할 수 있는 지능적인 선반입 기법과 마감시간을 고려한 전송 스케줄링 기법을 통해 실시간에 동기식으로 다중 미디어 스트림을 전송할 수 있는 동적 버퍼 관리 기법을 제안하였다. 마지막으로, 버퍼의 이용율을 높이기 위해 입출력 주기에 따라 버퍼 공간을 여러 스트림들이 파이프라이닝 방식으로 버퍼를 공유하는 기법과 잔여 버퍼공간의 할당 여부를 결정하기 위한 수락제어 기법을 적용하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.179-183
• /
• 2008

연속적이고 무한히 발생되는 데이터 스트림을 관리하는 데이터 스트림 관리시스템(DSMS)은 연속질의를 이용하여 스트림을 처리한다. 연속질의는 질의 별로 독립적인 큐를 유지하기 때문에 질의 개수가 증가함에 따라서 메모리 비용이 증가되며, 잦은 메모리 할당으로 인한 시스템의 성능 저하를 갖는다. 이러한 문제점을 해결하기 위한 기존의 연구로 메모리 풀을 이용한 메모리 관리 기법이 있다. 하지만 페이지의 크기가 고정되어 있기 때문에 각 질의마다 필요로 하는 데이터 스트림의 최적의 크기에 적합하게 할당되지 못하여 메모리를 낭비하는 문제점이 있다. 본 논문에서는 이러한 문제를 해결하기 위해 연속질의 처리를 위한 큐 메모리 관리 기법을 제안한다. 제안기법은 큐 관리 테이블에서 관리하는 각각의 큐 메모리들을 타임스탬프를 가지고 일정한 기간을 주기로 큐 메모리의 사용량을 분석한다. 분석된 큐 메모리들은 이전의 큐 메모리의 사용량과 현재 사용된 큐 메모리의 사용량을 비교함으로써 상한 값과 하한 값을 구함으로써 현재 큐 메모리에서 가지고 있는 사용량을 추가할 것인지, 줄일 것인지를 판단하여, 메모리의 사용량을 최적화 함으로써 시스템의 메모리 가용성을 향상한다. 제안 기법은 성능평가를 통해 메모리의 가용성이 기존의 방식에 비하여 향상된 성능을 보인다.

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

Developing a home network and a ubiquitous infrastructure requires various communication techniques and devices with more advanced hardware. With this development, increasing realtime access to multimedia data results in rapid degradation of qualify for multimedia playback. This paper presents a traffic allocation technique based on MPP(Media Preference for Presentation) that can steadily maintain multimedia playback quality by adaptively allocating streaming traffic requested from clients with different playback performances. Media preference is defined in accordance with content popularity and playback performance of client devices. Through experiments when requested stream data exceeds processing ability of a midea server, the proposed allocation technique shows 10% quality improvement comparing to the system without applying the proposed allocation technique.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.79-88
• /
• 2009

The volume of memory to store real-time data stream is varied dynamically. Continuous queries processing the data stream must manage the storage volume dynamically. In previous research, according to current volume of data a general memory manager which allocates and releases memory by a page unit is researched.However, the method frequently executes page allocation and release to store data stream. Moreover, particularly delayed queries can monopolize many of pages because the method directly allocates pages when a query has not enough memory. Focusing on the problems in memory management systems, this research proposes a memory management method which reduces the frequency of allocation and release and uniformly distributes pages for queries. The method can reduce the frequency of allocation and release through allocation based on utilization ratio of pages in each query and prevent memory monopoly through memory allocation which considers query delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1112-1123
• /
• 2002

Providing a multimedia service requires efficient network bandwidth allocation scheduling. Typically, transmission of information with bursty characteristics, such as a video data stream, utilizes some type of smoothing technique that reduces the transmission rate fluctuation. While capable of a drastic reduction in the peak transmission rate, even the optimum smoothing algorithm proposed to date, however, is rather inadequate for multi-stream applications that share network bandwidth since such an algorithm has been designed and applied toward handling each independent stream. In this paper, we proposed an efficient bandwidth allocation algorithm that addresses these shortcomings. The proposed bandwidth allocation algorithm is divided into two steps, a static bandwidth allocation and a dynamic bandwidth allocation. In the former case, the peak rate reduction is achieved by maintaining the accumulated data in the user buffer at a high level, whereas the concept of real demand factor is employed to meet the needs of multi-stream bandwidth allocation in the latter case, Finally, the proposed algorithm's performance was verified with ExSpect 6.41, a Petri net simulation tool.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.943-950
• /
• 2005

Recently, many of researches on stream transmission for satisfying each of different real-time transmission condition of the multimedia data that demands various service quality through high-speed networks have been studied actively. In this paper, we design a scheme that discriminately reserves the network resources for the transmission of each multimedia application and propose a bandwidth allocation scheme for improving the utilization ratio of free resources. And we also propose a pipelining scheme for providing flexible real-time transmission. The proposed schemes can be used to support a real-time transmission by applying feedback transmission control method based on receiving buffer for guaranteeing the synchronization conditions requested by the multimedia data. Moreover, we propose a transmission control scheme that can take the amount of network resources down to the minimum amount within the range of permissible error-range under the guarantee with no quality degradation simultaneously when the bottleneck is caused by the network congestion. Finally, we propose a dynamic bandwidth smoothing scheme that can smooth the maximum bandwidth to the demand of each video steam for giving continuous transmission to the delay sensitive video steam between senders and receivers.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.296-299
• /
• 2008

최근 데이터 스트림을 관리하기 위해 DSMS(Data Stream Management System)가 계속적으로 연구 되고 있다. 하지만 데이터 스트림은 방대한 양의 데이터를 처리하기 위하여 실시간성을 갖는 빠른 데이터 처리가 요구되며, 이러한 특성 때문에 데이터 처리의 효율성 증대를 위하여 메모리 관리가 중요하다. 기존 메모리 관리에 대한 연구는 쓰레드 스케줄링을 통한 관리 기법이 연구되었다. 하지만 기존의 연산자 쓰레드 스케줄링과 그래프 쓰레드 스케줄링은 쓰레드 관리의 유연성이 떨어지기 때문에 불규칙적인 데이터 스트림 환경에서는 부적합하다. 또한 하이브리드 멀티 쓰레드 스케줄링 기법은 두 가지 기법의 장점을 결합하였으나 가상 연산자의 일회성 사용으로 쓰레드 관리의 어려움 이 있다. 따라서 본 논문은 공유와 재사용이 가능한 링 연산자를 이용한 링 연산자 쓰레드 스케줄 링 기법을 제안한다. 본 기법은 링 연산자를 통해 새로 입력된 질의의 동일한 연산자 구성은 생성 되어 있는 링 연산자를 공유하거나 재사용하여 불필요한 자원 소모와 자원 할당의 과부하를 줄임으로써 기존 기법에 비해 쓰레드 할당의 수를 감소 시켜 대량의 질의 처리 시 속도를 증가 시켰다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.8-18
• /
• 2009

CableLAB published DOCSIS 3.0 Specifications to supply broadband access to homes and small businesses. The primary technique of DOCSIS 3.0 Specification is channel bonding which provides cable operators with a flexible way to significantly increase up/downstream speeds. In this paper, we propose the upstream scheduler that serves channel bonding. Proposed scheduler consists of two sub-scheduler: bonding group scheduler and channel scheduler. Also, we propose three scheduling algorithms to allocate request bandwidth of CM to each bonding channel: equivalent scheduling algorithm, current request-based scheduling algorithm, and last grant-based scheduling algorithm. In order to evaluate the performance of these algorithms and DOCSIS 3.0 MAC protocol, we develop the DOCSIS 3.0 simulator with the network simulator, OPNET, to model DOCSIS network, CMTS, and CM. Our results show that equivalent scheduling algorithm is superior to others in the view of transmission delay and throughput and DOCSIS 3.0 protocol provides higher throughput than pre-DOCSIS 3.0 protocol.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.886-895
• /
• 2004

In this paper, we propose the dynamic allocation scheme of the CPU bandwidth to efficiently integrate and schedule these tasks in the same system, where multimedia tasks and hard real-time tasks can coexist simultaneously. Hard real-time tasks are guaranteed based on worst case execution times, whereas multimedia tasks modeled as soft real-time tasks are served based on mean parameters. This paper describes a server-based allocation scheme for assigning the CPU resource to two types of tasks. Especially for MPEG video streams, we show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task. The primary purpose of the proposed method is to minimize the mean tardiness of multimedia tasks while satisfying the timing constraints of hard real-time tasks present in the system. We showed through simulations that the tardiness experienced by multimedia tasks under the proposed allocation scheme is much smaller than that experienced by using other scheme.