• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.101-104
• /
• 2000

In this paper, we implement a video conference system, which connects remote PCs. Each system receives video and audio data from devices attached to a PC and compresses them by using CODECs. It sends the compressed data to the opponent. Compared to the existing ones, the proposed system can combine two video streams into a new one. Thus, additional video data can be transferred to the opponent during a call.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.130-132
• /
• 2002

In this work, we like to present the result of study obtained from actual experiment. We instrument the effect of smoothing on packet loss behavior in mobile terminal on broadband wireless network under various different system settings. This activity requires comprehensive streaming software suite including streaming server, CODEC, and streaming client.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1577-1580
• /
• 2001

LAN 에 흩어져 있는 PC 들을 그룹화 하고 특정 스트림 서버 한 개에 가해지던 부담을 각 그룹 서버에게 분산시켜 망 자원을 효과적으로 이용하는 알고리즘을 제안한다. 본 논문에서는 하나의 스위칭 허브에 연결되어 있는 PC들을 그룹으로 묶고 각 그룹별 서버로 하여금 그룹내의 PC및 그룹 서버간 서비스를 책임지게 하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.691-693
• /
• 2003

인터넷을 통한 스트리밍 서비스의 품질 향상을 위하여 일반적으로 알려진 MIB 의 PUBLIC 영역의 정보뿐만 아니라 스트리밍 서버 프로그램 자체를 관리할 수 있는 망관리 시스템이 필요하게 되었다. 따라서 각 스트리밍 서버에 접속하고 있는 connection 정보, session 정보, stream에 대한 정보, access 정보 등을 SNMP 통신을 이용하여 망관리 시스템을 구현 하였다.

• Journal of The Korean Association of Information Education
• /
• v.2 no.1
• /
• pp.10-18
• /
• 1998

In a VOD server, media data are usually encoded by VBR compression technique such as MPEG, therefore, media stream rates vary. We propose a striping strategy called VCS considering VBR compression in Clustered VOD servers. Simulation are conducted to evaluate and compare the new strategy with a known striping strategy. The results show that the VCS strategy improves the performance.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.113-113
• /
• 2004

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3651-3667
• /
• 2000

Recently, in the distributed multimedia environments based on internet, as radical growing technologies, the most of researchers focus on both streaming technology and distributed object thchnology, Specially, the studies which are tried to integrate the streaming services on the distributed object technology have been progressing. These technologies are applied to various stream service mamgements and protocols. However, the stream service management mexlels which are being proposed by the existing researches are insufficient for suporting the QoS of stream services. Besides, the existing models have the problems that cannot support the extensibility and the reusability, when the QoS-reiatedfunctions are being developed as a sub-module which is suited on the specific-purpose application services. For solving these problems, in this paper. we suggested a QoS Integrated platform which can extend and reuse using the distributed object technologies, and guarantee the QoS of the stream services. A structure of platform we suggested consists of three components such as User Control Module(UCM), QoS Management Module(QoSM) and Stream Object. Stream Object has Send/Receive operations for transmitting the RTP packets over TCP/IP. User Control ModuleI(UCM) controls Stream Objects via the COREA service objects. QoS Management Modulel(QoSM) has the functions which maintain the QoS of stream service between the UCMs in client and server. As QoS control methexlologies, procedures of resource monitoring, negotiation, and resource adaptation are executed via the interactions among these comiXments mentioned above. For constmcting this QoS integrated platform, we first implemented the modules mentioned above independently, and then, used IDL for defining interfaces among these mexlules so that can support platform independence, interoperability and portability base on COREA. This platform is constructed using OrbixWeb 3.1c following CORBA specification on Solaris 2.5/2.7, Java language, Java, Java Media Framework API 2.0, Mini-SQL1.0.16 and multimedia equipments. As results for verifying this platform functionally, we showed executing results of each module we mentioned above, and a numerical data obtained from QoS control procedures on client and server's GUI, while stream service is executing on our platform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.7
• /
• pp.630-642
• /
• 2013

To transmit vital signal stream of mobile patients remotely, it requires mobility of patient and watcher, sensing function of patient's abnormal symptom and self-organizing service binding of related computing resources. In the existing relative researches, the vital signal stream is transmitted as a centralized approach which exposure the single point of failure itself and incur data traffic to central server although it is localized service. Self-organizing middleware platform based on heterogenous overlay network is a middleware platform which can transmit real-time data from sensor device(including vital signal measure devices) to Smartphone, TV, PC and external system through overlay network applied self-organizing mechanism. It can transmit and save vital signal stream from sensor device autonomically without arbitration of management server and several receiving devices can simultaneously receive and display through interaction of nodes in real-time.

• 대한공업교육학회지
• /
• v.32 no.2
• /
• pp.199-216
• /
• 2007

Stream Control Transmission Protocol(SCTP) is a transport layer protocol to support the data transmission. SCTP is similar to Transmission Control Protocol(TCP) in a variety of aspects. However, several features of SCTP including multi-homing and multi-streaming incur the performance difference from TCP. This paper highlights the data transfer during the initial slow start phase in SCTP congestion control composed of slow start phase and congestion avoidance phase. In order to compare the mean transfer time between SCTP and TCP, we experiment with different performance parameters including bandwidth, round trip time, and data length. By varying data length, we also measure the corresponding initial window size, which is one of factors affecting the mean transfer time. For the experiment, we have written server and client applications by C language using SCTP socket API and have measured the transfer time by ethereal program. We transferred data between client and server using round-robin method. Analysis of these experimental results from the testbed implementation shows that larger initial window size of SCTP than that of TCP brings the reduction in the mean transfer time of SCTP compared with TCP by 15 % on average during the initial slow start phase.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.