Scribd Logo
Upload

Welcome to Scribd!

  • Palindrome Network PDF

    Uploaded by

    gk_gbu
    13 views6 pages
    Palindrome network

    Original Title

    Palindrome network.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Palindrome network

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    13 views6 pages

    Palindrome Network PDF

    Uploaded by

    gk_gbu
    Palindrome network

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 6
    The Palindrome Network for Fault-Tolerant Interconnection Yuyun Liao, Mi Lu Dept. of Electrical Engineering Texas A&M University Abstract A new interconnection network composed of 3 x 3 ‘switching elements is proposed in this paper. This new network is called Palindrome interconnection network (PIN) with hardware complezity identical to its coun- ferparts, Compared with tis counterparts, our proposed network is fault-tolerant, as totally disjoint paths cx ist in the network between any souree/destination pair. In addition, for a given routing tag in the PIN, all the other equivalent tags which correspond to the same ‘source/destination pair, can be derived easily. Comput ing an equivalent routing tag from a given routing tag requires the change of two bits of routing tag, irrespec~ tive of the network size, suggesting that rerouting logics ‘can be incorporated into the constituent switching ele- ment comfortably without compromising performance The proposed network exhibits higher terminal reliabil- ity than its counterparts. 1 Introduction Many interconnection networks for the multiproces- sor systems and telephone switching systems have been. proposed (I)-9]. The design of a suitable interconnec- tion network has long been recognized as one of the key issues in developing telephone switching networks ‘and multiprocessor systems because the overall system, performance relies heavily upon the employed inter connection network, One popular class of the multi- stage interconnection network (MIN) is composed of 2 x 2 switching elements, including the Indirect Binary Cube (IBC) network [1], the Omega network [2] and the Baseline network (3). The Gamma interconnection network (GIN) [4], the augmented data manipulator (ADM) {5} and the inverse augmented data manipula- tor (ADM) [6] network, belong to the other popular class of MIN composed of 3 x 3 switching elements All of these ate not fault tolerant networks. In recent years much research has been devoted to add some extra stages to achieve fault tolerance for the networks that composed of 2 x 2 switching cle- ments (3}, [8] But for those networks composed of 3 x 3 switching elements, the price of extra stages sometimes is unaffordable. An interesting variation of 0-8186-7689-8/96 $05.00 © 1996 IEEE 556 Nian-Feng Tzeng ‘The Center for Advanced Computer Studies University of Southwestern Louisiana the Gamme network, called the reliable Gamma inter connection network (REGIN), was considered in [7 ‘The REGIN has the same hardware complexity as the Gamma network, but it ean provide multiple paths be- tween every soutce/destination pair. Unfortunately, the REGIN, like the Gamma network, has two ma- jor drawhacks. The first drawback of the REGIN is that it is not fault-tolerant, since the multiple paths between a source/destination pair in such a network are not necessarily disjoint and a certain single internal switching clement failure could make the communica: tion from a source to a destination impossible. The second drawback is that the method for deriving the alternative routing tags is not easy. Another Variation of the Gamma network, called modified Gamma inter connection network (CGIN), was proposed in [9]. The method to derive all possible routing tags for a giv- ‘en source/destination pair in CGIN is very similar to the method employed by Gamma network except some special routing tags which can be derived by changing ‘two bits of a given tag. In light of the drawbacks of the Gamma network, REGIN and CGIN, it is desirable to consider @ new interconnection network which offers fault tolerance without increasing hardware complexity as compared the Gamma network. It is also desirable to find a sim- ple and efficient method for deriving all possible outing tags. This paper introduces such a desirable network, which is fault-tolerant and permits the computation of ‘an alternative routing tag from a given one by simply changing two bits of routing tag for any size. The intzo- duced network is dubbed Palindrome interconnection network (PIN), as its connections are the same when scanned leftward or rightward. Tho previous works are introduced in Section 2. In Section 3, the proposed network and its characteristics are presented. ‘The terminal reliability of the network is described in Seotion 4. Conclusions are given in Sec- tion 6 2 Previous works ‘To compare our proposed network with the Gamma network and REGIN, it is necessary to introduce these two networks first. A size N = 2" Gamma network consists of n+ 1 stages, with each stage involving V switching elements (SE"s) [4]. Every SE in interme- diate stages is a 3 x 3 crossbar, whereas the SE"s in the first stage and last stage are of size 1 x 3 and 3 X 1 respectively. The N sources and destinations are numbered from 0 to N —1, starting with the top one ‘The stages are numbered from 0 to NV rightwards. A Gamma network with size 16 is depicted in Fig. 1 A path from source $ to the destination D in the iS = Figure 1: A Gamma interconnection network with size 16. Gamma network of size N= 2" can be set under the guidance of an n-bit routing tag, which represents the difference (modulo 1) between D and S. Each bit of the routing tag can be 1, 0, or —1 (denoted by T for convenience), and bit i used at stage fina way that the lower (r upper) output port is taken it equals 1 (rT), and the mile output port is taken when fis 0. The Gamma network makes use of the binary ful- ly redundant number system to represent each routing tag T= D~S (mod N). With this number system, the routing tag may have multiple representations (teferred to as equivalent routing tags), corresponding to multiple paths in the Gamma network. ‘The lad- der structure has been used in {4} to derive all possible paths fora given source/destination pai. The number of alternative paths for every tag in a Gamma network vith size 16 (the numberof total inputs or outputs) are given in the second row of Table 1. From this table, we notice that there is only one path for routing tag 0. Fig 2 illustrates a REGIN with size 16. The num- bers of alternative paths for every tag in a REGIN with sine 16 are given in the third row of Table 1. From this table, we notice that it can provide multiple paths be- tween every source/destination pair. But the multiple a ‘Table 1: The number of alternative paths for every tag in a GIN, a REGIN, and a PIN with size 16 Te OT] 23] 415] 7] a sign aaig an_[r[s [a7 ]3 [els [7 [2 [7 [sles 171415 Reon |7(7 {6 (ales |s(a]3[4[s[sle[7[7 [7 wn lo [ole lalelsis(stslslals|alslals paths between a source/destination pair in such a net- work are not necessarily disjoint and a certain single internal switching element failure could make the com- ‘munication from a source to a destination impossible. All possible paths for $= 0 and D = 10 ate highlight- cd in Fig. 2. From this figure, we notice that three paths share @ common internal switching element in stage 3. The method to derive all possible paths for 4 given source/destination pair is very similar to the method employed by Gamma network (7) In the Gamma network or the REGIN, equivalent Figure 2: The REGIN with size 16. All the alternative paths between the (0, 10) pair are highlighted. routing tags bear little resemblance with one another, and for a routing tag, there is no simple way to derive other equivalent routing tags from it. A feasible ap- proach to identify equivalent routing tags quickly for 2 given source/destination pair is through looking up tables, ifa table is kept at each source to store all the possible routing tags. The primary drawback of this approach is that the size of the tables grows rapidly as the network size increases. ‘This drawback makes Gamma network and REGIN impossible to carry out rerouting efficiently, when a blockage (due to conges- tion or failures) is encountered 3 Palindrome networks ‘The Palindrome network of size N (= 2") consists of n +1 stages, constructed by the superimposing of an indirect binary cube (IBC) and an inverse indirect binary cube network, as shown in Fig. 3, where the sol- id (oF dashed) lines illustrate the IBC (or inverse IBC) network. Each stage involves V switching elements, whereas a SE in the first stage is of size 1x3, a switch in the last stage is of size 3x 1, an intermediate stages is of size 3 x 3. SBi in stage j is denoted as SEj,;. The notation of SBi5 ~ SEy ,» is used to indicate a message routed from Sj j to SEy j» It is clear that the Palindrome network has the a switch in the Figure 3: ‘The Palindrome network with size 16. path specified by 0101 is highlighted. same hardware complexity as a compatible Gamma network or REGIN. The connection pattern for Palin- drome networks is defined by three functions, as fol- lows f1(), Ff(8) and fP"(), which specify bow the lower, upper and middie output ports of SE, are con- nected respectively to SE"s in the next stage. f'(i) 54 (12, FG) = 84+ (AP 2-9-4, and (i) = where a = [Es and g = [Le 16 should be noted that the middle output ports ate always con- nected to the middle input ports of next stage, and the lower (or upper) output ports are always connected to the lower (or upper) input ports of next stage. For ex- ample, for SEo,0 (switching element O in stage 0), the "upper output port of SEo, is connected to the upper input port of the switching element & in Stage 1 (since (0) = 8), the middie output port of SEa,o is connect- ad to the middle input port of the switching element 0 in Stage 1 (ince {§%(0) = 0), and the lower output port of SEq. is connected to the lower input port of the switching element 1 in Stage 1 (since f§(0) = 1). 3.1 Routing of the Palindrome networks Let 8 (= q-1iq-2" +8189) and D (= dyadyaa ido) be the source and the destination addresses re- spectively. A routing tag, denoted by 7p, is obtained from the bitwise exclusive-OR of the $ and D, ic, Tp = S@ D, called the primary routing tag. As will be seen shortly, all the other equivalent (alternative) routing tags can be derived easily from Tp, where two routing tags are said equivalent if and only if they both route the message from the same source to the same dest nation. For simplicity, two equivalent routing tags Ti and Ty are represented by T, ~ Tz. In general, a rout- ing tag for the Palindrome network of size N (= 2") is denoted by an n—bit string ty-il,2°--tito, where t; € {T,0,1} for all 0 ~» SEs =~ SEt,.De- Subcase (b): T, (= Veya1---t11) ‘Under routing tag Za, the message reaches destin tion Dj, where +Djaty+ S4(-1)" x2 IfS is even, Do = S +14 Dj -1=S + Dppay. The routing tag 7G specifies the path SEso ~ SBi,413 (219 x2, eens SEiggi st SE tint SE, i) IES is odd, Dy=S-14+55 ay. The routing tag , specifies the path SEs ~ SE,—1. Mn SBpat go SEiges tnt ~ SE, Subcase (¢): Te (= Waza -tiT) ‘Under routing tag Tp, the message reaches destina- tion Dg, where Dy = (“18 2-1 ISP ay (a1 eB, ADIOS S-< N/2, SHO DIP y a 84 TY ‘Under this case the routing tag Tj) specifies the path SE so ~ SEy garni <0 SEiggenng SB gare § i) S> NP, SP 84 Oily Under this case the routing tag 7S) specifies the path Sap ~ SEja-yng ne SByeae-ig~* SE. .-2--tnnt~ SE), pt From the results of Do, Dy and Dj, it is clear that routing tags 7,75 and Tg all route the message from the same source to the same destination, suggesting that Ty ~ T, ~ Tp. From the paths specified by the routing tage To, T and T;, we notice that these pathe have no internal switch in common Case 2: ty + to #0 559) Assume T= thaitnaa-*-tito, 7’ = fotna2°-tilnat (where Z; denotes —t,), the message reaches destination D under routing tag T,, and the message reaches desti- nation D’ under routing tag 7”. Similar to Case 1, it is easy to prove that D equals D’, and the path speck fied by T and the path specified by 7” have no internal switch in common Therefore, in the Palindrome network there are at least two disjoint paths between any source/destination pair. The existence of disjoint paths between any source/destination pair is a necessary and sulficient condition for @ network to tolerate an arbitrary sin- sie fault. Lemma: Let T= that +-temtnm-ttnoma2 tmeitmtmai":* tito, where m” satisfies n/2 > m2 0. Tf trem + tm = 0 Th toa tnem Otnamaa"** tng Olmmt tito), Te thot thomltnemer telnet tyto) and Ty tnt tomb ma" tg Mit tito) are equivar lent routing tags. "The proof of this lemma is similar to the proof of Case 1 for Theorem 1. © Lemma 2: Let T = tna themty-matty=ma2 tmgitntnaa*- fife, where ma sstite n/2 > om > 0. vat + ty #0, T (= tao tnomimtnemat tyto) and Tare equivalent routing tmat ‘The proof of this lemma is si Case 2 for Theorem 1. 0 Lemma 3: Let T = tyattna2"-* tnatyia stato, where n is odd. If Gnasya #0) TY (= tyeitnaa* Tow-tya- tifa) and T are equivalent routing tags. Proof. According to the connecting function, if ‘is odd and t(n1)/2 # 0, links connected to the upper ‘and lower output ports of a switching element at stage (n=1)/2 reach the same switch at stage (n—1)/2+1 ‘We assume that the message reaches destination D un- der routing tag 7, and the message reaches destination Di under routing tag T’. Similar to the proof of Case 1 for Theorem 1, itis easy to prove that D equals D’. Therefore, T~T'. 0 For a given size N (= 2"), there are 3° different routing tag representations, since the tag consists of n bits and each bit can be 1,0, or T, The total number of alternative paths for a given tag (= tn~itn~2° tito) in the Palindrome network is computed by the follow= ing form ear oe san={ 2% x 3¥ x alte-vel nis odd, wee 3 = DH (seta) andy Tiep! (1 pesca) F to the proof of ‘The numbers of alternative paths for every tag in the Palindrome network with size 16 are listed in the ‘Table 1. From this table, we notice that the path dis- tribution over different routing tags is evener than that of the Gamma network and the REGIN. 3.3 The equivalent routing tag calculation From Lemma 1, 2 and 3, we know that the alterna- tive routing tag for the given source/ destination pair can be derived very easily by changing two bits of the given routing tag, irrespective ofthe network size, sug- {gesting that rerouting logics can be incorporated into the constituent switching element comfortably without compromising performance. From source S (= 0000) to destination D (= 0100), for example, Tp = tatatito = S@D =0100, Since ta +o = 0, from Lemma 1, two additional equivalent routing tags 1107, TIO1 can be derived by changing ts and to. For these three routing tags 0100, 1107 and T101, since t2 +4; = 1 (¢ 0), from Lemma 2, other three equivalent routing tags 0070, 101T and TOTI can be derived by changing ¢2 and ty All the alternative paths specified by these six equiva- lent routing tags 0100, 1101, T101, 0070, 10TT and ToT are highlighted in Fig, 4 Compared to the previous proposed schemes deal- Figure 4: The alternative paths between the (0, 4) pair in the Palindrome network with size 16 are highlighted. with this problem in the Gamma network and RE- GIN, our proposed scheme for the Palindrome network is extremely efficient and simple to implement 4 Terminal reliability analysis For the relinbility analysis of the Palindrome net- work, we assume that all switches have the same re- liability P, which is the probability that a switch is working, and that the probability failures are statis tically independent. In this paper, we consider only 560 switch failures, assuming that link failures are includ- td in connected nodes. A closed form expression of the terminal reliability of the Palindrome network is de- rived in this section, indicating significant improvement over the terminal reliabilities of the Gamma network. ‘This lage terminal reliability improvement is mainly due to the fact that disjoint paths are guaranteed be- teen every source/destination pair in the Palindrome network. Our terminal reliability ie derived by exploring two or three sets of equivalent paths such that the paths in one set and those in the other set have no in- ternal switch in common. Now, we consider all the equivalent paths in the Palindrome network that orig- inate from source $ to destination D and assume that T= tains -tito. He tani + to = 0, all the equiv- alent paths can be divided into three sets; let Yo be the collestion ofall these equivalent paths that their tn=ito = 00, Wy be the collection of all these equivalent paths that their t,_1f9 = T1, and Wy be the collection of all these equivalent paths that their t,—ato = 17. If tn-i +to # 0, all the equivalent paths can be divided into two sets let W be the collection ofall these equiva- lent paths that the rst bit and last bit of their routing tags are t,—1 and fo respectively; let ' be the collec- tion ofall these equivalent paths that fist bit and last bit of their routing tags are f and f,—1 respectively, where f denotes —t Next, we consider the paths from 5 to D in a Paline drome network. According to the proof of Theorem 1, Wo, W; and W have no internal switch in common and W and W’ as well. The terminal reliability anal- ysis becomes simpler for the Palindrome network as all the alternative paths can be classed into two or three sets that have no internal switch in common. If toi +lo =O, let terminal reliability due the path in Wo,¥s and Vs be denoted respectively by Ryo, Ry: aud Ry. Terminal reliability due all the pathe in VoUWUW isequal to Rot Ry, + Ry, + Ry, Rey Re, RyRy, ~ Ry Reyy ~ Rey Fe: I tom +la 7 0, let rminal reliability due the paths in W and due the paths in be denoted respectively by Ry and Ry. Ten nal reliability due all the paths in WU" is equal to Res + Ry ~ RoR ‘Surprisingly, for T= taattyan-o-tafo, if ty + themet = 0, where 0

    You might also like