• Title/Summary/Keyword: Network diameter

Search Result 286, Processing Time 0.029 seconds

A Searching Algorithm for Shortest Path in RCR Network (RCR 네트워크에서 최단경로를 위한 탐색 알고리즘)

  • Kim, Seong-Yeol
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.5
    • /
    • pp.444-448
    • /
    • 2010
  • RCR network[1] is a topology for interconnection networks having many desirable properties for building scalable parallel machines. This had been analyzed by Hu and Cao[2] to deal with problems of disconnected graph, bisection width and diameter. We analyze some properties of RCR again and revise the condition for connected graph and network diameter. And we present an efficient algorithm for finding next node on a shortest path.

Hydraulic Analysis and Sizing of Inlet-Pipe Diameter for the Water Distribution Network (상수급수관 인입관경 제안 및 수리해석)

  • Shin, Sung-kyo;Kim, Eun-ju;Choi, Si-Hwan
    • Journal of Environmental Science International
    • /
    • v.31 no.1
    • /
    • pp.33-42
    • /
    • 2022
  • The objective of this study is to determine the appropriate size of the inlet pipe diameter and thereby conduct hydraulic analysis for the Korean water distribution network. To this end, the data tables for equivalent pipe diameters and outflow rates presently employed in Korea were adopted. By incorporating the table of equivalent pipe diameters, it was found that the size of the inlet pipe diameter was overestimated, which can cause shortage of water pressure and malfunctioning or insufficiency of outflow rate in the corresponding adjacent region. However, by conducting hydraulic analysis based on the table of outflow rates, relatively reasonable flow rates were observed. Furthermore, by comparing the real demand-driven analysis (RDDA) approach and demand-driven analysis (DDA) approach toward managing the huge water demand, it was observed that DDA could not effectively respond to real hourly usage conditions, whereas RDDA (which reflects the hourly effects of inlet pipe diameter and storage tanks) demonstrated results similar to that of real water supply.

The network analysis for school health program (학교 보건사업 협력 네트워크 분석)

  • Bae, Sang Soo
    • Korean Journal of Health Education and Promotion
    • /
    • v.33 no.3
    • /
    • pp.1-11
    • /
    • 2016
  • Objectives: The challenging issue of public health program is to strengthen partnership and network between health resources. This study identified the structure and characteristics of school health program network. Methods: In this paper we collected data from schools and organizations in 4 local communities in 2014 that participated to school health program. Using social network analysis techniques we measured the number of component, diameter, density, average degree, node centralization for each network. Results: We determined that networks shared some common organizational structure such as less density, low average degree, and short diameter. Networks were dominated by the health center, and directions of collaborations between nodes were mostly one-way. Conclusions: These findings can help to depict the network of school health program. The further research is necessary to define causal relationship between network effectiveness and public health outcomes.

Prediction of flow boiling heat transfer coefficient in horizontal channels varying from conventional to small-diameter scales by genetic neural network

  • Zhang, Jing;Ma, Yichao;Wang, Mingjun;Zhang, Dalin;Qiu, Suizheng;Tian, Wenxi;Su, Guanghui
    • Nuclear Engineering and Technology
    • /
    • v.51 no.8
    • /
    • pp.1897-1904
    • /
    • 2019
  • Three-layer back propagation network (BPN) and genetic neural network (GNN) were developed in this study to predict the flow boiling heat transfer coefficient (HTC) in conventional and small-diameter channels. The GNN has higher precision than BPN (with root mean square errors of 17.16% and 20.50%, respectively) and other correlations. The inputs include vapor quality x, mass flux G, heat flux q, diameter D and physical parameter φ, and the predicted flow boiling HTC is set as the outputs. Influences of input parameters on the flow boiling HTC are discussed based on the trained GNN: nucleate boiling promoted by a larger saturated pressure, a larger heat flux and a smaller diameter is dominant in small channels; convective boiling improved by a larger mass flux and a larger vapor quality is more significant in conventional channels. The HTC increases with pressure both in conventional and small channels. The HTC in conventional channels rises when mass flux increases but remains almost unaffected in small channels. A larger heat flux leads to the HTC growth in small channels and an increase of HTC was observed in conventional channels at a higher vapor quality. HTC increases inversely with diameter before dry out.

The design of interconnection network using inorder traversal on Fibonacci tree (피보나치 트리에서 중위순회를 이용한 상호연결망 설계)

  • 김현주;김용석
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.59-62
    • /
    • 2000
  • In this paper, We propose the new interconnection network which is designed to edge numbering method using inorder traversal a Fibonacci trees and its jump sequence is Fibonacci numbers. It has a simple (shortest path)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube on interconnection network measrtes.

  • PDF

