• Title/Summary/Keyword: networking services

Search Result 685, Processing Time 0.026 seconds

A Hadoop-based Multimedia Transcoding System for Processing Social Media in the PaaS Platform of SMCCSE

  • Kim, Myoungjin;Han, Seungho;Cui, Yun;Lee, Hanku;Jeong, Changsung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.11
    • /
    • pp.2827-2848
    • /
    • 2012
  • Previously, we described a social media cloud computing service environment (SMCCSE). This SMCCSE supports the development of social networking services (SNSs) that include audio, image, and video formats. A social media cloud computing PaaS platform, a core component in a SMCCSE, processes large amounts of social media in a parallel and distributed manner for supporting a reliable SNS. Here, we propose a Hadoop-based multimedia system for image and video transcoding processing, necessary functions of our PaaS platform. Our system consists of two modules, including an image transcoding module and a video transcoding module. We also design and implement the system by using a MapReduce framework running on a Hadoop Distributed File System (HDFS) and the media processing libraries Xuggler and JAI. In this way, our system exponentially reduces the encoding time for transcoding large amounts of image and video files into specific formats depending on user-requested options (such as resolution, bit rate, and frame rate). In order to evaluate system performance, we measure the total image and video transcoding time for image and video data sets, respectively, under various experimental conditions. In addition, we compare the video transcoding performance of our cloud-based approach with that of the traditional frame-level parallel processing-based approach. Based on experiments performed on a 28-node cluster, the proposed Hadoop-based multimedia transcoding system delivers excellent speed and quality.

A Personal Video Event Classification Method based on Multi-Modalities by DNN-Learning (DNN 학습을 이용한 퍼스널 비디오 시퀀스의 멀티 모달 기반 이벤트 분류 방법)

  • Lee, Yu Jin;Nang, Jongho
    • Journal of KIISE
    • /
    • v.43 no.11
    • /
    • pp.1281-1297
    • /
    • 2016
  • In recent years, personal videos have seen a tremendous growth due to the substantial increase in the use of smart devices and networking services in which users create and share video content easily without many restrictions. However, taking both into account would significantly improve event detection performance because videos generally have multiple modalities and the frame data in video varies at different time points. This paper proposes an event detection method. In this method, high-level features are first extracted from multiple modalities in the videos, and the features are rearranged according to time sequence. Then the association of the modalities is learned by means of DNN to produce a personal video event detector. In our proposed method, audio and image data are first synchronized and then extracted. Then, the result is input into GoogLeNet as well as Multi-Layer Perceptron (MLP) to extract high-level features. The results are then re-arranged in time sequence, and every video is processed to extract one feature each for training by means of DNN.

Design of a Personalized Service Model for Developing Research Support Tool (연구지원 도구의 개인화 서비스 모델 설계)

  • Choi, Hee-Seok;Park, Ji-Young;Shim, Hyoung-Seop;Kim, Jae-Soo;You, Beom-Jong
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.8
    • /
    • pp.37-45
    • /
    • 2015
  • With advancement in information technologies and a better mobile environment, the paradigm of service is shifting again from web portals to networked-applications based on individual application programs. Furthermore, as more investment is being made in R&D, the efforts to enhance R&D productivity are becoming important. In this paper, we designed a personalized service model for developing a tool to assist researchers in their R&D activities. To do this, we first compared services and tools in terms of information activities of researchers in R&D. In addition, we also analyzed changes of information environment such as open expansion of information and data, enhancement of personal information protection, popularization of social networking service, very big contents, advances in web platform technology in terms of personalization, and defined some directions of developing a personalized service. Subsequently we designed a personalized service model of research support tool in the views of functions, contents, operation, and defined personalized design goals and principles for implementing it as standard, participation, and open.

A Hybrid P2P Overlay Architecture for Live Media Streaming (라이브 미디어 스트리밍 서비스를 위한 하이브리드 P2P 오버레이 구조)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.6
    • /
    • pp.481-491
    • /
    • 2009
  • In this paper, we proposed a hybrid P2P overlay structure for live media streaming. The proposed structure consists of the mesh overlay organized by peers according to the geographical proximity and similar bandwidth range and the tree overlay formed by the peers for which the stability of participation is approved. The proposed scheme enhances the robustness of tree overlay and the long delay of mesh overlay by intelligently combining the utilization of the tree overlay and the mesh overlay. Furthermore, the peers with a large up-link bandwidth are located near to the media source peer. Therefore, it reduces the height of tree, and as a result, the stream transmission delay. Through simulation, we evaluated the performance of the proposed scheme in terms of scalability and quality of services.

A Study on OSPF for Wireless Tactical Communication Networks (무선 전술 통신망을 위한 OSPF 적용 방안)

  • Kook, Sung-Sook;Chang, Moon-Jeong;Lee, Mee-Jeong;Jun, Je-Hyun;Kim, Tae-Wan;Choi, Jeung-Won;Roh, Bong-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.2
    • /
    • pp.109-121
    • /
    • 2010
  • Recently, the military of Korea has been establishing the next generation wireless tactical communication system so called Tactical Information Communication Network (TICN). A routing protocol for TICN transport networks has to be able to select a path with high survivality, reliability, and stability while accommodating as many flows as possible with minimum QoS guarantees. The OSPF(Open Short Path First) used widely is determined to be the routing protocol for TICN. With the typical deployment practices OSPF, however, it cannot satisfy the requirements of TICN. In this paper, we propose a cost function for OSPF and a way to tune the OSPF protocol parameters for the TICN transport networks. Through simulations, it is shown that the OSPF with the proposed cost function provides better performance than the OSPF in terms of both the services provided to the applications and the network resources utilization.

