• Title/Summary/Keyword: Tree-Based Network

Search Result 630, Processing Time 0.034 seconds

Group Key Management using (2,4)-Tree ((2,4)-트리를 이용한 그룹키 관리)

  • 조태남;이상호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.4
    • /
    • pp.77-89
    • /
    • 2001
  • Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.

Efficient Multicast Routing on BCube-Based Data Centers

  • Xie, Junjie;Guo, Deke;Xu, Jia;Luo, Lailong;Teng, Xiaoqiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4343-4355
    • /
    • 2014
  • Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD(Hamming Distance)-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

Forecasting Sow's Productivity using the Machine Learning Models (머신러닝을 활용한 모돈의 생산성 예측모델)

  • Lee, Min-Soo;Choe, Young-Chan
    • Journal of Agricultural Extension & Community Development
    • /
    • v.16 no.4
    • /
    • pp.939-965
    • /
    • 2009
  • The Machine Learning has been identified as a promising approach to knowledge-based system development. This study aims to examine the ability of machine learning techniques for farmer's decision making and to develop the reference model for using pig farm data. We compared five machine learning techniques: logistic regression, decision tree, artificial neural network, k-nearest neighbor, and ensemble. All models are well performed to predict the sow's productivity in all parity, showing over 87.6% predictability. The model predictability of total litter size are highest at 91.3% in third parity and decreasing as parity increases. The ensemble is well performed to predict the sow's productivity. The neural network and logistic regression is excellent classifier for all parity. The decision tree and the k-nearest neighbor was not good classifier for all parity. Performance of models varies over models used, showing up to 104% difference in lift values. Artificial Neural network and ensemble models have resulted in highest lift values implying best performance among models.

  • PDF

Dynamic Caching Routing Strategy for LEO Satellite Nodes Based on Gradient Boosting Regression Tree

  • Yang Yang;Shengbo Hu;Guiju Lu
    • Journal of Information Processing Systems
    • /
    • v.20 no.1
    • /
    • pp.131-147
    • /
    • 2024
  • A routing strategy based on traffic prediction and dynamic cache allocation for satellite nodes is proposed to address the issues of high propagation delay and overall delay of inter-satellite and satellite-to-ground links in low Earth orbit (LEO) satellite systems. The spatial and temporal correlations of satellite network traffic were analyzed, and the relevant traffic through the target satellite was extracted as raw input for traffic prediction. An improved gradient boosting regression tree algorithm was used for traffic prediction. Based on the traffic prediction results, a dynamic cache allocation routing strategy is proposed. The satellite nodes periodically monitor the traffic load on inter-satellite links (ISLs) and dynamically allocate cache resources for each ISL with neighboring nodes. Simulation results demonstrate that the proposed routing strategy effectively reduces packet loss rate and average end-to-end delay and improves the distribution of services across the entire network.

A Network-based Indexing Method for Trajectories of Moving Objects on Roads (도로 위에 존재하는 이동객체의 궤적에 대한 네트워크 기반의 색인 방법)

  • Kim, Kyoung-Sook;Li, Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.879-888
    • /
    • 2006
  • Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

A Robust And-Or Tree-based LT Encoded Symbol Packetization Algorithm for Video Streaming over Wireless Network (무선 네트워크 환경에서 효과적인 영상 스트리밍을 위한 And-Or 트리 기반의 LT 부호화 심볼 패킷화 알고리즘)

  • Lee, Dong-Ju;Kim, Wan;Yang, Yeon-Mo;Song, Hwang-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9A
    • /
    • pp.749-757
    • /
    • 2011
  • In this paper, we propose a robust And-Or tree-based Luby transform encoded symbol packetization algorithm to minimize the quality degradation of video streaming service caused by packet losses over wireless network. To achieve this goal, the relationship among Luby transform encoded symbols are analyzed by using And-Or tree, and the proposed packetization algorithm is designed to minimize packet loss effects by reducing the dependency among packets conveying Luby transform encoded symbols. Finally, experimental results are provided to show the performance of the proposed algorithm.

