Nf. Tzeng et Gl. Feng, RESOURCE-ALLOCATION IN CUBE NETWORK SYSTEMS BASED ON THE COVERING RADIUS, IEEE transactions on parallel and distributed systems, 7(4), 1996, pp. 328-342
Citations number
18
Categorie Soggetti
System Science","Engineering, Eletrical & Electronic","Computer Science Theory & Methods
When multiple copies of a certain resource exist in a cube network sys
tem, it is desirable that every nonresource node can reach the resourc
e in a given number of hops. In this paper, we introduce systematic ap
proaches to resource allocation in a cube system so that each nonresou
rce node is connected with a specified number of resource copies and t
hat the allocation performance measure of interest is optimized. The m
ethodology used is based on the covering radius results of known codes
. These codes aid in constructing desired linear codes whose codewords
address nodes where resource copies are placed. The resource allocati
on problem is translated to an integer nonlinear program whose best po
ssible solution can be identified quickly by taking advantage of basic
properties derived from the known codes, yielding an optimal or near-
optimal allocation result. Those basic properties lead to drastic time
complexity reduction (up to several orders of magnitude smaller), in
particular for large system sizes. Our approaches are applicable to an
y cube size, often arriving at more efficient allocation outcomes than
what are attainable using prior schemes.