• Title/Summary/Keyword: efficient throughput

Search Result 709, Processing Time 0.029 seconds

QoS Control and Link-Level Performance Analysis for Mobile IP of Wireless Communication Networks (이동인터넷을 위한 QoS 제어 및 링크레벨 성능분석)

  • 조정호;김광현;이형옥
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.5
    • /
    • pp.941-950
    • /
    • 2001
  • In this paper, we present the integrated network architecture for supporting mobile IP in third generation mobile communication networks, and propose the end-to-end QoS control mechanisms of DiffServ and QoS control functions of each network element in the proposed network. First, the QoS supporting schemes of IMT-2000 are described. Second, the necessities of integrating the networks are discussed and the integrated architecture are proposed. Third, the mapping between wireless channels and DiffServ classes are presented. Finally, the end-to-end QoS control mechanisms are proposed. We also analyze the link level protocols with QoS provisioning for mobile multimedia assuming that the system support voice and data traffic simultaneously. In case of data traffic, the delay and throughput of SREJ ARQ and Type-1 Hybrid ARQ scheme are compared, and In case of voice traffic, the packet loss rate of BCH coding is analyzed according to the varying data traffic loads. The results indicate that the adaptive link level protocols are efficient to meet the QoS requirements while the complexities are increased.

  • PDF

Performance Analysis for ABR Congestion Control Algorithm of ATM Switch using Self-Similar Traffic (자기 유사한 트래픽을 이용한 ATM 스위치의 ABR 혼잡제어 알고리즘의 성능분석)

  • Jin, Sung-Ho;Yim, Jae-Hong
    • The KIPS Transactions:PartC
    • /
    • v.10C no.1
    • /
    • pp.51-60
    • /
    • 2003
  • One of the most important matters in designing network and realizing service, is to grip on the traffic characteristics. Conventional traffic prediction and analysis used the models which based on the Poisson or Markovian. Recently, experimental research on the LAN, WAN and VBR traffic properties have been pointed rut that they weren't able to display actual real traffic specificities because the models based on the Poisson assumption had been underestimated the long range dependency of network traffic and self-similar peculiarities, it has been lately presented that the new approach method using self-similarity characteristics as similar as the real traffic models. Therefore, in this paper, we generated self-similar data traffic like real traffic as background load. On the existing ABR congestion control algorithm, we analyzed by classify into ACR, buffer utilization. cell drop rate, transmission throughput with the representative EFCI, ERICA, EPRCA and NIST twitch algorithm to show the efficient reaction about the burst traffic.

Efficient User Selection Algorithms for Multiuser MIMO Systems with Zero-Forcing Dirty Paper Coding

  • Wang, Youxiang;Hur, Soo-Jung;Park, Yong-Wan;Choi, Jeong-Hee
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.232-239
    • /
    • 2011
  • This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

Performance Analysis of Operation Strategy of Dual Virtual Cell-based System under The Overlay Convergent Networks of Cognitive Networking (인지 네트워킹 기반 중첩 융합 네트워크에서 이중 가상 셀 운영방안의 성능분석)

  • Choi, Yu-Mi;Kim, Jeong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.483-488
    • /
    • 2012
  • With the fast growing data traffic, the performance of the convergent overlay network environment under the cognitive networking environment is crucial for the implementation of the efficient network structure. In order to achieve high capacity and reliable link quality in wireless communication of the overlay convergent networks with the cognitive networking based on the advanced capability of the mobile terminal, a Distributed Wireless Communication System (DWCS) can provide the capability of ambient-aware dual cell system's operation. This paper has considered virtual cell: the Dual Virtual Cell (DVC), and also proposes DVC employment strategy based on DWCS network. One is the Active Virtual Cell which exists for user's actual data traffic and the other is the Candidate Virtual Cell which contains a set of candidate antennas to protect user's link quality from performance degradation or interruption. The considered system constructs DVC by using cognitive ability of finding useful virtual signals. Also, for multi-user high-rate data transmission, the DWCS system exploits Space-Time Trellis Codes. The effects of changing environments on the system performance has been investigated thereafter.

Transcriptome-based identification of water-deficit stress responsive genes in the tea plant, Camellia sinensis

  • Tony, Maritim;Samson, Kamunya;Charles, Mwendia;Paul, Mireji;Richard, Muoki;Mark, Wamalwa;Stomeo, Francesca;Sarah, Schaack;Martina, Kyalo;Francis, Wachira
    • Journal of Plant Biotechnology
    • /
    • v.43 no.3
    • /
    • pp.302-310
    • /
    • 2016
  • A study aimed at identifying putative drought responsive genes that confer tolerance to water stress deficit in tea plants was conducted in a 'rain-out shelter' using potted plants. Eighteen months old drought tolerant and susceptible tea cultivars were each separately exposed to water stress or control conditions of 18 or 34% soil moisture content, respectively, for three months. After the treatment period, leaves were harvested from each treatment for isolation of RNA and cDNA synthesis. The cDNA libraries were sequenced on Roche 454 high-throughput pyrosequencing platform to produce 232,853 reads. After quality control, the reads were assembled into 460 long transcripts (contigs). The annotated contigs showed similarity with proteins in the Arabidopsis thaliana proteome. Heat shock proteins (HSP70), superoxide dismutase (SOD), catalase (cat), peroxidase (PoX), calmodulinelike protein (Cam7) and galactinol synthase (Gols4) droughtrelated genes were shown to be regulated differently in tea plants exposed to water stress. HSP70 and SOD were highly expressed in the drought tolerant cultivar relative to the susceptible cultivar under drought conditions. The genes and pathways identified suggest efficient regulation leading to active adaptation as a basal defense response against water stress deficit by tea. The knowledge generated can be further utilized to better understand molecular mechanisms underlying stress tolerance in tea.

