• Title/Summary/Keyword: 서버 부하 분산

Search Result 395, Processing Time 0.033 seconds

Encryption Scheme for MPEG-4 Media Transmission Exploiting Frame Dropping (대역폭 감소를 적용한 MPEG-4 미디어 전송시의 암호화 기법 연구)

  • Shin, Dong-Kyoo;Shin, Dong-Il;Park, Se-Young
    • The KIPS Transactions:PartB
    • /
    • v.15B no.6
    • /
    • pp.575-584
    • /
    • 2008
  • According to the network condition, the communication network overload could be occurred when media transmitting. Many researches are being carried out to lessen the network overload, such as the filtering, load distributing, frame dropping and many other methods. Among these methods, one of effective method is frame dropping that reduces specified video frames for bandwidth diminution. B frames are dropped and then I, P frames are dropped according to dependency among the frames in frame dropping. This paper proposes a scheme for protecting copyrights by encryption, when we apply frame dropping to reduce bandwidth of media following MPEG-4 file format. We designed two kinds of frame dropping: first one stores and then sends the dropped files and the other drops frames in real-time when transmitting. We designed three kinds of encryption methods in which DES algorithm is used to encrypt MPEG-4 data: macro block encryption in I-VOP, macro block and motion vector encryption in P-VOP, and macro block and motion vector encryption in I, P-VOP. Based on these three methods, we implemented a digital right management solution for MPEG-4 data streaming. We compared the results of dropping, encryption, decryption and quality of video sequences to select an optimal method, and there is no noticeable difference between the video sequences recovered after frame dropping and the ones recovered without frame dropping. The best performance in encryption and decryption of frames was obtained when we apply the macro block and motion vector encryption in I, P-VOP.

A Peer Load Balancing Method for P2P-assisted DASH Systems (P2P 통신 병용 DASH 시스템의 피어 부하 분산 방안 연구)

  • Seo, Ju Ho;Kim, Yong Han
    • Journal of Broadcast Engineering
    • /
    • v.25 no.1
    • /
    • pp.94-104
    • /
    • 2020
  • Currently media consumption over fixed/mobile Internet is mostly conducted by adaptive media streaming technology such as DASH (Dynamic Adaptive Streaming over HTTP), which is an ISO/IEC MPEG (Moving Picture Experts Group) standard, or some other technologies similar to DASH. All these heavily depend on the HTTP caches that ISPs (Internet Service Providers) are obliged to provide sufficiently to make sure fast enough Web services. As a result, as the number of media streaming users increases, ISPs' burden for HTTP cache has been greatly increased rather than CDN (Content Delivery Network) providers' server burden. Hence ISPs charge traffic cost to CDN providers to compensate for the increased cost of HTTP caches. Recently in order to reduce the traffic cost of CDN providers, P2P (Peer-to-Peer)-assisted DASH system was proposed and a peer selection algorithm that maximally reduces CDN provides' traffic cost was investigated for this system. This algorithm, however, tends to concentrate the burden upon the selected peer. This paper proposes a new peer selection algorithm that distributes the burden among multiple peers while maintaining the proper reduction level of the CDN providers' cost. Through implementation of the new algorithm in a Web-based media streaming system using WebRTC (Web Real-Time Communication) standard APIs, it demonstrates its effectiveness with experimental results.

