• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.735-742
• /
• 2007

We propose an effective packet marking algorithm for video streaming in DiffServ network. Because legacy packet markers such as srTCM(single rate three color marker) cannot distinguish the importance of packet, these markers can cause quality degradation of streaming during the network congestion period. Recently proposed TMS (Two Marker System) [4] shows effectiveness in such scenario that video streaming service is struggling with other types of service traffic. However, if many video streaming services co-exist in DiffServ network and result in competition among themselves, then both legacy packet markers and even TMS cannot prevent drastic streaming quality degradation. To cope with this, we suggest A-TCPM (Adaptive time sliding window Three Color Marker) algorithm. In this algorithm, an A-TCPM module decides the color of a racket based upon the probability which is lead by current channel status and frame importance ratio. Simulation results show that proposed A-TCPM algorithm can enhance streaming service quality especially when overbooked video streaming sessions struggle with themselves.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.93-100
• /
• 2012

In this paper we have proposed a linear time algorithm for solving the minimum sharable-bandwidth tree construction problem. The public-shared network is a user generated infrastructure on which a user can access the Internet and transfer data from any place via access points with sharable bandwidth. Recently, the idea of constructing the SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients on public-shared network, a tree structure is constructed. The problem of constructing a tree structure to serve the video streaming requests by using minimum amount of sharable bandwidth has been shown to be NP-hard. The previously published algorithms for solving this problem are either unable to find solutions frequently or less efficient. The experimental results showed that our algorithm is excellent both in the success rate of finding solutions and in the quality of solutions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1498-1507
• /
• 2017

According to recent report, global mobile data traffic is expected to increase by 11 times from 2016 to 2020. Moreover, this growth is expected to be driven mainly by mobile video traffic which is expected to account for about 70% of the total mobile data traffic. To cope with enormous mobile traffic, we need to understand video traffic's characteristic. Recently, the repetitive requests of some popular content such as popular YouTube videos cause a enormous network traffic overheads. If we constitute a network with the nodes capable of content caching based on the content popularity, we can reduce the network overheads by using the cached content for every request. Through device-to-device, multicast, and helpers, the video throughput can improve about 1.5~2 times and prefix caching reduces the playback delay by about 0.2~0.5 times than the conventional method. In this paper, we introduce some recent work on content popularity-based caching techniques in wireless networks.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.87-93
• /
• 2015

Recently, an idea has been suggested in which members construct the network by sharing their surplus bandwidth of their own access point. This kind of network is called public-shared network. As an application, SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients, a tree structure is constructed where the root is a stream server, internal nodes are sharable access points, and leafs are clients. The previous researches have focused on constructing the minimal sharable-bandwidth tree which can serve all video streaming requests using the minimal sharable bandwidth. In this paper, we have shown that the problem of constructing a tree structure with given sharable access points to serve maximal video streaming requests is NP-hard. We also have developed an efficient heuristic algorithm for this problem and evaluated experimentally our algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.197-200
• /
• 2017

퍼지 논리를 기반으로 한 적응형 스트리밍 기법인 FDASH 적응 알고리즘은 빠르게 변하는 네트워크 상황에서 우수한 콘텐츠의 화질을 보장하면서 끊김 없는 서비스를 제공하는 특성을 보이지만 비디오의 화질이 자주 변하기 때문에 최고의 사용자 체감 품질 (QoE: Quality of Experience)을 제공하지 못 할 수도 있다. 본 논문에서는 제한된 버퍼 크기를 가지고 동일한 콘텐츠의 화질을 보장하면서도 비디오 화질의 변화 횟수를 줄여서 최적의 QoE를 제공할 수 있도록 하는 변환된 퍼지 논리 기반의 DASH 적응 알고리즘을 제안하고자 한다. 제안된 방식은 우선 퍼지 논리 제어부(FLC : Fuzzy Logic Controller)의 수정을 통하여 다음 세그먼트의 비트율에 대해 최적의 판단을 하도록 하였고, 세그먼트 비트율 필터링 모듈 (SBFM: Segment Bitrate Filtering Module)을 추가하여 비디오 화질의 변화 횟수가 최소화 될 수 있도록 하였으며, 스트리밍 서비스 시작 시 SBFM에 의해 일정시간 저화질의 비디오를 시청해야 하는 상황을 막기 위한 Start Mechanism을 추가하였고, 마지막으로 버퍼의 오버플로우를 방지하기 위해 Sleeping Mechanism을 추가하였다. NS-3를 이용한 네트워크 모의실험 결과를 통해 제안된 방식이 FDASH 방식에 비하여 제한된 버퍼크기 상황 하에서도 오버플로우가 발생하지 않으며 점대점(Point to Point) 상황에서는 거의 동일 화질 성능을 보이면서도 비디오 화질 변화 횟수를 50% 이상 줄일 수 있음과 일반 Wifi환경에서는 오히려 17.8%정도 더 뛰어난 비디오 화질 성능을 보이면서 비디오 화질변화 횟수 측면에서는 53.1%정도 줄일 수 있음을 보여준다.

