Premium
Fault tolerant on‐board networks with priorities
Author(s) -
Bermond J.C.,
Havet F.,
Tóth C.D.
Publication year - 2006
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20094
Subject(s) - disjoint sets , amplifier , function (biology) , quality of service , computer science , quality (philosophy) , fault tolerance , set (abstract data type) , fault (geology) , topology (electrical circuits) , mathematics , discrete mathematics , combinatorics , computer network , distributed computing , physics , bandwidth (computing) , quantum mechanics , evolutionary biology , seismology , biology , programming language , geology
We consider on‐board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches, each of which has four available links. The paths connecting inputs to outputs should be link‐disjoint. Some of the input signals, called priorities, must be connected to the amplifiers that provide the best quality of service (that is, to some specific outputs). In practice, amplifiers are prone to fail, and the faults cannot be repaired. Therefore, extra outputs have to be built into the network to ensure that every input can be routed to operational outputs. Given three integers, n , p , and f , we would like to design a low‐cost network (where the network cost is proportional to the total number of switches) such that it is possible to route all n inputs to n operational amplifiers, and to route the p priorities to the p best quality amplifiers for any set of f faulty and p best‐quality amplifiers. Let R ( n, p, f ) be the minimum number of switches of such a network. We prove here that $R(n,p,f)\leq{{n+f}\over{2}}\lceil\log_2p\rceil+{{5}\over{2}}(n-p)+g(f)$ with g a function depending only on f . We then compute R ( n, p, f ) exactly for a few small values of p and f . © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 9–25 2006