• Title/Summary/Keyword: 임의 네트워크

Search Result 779, Processing Time 0.02 seconds

All Flash Array Storage Virtualisation using SCST (SCST를 이용한 All Flash Array 스토리지 가상화)

  • Heo, Huiseong;Pirahandeh, Mehdi;Lee, Kwangsoo;Kim, Deokhwan
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.10
    • /
    • pp.525-533
    • /
    • 2014
  • SCST(The generic SCSI target subsystem for Linux) enables developers to make SCSI target storage and supports various SCSI network protocol such as iSCSI, FC, SRP. In this paper, we propose storage virtualization method using SCST and virtualize all flash array as high performance storage through 4Gb Fiber Channel, 10Gb Ethernet and 40Gb Infiniband and evaluate their performance, respectively. Experimental result shows that 40Gb infiniband network appliance have better performance than others. In case of sequential/random read, 40Gb infiniband network appliance shows 78% and 79% of local all flash array performance attached to SCSI target system. In case of sequential/random write, it shows 83% and 88% of local flash array performance attached to SCSI target system.

A Disjoint Multi-path Routing Protocol for Efficient Transmission of Collecting Data in Wireless Sensor Network (무선 센서 네트워크에서 수집 데이터의 효과적인 전송을 위한 비겹침 다중경로 라우팅 프로토콜)

  • Han, Dae-Man;Lim, Jae-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.17C no.5
    • /
    • pp.433-440
    • /
    • 2010
  • Energy efficiency, low latency and scalability for wireless sensor networks are important requirements, especially, the wireless sensor network consist of a large number of sensor nodes should be minimized energy consumption of each node to extend network lifetime with limited battery power. An efficient algorithm and energy management technology for minimizing the energy consumption at each sensor node is also required to improve transfer rate. Thus, this paper propose no-overlap multi-pass protocol provides for sensor data transmission in the wireless sensor network environment. The proposed scheme should minimize network overhead through reduced a sensor data translation use to searched multi-path and added the multi-path in routing table. Proposed routing protocol may minimize the energy consumption at each node, thus prolong the lifetime of the sensor network regardless of where the sink node is located outside or inside the received signal strength range. To verify propriety proposed scheme constructs sensor networks adapt to current model using the real data and evaluate consumption of total energy.

The Performance Comparison of the Unicast Routing Protocol and the Broadcast Routing Protocol in the Small-sized Ad hoc Network (소규모 애드혹 네트워크에서의 유니캐스트와 브로드캐스트 라우팅 프로토콜의 성능비교)

  • Kim, Dong-Hee;Park, Jun-Hee;Moon, Kyeong-Deok;Lim, Kyung-Shik
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.685-690
    • /
    • 2006
  • This paper compares the performance of the unicast routing protocol and the broadcast routing protocol in a small-sized wireless multi-hop network, such as home network. Normally, ad-hoc routing protocols are designed for general wireless multi-hop networks, not being said to be optimized for the small-sized ad hoc network. This paper compares some unicast routing protocols and optimal broadcast routing protocol, and shows the result. The result of the simulation says the broadcast routing protocol shows better performance than the ad-hoc routing protocols in the small-sired wireless multi-hop network. Especially, the result shows that the broadcast protocol has higher packet delivery ratio and lower packet latency than unicast routing protocols

An Efficient Multi-User Resource Allocation Scheme for Future IEEE 802.11 LRLP Communications (미래 IEEE 802.11 LRLP 통신을 위한 효율적인 다중 사용자 자원할당 기법)

  • Ahn, Woojin;Kim, Ronny Yongho
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.3
    • /
    • pp.232-237
    • /
    • 2016
  • As a possible standardization of wireless local area network (WLAN), IEEE 802.11 LRLP is under discussion in order to support long range and low power (LRLP) communication for internet of things (IoT) including drones and many other IoT devices. In this paper, an efficient adaptive resource unit allocation scheme for uplink multiuser transmission in IEEE 802.11 LRLP networks is proposed. In the proposed scheme, which adopts OFDMA random access based transmission scheme of IEEE 802.11ax, in order to enhance the efficiency of the slotted OFDMA random access, access point (AP) traces the history of the sizes of successfully transmitted uplink data, and adjusts the sizes of resource units for the next uplink multiuser transmission adaptively. Our simulation results corroborate that the proposed scheme significantly improves the system throughput.

Reservation based Multichannel CSMA Protocol for Improvement of Energy Consumption and QoS in Wireless Sensor Networks (무선 센서 네트워크 환경에서 에너지 소비 및 QoS를 고려한 예약기반 Multichannel CSMA 프로토콜)

  • Han, Jung-Ahn;Kim, Yun-Hyung;Lee, Moon-Ho;Kim, Byung-Gi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2A
    • /
    • pp.143-151
    • /
    • 2007
  • One of the consideration things to design protocol in wireless sensor networks is to maximize lifetime of sensor node as reducing energy consumption. In this paper propose reserve based multichannel CSMA mac protocol for minimizing energy consumption which arise from collision and waiting retransmission at channel access process in mac layer Each sensor node which constitute sensor networks has data channel and control channel. And as sensor node reserve channel for data transmission by using control channel and receipt node allow reservation node to use data channel, sending node can abbreviate try of retransmission after random interval time. Also, When sending node delivers selects option channel in available channels to receipt node, the receipt node decide whether the channel is available to oneself and through the result select transmission channel ultimately. Performance evaluation compare with previous simple multichannel CSMA.