Optimistic Concurrency Control Using Time-stamp Ordering in Mobile Databases (이동 데이터베이스 시스템에서 타임스탬프를 이용한 낙관적 동시성 제어 기법)

  • Kim Dae-Ho;Jeong Byeong-Soo;Lee Young-Koo
    • Journal of Internet Computing and Services
    • /
    • v.7 no.4
    • /
    • pp.79-90
    • /
    • 2006
  • Data broadcasting is an efficient method for disseminating data, and is widely accepted in the database applications of mobile computing environments because of its asymmetric communication bandwidth between a server and mobile clients. This requires new types of concurrency control mechanism to support mobile transactions executed in the mobile clients, which have low-bandwidths toward the server. In this paper, we propose an OCC/DTA (Optimistic Concurrency Control with Dynamic Time-stamp Adjustment) protocol that can be efficiently adapted to mobile computing environments. The protocol reduces communication overhead by using client-side validation procedure and enhances transaction throughput by adjusting serialization order without violating transaction semantics. We show that the proposed protocol satisfies data consistency requirements, and simulate that this protocol can improve the performance of mobile transactions in data broadcasting environments.

  • PDF

A Simple Method for the Detection and Identification of Korean Brown Cattle(Hanwoo) using DHPLC

  • Kang, Won;Park, Sane-Bum;Nam, Youn-Hyoung;An, Young-Chang;Lee, Sang-Hyun;Park, Jin-Keun;Lee, Jae-Sik;Jang, On-Cheoul;Park, Su-Min;Park, Yong-Hyun;Ko, Kyung-Hee;Moon, Sung-Sil
    • Proceedings of the Korean Society for Food Science of Animal Resources Conference
    • /
    • 2006.05a
    • /
    • pp.179-183
    • /
    • 2006
  • Denaturing high-performance liquid chromatography(DHPLC) is used in a wide variety of genetic applications and is an efficient method for detection of mutations involving one or a few nucleotides. We developed a high-throughput DHPLC method for identifying polymorphisms in the MC1R gene that are characteristic of Hanwoo cattle. We compared 10 tissue samples from Hanwoo cattle, 10 samples from Holstein cattle and 10 samples from Hanwoox Holstein crossbred cattle to determine whether DHPLC analysis can be used to distinguish between these genotypes. Samples obtained from Hanwoo cattle had a unique profile of peaks that could be used as a molecular fingerprint for this breed. We also analyzed two hundred samples in a trial in which we were blinded to the genotype of the samples and correctly identified the breed-of-origin of 594 out of 600 sequence variations(99%).

  • PDF

Genetic Algorithm based Resource Management for Cognitive Mesh Networks with Real-time and Non-real-time Services

  • Shan, Hangguan;Ye, Ziyun;Bi, Yuanguo;Huang, Aiping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2774-2796
    • /
    • 2015
  • Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

User Bandwidth Demand Centric Soft-Association Control in Wi-Fi Networks

  • Sun, Guolin;Adolphe, Sebakara Samuel Rene;Zhang, Hangming;Liu, Guisong;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.709-730
    • /
    • 2017
  • To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile user. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the effective bandwidth demand of each user actually differs vastly due to their different preferences for mobile applications. In this paper, we formulate a set of non-linear integer programming models for joint user association control and user demand guarantee problem. In this model, we are trying to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control with a software defined network controller. With the fact of NP-hard complexity of non-linear integer programming solver, we propose a Kernighan Lin Algorithm based graph-partitioning method for a large-scale network. Finally, we evaluated the performance of the proposed algorithm for the edge users with heterogeneous bandwidth demands and mobility scenarios. Simulation results show that the proposed adaptive soft-association control can achieve a better performance than the other two and improves the individual quality of user experience with a little price on system throughput.

An Efficient Mobility Agent Advertisement Mechanism for MIPMANET (MIPMANET에서 효율적인 이동성 에이전트 광고기법)

  • Park, Chan-Heum;Seo, Hyun-Gon;Kim, Ki-Hyung;Kim, Chong-Gun
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.5
    • /
    • pp.343-354
    • /
    • 2006
  • There has been much research efforts trying to integrate mobile IP that has been proposed to guarantee the mobility of mobile nodes on MANET (Mobile Ad Hoc Networks) and wired integrated networks. To support the mobility service of nodes in MIPMANET, this paper proposes MAAM(Mobility Agent Advertisement Mechanism) and AMAAM protocols. In MAAM, the mobility agent of the mobile IP can maintain the information of ad hoc networks by broadcasting advertisement messages periodically. AMAAM(Aggregation based Mobility Agent Advertisement Mechanism) is an enhancement of MAAM for reducing the number of transmission of advertisement messages by aggregating them. The proposed schemes are applied in MIPMANET for agent advertisement mechanism. For the performance evaluation of both protocols, we simulated them by NS2. We evaluate the protocols by ns2 with such performance metrics as packet delivery ratio, transmission throughput, and energy consumption.