Lin, “Maximum safety-path matrices based fault-tolerant routing for hypercube multi-com-puters,” Journal of Software, Vol. Kutten, et al., “Perfectly secure key distribution for dynamic conferences,” in Advances in Cryptology-CRYPTO’92, LNCS, 740, pp. Li, “Establishing pairwise keys in distributed sensor networks,” ACM Journal Name, Vol. Song, “Random key predis-tribution schemes for sensor networks,” in IEEE Sypo-sium on Research in Security and Privacy, pp. Gligor, “A key-management scheme for distributed sensor networks,” in proceedings of the 9th ACM Conference on Computer and Commu-nication Security, pp. We evaluate their throughput using simulations, and compare it to that of the priority scheme.L. A new adaptive importance sampling scheme for reliability cal. There are links between nodes whose representations differ in one bit. Latin hypercube sampling (LHS) is generalized in terms of a spectrum of. DESCRIPTION OF THE HYPERCUBE NODE MODEL AND THE ROUTING SCHEMES Each node of an N 2d-node hypercube is represented by a unique d-bit binary string 8d-s182 ··. Despite its small di- ameter, high connectivity, simple routing scheme, and fault tolerance, the hypercube is not used in the most recent MPC projects. We also consider two deflection routing schemes, called the simple nonwasting deflection and the priority nonwasting deflection schemes. Description of the Hypercube Node Model and the Routing Schemes 2. We find that little buffer space (between one and three packets per link) is necessary to achieve throughput close to that of the infinite buffer case. The results obtained are approximate, but very accurate as simulations indicate, and are given in particularly interesting forms. We evaluate the throughput of both the unbuffered and the buffered version of these schemes for random multiple node-to-node communications. We evaluate their throughput using simulations, and compare it to that of the priority scheme.ĪB - We consider two different hypercube routing schemes, which we call the simple and the priority schemes. We also consider two deflection routing schemes, called the simple nonwasting deflection and the priority nonwasting deflection schemes. N2 - We consider two different hypercube routing schemes, which we call the simple and the priority schemes. Bertsekas is with the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139 USA. Each node is assigned a number ranging from 0 to n-1. The goal is to reach all nodes within log(n) time, and reduce the maximum of sent messages for each node to log(n). We then proceed to show an adaptation for the general case. Varvarigos is with the Department of Electrical and Computer Engineering, University of Califomia, Santa Barbara, CA 93106 USA. In addition to providing a cost-effective and reliable sampling scheme, the Latin hypercube sampling technique also provides the user with the flexibility. Hypercube scheme First we handle the case where the number of nodes n is a even power of 2.
#Hypercube scheme free#
However, they may remain at some node even if there is a free link that they want to use. In both schemes, packets follow shortest paths to their destinations. In this paper we propose two new routing schemes for hypercube networks, which we call the simple and the priority routing schemes. This work was supported by the NSF under Grants NSF-DDM-8903385 and NSF-RIA-08930554, and by the ARO under Grants DAAL03-86-K-0171 and DAAL03-92-G-0309. of the hypercube scheme, without using approximations. Manuscript received Decemrevised Septemapproved by IEEWACM TRANSACTIONSO N NETWORKINEGdi tor I. T1 - Performance of Hypercube Routing Schemes With or Without Buffering
0 kommentar(er)
