• Title/Summary/Keyword: efficient throughput

Search Result 709, Processing Time 0.028 seconds

Integrating Resilient Tier N+1 Networks with Distributed Non-Recursive Cloud Model for Cyber-Physical Applications

  • Okafor, Kennedy Chinedu;Longe, Omowunmi Mary
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.7
    • /
    • pp.2257-2285
    • /
    • 2022
  • Cyber-physical systems (CPS) have been growing exponentially due to improved cloud-datacenter infrastructure-as-a-service (CDIaaS). Incremental expandability (scalability), Quality of Service (QoS) performance, and reliability are currently the automation focus on healthy Tier 4 CDIaaS. However, stable QoS is yet to be fully addressed in Cyber-physical data centers (CP-DCS). Also, balanced agility and flexibility for the application workloads need urgent attention. There is a need for a resilient and fault-tolerance scheme in terms of CPS routing service including Pod cluster reliability analytics that meets QoS requirements. Motivated by these concerns, our contributions are fourfold. First, a Distributed Non-Recursive Cloud Model (DNRCM) is proposed to support cyber-physical workloads for remote lab activities. Second, an efficient QoS stability model with Routh-Hurwitz criteria is established. Third, an evaluation of the CDIaaS DCN topology is validated for handling large-scale, traffic workloads. Network Function Virtualization (NFV) with Floodlight SDN controllers was adopted for the implementation of DNRCM with embedded rule-base in Open vSwitch engines. Fourth, QoS evaluation is carried out experimentally. Considering the non-recursive queuing delays with SDN isolation (logical), a lower queuing delay (19.65%) is observed. Without logical isolation, the average queuing delay is 80.34%. Without logical resource isolation, the fault tolerance yields 33.55%, while with logical isolation, it yields 66.44%. In terms of throughput, DNRCM, recursive BCube, and DCell offered 38.30%, 36.37%, and 25.53% respectively. Similarly, the DNRCM had an improved incremental scalability profile of 40.00%, while BCube and Recursive DCell had 33.33%, and 26.67% respectively. In terms of service availability, the DNRCM offered 52.10% compared with recursive BCube and DCell which yielded 34.72% and 13.18% respectively. The average delays obtained for DNRCM, recursive BCube, and DCell are 32.81%, 33.44%, and 33.75% respectively. Finally, workload utilization for DNRCM, recursive BCube, and DCell yielded 50.28%, 27.93%, and 21.79% respectively.

Automated Bacterial Cell Counting Method in a Droplet Using ImageJ (이미지 분석 프로그램을 이용한 액적 내 세포 계수 방법)

  • Jingyeong Kim;Jae Seong Kim;Chang-Soo Lee
    • Korean Chemical Engineering Research
    • /
    • v.61 no.2
    • /
    • pp.247-257
    • /
    • 2023
  • Precise counting of cell number stands in important position within clinical and research laboratories. Conventional methods such as hemocytometer, migration/invasion assay, or automated cell counters have limited in analytical time, cost, and accuracy., which needs an alternative way with time-efficient in-situ approach to broaden the application avenue. Here, we present simple coding-based cell counting method using image analysis tool, freely available image software (ImageJ). Firstly, we encapsulated RFP-expressing bacteria in a droplet using microfluidic device and automatically performed fluorescence image-based analysis for the quantification of cell numbers. Also, time-lapse images were captured for tracking the change of cell numbers in a droplet containing different concentrations of antibiotics. This study confirms that our approach is approximately 15 times faster and provides more accurate number of cells in a droplet than the external analysis program method. We envision that it can be used to the development of high-throughput image-based cell counting analysis.

Economic Efficiency of the Korean Container Terminals: A Stochastic Cost Frontier Approach

  • Seokwoo Jake Choi;Gi-Su Kim;BoKyung Kim
    • Journal of Korea Trade
    • /
    • v.26 no.3
    • /
    • pp.23-44
    • /
    • 2022
  • Purpose - Recent issues such as vessel enlargement, strengthening of environmental regulations, and port smartization are expected to increase costs and intensify competition in the port industry. In the new normal era, when external growth has reached its limit, the efficient operation of ports is becoming indispensable for achieving sustainable growth. This study aims to identify the determinants of inefficiency by examining the cost structure and efficiency of container terminals in Korea and furthermore propose the political implications to derive the maximization of efficiency. Design/methodology - This study estimates the cost function of container terminal operators and identifies the efficiency of container terminals using stochastic cost frontier (SCF) in the first stage. In the second step, the SCF results are compared with the data envelopment analysis (DEA). Last, this paper proposes efficiency determinants on container terminal operation to establish appropriate strategies. Out of the 29 container terminal operators in South Korea, 13 operators participated in the survey. The translog cost function was estimated utilizing a total of 116 observations collected over the 2007-2017 period. Findings - Empirical analysis shows that economies of scale exist in Korea's container ports, which provides a rationale for the government's policy to establish the global terminal operator by integrating small terminal operators to enhance competitiveness. In addition, as a result of the determinants analysis, container throughput, weight of direct employment costs, and labour cost share have positive effects on improving cost efficiency, while inefficiency increases as the length of quay increases. More specifically, cost efficiency improves as the proportion of direct employment costs to outsourcing service costs increases. Originality/value - This study contributes to analyzing the inefficiency factors of container terminals through efficiency analysis with respect to a cost function. In addition, this study proposes the practical and political implications, such as establishing a long-term manpower pool, the application of the hybrid liner terminal system, and the construction of a statistical data system, to improve the cost inefficiency of terminal operators.

