• Title/Summary/Keyword: SCALABILITY

Search Result 1,697, Processing Time 0.026 seconds

Cloud Assisted P2P Live Video Streaming over DHT Overlay Network (DHT 오버레이 네트워크에서 클라우드 보조의 P2P 라이브 비디오 스트리밍)

  • Lim, Pheng-Un;Choi, Chang-Yeol;Choi, Hwang-Kyu
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.1
    • /
    • pp.89-99
    • /
    • 2017
  • Many works have attempted to solve the scalability, the availability, and the low-latency problems of peer-to-peer (P2P) live video streaming; yet, the problems still remain. While tree-based systems are vulnerable to churn, the mesh-based systems suffer from high delay and overhead. The DHT-aided chunk-driven overlay (DCO) [1] tried to tackle these problems by using the distributed hash table (DHT), which structures into a mesh-based overlay to efficiently share the video segment. However, DCO fully depends on the capacity of the users' device which is small and unstable, i.e., the users' device may leave and join the network anytime, and the video server's bandwidth can be insufficient when the number of users joining the network suddenly increases. Therefore, cloud assist is introduced to overcome those problems. Cloud assist can be used to enhance the availability, the low-latency, and the scalability of the system. In this paper, the DHT is used to maintain the location of the streaming segments in a distributed manner, and the cloud server is used to assist other peers when the bandwidth which required for sharing the video segment is insufficient. The simulation results show that by using the threshold and cloud assist, the availability and the low-latency of the video segments, and the scalability of the network are greatly improved.

A Study of Concurrency Control Scheme for Scalability of Blockchain Technology (블록체인 기법의 확장가능성을 위한 병행 수행 제어 기법에 대한 연구)

  • Kang, Yong-Hyeog
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.569-570
    • /
    • 2017
  • Bitcoin-based blockchain technology provides an infrastructure that enables anonymous smart contracts, low-cost remittances, and online payments. However, the block-chain technology that implements the bitcoin has scalability constraints in tradeoffs between throughput and latency. To solve these problems, the Byzantine fault tolerant block-chain technique has been proposed. This technique improves throughput without increasing latency by selecting a leader and constructing many microblocks that do not contain proofs of work within the existing block by the leader. However, this technique may be less secure than existing techniques in selecting the reader. In this paper, we propose a technique for scalability of the blockchain technology by using microblock technology and parallel execution technique. Within one microblock there is information about several transactions. In the proposed scheme, the throughput of the microblocks can be increased by performing concurrently.

  • PDF

Scalable Interest Management based on Interest Groups for Large Networked Virtual Environments (대규모 네트워크 가상 환경을 위한 확장성 있는 사용자 관심그룹기반 인지도 관리 기법)

  • Han, Seung-Hyun;Lim, Min-Gyu;Lee, Dong-Man
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.188-196
    • /
    • 2002
  • As networked virtual environment (NVE) scales in terms of users and network latency, a key aspect to consider is scalability for interactive performance because a large number of objects likely impose heavy burden especially on the network and computational resources. To improve the scalability, various relevance-filtering mechanism have been proposed. However, the existing filtering mechanism do not scale well in terms of interactive performance as the number of users increase and crowds in a specific place. In this paper, we propose a new scalable filtering scheme which reduces the number of messages by dynamically grouping users based on their interests and distance. Within a group, members communicate with each other with high fidelity. However, a representative sends up-to-dated group information of members with low transmission frequency when they are not of immediate interest but are still within the interest area. The representative is elected from members of the group in distributed manner. The proposed scheme enhances the interactive performance scalability of large-scale NVE systems as much as 18% compared with the existing approach.

Healthcare System using Pegged Blockchain considering Scalability and Data Privacy

  • Azizan, Akmal;Pham, Quoc-Viet;Han, Suk Young;Kim, Jung Eon;Kim, Hoon;Park, Junseok;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.5
    • /
    • pp.613-625
    • /
    • 2019
  • The rise of the Internet of Things (IoT) devices have greatly influenced many industries and one of them is healthcare where wearable devices started to track all your daily activities for better health monitoring accuracy and even down to tracking daily food intake in some cases. With the amounts of data that are being tracked and shared between from these devices, questions were raised on how to uphold user's data privacy when data is shared between these IoT devices and third party. With the blockchain platforms started to mature since its inception, the technology can be implemented according to a variety of use case scenarios. In this paper, we present a system architecture based on the healthcare system and IoT network by leveraging on multiple blockchain networks as the medium in between that should enable users to have direct authority on data accessibility of their shared data. We provide proof of concept implementation and highlight the results from our testing to show how the efficiency and scalability of the healthcare system improved without having a significant impact on the performance of the Electronic Medical Record (EMR) that mostly affected by the previous solution since these solutions directly connected to a public blockchain network and which resulted in significant delays and high cost of operation when a large amount of data or complicated functions are involved.