Development of Value-added Service Application for ESP based on Consumer Portal System (수용가 포탈 시스템 기반의 전력부가서비스 구축 방안 연구)

  • Yang, Won-Chul;Kim, Jae-Hee;Kim, Sang-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.350-355
    • /
    • 2006
  • 선진 전력시장의 경우, 전력산업의 환경변화에 따라 소비자의 역할이 증대되고 있으며 이와 더불어 IT 기반의 다양한 소비자 중심의 전력부가서비스의 개발이 시도되고 있거나 일부 제공되고 있다. 이러한 서비스의 발전은 시간이 흐르면서 단방향이 아닌 양방향 통신 기반의 소비자 중심 서비스에 대한 연구로 확대되고 있다. 특히, 미국 EPRI의 IntelliGrid 컨소시엄에서 제시한 수용가 포탈 시스템은 소비자 영역내의 장비와 에너지 서비스 기관 간의 양방향 통신을 전제함으로써 이루어지는 통합적인 개념의 서비스 기반으로써, 공급자를 포함한 ESP(Energy Service Provider)와 소비자는 수용가 포탈을 기반으로 원활한 커뮤니케이션을 수행하고 그 결과를 이용한 부가적 이익을 누릴 수 있게 된다. 이에 비해 국내의 전력부가서비스 제공 수준은 이제 겨우 시작 단계에 불과하지만, 서비스에 대한 인식 정도와 IT기술의 발전 속도를 생각해 본다면 머지않아 국내 전력산업에서도 현재의 서비스 제공 수준을 한 단계 넘어선 양방향 통신 기반의 수준 높은 전력부가서비스를 요구하게 될 것이다. 따라서, 국내 환경에 적합한 수용가 포탈 시스템 기반의 전력부가서비스 창출은 수용가에게는 비용 절감이 가능한 합리적인 소비를 제시하고, ESP(Energy Service Provider)에게는 부하·수요관리 및 투자비를 절감할 수 있는 기회를 제공해야 할 것이다. 본 논문에서는 새로운 전력부가서비스 기반인 수용가 포탈시스템을 분석하고, 현행 전력부가서비스의 현황과 동향 분석, 적용가능 기술 분석, 타 산업 벤치마킹을 통해 국내환경에 적합한 수용가 포탈 시스템 기반의 전력부가서비스 선정 및 구축 방안을 제시하고자 한다.원 사용이 가능하도록 설계하였다.서버로 분산처리하게 함으로써 성능에 대한 신뢰성을 향상 시킬 수 있는 Load Balancing System을 제안한다.할 때 가장 효과적인 라우팅 프로토콜이라고 할 수 있다.iRNA 상의 의존관계를 분석할 수 있었다.수안보 등 지역에서 나타난다 이러한 이상대 주변에는 대개 온천이 발달되어 있었거나 새로 개발되어 있는 곳이다. 온천에 이용하고 있는 시추공의 자료는 배제하였으나 온천이응으로 직접적으로 영향을 받지 않은 시추공의 자료는 사용하였다 이러한 온천 주변 지역이라 하더라도 실제는 온천의 pumping 으로 인한 대류현상으로 주변 일대의 온도를 올려놓았기 때문에 비교적 높은 지열류량 값을 보인다. 한편 한반도 남동부 일대는 이번 추가된 자료에 의해 새로운 지열류량 분포 변화가 나타났다 강원 북부 오색온천지역 부근에서 높은 지열류량 분포를 보이며 또한 우리나라 대단층 중의 하나인 양산단층과 같은 방향으로 발달한 밀양단층, 모량단층, 동래단층 등 주변부로 NNE-SSW 방향의 지열류량 이상대가 발달한다. 이것으로 볼 때 지열류량은 지질구조와 무관하지 않음을 파악할 수 있다. 특히 이러한 단층대 주변은 지열수의 순환이 깊은 심도까지 가능하므로 이러한 대류현상으로 지표부근까지 높은 지온 전달이 되어 나타나는 것으로 판단된다.의 안정된 방사성표지효율을 보였다. $^{99m}Tc$-transferrin을 이용한 감염영상을 성공적으로 얻을 수 있었으며, $^{67}Ga$-citrate 영상과 비교하여 더 빠른 시간 안에 우수한 영상을 얻을 수 있었다. 그러므로 $^{99m}Tc$-transierrin이 감염 병소의 영상진단

  • PDF

