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

무선 이동 환경에서의 멀티미디어 서비스를 안정적으로 제공하기 위해서 CDN을 적용할 경우, 중간 경로에 많은 부하를 주거나 사용자 요구 수준을 저하시키는 등의 문제점이 발생할 수 있다. D­MCDN은 사용자의 이동으로 최적의 서버가 변경되었을 경우, 새로운 서버로 연결을 재설정하는 session migration을 통해 이러한 문제점을 해결한다. 본 논문은 주변 에지 사이트와의 네트워크 지연 시간과 서버의 부하를 참조하는 session migration 알고리즘을 제시하고, 시뮬레이션을 통해 D­MCDN의 성능을 평가한다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1457-1467
• /
• 1998

본 논문에서는 ATM-LAN상 Navigation서버를 이용한 브라우징 메카니즘, 서버와 클라이언트, 응용, AAL과 Qos간 협상 및 예약 절차의 세션 설정 기술, 프레임의 분열 및 재결합에 관한 알고리즘을 제안하고 구현한 후, 실험 평가한다. 그리고 사용자에게 효율적인 서비스를 제공하기 위한 서비스 관리 모델로서 서비스 메니저를 모델링한다.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.129-132
• /
• 2003

In this paper, we propose the DQM - CBRP( Distributed QoS Monitoring - Cluster Based Routing Protocol ) routing protocol to provide Quality of Service guarantee for multimedia service in Ad hoc mobile network. This paper proves the DQM-CBRP can avoid message loss and is suitable to guarantee of QoS thru simulation of COMNET III.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1917-1918
• /
• 2008

분산 환경의 멀티미디어 시스템을 관리하기 위한 여러 가지 방법은 인터넷과 네트워크의 발달과 가속화되고 있다. 좀 더 편리하고 쉽게 중앙의 관리자가 분산된 환경의 다수의 이용자들을 효율적으로 관리하기 위해서 원격제어 방법을 사용한다. 이 때 관리자는 1:1 제어뿐만 아니라 1:n 제어도 가능해야 한다. 본 논문에서는 소켓을 사용하여 분산된 환경에서 다수의 사용자의 음악과 이미지 파일을 원격으로 제어할 수 있는 시스템을 설계, 구현한다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.801-805
• /
• 1994

멀티미디어(화상,음성,하이퍼텍스트)의 데이터는 다른 데이터와 상이점이 많아 운용에 어려움이 있다. 대용량의 저장용량(storage)의 필요, 데이터 통신의 어려움 등이 빠르게 발전하는 멀티미디어 기술에 제약조건이 된다. 본 연구에서는 멀티미디어 데이터가 일 반적인 텍스트(Text)데이터와 같이 높은 수행도(Performance) 및 안정적인 데이터베이스 (Database)로 구축되어 효율적으로 운용 되는데 중점을 둔다. 아울러 대량의 정보를 처리하기 위하여 서버(server)와 클라이언트(Client)기법을 이용한 분산처리로 실시간 처리 및 데이터 저장의 한계를 극복하고자 한다.

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

OMG에서 제안된 CORBA는 표준 개방 분산환경의 플래트폼을 제공하며 객체지향적인 방법으로 최근 주목을 받고 있다. 일반적으로 CORBA는 원격 데이터베이스 질의 등과 같은 요구/응답형의 응용에 잘 적용이 된다. 그러나 과도한 처리부담, 실시간 처리 기능과 QOS 지원 등의 결여로 멀티미디어 스트림과 같은 연속미디어의 처리에는 부적합하다. 본 논문에서는 실시간 제약을 갖는 멀티미디어 스트림의 효율적인 전송을 위하여 기존의 CORBA를 확장하여 멀티미디어 서비스를 설계한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2169-2175
• /
• 2014

In this paper we have proposed a new distributed architecture of session-based instant message system, in which multiple servers can distribute loads effectively to improve system extendability. The server of session-based instant message system should manage SIP sessions to transfer instant message with multimedia data to each users, and it should process large amount of presence informations from each users. Therefore load of the server should be distributed as the number of users increases. In our system, when server load increases according to large user numbers, the load are distributed by selecting a server with the lowest load value, or new server is created to allocate the message processing. Therefore the overall load of instant message system can be dynamically distributed. A new presence information data format with added elements for controlling server load has been designed for this purpose, and SIP messages exchanging procedure between servers and users has been also suggested. The performance of our proposed system has been analysed by simulation, and showed improvement of performance.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.439-449
• /
• 2005

Distributed main memory database management systems (DMM-DBMSs) store the database in main memories of the participating sites. They provide high performance through fast access to the local databases and high speed communication among the sites. Recently, a lot of research results on DMM- DBMSs has been reported. However, to the best of our knowledge, there is no known research result on the performance of the catalog management schemes for DMM-DBMSs. In this work, we evaluated the performance of the partitioned catalog management schemes through experimental analysis. First, we classified the partitioned catalog management schemes into three categories : Partitioned Catalogs Without Caching (PCWC), Partitioned Catalogs With Incremental Caching (PCWIC), and Partitioned Catalogs With Full Caching (PCWFC). Experiments were conducted by varying the number of sites, the number of terminals per site, buffer size, write query ratio, and local query ratio. Experiments show that PCWFC outperforms the other two schemes in all cases. It also means that the performance of PCWIC gradually increases as time goes by. It should be noted that PCWFC does not guarantee high performance for disk-based distributed DBMSs in cases when the workload of individual site is high, catalog write ratio is high, or remote data objects are accessed very frequently. Main reason that PCWFC outperforms for DMM-DBMSs is that query compilation and remote catalog access can be done in a very high speed, even when the catalogs of the remote data objects are frequently updated.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1503-1514
• /
• 2006

Today, consumers can access Internet from everywhere, therefore most commercial and other organizations provide their services on the Web. As the result, countless Web service systems are already on the Internet and more systems are under construction. Therefore, many researches of verifying that the system to be constructed will not have any deadlock and will run successfully without any problem at the early stage of design have been performed. Several Petri net based verification methods have also been published. However, they have focused on building Petri net models of Web service systems and none of them introduces efficient analysis methods. As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the real world is a stochastic number in general. Therefore, this paper proposes 'Mixedly Distributed Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net'. We also introduce a method of analysing a Web service system's response time with the minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net.'.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.575-581
• /
• 2010

With widespread use of the Internet and improvements in streaming media and compression technology, digital music, video, and image can be distributed instantaneously across the Internet to end-users. However, most conventional Digital Right Management are often not secure and not fast enough to process the vast amount of data generated by the multimedia applications to meet the real-time constraints. The SVC offers temporal, spatial, and SNR scalability to varying network bandwidth and different application needs. Meanwhile, for many multimedia services, security is an important component to restrict unauthorized content access and distribution. This suggests the need for new cryptography system implementations that can operate at SVC. In this paper, we propose a new scrambling encryption for reserving the characteristic of scalability in MPEG4-SVC. In the base layer, the proposed algorithm is applied and performed the selective scambling. And it encrypts various MVS and intra-mode scrambling in the enhancement layer. In the decryption, it decrypts each encrypted layers by using another encrypted keys. Throughout the experimental results, the proposed algorithms have low complexity in encryption and the robustness of communication errors.