• Title/Summary/Keyword: End-to-End Throughput

Search Result 262, Processing Time 0.033 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

Novel High-Throughput DNA Part Characterization Technique for Synthetic Biology

  • Bak, Seong-Kun;Seong, Wonjae;Rha, Eugene;Lee, Hyewon;Kim, Seong Keun;Kwon, Kil Koang;Kim, Haseong;Lee, Seung-Goo
    • Journal of Microbiology and Biotechnology
    • /
    • v.32 no.8
    • /
    • pp.1026-1033
    • /
    • 2022
  • This study presents a novel DNA part characterization technique that increases throughput by combinatorial DNA part assembly, solid plate-based quantitative fluorescence assay for phenotyping, and barcode tagging-based long-read sequencing for genotyping. We confirmed that the fluorescence intensities of colonies on plates were comparable to fluorescence at the single-cell level from a high-end, flow-cytometry device and developed a high-throughput image analysis pipeline. The barcode tagging-based long-read sequencing technique enabled rapid identification of all DNA parts and their combinations with a single sequencing experiment. Using our techniques, forty-four DNA parts (21 promoters and 23 RBSs) were successfully characterized in 72 h without any automated equipment. We anticipate that this high-throughput and easy-to-use part characterization technique will contribute to increasing part diversity and be useful for building genetic circuits and metabolic pathways in synthetic biology.