A Method for Detecting the Exposure of an OCSP Responder's Session Private Key in D-OCSP-KIS (D-OCSP-KIS에서 OCSP Responder의 세션 개인키의 노출을 검출하는 방법)

  • Lee, Young-Gyo;Nam, Jung-Hyun;Kim, Jee-Yeon;Kim, Seung-Joo;Won, Dong-Ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.4
    • /
    • pp.83-92
    • /
    • 2005
  • D-OCSP-KIS proposed by Koga and Sakurai not only reduces the number or OCSP Responder's certificate but also criers the certificate status validation about OCSP Responder to the client. Therefore, D-OCSP-KIS is an effective method that can reduce the communication cost, computational time and storage consumption in client, but it has some problems. In case an attacker accidentally acquires an OCSP Responder's session private key in a time period (e.g., one day), she can disguise as the OCSP Responder in the time period unless the OCSP Responder recognizes. She can offer the wrong response to the client using the hash value intercepted. And the server and user on I-commerce can have a serious confusion and damage. And the computation and releasing of hash chain can be a load to CA. Thus, we propose a method detecting immediately the exposure of an OCSP Responder's session private key and the abuse of hash value in D-OCSP-KIS.

Enhancing the performance of taxi application based on in-memory data grid technology (In-memory data grid 기술을 활용한 택시 애플리케이션 성능 향상 기법 연구)

  • Choi, Chi-Hwan;Kim, Jin-Hyuk;Park, Min-Kyu;Kwon, Kaaen;Jung, Seung-Hyun;Nazareno, Franco;Cho, Wan-Sup
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.5
    • /
    • pp.1035-1045
    • /
    • 2015
  • Recent studies in Big Data Analysis are showing promising results, utilizing the main memory for rapid data processing. In-memory computing technology can be highly advantageous when used with high-performing servers having tens of gigabytes of RAM with multi-core processors. The constraint in network in these infrastructure can be lessen by combining in-memory technology with distributed parallel processing. This paper discusses the research in the aforementioned concept applying to a test taxi hailing application without disregard to its underlying RDBMS structure. The application of IMDG technology in the application's backend API without restructuring the database schema yields 6 to 9 times increase in performance in data processing and throughput. Specifically, the change in throughput is very small even with increase in data load processing.

Improving Search Performance of Tries Data Structures for Network Filtering by Using Cache (네트워크 필터링에서 캐시를 적용한 트라이 구조의 탐색 성능 개선)

  • Kim, Hoyeon;Chung, Kyusik
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.6
    • /
    • pp.179-188
    • /
    • 2014
  • Due to the tremendous amount and its rapid increase of network traffic, the performance of network equipments are becoming an important issue. Network filtering is one of primary functions affecting the performance of the network equipment such as a firewall or a load balancer to process the packet. In this paper, we propose a cache based tri method to improve the performance of the existing tri method of searching for network filtering. When several packets are exchanged at a time between a server and a client, the tri method repeats the same search procedure for network filtering. However, the proposed method can avoid unnecessary repetition of search procedure by exploiting cache so that the performance of network filtering can be improved. We performed network filtering experiments for the existing method and the proposed method. Experimental results showed that the proposed method could process more packets up to 790,000 per second than the existing method. When the size of cache list is 11, the proposed method showed the most outstanding performance improvement (18.08%) with respect to memory usage increase (7.75%).

An Efficient Real-Time Image Reconstruction Scheme using Network m Multiple View and Multiple Cluster Environments (다시점 및 다중클러스터 환경에서 네트워크를 이용한 효율적인 실시간 영상 합성 기법)

  • You, Kang-Soo;Lim, Eun-Cheon;Sim, Chun-Bo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.11
    • /
    • pp.2251-2259
    • /
    • 2009
  • We propose an algorithm and system which generates 3D stereo image by composition of 2D image from 4 multiple clusters which 1 cluster was composed of 4 multiple cameras based on network. Proposed Schemes have a network-based client-server architecture for load balancing of system caused to process a large amounts of data with real-time as well as multiple cluster environments. In addition, we make use of JPEG compression and RAM disk method for better performance. Our scheme first converts input images from 4 channel, 16 cameras to binary image. And then we generate 3D stereo images after applying edge detection algorithm such as Sobel algorithm and Prewiit algorithm used to get disparities from images of 16 multiple cameras. With respect of performance results, the proposed scheme takes about 0.05 sec. to transfer image from client to server as well as 0.84 to generate 3D stereo images after composing 2D images from 16 multiple cameras. We finally confirm that our scheme is efficient to generate 3D stereo images in multiple view and multiple clusters environments with real-time.