Petersen-Torus(PT) Network for Multicomputing System (멀티컴퓨팅 시스템을 위한 피터슨-토러스(PT) 네트워크)

  • Seo, Jung-Hyun;Lee, Hyeong-Ok;Jang, Moon-Suk
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.6
    • /
    • pp.263-272
    • /
    • 2008
  • We propose and analyze a new interconnection network, called petersen-torus(PT) network based on well-known petersen graph. PT network has a smaller diameter and a smaller network cost than honeycomb torus with same number of nodes. In this paper, we propose optimal routing algorithm and hamiltonian cycle algorithm. We derive diameter, network cost and bisection width.

Fault Diameter and Fault Tolerance of Gray Cube (그레이 큐브의 고장 지름(Fault Diameter)과 고장 허용도(Fault Tolerance))

  • Lee, Hyeong-Ok;Joo, Nak-Keun;Lim, Hyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.8
    • /
    • pp.1930-1939
    • /
    • 1997
  • In this paper, we analyze the fault diameter and fault tolerance of Gray cube proposed recently in [12]. fault diameter of an interconnection network is one of the important network measures concerning the distance between nodes when some nodes fail. It is showed that fault diameter of n-dimensional Gray cube having $2^n$ nodes is [(n+1)/2]+2, ($n{\ge}3$). It means the increment of the longest distance between nodes under node-failure is only constant factor. Comparing the result with the fault diameter of well-known hypercube, the longest routing distance of a message in a Gray cube under node-failure is about the half of that hypercube.

  • PDF

IDENTITY-BASED AAA AUTHENTICATION PROTOCOL

  • Kim Dong-myung;Cho Young-bok;Lee Dong-heui;Lee Sang-ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.678-682
    • /
    • 2005
  • IETF suggested AAA for safe and reliable user authentication on various network and protocol caused by development in internet and increase in users. Diameter standard authentication system does not provide mutual authentication and non-repudiation. AAA authentication system using public key was suggested to supplement such Diameter authentication but application in mobile service control nodes is difficult due to overhead of communication and arithmetic. ID based AAA authentication system was suggested to overcome such weak point but it still has the weak point against collusion attack or forgery attack. In this thesis, new ID based AAA authentication system is suggested which is safe against collusion attack and forgery attack and reduces arithmetic quantity of mobile nodes with insufficient arithmetic and power performance. In this thesis, cryptological safety and arithmetical efficiency is tested to test the suggested system through comparison and assessment of current systems. Suggested system uses two random numbers to provide stability at authentication of mobile nodes. Also, in terms of power, it provides the advantage of seamless service by reducing authentication executing time by the performance of server through improving efficiency with reduced arithmetic at nodes.

  • PDF

Mapping of QoS Information Elements and Implementation of Rs/Rw Interface Resource Control Protocols in NGN (NGN에서의 QoS 정보요소 매핑 및 Rs/Rw 인터페이스의 자원제어 프로토콜 구현)

  • Jeon, Jin-Su;Kim, Hae-Hyun;Cha, Young-Wook;Kim, Choon-Hee;Jeong, You-Hyeon
    • The KIPS Transactions:PartC
    • /
    • v.15C no.5
    • /
    • pp.429-438
    • /
    • 2008
  • NGN is a packet-based converged network to support session and non-session services in QoS-enabled broadband transport network. QoS based resource control must be defined to support differentiated services for various network users in NGN. We designed and implemented DIAMETER protocol as the Rs interface, and also defined mapping rules between DIAMETER information elements and SDP(Session Description Protocol) attributes for QoS based resource control in NGN. We selected and implemented DIAMETER protocol among alternate resource control protocols in ITU-T as the Rw interface because of simple interworking method with Rs interface and adequate AAA functionality. We defined mapping rules of messages and information elements between Rs and Rw interfaces for resource control from a service layer to a transport layer. Based on the mapping rule of QoS information elements and the interworking method between Rs and Rw interfaces, we built up a test-bed that support differentiated delivery services.

Diameter, Fault Diameter and Average Distance between Two Nodes in Z-cube Network (Z-cube 네트워크의 직경, 고장직경과 정점간 평균거리)

  • Gwon, Gyeong-Hui;Lee, Gye-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.75-83
    • /
    • 1999
  • recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.

  • PDF