• Title/Summary/Keyword: Throughput increase

Search Result 489, Processing Time 0.027 seconds

Traffic and Resource Management for Provisioning QoE in Mobile Communication Networks

  • Lee, Moon-Ho;Lee, Jong-Chan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.11
    • /
    • pp.65-71
    • /
    • 2016
  • This paper proposes a novel traffic and resource management scheme based on Service Level Agreement (SLA) which allows to guarantee the quality of experience (QoE) for various high-quality mobile multimedia service users to a certain level. For this purpose, QoE-SLA coupling structure is considered and a novel scheme is suggested to suppress the processing delay of the mobile terminal and to decrease the transfer delay in the transmission network. According to simulation results, our proposed scheme can increase the total throughput and decrease the average delay by adjusting SLA.

Rounds Reduction and Blocks Controlling to Enhance the Performance of Standard Method of Data Cryptography

  • Abu-Faraj, Mua'ad M.;Alqadi, Ziad A.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12spc
    • /
    • pp.648-656
    • /
    • 2021
  • Color digital images are used in many multimedia applications and in many vital applications. Some of these applications require excellent protection for these images because they are confidential or may contain confidential data. In this paper, a new method of data cryptography is introduced, tested, and implemented. It will be shown how this method will increase the security level and the throughput of the data cryptography process. The proposed method will use a secret image_key to generate necessary private keys for each byte of the data block. The proposed method will be compared with other standard methods of data cryptography to show how it will meet the requirements of excellent cryptography, by achieving the objectives: Confidentiality, Integrity, Non-repudiation, and Authentication.

Radio Resource Scheduling Approach For Femtocell Networks

  • Alotaibi, Sultan
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.394-400
    • /
    • 2022
  • The radio resources available in a wireless network system are limited. Therefor, job of managing resources is not easy task. Because the resources are shared among the UEs that are connected, the process of assigning resources must be carefully controlled. The packet scheduler in an LTE network is in charge of allocating resources to the user equipment (UE). Femtocells networks are being considered as a promising solution for poor channel performance for mulitple environments. The implementation of femtocells into a macrocell (traditional base station) would boost the capacities of the cellular network. To increase femtocells network capacity, a reliable Packet Scheduler mechanism should be implemented. The Packet Scheduler technique is introduced in this paper to maximize capacity of the network while maintaining fairness among UEs. The proposed solution operates in a manner consistent with this principle. An analysis of the proposed scheme's performance is conducted using a computer simulation. The results reveal that it outperforms the well-known PF scheduler in terms of cell throughput and average throughput of UEs.

A Mathematical Model for Calculating the Capacity in Terminal Control Areas (접근관제구역 수용량 산정을 위한 수리적 모형)

  • JongMok Chae;Hojong Baik;Jang Ryong Lee;Janghoon Park
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.31 no.4
    • /
    • pp.7-18
    • /
    • 2023
  • The continuous increase in air traffic emphasizes the importance of capacity calculation. Research on the calculation method of Terminal Control Area (TMA) capacity has been treated as a partial aspect of the airspace sector capacity or has been limitedly studied. This study aims to propose a mathematical model for calculating TMA capacity, taking into account the Standard Terminal Arrival Route (STAR), separation standards, TMA entry speed, and runway threshold passing speed. The proposed model has the advantage of being able to calculate the instantaneous arrival capacity, which has not been noted in previous studies, along with the throughput. Additionally, it is meaningful as the model can easily calculate the arrival capacity of the TMA considering airport construction, runway expansion, or new procedures.

Evaluation of a Sample-Pooling Technique in Estimating Bioavailability of a Compound for High-Throughput Lead Optimazation (혈장 시료 풀링을 통한 신약 후보물질의 흡수율 고효율 검색기법의 평가)

  • Yi, In-Kyong;Kuh, Hyo-Jeong;Chung, Suk-Jae;Lee, Min-Haw;Shim, Chang-Koo
    • Journal of Pharmaceutical Investigation
    • /
    • v.30 no.3
    • /
    • pp.191-199
    • /
    • 2000
  • Genomics is providing targets faster than we can validate them and combinatorial chemistry is providing new chemical entities faster than we can screen them. Historically, the drug discovery cascade has been established as a sequential process initiated with a potency screening against a selected biological target. In this sequential process, pharmacokinetics was often regarded as a low-throughput activity. Typically, limited pharmacokinetics studies would be conducted prior to acceptance of a compound for safety evaluation and, as a result, compounds often failed to reach a clinical testing due to unfavorable pharmacokinetic characteristics. A new paradigm in drug discovery has emerged in which the entire sample collection is rapidly screened using robotized high-throughput assays at the outset of the program. Higher-throughput pharmacokinetics (HTPK) is being achieved through introduction of new techniques, including automation for sample preparation and new experimental approaches. A number of in vitro and in vivo methods are being developed for the HTPK. In vitro studies, in which many cell lines are used to screen absorption and metabolism, are generally faster than in vivo screening, and, in this sense, in vitro screening is often considered as a real HTPK. Despite the elegance of the in vitro models, however, in vivo screenings are always essential for the final confirmation. Among these in vivo methods, cassette dosing technique, is believed the methods that is applicable in the screening of pharmacokinetics of many compounds at a time. The widespread use of liquid chromatography (LC) interfaced to mass spectrometry (MS) or tandem mass spectrometry (MS/MS) allowed the feasibility of the cassette dosing technique. Another approach to increase the throughput of in vivo screening of pharmacokinetics is to reduce the number of sample analysis. Two common approaches are used for this purpose. First, samples from identical study designs but that contain different drug candidate can be pooled to produce single set of samples, thus, reducing sample to be analyzed. Second, for a single test compound, serial plasma samples can be pooled to produce a single composite sample for analysis. In this review, we validated the issue whether the second method can be applied to practical screening of in vivo pharmacokinetics using data from seven of our previous bioequivalence studies. For a given drug, equally spaced serial plasma samples were pooled to achieve a 'Pooled Concentration' for the drug. An area under the plasma drug concentration-time curve (AUC) was then calculated theoretically using the pooled concentration and the predicted AUC value was statistically compared with the traditionally calculated AUC value. The comparison revealed that the sample pooling method generated reasonably accurate AUC values when compared with those obtained by the traditional approach. It is especially noteworthy that the accuracy was obtained by the analysis of only one sample instead of analyses of a number of samples that necessitates a significant man-power and time. Thus, we propose the sample pooling method as an alternative to in vivo pharmacokinetic approach in the selection potential lead(s) from combinatorial libraries.

  • PDF