Implementation and Performance Evaluation of the Wireless Transaction Protocol Using UML/SDL (UML과 SDL을 이용한 무선 트랜잭션 프로토콜의 구현과 성능 평가)

  • 정호원;임경식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1064-1073
    • /
    • 2002
  • In this paper, we design and implement the Wireless Transaction Protocol (WTP) proposed by the Wireless Application Protocol (WAP) forum using a protocol development tool, SDL Development Tool (SDT). And we conduct a comparative performance evaluation of the WTP implementation with other three implementations that are based on different implementation models respectively: the server model, the coroutine model, and the activity-thread model. To implement WTP, we first use Unified Modeling Language (UML) for analyzing the protocol requirement and defining the protocol engine architecture. Next, we use Software Development Language (SDL) to design the protocol engine in details and then generate the WTP implementation automatically with the aid of SDT The code size of the WTP implementation generated by SDT is 62% larger than the other three implementations. However, its throughput and system response time for transaction processing is almost equal to the other three implementations when the number of concurrent clients is less than 3,000. If more than 5,000 concurrent clients tries, the transaction success rate abruptly decreases to 10% and system response time increases to 1,500㎳, due to the increased protocol processing time. But, it comes from the fact that the load overwhelms the capacity of the PC resource used in this experimentation.

Air Quality Monitoring System Using NDIR-CO$_2$ Sensor for Underground Space based on Wireless Sensor Network (비분산적의선 CO$_2$센서를 이용한 무선 센서 네트워크 기반의 지하 공기질 모니터링 시스템)

  • Kwon, Jong-Won;Kim, Jo-Chun;Kim, Gyu-Sik;Kim, Hie-Sik
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.46 no.4
    • /
    • pp.28-38
    • /
    • 2009
  • In this study, a remote air quality monitoring system for underground spaces was developed by using NDIR-based CO$_2$ sensor. And the remote monitoring system based on wireless sensor networks was installed practically on the subway station platform. More than 6.5 million citizens commutate everyday by the Seoul subway transportation that is the most typical public transportation. They concern about air quality with increasing interest on public health or many workers in subway stations or underground shopping centers. Recently, the Korean Ministry of Environment has operated the air quality monitoring system in some subway stations for testing phase. However, it showed many defects which are large-scale, high-cost and maintenance of precision sensors imported from abroad. Therefore this research includes the reliability test and a theoretical study about the inexpensive commercialized CO$_2$ sensor for reliable measurement of air quality which changes rapidly by the surrounding environments. And then we develop the wireless sensor nodes and the gateway applied for remote air quality monitoring. In addition, web server program was realized to manage air quality in the subway platform. This result will be valuable for a basic research for air quality management in underground spaces for future study.

Reconfiguration of Apache Storm for InfiniBand Communications (InfiniBand RDMA 통신을 위한 Apache Storm의 재구성)

  • Yang, Seokwoo;Son, Siwoon;Moon, Yang-Sae
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.8
    • /
    • pp.297-306
    • /
    • 2018
  • In this paper, we address how to apply Apache Storm, a distributed stream processing framework, to InfiniBand, a high performance communication device. An easy way to run Storm on InfiniBand is to simply use IPoIP (IP over InfiniBand). However, this method causes a serious CPU load on the node, which is caused by frequent context switches and buffer copies. To solve this problem, we propose a new communication method using InfiniBand's Remote Direct Memory Access (RDMA) function in Storm. First, we design and implement RJ-Netty (RDMA/JXIO Netty), a new framework that replaces Netty, the legacy framework, to exploit RDMA functionality. Second, we reimplement the related classes so that Storm can use both existing Netty and new RJ-Netty. Third, we extend the JXIO server functionality so as to support multi-threading to maximize the performance of RJ-Netty. Experimental results show that the proposed RJ-Netty significantly reduces CPU load while improving message throughput compared to IPoIB as well as Ethernet. This paper is the first attempt to run Apache Storm on InfiniBand, and we believe that it is an excellent research result that improves the performance of Storm by using InfiniBand RDMA.