Secure and Scalable Blockchain-Based Framework for IoT-Supply Chain Management Systems

  • Omimah, Alsaedi;Omar, Batarfi;Mohammed, Dahab
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.12
    • /
    • pp.37-50
    • /
    • 2022
  • Modern supply chains include multiple activities from collecting raw materials to transferring final products. These activities involve many parties who share a huge amount of valuable data, which makes managing supply chain systems a challenging task. Current supply chain management (SCM) systems adopt digital technologies such as the Internet of Things (IoT) and blockchain for optimization purposes. Although these technologies can significantly enhance SCM systems, they have their own limitations that directly affect SCM systems. Security, performance, and scalability are essential components of SCM systems. Yet, confidentiality and scalability are one of blockchain's main limitations. Moreover, IoT devices are lightweight and have limited power and storage. These limitations should be considered when developing blockchain-based IoT-SCM systems. In this paper, the requirements of efficient supply chain systems are analyzed and the role of both IoT and blockchain technologies in providing each requirement are discussed. The limitations of blockchain and the challenges of IoT integration are investigated. The limitations of current literature in the same field are identified, and a secure and scalable blockchain-based IoT-SCM system is proposed. The proposed solution employs a Hyperledger fabric blockchain platform and tackles confidentiality by implementing private data collection to achieve confidentiality without decreasing performance. Moreover, the proposed framework integrates IoT data to stream live data without consuming its limited resources and implements a dualstorge model to support supply chain scalability. The proposed framework is evaluated in terms of security, throughput, and latency. The results demonstrate that the proposed framework maintains confidentiality, integrity, and availability of on-chain and off-chain supply chain data. It achieved better performance through 31.2% and 18% increases in read operation throughput and write operation throughput, respectively. Furthermore, it decreased the write operation latency by 83.3%.

A Study on Visual Perception Scalability of AR/QR Picture Book Animation: Focusing on the Design Characteristics of the Picture Book 〈Where is this?〉 (AR·QR 그림책 애니메이션의 시지각 확장성 연구: 그림책 <여기가 어디지?>의 설계적 특징을 중심으로)

  • Sung Won Park;Jae Yun Park
    • Journal of Information Technology Applications and Management
    • /
    • v.30 no.1
    • /
    • pp.21-32
    • /
    • 2023
  • This study presents a way to design picture books that allow children to experience indirectly through realistic media at home and educational institutions for children whose direct experiences and activities are reduced offline in the post-COVID-19 era. The development and popularization of realistic media such as AR continues to be grafted and developed in the picture book field, and the advantage of this picture book is that children at the stage before learning letters can feel the story and character situation of the book through the experience of AR and QR animation in the picture book. In this process, you can get access to imaginary areas that can not be experienced in flat-panel illustrations with spatial animation to help improve the scalability and literacy of the story contained on the page. Children's education through realistic animation can increase the learning effect and needs to continue after COVID-19. Therefore, by presenting the process of viewing and experiencing picture books using AR and QR, the result of the study suggests that the design process of realistic picture books is not just a combination of technology, but a process of expanding children's perception and imagination. This study aims to find out how visual perception is designed differently by analyzing the differences and characteristics of each animation design, focusing on the AR and QR picture book "Where am I?" published by the researcher, and to contribute to the active introduction and development of realistic animation in the field of children's picture books and education.

Analysis of Rollup Optimization Strategies for Reducing Operational Costsin Optimistic Rollup-Based Layer 2 Networks (Optimistic Rollup 기반 Layer 2 네트워크의 운영비용 절감을 위한 Rollup 최적화 방안 분석)

  • MinJae Koo;Junghee Lee
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.6
    • /
    • pp.1403-1414
    • /
    • 2024
  • Optimistic Rollup-based Layer 2 networks have garnered attention as a significant solution to address Ethereum's scalability issues. However, the efficiency of operational costs acts as a critical factor for the sustainability and scalability of these networks. In this paper, we propose and experimentally validate a method to reduce operational costs by adjusting the rollup intervals and sizes in the Titan network. Specifically, we conducted experiments by modifying the rollup intervals of Transaction Batches and State Root Batches. The experimental results showed that we could reduce the operational costs of Transaction Batches by approximately 3.4% and State Root Batches by about 64%, achieving a total operational cost reduction of around 36%. This reduction was primarily due to the decrease in overhead gas costs associated with State Root Batches. Furthermore, we derived the optimal balance by considering the impact of rollup interval changes on service quality and user experience. This study provides practical guidelines for enhancing the operational efficiency of Optimistic Rollup networks and is expected to be valuable for future network design and operations.

