On Resources Allocation in Binary n-Cube Network Systems

Abstract

We introduce systematic approaches to resource allocation in a cube system so that each non resource node is connected with one resource copy and that the allocation performance measure of interest is optimized.

Keywords

RESOURCE MANAGEMENT
LINEAR CODE
BLOCK CODES
PARITY CHECK CODES
HYPERCUBES
PARALLEL PROCESSING
INTELLIGENT NETWORKS
COMPUTER NETWORKS
CONCURRENT COMPUTING
BINARY SEQUENCES

This publication has 4 references indexed in Scilit:

Resource Allocation in Hypercube Systems
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
On Resources Allocation in Binary n-Cube Network Systems
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1993
Short codes with a given covering radius
IEEE Transactions on Information Theory, 1989
Covering radius---Survey and recent results
IEEE Transactions on Information Theory, 1985