• 정보화사회
• /
• s.95
• /
• pp.20-25
• /
• 1995

통신위성을 이용한 하나의 네트워크, MSN으로 세계를 묶고, 비디오 및 오디오 전송에 서버프로그램인 타이거를 사용하며, 그 단말에 윈도 95를 공급, 가정에서 글로벌 네트워크까지 일체형으로 연결되는 시스템을 구상 하고 있는 마이크로소프트의 네트워크 전략은 구체적으로 무엇인가.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.299-311
• /
• 2012

Recently, H.264 SE(scalable extension) has become a standard of next generation multimedia service which is one source, multi-user service in the telecommunication environment of different kinds of networks and terminal equipments. But existing DRM schemes for multimedia service are not fit for H.264 SE system. Because the amount of transmitted multimedia data is changed considering network environment and terminal equipments' performance by the system, but in the existing DRM schemes, the amount of handled multimedia data are not variable according to network environment and terminal equipments' performance. In this paper, an information security scheme combined video watermarking and encryption is presented for H.264 SE. Amount of watermarks and embedding positions are calculated by the frame number of enhancement layers which are created according to the state of networks and terminal equipments. In order to minimize delayed time by video watermarking and encryption, the video data are watermarked and encrypted in the H.264 SE compression process. In the experimental results, we confirmed that proposed scheme is robust against video compression, general signal processing and geometric processing.

• Journal of Distribution Science
• /
• v.7 no.1
• /
• pp.35-53
• /
• 2009

Sees the market where home appliance and network equipment, the communication service enterprises are new recently the home network market of the most which has an interest in the home network is being activated the newly-built high-class apartment in the center. The company building leads because not being option of the case last customer of newly-built market and must do a business . marketing. So newly-built market the demand grasp which is individual leads sale activation with difficult and that to creates a benefit there is a limit judges and axis market in the object hereafter demand at even the popular house the function to prepare in being magnified is simple and there is a possibility of saying that a more effort is demanded in supply style video phone market opening up where the price is cheap. Saw with like this reason from, analyzes the concept and a market trend of the video phone, grasps distribution channel forms and A/S handling systems and there is the goal finds the video phone sale revitalization plan which is suitable in all market.

• Journal of Digital Contents Society
• /
• v.17 no.3
• /
• pp.181-188
• /
• 2016

Video streaming traffics which are arrived in receiver have irregular traffic patterns by many problems over the network path. Particularly, if these received traffics enter into replay buffer without any operation, the overflow and underflow effects are made according to the buffer status. There was an existing scheme which automatically set up token bucket parameters using the video information file under the assumption of the lossless packet on network. The existing scheme has a problem which can set up the wrong token bucket parameters by the lost packets on the practical networks with video packet loss. Therefore, this paper proposes a new scheme which reset up video file information to correct the wrong token bucket parameters in case of packet loss in practical networks with packet loss. Through the simulation, it was found that the proposed scheme would have better performance than the existing scheme in terms of overflow generation and packet loss.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.29-32
• /
• 2000

Layered video coding schemes allow the video information to be transmitted in multiple video bitstreams to achieve scalability. they are attractive in theory for two reasons. First, they naturally allow for heterogeneity in networks and receivers in terms of client processing capability and network bandwidth. Second, they correspond to optimal utilization of available bandwidth when several video qualify levels are desired. In this paper we propose a scalable video codec architectures with motion estimation, which is suitable for real-time audio and video communication over packet networks. The coding algorithm is compatible with ITU-T recommendation H.263+ and includes various techniques to reduce complexity. Fast motion estimation is Performed at the H.263-compatible base layer and used at higher layers, and perceptual macroblock skipping is performed at all layers before motion estimation. Error propagation from packet loss is avoided by Periodically rebuilding a valid Predictor in Intra mode at each layer.