Design of a High Throughput Parallel Turbo Decoder (고 처리율 병렬 터보 복호기 설계)

  • Lee, Won-Ho;Park, Heemin;Rim, Chong S.
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.50-57
    • /
    • 2013
  • This paper provides a design of high-throughput parallel turbo decoder that is able to decode several packets of various length simultaneously. For high-speed communications, designing of Turbo decoder as parallel structures reduces the long decoding time caused by iterative turbo decode way. Also, by employing the double buffer structure for input and output packets improves the decoder throughput by enabling continuous decoding. Because parallel turbo decoder is designed to be able to decode the packet of the longest length, there exist idle PE's(Processing Element) in the case of decoding packets of short length. The main idea of this paper is to increase the utilization of PE's in parallel Turbo decoder and to improve the decoder throughput by using the idle PE's immediately for the subsequent packets decoding. For this, the control is necessary to enable the concurrent decoding of several short packets and we propose the method of this control. Applying the proposed method, we implemented Turbo Decoder with 32 PE's that can decode packets of 6144 bits maximum. Compared to the conventional Turbo decoder, although the area was increased about 16%, the decoder throughput was improved 28 times for short packets.

Improving TCP Performance by Limiting Congestion Window in Fixed Bandwidth Networks (고정대역 네트워크에서 혼잡윈도우 제한에 의한 TCP 성능개선)

  • Park, Tae-Joon;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.149-158
    • /
    • 2005
  • This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

Hybrid Offloading Technique Based on Auction Theory and Reinforcement Learning in MEC Industrial IoT Environment (MEC 산업용 IoT 환경에서 경매 이론과 강화 학습 기반의 하이브리드 오프로딩 기법)

  • Bae Hyeon Ji;Kim Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.9
    • /
    • pp.263-272
    • /
    • 2023
  • Industrial Internet of Things (IIoT) is an important factor in increasing production efficiency in industrial sectors, along with data collection, exchange and analysis through large-scale connectivity. However, as traffic increases explosively due to the recent spread of IIoT, an allocation method that can efficiently process traffic is required. In this thesis, I propose a two-stage task offloading decision method to increase successful task throughput in an IIoT environment. In addition, I consider a hybrid offloading system that can offload compute-intensive tasks to a mobile edge computing server via a cellular link or to a nearby IIoT device via a Device to Device (D2D) link. The first stage is to design an incentive mechanism to prevent devices participating in task offloading from acting selfishly and giving difficulties in improving task throughput. Among the mechanism design, McAfee's mechanism is used to control the selfish behavior of the devices that process the task and to increase the overall system throughput. After that, in stage 2, I propose a multi-armed bandit (MAB)-based task offloading decision method in a non-stationary environment by considering the irregular movement of the IIoT device. Experimental results show that the proposed method can obtain better performance in terms of overall system throughput, communication failure rate and regret compared to other existing methods.

A Design of the High-Speed Cipher VLSI Using IDEA Algorithm (IDEA 알고리즘을 이용한 고속 암호 VLSI 설계)

  • 이행우;최광진
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.1
    • /
    • pp.64-72
    • /
    • 2001
  • This paper is on a design of the high-speed cipher IC using IDEA algorithm. The chip is consists of six functional blocks. The principal blocks are encryption and decryption key generator, input data circuit, encryption processor, output data circuit, operation mode controller. In subkey generator, the design goal is rather decrease of its area than increase of its computation speed. On the other hand, the design of encryption processor is focused on rather increase of its computation speed than decrease of its area. Therefore, the pipeline architecture for repeated processing and the modular multiplier for improving computation speed are adopted. Specially, there are used the carry select adder and modified Booth algorithm to increase its computation speed at modular multiplier. To input the data by 8-bit, 16-bit, 32-bit according to the operation mode, it is designed so that buffer shifts by 8-bit, 16-bit, 32-bit. As a result of simulation by 0.25 $\mu\textrm{m}$ process, this IC has achieved the throughput of 1Gbps in addition to its small area, and used 12,000gates in implementing the algorithm.

Evaluation of Multiple Access Protocol for Underwater Acoustic Network (수중 네트워크를 위한 다중접속 프로토콜의 평가)

  • Kim, Lack-Hoon;Kim, Tae-Jung;Shim, Tae-Bo
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.91-92
    • /
    • 2008
  • The purpose of this paper is to propose a CSMA/CA protocol to reduce the delay time and increase the throughput of the original CSMA/CA protocol. In underwater environments, the efficiency of the protocol is reduced due to the increase of the propagation delay time, which results in increase of the collision possibility causing lowering of the transmission efficiency.

  • PDF