• Title/Summary/Keyword: SCALABILITY

Search Result 1,686, Processing Time 0.027 seconds

The Review of JPEG2000 Algorithm using Optimal Rate Control (비율 제어 최적화를 이용한 JPEG2000 알고리즘 리뷰)

  • Chong, Hyun-Jin;Kim, Young-Seop
    • Journal of the Semiconductor & Display Technology
    • /
    • v.8 no.1
    • /
    • pp.19-25
    • /
    • 2009
  • Abstract JPEG2000 achieve quality scalability through the rate control method used in the encoding process, which embeds quality layers to the code-stream. This architecture might raise two drawbacks. First, when the coding process finishes, the number and bit-rates of quality layers are fixed, causing a lack of quality scalability to code-stream encoded with a single or few quality layers. Second, in Post compression rate distortion (PCRD) the bit streams after the truncation points discarded. Therefore, computational power for the discarded bit streams is wasted. For solving of problem, through bit rate control, there are many researches. Each proposed algorithms have specially target feature that is improved performance like reducing computational power. Research results have strength and weakness. For the mean time, research contents are reviewed and compared, so we proposed research direction in the future.

  • PDF

Coding efficiency prediction of HEVC using spatial scalability (공간적 스케일러빌리티를 이용한 HEVC의 부호화 효율 예측)

  • Jang, Sujin;Seo, Youngho;Kim, Dongwook
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2014.11a
    • /
    • pp.211-213
    • /
    • 2014
  • 최근 4K 이상의 초고해상도 동영상 콘텐츠가 제작되고 있고 그에 따라 많은 기업이 UHD TV 제품을 제작 판매 하고 있다. 따라서 이에 대응할 수 있는 새로운 코덱이 필요하고 그를 위해 HEVC가 개발되었다. 그러나 아직 HEVC의 부호화 효율을 위한 scalable 부호화 방식이 개발 중이다. 초고해상도 비디오 콘텐츠를 다양한 단말기에서 사용할 수 있도록 하기 위해서는 scalable 부호화 방식이 연구개발 되어야 한다. 본 논문에서는 HEVC 이전 버전 코덱인 H.264/AVC를 기반으로 한 scalable 부호화 방식 중 공간적 scalability에 대해 설명하고 여러 방법으로 간단하게 적용시켜 scalable 부호화 방식의 효율의 성능을 예측 평가해 본다. 이 방식은 dowm-sampling한 영상을 HEVC로 부호화하고 이를 up-sampling한 영상과 원영상의 차영상을 HEVC로 부호화하여 전송하는 방식이다. 여기서는 이 방식의 결과를 토대로 이 방식의 문제점을 지적하고 이를 토대로 한 향후의 연구방향을 제시한다.

  • PDF

Electrical characteristic for Phase-change Random Access Memory according to the $Ge_{1}Se_{1}Te_{2}$ thin film of cell structure (상변화 메모리 응용을 위한 $Ge_{1}Se_{1}Te_{2}$ 박막의 셀 구조에 따른 전기적 특성)

  • Na, Min-Seok;Lim, Dong-Kyu;Kim, Jae-Hoon;Choi, Hyuk;Chung, Hong-Bay
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.1335-1336
    • /
    • 2007
  • Among the emerging non-volatile memory technologies, phase change memories are the most attractive in terms of both performance and scalability perspectives. Phase-change random access memory(PRAM), compare with flash memory technologies, has advantages of high density, low cost, low consumption energy and fast response speed. However, PRAM device has disadvantages of set operation speed and reset operation power consumption. In this paper, we investigated scalability of $Ge_{1}Se_{1}Te_{2}$ chalcogenide material to improve its properties. As a result, reduction of phase change region have improved electrical properties of PRAM device.

  • PDF

Ranking-based Flow Replacement Method for Highly Scalable SDN (고확장성 SDN을 위한 랭킹 기반 플로우 교체 기법)

  • Tri, Hiep T. Nguyen;Kim, Kyungbaek
    • Annual Conference of KIPS
    • /
    • 2015.04a
    • /
    • pp.143-146
    • /
    • 2015
  • Software Defined Network (SDN) separates control plane and data plane to achieve benefits such as centralized management, centralized provisioning, lower device cost and more flexibility. In SDN, scalability is an important issue. Centralized controller can be a bottle neck and many research tried to solve this issue on the control plan. However, scalability issue does not only happen in the control plane, but also happen in the data plane. In the data plane, flow table is an important component and its size is limited. In a large network operated by SDN technology, the performance of the network can be highly degraded because of the size limitation of a flow table. In this paper, we propose a ranking-based flow replacement method, Flow Table Management (FTM), to overcome this problem.

Past, Present and Future of Blockchain Technology (블록체인 세대별 기술 동향)

  • Park, J.S.;Park, J.Y.;Choi, S.M.;Oh, J.T.;Kim, K.Y.
    • Electronics and Telecommunications Trends
    • /
    • v.33 no.6
    • /
    • pp.139-153
    • /
    • 2018
  • The explosive interest in block chain, which was triggered by Bitcoin in 2009, is leading to substantial investment and the development of block chain technology. There is no dispute among experts that block chain will be the next generation of innovation. However, despite the high expectations for block chains, the related technology still has certain limitations. In addition to improving issues such as a low transaction throughput, inefficient agreement algorithms, and an inflexible governance structure, it is necessary to solve various problems for commercialization and full-scale spreading owing to the trilemma problem among the scalability, security, and decentralization. Under this situation, identification of the technology characteristics according to the generation is helpful for the development of the core technology requirements and commercialization blueprint in establishing an R&D direction. Therefore, in this article, the development of blockchain technology is divided into generations and analyzed in terms of the operational structure, consensus algorithm, governance, scalability, and security.

