• Title, Summary, Keyword: Intra-Node Communication

Search Result 14, Processing Time 0.027 seconds

Facilitating Data Source Movement with Time-Division Access in Content-Centric Networking

  • Priyono, Olivica;Kong, In-Yeup;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.4
    • /
    • pp.433-440
    • /
    • 2014
  • Wireless communication offers the flexibility to the node movement at the spatial dimension more than the wire communication not only in IP architecture but also in Content-Centric Networking. Although it gives such advantage, the intra-domain movement of a node especially the data source node affects the communication to the access point node which in the end affects the acceptance ratio of the client node that requests the data packets from the data source node. In this paper, we use time-division access method to maintain the acceptance ratio of the client node as the effect of the intra-domain data source node movement in Content-Centric Networking. The simulation result shows that the acceptance ratio of the client node can be maintained using the time-division access method as long as the interval access time is less than the coherence time.

A Kernel Module to Support High-Performance Intra-Node Communication for Multi-Core Systems (멀티 코어 시스템을 위한 고속 노드내 통신 지원 모듈)

  • Jin, Hyun-Wook;Kang, Hyun-Goo;Kim, Jong-Soon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.9
    • /
    • pp.407-415
    • /
    • 2007
  • In parallel cluster computing systems, the efficiency of communication between computing nodes is one of important factors that decide overall system performance. Accordingly, many researchers have studied on high-performance inter-node communication. The recently launched multi-core processor, however. increases the importance of intra-node communication as well because the more the number of cores in a node, the more the number of parallel processes running in the same node. Though there have been studies on intra-node communications, these have limited considerations on the state-of-the-art systems. In this paper, we propose a Linux kernel module that minimizes the number of data copy by exploiting the memory mapping mechanism for high-performance intra-node communication. The proposed kernel module supports the Linux kernel version 2.6. The performance measurements over a multi-core system present that the proposed kernel module can achieve lower latency up to 62% and higher throughput up to 144% than an existing kernel module approach. In addition, the measurements reveal that the performance of intra-node communication can vary significantly based on whether the cores that run the communication processes are belong to the same processor package (i.e., sharing the L2 cache).

Using the On-Package Memory of Manycore Processor for Improving Performance of MPI Intra-Node Communication (MPI 노드 내 통신 성능 향상을 위한 매니코어 프로세서의 온-패키지 메모리 활용)

  • Cho, Joong-Yeon;Jin, Hyun-Wook;Nam, Dukyun
    • Journal of KIISE
    • /
    • v.44 no.2
    • /
    • pp.124-131
    • /
    • 2017
  • The emerging next-generation manycore processors for high-performance computing are equipped with a high-bandwidth on-package memory along with the traditional host memory. The Multi-Channel DRAM (MCDRAM), for example, is the on-package memory of the Intel Xeon Phi Knights Landing (KNL) processor, and theoretically provides a four-times-higher bandwidth than the conventional DDR4 memory. In this paper, we suggest a mechanism to exploit MCDRAM for improving the performance of MPI intra-node communication. The experiment results show that the MPI intra-node communication performance can be improved by up to 272 % compared with the case where the DDR4 is utilized. Moreover, we analyze not only the performance impact of different MCDRAM-utilization mechanisms, but also that of core affinity for processes.

Doughnut: An improved P2P Pastry Overlay Network with Efficient Locality and Caching (Doughnut: 효율적인 지역성 및 캐슁을 사용하는 향상된 P2P Pastry 오버레이 네트워크)

  • Kim, Myung-Won;Kwak, Hu-Keun;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.245-256
    • /
    • 2009
  • Pastry overlay network is one of structured P2Ps using DHT(Distributed Hash Table). To reduce the number of messages among nodes, Rosary and LAR have been proposed by exploiting spatial locality and caching, respectively, in the Pastry. Rosary consists of Inter-Pastry and Intra-Pastry. A root node is assigned as a representative in each Intra-Pastry and it has the responsibility of Inter-Pastry and Intra-Pastry routing. Therefore, Rosary has several disadvantages; 1) low fault tolerance in case of root node failure 2) routing hop count increases because of the use of root nodes compared to the existing structured P2Ps, and 3) the communication load is concentrated in some specific areas. LAR has inefficient problems in that caching is not distributed among nodes in Intra-Pastry and caching is used by only nodes in the Intra-Pastry. In this paper, we propose an improved Pastry called Doughnut to overcome the above problems of Rosary and LAR. By dividing nodes with the local characteristics, the Doughnut consists of Inter-Pastry and Intra-Pastry, and all nodes have the responsibility of Inter-Pastry and Intra-Pastry routing. This results in that all nodes perform the role of the existing root node. This solves the problems of the reducing of fault-tolerance, the increasing of routing hop count, and the not-distributed communication load. Also Doughnut can use cache effectively because it guarantees the even cache distribution in local(Intra-Pastry) and the cache contents in local can be used in the other local. The proposed algorithm is implemented using simulator and the experimental results show the effectiveness of the proposed method compared to the existing method.

