• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3856-3872
• /
• 2018

HTTP-based adaptive streaming (HAS) has recently been widely deployed on the Internet. In the HAS system, a video content is encoded at multiple bitrates and the encoded video content is segmented into small parts of fixed durations. The HAS client requests a video segment and stores it in the playout buffer. The rate adaptation algorithm employed in HAS clients dynamically determines the video bitrate depending on the time-varying bandwidth. Many studies have shown that an efficient rate adaptation algorithm is critical to ensuring quality-of-experience in HAS systems. However, existing algorithms have problems estimating the network bandwidth because bandwidth estimation is performed on the client-side application stack. Without the help of transport layer protocols, it is difficult to achieve accurate bandwidth estimation due to the inherent segment-based transmission of the HAS. In this paper, we propose an alternative approach that utilizes the playout buffer occupancy rather than using bandwidth estimates obtained from the application layer. We start with a queueing analysis of the playout buffer. Then, we present a buffer-aware rate adaptation algorithm that is solely based on the mean buffer occupancy. Our simulation results show that compared to conventional algorithms, the proposed algorithm achieves very smooth video quality while delivering a similar average video bitrate.

• 한국멀티미디어학회논문지
• /
• 제19권2호
• /
• pp.325-333
• /
• 2016

The development of smart technology has brought the conversion of closed traditional e-learning contents into open flexible smart learning contents consisting of learner-centered modules, without the constraints of time and space by use of smart devices from the uniformed and passive classroom between teachers and learners. It has been demanded an open, personalized and customized teaching and learning contents of smart education and training systems according to wide supply of various smart devices. In this paper, we discuss about the status of the smart teaching and learning systems and analyze the characteristics and structure of the web contents for smart education and training systems by use of smart devices. And we propose a method how to block web contents, to extract them, and adapt personalized segments of web contents by adaptive algorithm into smart learning devices. We extract blocks from the web contents based on the smart device information and the preference information of the learners from existing web contents without the hassle of learners environment. After specifying a block priority from the extracted web contents by the adaptive segment algorithm, it can be displayed directly to the screen to fit the individual learning progress of the learners.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권6호
• /
• pp.628-646
• /
• 2009

Users want to browse and search various web contents with mobile devices which can be used anywhere and anytime without limitations, in the same manner as desktop. But mobile devices have limited resources compared to desktop in terms of computing performance, network bandwidth, screen size for full browsing, and etc, so there are many difficulties in providing support for mobile devices to fully use desktop-based web contents. Recently, mobile network bandwidth has been greatly improved, however, since mobile devices cannot provide the same environment as desktop, users still feel inconvenienced. To provide web contents optimized for each user device, there have been studies about analyzing code to extract blocks for adaptation to a mobile environment. But since web contents are divided into several items such as menu, login, news, shopping, etc, if the block dividing basis is limited only to code or segment size, it will be difficult for users to recognize and find the items they need. Also it is necessary to resolve interface issues, which are the biggest inconvenience for users browsing in a mobile environment. In this paper, we suggest a personalized adaptation system that extracts item blocks from desktop-based web contents based on user interests, layers them, and adapts them for users so they can see preferred contents first.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4585-4603
• /
• 2015

Video streaming services make up a large proportion of Internet traffic on both fixed and mobile access throughout the world. Adaptive streaming allows for dynamical adaptation of the bitrate with varying network conditions, to guarantee the best user experience. Adaptive bitrate algorithms face a significant challenge in correctly estimating the throughput as it varies widely over time. In this paper, we first evaluate the throughput estimation techniques and show that the method that we have used offers stable response to throughput fluctuations while maintaining a stable playback buffer. Then, we propose an adaptive bitrate scheme that intelligently selects the video bitrates based on the estimated throughput and buffer occupancy. We show that the proposed scheme improves viewing experience by achieving a high video rate without taking unnecessary risks and by minimizing the frequency of changes in the video quality. Furthermore, we show that it offers a stable response to short-term fluctuations and responds swiftly to large fluctuations. We evaluate our algorithm for both constant bitrate (CBR) and variable bitrate (VBR) video content by taking into account the segment sizes and show that it significantly improves the quality of video streaming.

• 방송공학회논문지
• /
• 제22권5호
• /
• pp.618-631
• /
• 2017

본 논문에서는 시변 네트워크 상황에서 끊김 없는 미디어 서비스를 제공 할 수 있는 퍼지 논리 기반 DASH 적응 알고리즘(FDASH)의 수정을 제안한다. 제안하는 알고리즘은 퍼지 논리 제어부(FLC : Fuzzy Logic Controller)의 수정을 통하여 다음 요청 할 세그먼트의 비트율에 대해 최적의 판단을 하도록 하고, 세그먼트 비트율 필터링 모듈(SBFM : Segment Bit-rate Filtering Module)을 적용하여 비디오 화질의 변화 횟수를 줄인다. 또한, 스트리밍 서비스를 시작 할 때 사용자들이 일정시간 저화질의 비디오를 시청해야 하는 상황을 막는 시작 메커니즘(Start Mechanism)과 버퍼의 오버플로우를 방지하는 대기 메커니즘(Sleeping Mechanism)을 포함한다. 최종적으로 제안된 알고리즘이 FDASH에 비해 좋은 성능을 가짐을 NS-3를 이용한 모의실험을 통해 검증한다. 모의실험 결과, 제안된 방식이 FDASH에 비해 제한된 버퍼크기 상황 하에서도 버퍼 언더플로우/오버플로우가 발생하지 않음을 확인하였다. 또한 점대점(Point-to-Point) 환경과 Wi-Fi환경에서 거의 동일 화질 성능을 보이면서도 비디오 화질 변화 횟수를 50% 이상 줄일 수 있음을 확인하였다.

• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• 제어로봇시스템학회논문지
• /
• 제7권8호
• /
• pp.675-679
• /
• 2001

This paper presents walking algorithm for a quadruped robot that does not have an upper body. Tilting motion is added to the planned walking trajectory instead of using an extra body segment that is independent on walking trajectory. Area and tracking algorithms are proposed as tilting method and compared with that of off-line tilting and that of no tilting. Computer simulation shows that stability of tilted walking is more improved than that of the usual walking algorithm for general walking paths. It also shows that the tracking method guarantees stability and best mobility.

• 대한전자공학회논문지SP
• /
• 제39권2호
• /
• pp.116-127
• /
• 2002

본 논문에서는 CDHMM 음성인식기의 인식성능을 향상시키기 위해 상태 당 관측밀도함수 수 변화에 의한 화자적응 알고리듬을 제안하였다. 제안한 방법은 CDHMM의 각 상태마다 관측 확률밀도함수의 가지 수가 두 개 이상이 릴 수도 있게 하여 발음특성의 다양성을 반영할 수 있게 하였다. 가지 수는 각 상태에 속하는 적응음성의 프레임 수에 따라 정하는 방법과 특징벡터 행렬식에 따라 정하는 방법으로 하였다 이두 방법중의 어느 하나로 관측 확률밀도함수의 가지가 결정되면, 세분화된 각 가지로부터 MAP 파라미터를 추출함으로써 정밀한 화자적응모델의 파라미터를 구할 수 있었다. 아울러 적응음성을 상태분할 할 때 기존의 화자독립모델을 사전정보로 이용함으로써 ML 추정시의 초기 상태분할 오류의 영향을 줄여 기존 상태분 할 방법의 단점을 개선하였다 그리고 상태지속분포를 화자에 적응시킴으로써 화자 고유의 발음속도와 발음 패턴 등의 음성특성을 흡수하도록 하였다. 제안한 방법들의 타당성을 확인하기 위한 실험에서 제안한 방법이 기존 방법에 비해 높은 인식률을 얻음을 확인하였다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 추계종합학술대회
• /
• pp.553-556
• /
• 2005

Bluetooth 환경에서 SAR(Segment And Re-assembly) 알고리즘을 사용하여 WAP 성능을 향상시키기 위한 WAP 패킷의 전송 시간을 분석하였다. 이러한 WAP의 전송 능력을 향상시키기 위한 한 방법으로 SAR의 과정은 WTP (Wireless Transaction Protocol) 상위계층에서 내려온 전체 메시지를 분할한 다음, 베이스밴드에서 패킷을 전송하게 된다. 그리고 Bluetooth 피코넷 환경에서 SAR 알고리즘을 사용하여 Bluetooth 패킷 타입 중 DM(Data-Medium rate) 1, DM3, DM5 에 따른 Bluetooth 환경에서 WAP의 패킷 전송 시간을 분석하였다. 이 SAR 알고리즘은 멀티 슬롯으로 전송할 경우 L2CAP (Logical Link Control And Adaptation Protocol) 베이스밴드 패킷 전송 시간을 감소시킨다.

• 한국항행학회논문지
• /
• 제6권2호
• /
• pp.158-167
• /
• 2002

본 논문은 Bluetooth 환경에서 SAR-QT (Segment And Re-assembly Quick Transfer) 알고리즘을 사용하여 WAP (Wireless Application Protocol) 성능을 향상시키기 위한 WAP 패킷의 전송 시간을 분석하였다. 이러한 WAP의 전송 능력을 향상시키기 위한 한 방법으로 SAR-QT의 과정은 WTP (Wireless Transaction Protocol) 상위 계층에서 내려온 전체 메시지를 분할한 다음 베이스밴드에서 패킷을 전송하게 된다. 그리고 Bluetooth 피코넷 환경에서 SAR-QT 알고리즘을 사용하여 Bluetooth 패킷 타입 중 DM (Data-Medium rate) 1, DM3, DM5에 따른 WAP over Bluetooth의 패킷 전송 시간을 분석하였다. 이 SAR-QT 알고리즘은 멀티 슬롯으로 전송할 경우 L2CAP (Logical Link Control And Adaptation Protocol) 에이스밴드 패킷 전송 시간을 감소시킨다. 결과로부터, WAP over Bluetooth 환경에서 WAP 패킷의 전송 시간을 줄이기 위해서 WTP 패킷 크기가 증가해야 한다는 점을 알 수 있었다 또한, 이러한 무선 채널을 고려한 Rician 페이딩 환경에서 WAP over Bluetooth의 적당한 패킷 크기를 구할 수 있었다.