A Study on Efficient Mixnet Techniques for Low Power High Throughput Internet of Things (저전력 고속 사물 인터넷을 위한 효율적인 믹스넷 기술에 대한 연구)

  • Jeon, Ga-Hye;Hwang, Hye-jeong;Lee, Il-Gu
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.246-248
    • /
    • 2021
  • Recently data has been transformed into a data economy and society that acts as a catalyst for the development of all industries and the creation of new value, and COVID-19 is accelerating digital transformation. In the upcoming intelligent Internet of Things era, the availability of decentralized systems such as blockchain and mixnet is emerging to solve the security problems of centralized systems that makes it difficult to utilize data safely and efficiently. Blockchain manages data in a transparent and decentralized manner and guarantees the reliability and integrity of the data through agreements between participants, but the transparency of the data threatens the privacy of users. On the other hand, mixed net technology for protecting privacy protects privacy in distributed networks, but due to inefficient power consumption efficiency and processing speed issues, low cost, light weight, low power consumption Internet Hard to use. In this paper, we analyze the limitations of conventional mixed-net technology and propose a mixed-net technology method for low power consumption, high speed, and the Internet of things.

  • PDF

Analysis of Network Security Policy Enforcement in Container Environments (컨테이너 환경에서의 네트워크 보안 정책 집행 분석)

  • Bom Kim;Seungsoo Lee
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.6
    • /
    • pp.961-973
    • /
    • 2023
  • With the changes in the modern computing landscape, securing containerized workloads and addressing the complexities of container networking have become critical issues. In particular, the complexity of network policy settings and the lack of cloud security architecture cause various security issues. This paper focuses on the importance of network security and efficiency in containerized environments, and analyzes the security features and performance of various container network interface plugins. In particular, the features and functions of Cilium, Calico, Weave Net, and Kube-router were compared and evaluated, and the Layer 3/4 and Layer 7 network policies and performance features provided by each plugin were analyzed. We found that Cilium and Calico provide a wide range of security features, including Layer 7 protocols, while Weave Net and Kube-router focus on Layer 3/4. We also found a decrease in throughput when applying Layer 3/4 policies and an increase in latency due to complex processing when applying Layer 7 policies. Through this analysis, we expect to improve our understanding of network policy and security configuration and contribute to building a safer and more efficient container networking environment in the future.

Insights into structural vaccinology harnessed for universal coronavirus vaccine development

  • Chin Peng Lim;Chiuan Herng Leow;Hui Ting Lim;Boon Hui Kok;Candy Chuah;Jonas Ivan Nobre Oliveira;Malcolm Jones;Chiuan Yee Leow
    • Clinical and Experimental Vaccine Research
    • /
    • v.13 no.3
    • /
    • pp.202-217
    • /
    • 2024
  • Structural vaccinology is pivotal in expediting vaccine design through high-throughput screening of immunogenic antigens. Leveraging the structural and functional characteristics of antigens and immune cell receptors, this approach employs protein structural comparison to identify conserved patterns in key pathogenic components. Molecular modeling techniques, including homology modeling and molecular docking, analyze specific three-dimensional (3D) structures and protein interactions and offer valuable insights into the 3D interactions and binding affinity between vaccine candidates and target proteins. In this review, we delve into the utilization of various immunoinformatics and molecular modeling tools to streamline the development of broad-protective vaccines against coronavirus disease 2019 variants. Structural vaccinology significantly enhances our understanding of molecular interactions between hosts and pathogens. By accelerating the pace of developing effective and targeted vaccines, particularly against the rapidly mutating severe acute respiratory syndrome coronavirus 2 and other prevalent infectious diseases, this approach stands at the forefront of advancing immunization strategies. The combination of computational techniques and structural insights not only facilitates the identification of potential vaccine candidates but also contributes to the rational design of vaccines, fostering a more efficient and targeted approach to combatting infectious diseases.