Routing considering Channel Contention in Wireless Communication Networks with Multiple Radios and Multiple Channels (다수 라디오와 채널을 갖는 무선통신망에서 채널경쟁을 고려한 라우팅)

  • Ko, Sung-Won;Kang, Min-Su;Kang, Nam-Hi;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.7-15
    • /
    • 2007
  • In wireless communication networks, single-radio single-channel architecture degrades throughput and end-to-end delay due to half-duplex transmission of wireless node and route intra interference. Also, In contention-based MAC (Medium Access Control) architecture, channel contention reduces throughput and packet collision enlarges end-to-end delay. In this paper, we use multi-radio multi-channel architecture which will make wireless node to operate in full duplex mode, and exclude route intra interference. Based on this architecture, we propose a new link metric, ccf which reflects the characteristics of a contention-based wireless link, and propose a routing path metric MCCR considering channel switching delay and route intra interference. MCCR is compared with MCR by simulation, the performance of a route established by MCCR outperforms the performance of a route by MCR in terms of throughput and end-to-end delay.

Call Admission Control in Wireless Ad-hoc Networks with Multiple Channels and Radios

  • Ko, Sung-Won
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.4
    • /
    • pp.104-114
    • /
    • 2007
  • In this paper, an Ad-hoc Routing Protocol that works in wireless Ad-hoc communication networks with multiple radios and multiple channels and that controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, the MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which allows full duplex transmission between wireless Ad-hoc nodes, and reduces intra interference on the route. Also, a fixed channel only for reception at each node enables the estimation of the available bandwidth, which is used to control the call admission for QoS provision. The performance of the MCQosR was verified by simulation.

A Session Key Establishment Scheme in Mobile Ad-Hoc Networks (이동 애드혹 네트워크에서 세션 키 설정 방안)

  • 왕기철;정병호;조기환
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.4
    • /
    • pp.353-362
    • /
    • 2004
  • Mobile Ad-Hoc network tends to expose scarce computing resources and various security threats because all traffics are carried in air along with no central management authority. To provide secure communication and save communication overhead, a scheme is inevitable to serurely establish session keys. However, most of key establishment methods for Ad-Hoc network focus on the distribution of a group key to all hosts and/or the efficient public key management. In this paper, a secure and efficient scheme is proposed to establish a session key between two Ad-Hoc nodes. The proposed scheme makes use of the secret sharing mechanism and the Diffie-Hellman key exchange method. For secure intra-cluster communication, each member node establishes session keys with its clusterhead, after mutual authentication using the secret shares. For inter-cluster communication, each node establishes session keys with its correspondent node using the public key and Diffie-Hellman key exchange method. The simulation results prove that the proposed scheme is more secure and efficient than that of the Clusterhead Authentication Based Method(1).

A study on adaptable configuration protocol for high speed electric railway vehicles (고속전철 차량간 구성변화의 능동적 적응을 위한 통신규약에 관한 연구)

  • Han Jae-Mun;Park Jae-Hyun
    • Proceedings of the KSR Conference
    • /
    • /
    • pp.204-209
    • /
    • 2003
  • Recently, The TCN(Train Communication Network} as the distributed control systems for electric vehicles, which is the international standard of the intra vehicle communication, actively recognizes variations and supports reconfiguration of the train network when a vehicle is separated or recombined. The technique of reconfiguration to take variety and interoperability of a vehicle constitution is used when the vehicle constitution is changed. At the time, each node making up vehicle network shares the information about the variation of vehicle constitutions and the state of nodes. In the hierarchical TCN structure, an exchange of data becomes available as a work to transmit information between components is performed at the node playing a role of gateway. This paper proposes a protocol to transmit the information of the train reconfiguration. The protocol gives an application to renew a list for transmitting information and to perform the transmission that can guarantee periodic and non-periodic data transmission between nodes when the network nodes changed by a variation of the network state are reconfigured. If use this protocol, can use functions that are offered in the electric railcar at the same time that composition of vehicles is completed without delay. And when driver of the electric railcar inspect before running of vehicles, can confirm state of vehicles visually through monitor in driver's room.

  • PDF

Multi-Channel/Radio based CAC Mechanism for Wireless Ad-hoc Networks (무선 애드혹 통신망용 멀티 채널/라디오 기반 호접속 제어 메저니즘)

  • Ko, Sung-Won;Kang, Min-Su;Kim, Young-Han
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.396-404
    • /
    • 2007
  • In this paper, an Ad-hoc Routing Protocol which works in wireless Ad-hoc communication networks with multiple radios and multiple channels, and controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which makes full duplex transmission between wireless Ad-hoc nodes, and reduces the intra interference on a route. Also, a fixed channel only for reception at each node enables the measurement of the available bandwidth, which is used to control the call admission for QoS provision. The performance of MCQosR is verified by simulation.

Device-to-Device Relay Cooperative Transmission Based on Network Coding

  • Wang, Jing;Ouyang, Mingsheng;Liang, Wei;Hou, Jun;Liu, Xiangyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3431-3445
    • /
    • 2017
  • Due to the advantages of low transmit power consumption, high spectral efficiency and extended system coverage, Device-to-Device (D2D) communication has drawn explosive attention in wireless communication field. Considering that intra-cell interference caused between cellular signals and D2D signals, in this paper, a network coding-based D2D relay cooperative transmission algorithm is proposed. Under D2D single-hop relay transmission mode, cellular interfering signals can be regarded as useful signals to code with D2D signals at D2D relay node. Using cellular interfering signals and network coded signals, D2D receiver restores the D2D signals to achieve the effect of interference suppression. Theoretical analysis shows that, compared with Amplify-and-forward (AF) mode and Decode-and-forward (DF) mode, the proposed algorithm can dramatically increase the link achievable rate. Furthermore, simulation experiment verifies that by employing the proposed algorithm, the interference signals in D2D communication can be eliminated effectively, and meanwhile the symbol error rate (SER) performance can be improved.