Automatic Detection of Dead Trees Based on Lightweight YOLOv4 and UAV Imagery

  • Yuanhang Jin;Maolin Xu;Jiayuan Zheng
    • Journal of Information Processing Systems
    • /
    • v.19 no.5
    • /
    • pp.614-630
    • /
    • 2023
  • Dead trees significantly impact forest production and the ecological environment and pose constraints to the sustainable development of forests. A lightweight YOLOv4 dead tree detection algorithm based on unmanned aerial vehicle images is proposed to address current limitations in dead tree detection that rely mainly on inefficient, unsafe and easy-to-miss manual inspections. An improved logarithmic transformation method was developed in data pre-processing to display tree features in the shadows. For the model structure, the original CSPDarkNet-53 backbone feature extraction network was replaced by MobileNetV3. Some of the standard convolutional blocks in the original extraction network were replaced by depthwise separable convolution blocks. The new ReLU6 activation function replaced the original LeakyReLU activation function to make the network more robust for low-precision computations. The K-means++ clustering method was also integrated to generate anchor boxes that are more suitable for the dataset. The experimental results show that the improved algorithm achieved an accuracy of 97.33%, higher than other methods. The detection speed of the proposed approach is higher than that of YOLOv4, improving the efficiency and accuracy of the detection process.

Reliability analysis of nuclear safety-class DCS based on T-S fuzzy fault tree and Bayesian network

  • Xu Zhang;Zhiguang Deng;Yifan Jian;Qichang Huang;Hao Peng;Quan Ma
    • Nuclear Engineering and Technology
    • /
    • v.55 no.5
    • /
    • pp.1901-1910
    • /
    • 2023
  • The safety-class (1E) digital control system (DCS) of nuclear power plant characterized structural multiple redundancies, therefore, it is important to quantitatively evaluate the reliability of DCS in different degree of backup loss. In this paper, a reliability evaluation model based on T-S fuzzy fault tree (FT) is proposed for 1E DCS of nuclear power plant, in which the connection relationship between components is described by T-S fuzzy gates. Specifically, an output rejection control system is chosen as an example, based on the T-S fuzzy FT model, the key indicators such as probabilistic importance are calculated, and for a further discussion, the T-S fuzzy FT model is transformed into Bayesian Network(BN) equivalently, and the fault diagnosis based on probabilistic analysis is accomplished. Combined with the analysis of actual objects, the effectiveness of proposed method is proved.

An Algorithm based on Evolutionary Computation for a Highly Reliable Network Design (높은 신뢰도의 네트워크 설계를 위한 진화 연산에 기초한 알고리즘)

  • Kim Jong-Ryul;Lee Jae-Uk;Gen Mituso
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.4
    • /
    • pp.247-257
    • /
    • 2005
  • Generally, the network topology design problem is characterized as a kind of NP-hard combinatorial optimization problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented network size. In this paper, we propose the efficient approach with two phase that is comprised of evolutionary computation approach based on Prufer number(PN), which can efficiently represent the spanning tree, and a heuristic method considering 2-connectivity, to solve the highly reliable network topology design problem minimizing the construction cost subject to network reliability: firstly, to find the spanning tree, genetic algorithm that is the most widely known type of evolutionary computation approach, is used; secondly, a heuristic method is employed, in order to search the optimal network topology based on the spanning tree obtained in the first Phase, considering 2-connectivity. Lastly, the performance of our approach is provided from the results of numerical examples.

Implementation of Bio-Signals Transmission and Storage System Using ZigBee Sensor Network (ZigBee 센서 네트워크를 이용한 생체신호 전송 및 저장 시스템의 구현)

  • Kim, Young-Joon;Lee, In-Sung
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.131-132
    • /
    • 2007
  • In this paper, we designed and implemented bio-signals transmission and storage system using wireless sensor network based on ZigBee. Wireless sensor network is organized with routing protocol based on tree structure. The data is transmitted to monitoring system based on SIP. ZigBee will be used as various combinations with other wireless network technologies for application purposes.

  • PDF