The method is proposed for building a fault-tolerant system area network (SAN) as a flat network comprised of several copies of the source network. This flat network is based on a theory of balanced incomplete block designs (BIBD).

A balanced incomplete block design (BIBD) is instrumental in design of experiments. This is usually constructed by algebraic methods such as finite algebra or difference sets. However, in algebraic approaches, no unified method exists, and each BIBD has been constructed in some ad hoc ways. On the other hand, computer-based methods apply the same algorithm to all BIBDs; hence, these are unified...

Given a design V, other designs can be constructed by using unions of various sets of blocks as new blocks. This method of constructing designs is referred to as "the union method". In general, the constructed design has neither constant blocksize nor balance properties. Various situations in which balanced incomplete block designs (BIBD's) and group divisible designs (GDD's) can be constructed...

UNLABELLED Boid inclusion body disease (BIDB) is a fatal disease of boid snakes, the etiology of which has only recently been revealed following the identification of several novel arenaviruses in diseased snakes. BIBD-associated arenaviruses (BIBDAV) are genetically divergent from the classical Old and New World arenaviruses and also differ substantially from each other. Even though there is c...

TraceabilityCodes are CombinatorialObjects introduced by Chor, Fiat and Naor in 1994[7] to be used traitor tracing protect Digital Content. Frameproof Codes were given byBoneh Shaw 1994 prevent privacy gave the idea of c-secure codes withέ-error. Traceable is a strong form Codes. Balanced Incomplete Block Design frameproof arealready available literature [4]. Here this paper we will define how ...

A graph G with vertex set V is said to be n-existentially closed if, for every S ⊂ V with |S| = n and every T ⊆ S, there exists a vertex x ∈ V − S such that x is adjacent to each vertex of T but is adjacent to no vertex of S − T . Given a combinatorial design D with block set B, its block-intersection graph GD is the graph having vertex set B such that two vertices b1 and b2 are adjacent if and...

Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...