Performance Analysis of HMIPv6 applying Adaptive MAP Domain Size (적응적 MAP도메인 크기를 적용한 HMIPv6의 성능분석)

  • ;Choe Jongwon
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.625-632
    • /
    • 2005
  • Recently, real time services have been demanding a lot and the number of mobile devices is increasing extremely. Many researchers are focusing on decreasing handoff or signaling cost, produced when mobile devices are moving around. With these efforts, HMIPv6(Hierarchical Mobile Internet Protocol Version 6) was proposed. Mobile nodes do not need to register their locations to Home Agents whenever crossing over subnets within a MAP domain. In HMIPv6, mobile nodes choose the farthest MAP without considering node mobility pattern. However, a large MAP domain is not always efficient for a slow moving node and required additional work to choose a MAP in HMIPv6. Hence, this paper proposes 'Performance Analysis of HMIPv6 applying adaptive MAP Domain Site'.

Design of a Secure Payment Mechanism based on S/MIME (S/MIME을 적용한 안전한 지불 메커니즘 설계)

  • Chun, Cheul-Woo;Lee, Jong-Hu;Lee, Sang-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.482-494
    • /
    • 2002
  • In E-mail based accounting system, the remitter does not have need to find collector's account number. To transfer money to a collector's account, what remitter need is just a collector's E-mail address. But the current E-mail based accounting systems are built on SSL technology. Basically SSL provides some security services - confidentiality, user authentication and data integrity, but does not provide non-repudiation. So, in the current E-mail based accounting system, it is possible to deny transaction. And there is no receipt of transaction. In this paper, we design and implementation of a S/MIME applied Secure Payment Mechanism. In our system, every account information - account number, receiver name, amount of money, etc. - is included in a 'check' message. And this message is protected under the Secure Web-mail using S/MIME. In a view point of the convenience, users using our system do not have need to find collector's account number. And in a view point of the security, our system provides confidentiality, user authentication, data integrity and non-repudiation. Moreover our system provides a receipt.

A Queue Management Algorithm for Improving Fairness in a Private Network (사설 망의 공정성을 향상시키기 위한 큐 관리 알고리즘)

  • Kang, Tae-Hyung;Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.524-532
    • /
    • 2002
  • With the recent rapid progress of Internet, the higher speed network is needed to support the exploration of ambient information from text-based to multimedia-based information. Also, demands for additional Layer 3 routing technique, such as Network Address Translator (NAT) and Firewall, are required to solve a limitation of a current Internet address space and to protect the interior network from the exterior network. However, current router-based algorithms do not provide mechanisms to solve the congestion and fairness problems, while supporting the multimedia services and satisfying the user requirements. In this paper, to solve these problems, a new active queue management, called MFRED (Multiple Fairness RED) algorithm, is proposed. This algorithm can efficiently reduce the congestion in a router or gateway based on the Layer 3 routing technique, such as NAT. This algorithm can improve the fairness among TCP-like flows and unresponsive flows. It also works well in fairly protecting congestion-sensitive flows, i.e. fragile TCP, from congestion-insensitive or congestion-causing flows, i.e. robust TCP.

Concealment of Propagation Delay using Synchronized overlap-add Algorithm in Internet Phone (인터넷 폰에서 Synchronized overlap-add 알고리즘을 이용한 전송지연 보상 기법)

  • Nam, Jae-Hyun;Lee, Jung-Tae
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.540-549
    • /
    • 2001
  • Internet telephony service is very cheap and very easy to introduce the value-added service than the POTS, but is difficult to the QoS of telephone service. The existing Internet typically offers 'best effort' services only, which do not make any commitment about delay, packet loss and jitter. This paper compensates the low quality of the speech for packet loss or delay using SOLA algorithm in Internet phone. SOLA algorithm is a popular technique for Time Scale Modification of speech and audio signal. In the proposed algorithm, the receiver expands the received packet under resonable threshold, and hence compensates the QoS of speech. From the simulation, this algorithm can conceals packet loss considerably, and is also improved the quality of the speech.

  • PDF

Performance Comparison of Multicast ABR Flow Control Algorithms with Fast Overload Indication in ATM Networks (ATM망에서 신속한 폭주통지 기능을 지닌 멀티캐스트 ABR 흐름제어 알고리즘의 성능비교)

  • Kim, Dong-Ho;Kim, Byung-Chul;Cho, You-Ze;Kwon, Yul
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.1
    • /
    • pp.98-107
    • /
    • 2000
  • This paper compares the performance of feedback consolidation algorithms with or without a fast overload indication function which has been recently proposed in the ATM Forum for multicast ABR (Available Bit Rate) services in ATM networks. We use the performance criteria such as the ACR (Allowed Cell Rate) of a source, queue length at a switch, link utilization, fairness, and BRM (Backward Resource Management) cell overhead. Simulation results show that performance of the feedback consolidation algorithms with a fast overload indication function can be improved sign.ificantly than that of algorithms without this function in terms of ramp-down delay, particularly in initial start-up period or under a severe overload situation. The fast overload indication function can be combined with any feedback consolidation algorithm, whereas its performance is highly dependent on an underlying basic feedback consolidation algorithm.

  • PDF