A Study on Ethereum based block-chain scalability (이더리움 기반 블록체인 확장성 연구)

  • Na, Ji-won;Choo, Min-ji;Min, Youn-A;Baek, Yeong-Tae
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.07a
    • /
    • pp.383-384
    • /
    • 2019
  • 본 논문에서는 이더리움 기반 블록체인 확장성 문제해결을 위해 데이터 저장방법인 Merkle patricia tree를 응용하여 데이터에 따라 트리 이원화 사용을 제안한다. 이 연구는 시스템 자원인 CPU와 메모리를 효율적으로 사용하여 트랜잭션 처리량을 최대화하고, 작업시간을 최소화하기 위함이다. 본 논문에서는 기존 이더리움 블록체인의 트랜잭션 처리속도와 확장성 향상을 목표로 하며. 기존의 방식과 비교하여 제안을 분석한다.

  • PDF

A Comparative Analysis on Performance of Wireless Sensor Networks Routing Protocols

  • KRISHNA, KONDA. HARI;NAGPAL, TAPSI;BABU, Y. SURESH
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.240-244
    • /
    • 2022
  • The common goals of designing a routing algorithm are not only to reduce control packet overhead, maximize throughput and minimize the end-to-end delay, but also take into consideration the energy consumption. Scalability is an important factor in designing an efficient routing protocol for wireless sensor networks (WSN's). Three metrics (power consumption, time of transmission and packet loss rate) are used in order to compare three routing protocols which are AODV, DSDV and LEACH.

Ontology BIM-based Knowledge Service Framework Architecture Development (온톨로지 BIM 기반 지식 서비스 프레임웍 아키텍처 개발)

  • Kang, Tae-Wook
    • Journal of KIBIM
    • /
    • v.12 no.4
    • /
    • pp.52-60
    • /
    • 2022
  • Recently, the demand for connection between various heterogeneous dataset and BIM as a construction data model hub is increasing. In the past, in order to connect model between BIM and heterogeneous dataset, related dataset was stored in the RDBMS, and the service was provided by programming a method to link with the BIM object. This approach causes problems such as the need to modify the database schema and business logic, and the migration of existing data when requirements change. This problem adversely affects the scalability, reusability, and maintainability of model information. This study proposes an ontology BIM-based knowledge service framework considering the connectivity and scalability between BIM and heterogeneous dataset. Through the proposed framework, ontology BIM mapping, semantic information query method for linking between knowledge-expressing dataset and BIM are presented. In addition, to identify the effectiveness of the proposed method, the prototype is developed. Also, the effectiveness and considerations of the ontology BIM-based knowledge service framework are derived.

Enhanced MPR Selection Strategy for Multicast OLSR

  • Matter, Safaa S.;Al Shaikhli, Imad F.;Hashim, Aisha H.A.;Ahmed, Abdelmoty M.;Khattab, Mahmoud M.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.10
    • /
    • pp.137-144
    • /
    • 2022
  • Wireless community networks (WCNs) are considered another form of ownership of internet protocol (IP) networks, where community members manage and own every piece of equipment in a decentralized way, and routing for traffic is done in a cooperative manner. However, the current routing protocols for WCNs suffer from stability and scalability issues. In this paper, an enhanced routing protocol is proposed based on the optimized link state routing (OLSR) protocol to meet the standards of efficiency in terms of stability and scalability. The proposed routing protocol is enhanced through two phases: multicasting expansion and multipoint relay (MPR) selection based on an analytical hierarchical process (AHP). The experimental results demonstrate that the proposed routing protocol outperforms the OLSR protocol in terms of network control overhead and packet delivery ratio by 18% and 1% respectively.

Implementation of Framework for Efficient and Scalable Disaster Response Services

  • Seokjin Im
    • International Journal of Advanced Culture Technology
    • /
    • v.11 no.1
    • /
    • pp.290-295
    • /
    • 2023
  • The global warming by greenhouse gases causes climate change and disasters such as earthquakes and tsunamis frequently, leading to great damage. It is important to build efficient and scalable disaster response services to minimize the damage. Existing disaster warning service by the mobile text is limited by the scalability and the data size to be delivered. In this paper, we propose a framework for disaster response services that is efficient and flexible by allowing to adopt various indexing schemes and scalable by supporting any number of clients in disaster situations anytime and anywhere. Also, the framework by wireless data broadcast can be free from the limitation of the size of data to be delivered. We design and implement the proposed framework and evaluate the framework. For the evaluation, we simulate the implemented framework by adopting various indexing schemes like HCI, DSI and TTSI, and by comparing the access times of the clients. Through the evaluation, we show that the proposed framework can provide efficient and scalable and flexible disaster response services.