A Study on Scalability of Profiling Method Based on Hardware Performance Counter for Optimal Execution of Supercomputer (슈퍼컴퓨터 최적 실행 지원을 위한 하드웨어 성능 카운터 기반 프로파일링 기법의 확장성 연구)

  • Choi, Jieun;Park, Guenchul;Rho, Seungwoo;Park, Chan-Yeol
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.10
    • /
    • pp.221-230
    • /
    • 2020
  • Supercomputer that shares limited resources to multiple users needs a way to optimize the execution of application. For this, it is useful for system administrators to get prior information and hint about the applications to be executed. In most high-performance computing system operations, system administrators strive to increase system productivity by receiving information about execution duration and resource requirements from users when executing tasks. They are also using profiling techniques that generates the necessary information using statistics such as system usage to increase system utilization. In a previous study, we have proposed a scheduling optimization technique by developing a hardware performance counter-based profiling technique that enables characterization of applications without further understanding of the source code. In this paper, we constructed a profiling testbed cluster to support optimal execution of the supercomputer and experimented with the scalability of the profiling method to analyze application characteristics in the built cluster environment. Also, we experimented that the profiling method can be utilized in actual scheduling optimization with scalability even if the application class is reduced or the number of nodes for profiling is minimized. Even though the number of nodes used for profiling was reduced to 1/4, the execution time of the application increased by 1.08% compared to profiling using all nodes, and the scheduling optimization performance improved by up to 37% compared to sequential execution. In addition, profiling by reducing the size of the problem resulted in a quarter of the cost of collecting profiling data and a performance improvement of up to 35%.

Optimal Design of Network-on-Chip Communication Sturcture (Network-on-Chip에서의 최적 통신구조 설계)

  • Yoon, Joo-Hyeong;Hwang, Young-Si;Chung, Ki-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.8
    • /
    • pp.80-88
    • /
    • 2007
  • High adaptability and scalability are two critical issues in implementing a very complex system in a single chip. To obtain high adaptability and scalability, novel system design methodology known as communication-based system design has gained large attention from SoC designers. NoC (Network-on-Chip) is such an on-chip communication-based design approach for the next generation SoC design. To provide high adaptability and scalability, NoCs employ network interfaces and routers as their main communication structures and transmit and receive packetized data over such structures. However, data packetization, and routing overhead in terms of run time and area may cost too much compared with conventional SoC communication structure. Therefore, in this research, we propose a novel methodology which automatically generates a hybrid communication structure. In this work, we map traditional pin-to-pin wiring structure for frequent and timing critical communication, and map flexible and scalable structure for infrequent, or highly variable communication patterns. Even though, we simplify the communication structure significantly through our algorithm the connectivity or the scalability of the communication modules are almost maintained as the original NoC design. Using this method, we could improve the timing performance by 49.19%, and the area taken by the communication structure has been reduced by 24.03%.

A Non-Equal Region Split Method for Data-Centric Storage in Sensor Networks (데이타 중심 저장 방식의 센서 네트워크를 위한 비균등 영역 분할 기법)

  • Kang, Hong-Koo;Jeon, Sang-Hun;Hong, Dong-Suk;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.3
    • /
    • pp.105-115
    • /
    • 2006
  • A sensor network which uses DCS(Data-Centric Storage) stores the same data into the same sensor node. Thus it has a hot spot problem when the sensor network grows and the same data arise frequently. In the past researches of the sensor network using DCS, the hot spot problem caused by growing the sensor network was ignored because they only concentrated on managing stored sensor data efficiently. In this paper, we proposed a non-equal region split method that supports efficient scalability on storing multi-dimensional sensor data. This method can reduce the storing cost, as the sensor network is growing, by dividing whole space into regions which have the same number of sensor nodes according to the distribution of sensor nodes, and storing and managing sensor data within each region. Moreover, this method can distribute the energy consumption of sensor nodes by increasing the number of regions according to the size of the sensor network, the number of sensor nodes within the sensor network, and the quantity of sensor data. Therefore it can help to increase the life time and the scalability of the sensor network.

  • PDF