The Design and Implementation of the Multimedia End-to-End Server I/O System based on Linux (멀티미디어 End-to-End 서버용 리눅스 기반 I/O 시스템 설계 및 구현)

  • Nam, Sang-Jun;Lee, Byeong-Rae;Park, Nam-Seop;Lee, Yun-Jeong;Kim, Tae-Yun
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.311-318
    • /
    • 2001
  • In recent years, users\` demands for multimedia service are increasing because of a diffusion of internet. Server systems, however, offer inefficient multimedia data service to users. Multimedia applications often transfer the same data between shared devices at very high rates, and therefore require an efficient I/O subsystem. Data copying and context switching have long been identified as sources of I/O inefficiency. Therefore we propose the new Multimedia Stream System Call (MSSC) mechanism, which is inserted into a Linux kernel: The MSSC mechanism operates in kernel domain with RTP (Real-time Transport Protocol). We present measurements indicating that use of our techniques resulted in a 12.5%∼14% gain in throughput as compared with a conventional Linux system.

  • PDF

Relay Selection Algorithm for Two-way Multiple Relay Channels (양방향 다중 중계기 채널에서의 중계기 선택 기법)

  • Kang, Yoo-Keun;Lee, Jae-Hong
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.134-143
    • /
    • 2009
  • In this paper, we propose a new relay selection algorithm for a two-way multiple relay channel. In the two-way multiple relay channel, two users exchange information with each other via multiple relays. The relays use a decode-and-forward or amplify-and-forward protocol, and exploit the combining process of the received packets to reduce the required channel resources. In the multiple relay network, diversity gain is achieved as the number of relays increases, and various schemes are proposed. In this paper, we propose a single best relay selection scheme based on instantaneous channel conditions. First of all, relays obtain the instantaneous channel state information in the handshaking process, and a single best relay is selected in a distributed methods prior to data transmissions. The relay selection metric is proposed so that the end-to-end channel condition is evaluated based on the intantaneous channel state informations. Simulation results show that the proposed relay selection algorithm achieve the increased throughput and diversity order when the number of potential relays is increased.

An Internet Multicast Routing Protocol with Region-based Tree Switching (지역망간의 트리전환을 이용하는 인터넷 멀티캐스트 라우팅 프로토콜)

  • Kim, Won-Tae;Park, Yong-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.234-243
    • /
    • 2000
  • We design a modified network architecture with condsidering current Internet network model and traffic characteristics, and propose EDCBT(Enhanced Dispersed Core-based Tree) multicast routing protocol, which enhances scalabity, reliability, end-to-end delay and resource utilization EDBCT adopts bidirectional dispersed shared trees and manages both of intradomain and interdomain multicast trees for a multicast group. Each regional multicast tree is estabilshed from its core router and they are interconnected by the operation between border routers on edges of each regional network. As a result, interdomain multicast tree can be easily established. We introduce a new concept named RBTS(Region-based Tree Switching), which dramatically enhances QoS and network utilization. Finally, protocol performance and the effect of core router location are evaluated with MIL3 OPNet network simulator, in terms of end-to-end delay, packet loss and throughput.

  • PDF

Space-Polarization Division Multiple Access System with Limited Feedback

  • Joung, Heejin;Jo, Han-Shin;Mun, Cheol;Yook, Jong-Gwan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1292-1306
    • /
    • 2014
  • This paper proposes a space-polarization division multiple access (SPDMA) system that has limited feedback channels. The system simultaneously serves data streams to multiple mobile users through dual-polarized antenna arrays, by using pre-determined sets of precoding vectors that are orthogonal in both space and polarization domains. To this end, a codebook whose elements are sets of the precoding vectors is systematically designed based on the discrete Fourier transform (DFT) matrix and considering the power imbalance of polarized channels. Throughput of the SPDMA system is evaluated and compared to that of space division multiple access (SDMA) system, according to the various parameters including cross polarization discrimination (XPD). The results show that the throughput of SPDMA system outperforms that of SDMA in the environments of high XPD with many mobile users.

Reliable Extension Scheme using Multiple Paths in Wireless Ad-hoc Networks (무선 애드-혹 네트워크의 다중 경로를 이용한 신뢰적인 확장 기법)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.3
    • /
    • pp.218-225
    • /
    • 2007
  • As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless mobile ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an extension scheme of a wireless mobile ad-hoc network based on limited multiple paths source routing protocol. This scheme reduces the overhead of route re-establishment and re-registration by maintaining link/node non-disjoint multiple paths between mobile hosts in a wireless mobile ad-hoc network or a mobile host in a wireless mobile ad-hoc network and a base station supporting fixed network services. By maintaining multiple paths, our scheme provides short end-to-end delay and is reliable extension scheme of a wireless mobile ad-hoc network to a fixed network. In this paper, our simulations show that our scheme outperforms existing schemes with regards to throughput and end-to-end delay. Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.

Adaptation Latency and Throughput of TCP Congestion Control Schemes on Vertical Handoff (이기종망간의 핸드오프에 대한 TCP 적응성능 분석연구)

  • Seok, Woo-Jin;Lee, Gil-Jae;Kwak, Jai-Seung;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2B
    • /
    • pp.124-132
    • /
    • 2007
  • Where a wireless LAN and a cellular network coexist, a mobile node has to experience vertical handoffs to move between them. Immediately after the vertical handoffs, TCP must need adaptation latency to adjust its congestion window to the proper size at a newly arrived network to use full of a new end-to-end available bandwidth. Even though SACK TCP has the best performance among other regular TCPs in the previous studies, it still cannot use full of the new available bandwidth quickly due to its inefficient increasing way of congestion window. BIC TCP, that becomes a popular TCP in long fat networks, has great feature working well against vertical handoffs by increasing congestion window exponentially with TCP connection sustained. In this paper, we derive adaptation latency of SACK TCP and BIC TCP numerically, and verify them by simulations. We also find that the shorter adaptation latency of BIC TCP produces higher throughput than SACK TCP on vertical handoffs. Consequently, to get higher performance on vertical handoff situations, we propose to use BIC TCP.

IDMMAC: Interference Aware Distributed Multi-Channel MAC Protocol for WSAN

  • Kakarla, Jagadeesh;Majhi, Banshidhar;Battula, Ramesh Babu
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1229-1242
    • /
    • 2017
  • In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed for wireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ample amount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed to enhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the ad-hoc traffic indication message (ATIM) window phase and data transmission phase). When a sensor wants to transmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and the capacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via a control channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backup cluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and node degree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area or it leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multi-channel MAC protocol is also proposed for actor-actor coordination. An actor selects a minimum interference and maximum throughput channel among the available channels to communicate with the destination actor. The performance of the proposed IDMMAC protocol is analyzed using standard network parameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. The obtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MAC protocols.

Efficient New Routing Protocol for Mobile Ad Hoc Networks (이동 애드혹 네트워크을 위한 새로운 라우팅 프로토콜 기법)

  • Ngo, Van-Vuong;Jang, Jaeshin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.815-818
    • /
    • 2015
  • AODV routing protocol, one of the most studied routing protocols for the Mobile Ad hoc Network (MANET), uses the number of hops as the metric to choose a path from a source node to a destination node. If the path is deteriorated, it will cause many problems to the communication. In order to improve the performance of the network, we propose AuM-AODV routing protocol that contains an auxiliary metric besides the number of hops. Nodes using AuM-AODV use control packets such as Route Request (RREQ), Route Reply (RREP), and HELLO to exchange information about network topology like AODV routing protocol. AuM-AODV routing protocol is implemented in NS-3 for performance evaluation. We use three performance metrics, that is to say, throughput, packet delivery ratio, and average end-to-end delay. According to numerical results, the new AuM-AODV routing protocol has better performance over three performance metrics than AODV routing protocol.

  • PDF