An Efficient Array Algorithm for VLSI Implementation of Vector-radix 2-D Fast Discrete Cosine Transform (Vector-radix 2차원 고속 DCT의 VLSI 구현을 위한 효율적인 어레이 알고리듬)

  • 신경욱;전흥우;강용섬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.12
    • /
    • pp.1970-1982
    • /
    • 1993
  • This paper describes an efficient array algorithm for parallel computation of vector-radix two-dimensional (2-D) fast discrete cosine transform (VR-FCT), and its VLSI implementation. By mapping the 2-D VR-FCT onto a 2-D array of processing elements (PEs), the butterfly structure of the VR-FCT can be efficiently importanted with high concurrency and local communication geometry. The proposed array algorithm features architectural modularity, regularity and locality, so that it is very suitable for VLSI realization. Also, no transposition memory is required, which is invitable in the conventional row-column decomposition approach. It has the time complexity of O(N+Nnzp-log2N) for (N*N) 2-D DCT, where Nnzd is the number of non-zero digits in canonic-signed digit(CSD) code, By adopting the CSD arithmetic in circuit desine, the number of addition is reduced by about 30%, as compared to the 2`s complement arithmetic. The computational accuracy analysis for finite wordlength processing is presented. From simulation result, it is estimated that (8*8) 2-D DCT (with Nnzp=4) can be computed in about 0.88 sec at 50 MHz clock frequency, resulting in the throughput rate of about 72 Mega pixels per second.

  • PDF

A Secure Route Optimization Mechanism for Mobile VPN users in Foreign Networks (모바일 VPN 사용자를 위한 보안 강화 경로 최적화 방안)

  • Kim, Kyoung-Min;Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.348-359
    • /
    • 2007
  • The conventional mobile VPN services assumed the mobile communications occur between the MN in foreign networks and the CN in the home network. However, if a MN wants to communicate with another MN in a foreign network, it could degrade the performance of the mobile VPN service because of the triangular routing problem. In this paper, we propose a route optimization mechanism based on the mobile VPN using an x-HA allocated by diameter MIP in order to support the efficient communication between the mobile VPN users in foreign networks. The i-HA maintains the VPN-TIA as well as the x-HoA as the CoAs to solve the security problem and to provide an efficient route optimization simultaneously. Moreover, we proposed revised IPSec tunnel configuration to reduce the IPSec tunnel overheads at a MN when the MN communicates with several MNs in the foreign networks at the same time. The VPN server, a security management entity in the home network, notifies an additional IPSec tunnel establishment between the x-HAs where the communication peers are registered. The simulation result showed that the proposed scheme decreases the end-to-end packet delay time and improves the throughput after the handoff compared to the existing mechanism.

A MAC Protocol for Efficient Burst Data Transmission in Multihop Wireless Sensor Networks (멀티홉 무선 센서 네트워크에서 버스트 데이타의 효율적인 전송을 위한 프로토콜에 관한 연구)

  • Roh, Tae-Ho;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.3
    • /
    • pp.192-206
    • /
    • 2008
  • Multihop is the main communication style for wireless sensor networks composed of tiny sensor nodes. Until now, most applications have treated the periodic small sized sensing data. Recently, the burst traffic with the transient and continuous nature is increasingly introduced due to the advent of wireless multimedia sensor networks. Therefore, the efficient communication protocol to support this trend is required. In this paper, we propose a novel PIGAB(Packet Interval Gap based on Adaptive Backoff) protocol to efficiently transmit the burst data in multihop wireless sensor networks. The contention-based PIGAB protocol consists of the PIG(Packet Interval Gap) control algorithm in the source node and the MF(MAC-level Forwarding) algorithm in the relay node. The PIGAB is on basis of the newly proposed AB(Adaptive Backoff), CAB(Collision Avoidance Backoff), and UB(Uniform Backoff). These innovative algorithms and schemes can achieve the performance of network by adjusting the gap of every packet interval, recognizing the packet transmission of the hidden node. Through the simulations and experiments, we identify that the proposed PIGAB protocol considerably has the stable throughput and low latency in transmitting the burst data in multihop wireless sensor networks.

An Efficient TCP Buffer Tuning Algorithm based on Packet Loss Ratio(TBT-PLR) (패킷 손실률에 기반한 효율적인 TCP Buffer Tuning 알고리즘)

  • Yoo Gi-Chul;Kim Dong-kyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.121-128
    • /
    • 2005
  • Tho existing TCP(Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high RDP(Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT(Automatic TCP fluffer Tuning) attempts to assure the buffer size of TCP sender according to its current congestion window size but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer tuning technique(called TBT-PLR: TCP buffer tuning algorithm based on packet loss ratio) since we adopt the ATBT mechanism and the TBT-PLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBT-PLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.