A Minimun-diameter Spanning Tree with Bounded Degrees (제한된 분지수를 가지는 최소지름 신장트리)

  • 안희갑;신찬수
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.78-85
    • /
    • 2004
  • Given a set S of n points in the plane, a minimum-diameter spanning tree(MDST) for the set might have a degree up to n-1. This might cause the degradation of the network performance because the node with high degree should handle much more requests than others relatively. Thus it is important to construct a spanning tree network with small degree and diameter. This paper presents an algorithm to construct a spanning tree for S satisfying the following four conditions: (1) the degree is controled as an input, (2) the tree diameter is no more than constant times the diameter of MDST, (3) the tree is monotone (even if arbitrary point is fixed as a root of the tree) in the sense that the Euclidean distance from the root to any node on the path to any leaf node is not decreasing, and (4) there are no crossings between edges of the tree. The monotone property will play a role as an aesthetic criterion in visualizing the tree in the plane.

A Peer-to-Peer Key Establishment Scheme without Pre-distributing Keys in Ad-Hoc Networks (Ad-Hoc 네트워크에서 선행 키 분배 없는 단 대 단 키 설정 방안)

  • 왕기철;방상원;정병호;조기환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7C
    • /
    • pp.1015-1023
    • /
    • 2004
  • In order to protect an exchanged data, it is indispensable to establish a peer-to-peer key between the two communicating nodes. Pre-distributing keys among the nodes is unrealistic in Ad-Hoc network environment because of the dynamic nature of its network topology and the equal authority of its nodes. This paper presents a peer-to-peer key establishment scheme without pre-distributing keys in Ad-Hoc networks. The proposed scheme is based on the Diffie-Hellman key exchange protocol. Main idea is to prevent the falsification of Diffe-Hellman values using some elements of a hash chain. As a result, it is as safe as the underlying hash function against a man-in-the-middle attack. Simulation results have shown that the proposed scheme dramatically reduces the number of messages, and has relatively higher scalability, as compared with the key pre-distribution based scheme.

FST : Fusion Rate Based Spanning Tree for Wireless Sensor Networks (데이터 퓨전을 위한 무선 센서 네트워크용 스패닝 트리 : FST)

  • Suh, Chang-Jin;Shin, Ji-Soo
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.83-90
    • /
    • 2009
  • Wireless Sensor Network (WSN) is a wireless network that gathers information from remote area with autonomously configured routing path. We propose a fusion based routing for a 'convergecast' in which all sensors periodically forward collected data to a base station. Previous researches dealt with only full-fusion or no-fusion case. Our Fusion rate based Spanning Tree (FST) can provide effective routing topology in terms of total cost according to all ranges of fusion rate f ($0{\leq}f{\leq}1$). FST is optimum for convergecast in case of no-fusion (f = 0) and full-fusion (f = 1) and outperforms the Shortest Path spanning Tree (SPT) or Minimum Spanning Tree (MST) for any range of f (0 < f < 1). Simulation of 100-node WSN shows that the total length of FST is shorter than MST and SPT nearby 31% and 8% respectively in terms of topology lengths for all range of f. As a result, we confirmed that FST is a very useful WSN topology.

A Virtual Grid-Based Routing Algorithm in Ad Hoc Networks (애드혹 네트워크에서의 가상 그리드 기반 라우팅 알고리즘)

  • Lee, Jong-Min;Kim, Seong-Woo
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.2
    • /
    • pp.17-26
    • /
    • 2007
  • In this paper, we propose a basic virtual grid-based routing algorithm in order to devise an efficient routing method in ad hoc networks using the location information of nodes, energy level, etc. A packet is forwarded to the X-axis direction at first based on the location information of a destination node, and then it is forwarded to the Y-axis direction as its location becomes close to the destination from the viewpoint of the X-axis. Due to the selection of next hop nodes to deliver a packet from a certain node to a destination node, we can regard the whole network as a virtual grid network. The proposed routing algorithm determines routing paths using the local information such as the location information of a destination and its neighbor nodes. Thus, the routing path setup is achieved locally, by which we can expect reduction in network traffics and routing delays to a destination. To evaluate the performance of the proposed routing algorithm, we used the network simulator ns2 and compared its network throughput with that of an existing routing algorithm.

  • PDF

Major Studios' Risk Sharing Mechanism in the US TV Drama Industry (미국 TV드라마 산업에서 메이저 스튜디오의 리스크 분산 메커니즘)

  • Yim, Jung-Su
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.11
    • /
    • pp.137-144
    • /
    • 2011
  • This study explored the risk sharing mechanism in the US TV drama industry. The hollywood system of TV production and distribution can be understood to be the result of the efforts to reduce the uncertainty and the risk of investment. Since the 1990s, the vertical integration of major studios and networks has been one of the core strategies for risk sharing. In the strategy, the most important role of networks is to schedule new series that the affiliated studios produce. Networks also provide the new series their brand value. On the other hand, the most important role of studios in the vertical integrated environment is to provide the affiliated networks the infrastructures for production and distribution, financial management, and product management. In addition, networks keep the right on the series in the secondary markets, and attempt to increase the aggressive investment on new series on the base of the rights. However, such a risky investment can be the potential burden and risk for the networks in the future. This paper shows the importance of the reasonable risk sharing in the television drama industry to the Korean TV drama industry that has experienced the conflict between networks and independent production companies.