Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors
|
|
- Derick White
- 6 years ago
- Views:
Transcription
1 Optmal Fault-Tolerant Routng n Hypercubes Usng Extended Safety Vectors Je Wu Department of Computer Scence and Engneerng Florda Atlantc Unversty Boca Raton, FL 3343 Feng Gao, Zhongcheng L, and Ynghua Mn Center for Fault-Tolerant Computng, CAD Lab Insttute of Computng Technology, Chnese Academy of Scences Bejng, P.R. Chna Abstract Relable communcaton n cube-based multcomputers usng the extended safety vector concept s studed n ths paper. In our approach, each node n a cube-based multcomputer of dmenson n s assocated wth an extended safety vector of n bts, whch s an approxmated measure of the number and dstrbuton of faults n the neghborhood. In the extended safety vector model, each node knows fault nformaton wthn dstance- and fault nformaton outsde dstance- s coded n a specal way based on the coded nformaton of ts neghbors. The extended safety vector of each node can be easly calculated through n, rounds of nformaton exchanges among neghborng nodes. Optmal uncastng between two nodes s guaranteed f the kth bt of the safety vector of the source node s one, where k s the Hammng dstance between the source and destnaton nodes. In addton, the extended safety vector can be used as a navgaton tool to drect a message to ts destnaton through a mnmal path. Smulaton results show a sgnfcant mprovement n terms of optmal routng capablty n a hypercube wth faulty lnks usng the proposed model, compared wth the one usng the orgnal safety vector model.. Introducton Many recent expermental and commercal multcomputers use drect-connected networks wth the grd topology. The bnary hypercube [8] s one of the popular grd structures. Several research prototypes and systems have been bult n the past two decades, ncludng NCUBE-, In- Ths work was supported n part by NSFC of P. R. Chna under grant No and by NSF grant CCR tel PSC, and the Connecton Machne. The more recently bult SGI Orgn 000 uses a varaton of the hypercube topologes. Effcent nterprocessor communcaton s a key to the performance of a multcomputer. Uncastng s a one-toone communcaton between two nodes, one s called the source node and the other the destnaton node. Wth the rapd progress n VLSI and hardware technologes, the sze of computer systems has ncreased tremendously and the probablty of processor falure has also ncreased. As a result, buldng a relable multcomputer has become one of the central ssues, especally n the communcaton subsystem whch handles all nterprocessor communcatons. Among dfferent routng (uncast) schemes, the classcal e-cube routng s smple to mplement and provdes hgh throughput for unform traffc; however, t cannot handle even smple node or lnk faults due to ts nonadaptve routng. Adaptve and fault-tolerant routng protocols have been the subject of extensve research n recent years ([3], [4], [7]). A general theory of fault-tolerant routng s dscussed n []. Lmted-global-nformaton-based routng s a compromse between local-nformaton-based and globalnformaton-based approaches. A routng algorthm of ths type normally obtans an optmal or suboptmal soluton and requres a relatvely smple process to collect and mantan fault nformaton n the neghborhood (such nformaton s called lmted global nformaton). Therefore, an approach of ths type can be more cost effectve than the ones based on global nformaton [9] or local nformaton ([], [5]). One smple but neffectve approach s to use dstance-k nformaton n whch each node knows the status of all components wthn Hammng-dstance-k (or smple dstancek). However, optmalty cannot be guaranteed, as a routng process could possbly go to ether a state where all mn-
2 mal paths are blocked by faulty components or a dead end where backtrackng s requred. In addton, each node has to mantan a relatvely large table contanng dstance-k nformaton. Another approach s based on the coded fault nformaton, where each node has the exact nformaton of adjacent nodes and nformaton of other nodes are coded n a specal way. Then an optmal/suboptmal routng algorthm s proposed based on the coded nformaton assocated wth each node. The followng s a summary of dfferent codng methods n an n-cube, all of them are prmarly desgned to cover node faults. Lee and Hayes [6] safe and unsafe node concept. A nonfaulty node s unsafe f and only f there are at least two unsafe or faulty neghbors. Therefore, each node s labeled (coded) faulty, unsafe, or safe. Wu and Fernandez [] extended safe node concept by relaxng certan condtons of Lee and Hayes defnton. Each node s stll labeled faulty, unsafe, or safe. However, a dfferent defnton s gven: A nonfaulty node s unsafe f and only f there are two faulty neghbors or there are at least three unsafe or faulty neghbors. Wu s safety level [] concept where each node s assgned wth a safety level k, 0 k n. A node wth a safety level k = n s called safe and a faulty node s assgned wth the lowest level 0. Therefore, there are n +possble labels for a node n the safety level model. Wu s safety vector [0] concept where each node s assocated wth a bnary vector. The bt value of the kth bt corresponds to the routng capablty to nodes that are dstance-k away. The safety vector s a refnement of the safety level model. The effectveness of a codng method s measured by the followng: () How fast fault nformaton can be collected (coded) at each node. () How accurate the coded fault nformaton representng the real fault dstrbuton n terms of optmal routng capablty. Both safe/unsafe and extended safe/unsafe models requre O(n ) rounds of nformaton exchanges n an n-cube to label (code) all the nodes. Both safety level and safety vector need only O(n) rounds of nformaton exchanges. The order, n terms of accurately representng fault nformaton, s the followng: safe/unsafe, extended safe/unsafe, safety level, and safety vector. The safety vector s the latest model that has a mert of smplcty and wde-range of fault coverage. However, ths model s stll relatvely neffcent n handlng of lnk faults. Bascally, a lnk fault s consdered by other nodes as node fault(s) by treatng two end nodes of the lnk faulty. Each end node of a faulty lnk treats the other one faulty, but t does not consder tself faulty. Ths overly conservatve approach generates many faulty nodes that severely dmnshes the routng capablty of the system. In ths paper, we propose a new codng methodology. It s assumed that each node has precse nformaton of fault dstrbuton wthn a gven dstance d. Fault nformaton outsde dstance d s coded, lke the one used n safety vector. We select d =as an example and the correspondng model s called extended safety vector. Smulaton results show a sgnfcant mprovement usng the proposed model n terms of optmal routng capablty n a hypercube wth faulty lnks, compared wth the one usng the orgnal safety vector model. We also show that the selecton of d =s a rght one and ts results stay very close to the one usng global fault nformaton,.e., d = n.. Prelmnares Hypercubes. An n-cube (Q n ) s a graph havng n nodes labeled from 0 to n,. Two nodes are joned by a lnk f ther addresses, as bnary numbers, dffer n exactly one bt poston. More specfcally, every node u has an address u(n)u(n, ) u() wth u() f0,g, n, and u() s called the th bt (dmenson) of the address. We denote node u () the neghbor of u along dmenson. u () s calculated by settng or resettng the th bt of u. For example, 0 (3) = 00. Ths notaton can be used to set or reset the th bt of any bnary strng. A faulty n-cube ncludes faulty nodes and/or lnks. A faulty n-cube may or may not be connected dependng on the number and locaton of faults. A path connectng two nodes s and d s called a mnmal path (also called a Hammng dstance path) f ts length s equal to the Hammng dstance between these two nodes. An optmal (or mnmal) routng s one whch always generates a mnmal path. In general, optmal routng has a broader meanng whch always generates a shortest path, not necessarly a mnmal one, among the avalable ones. It s possble that all mnmal paths are blocked by faults. In ths case, a shortest (avalable) path s not a mnmal one. In ths paper, the above stuaton wll never occur and we use the terms shortest and mnmal nterchangeably. The dstance between two nodes s and d s equal to the Hammng dstance between ther bnary addresses, denoted by H(s; d). Symbol denotes the btwse exclusve OR operaton on bnary addresses of two nodes. Clearly, s d has value at H(s; d) bt postons correspondng to H(s; d) dstnct dmensons. These H(s; d) dmensons are called preferred dmensons and the correspondng nodes are termed preferred neghbors. The remanng n, H(s; d) dmensons are called spare dmensons and the correspondng nodes are spare neghbors. A mnmal path can be ob-
3 taned by usng lnks at each of these H(s; d) preferred dmensons n some order. Safety Level and Safety Vector. Let us frst revew the concepts of safety level and safety vector. Safety level and safety vector are scalar and vector numbers assocated wth each node n a gven n-cube, respectvely. They provde coded nformaton about fault nformaton n the neghborhood. Defnton []: The safety level of a faulty node s 0. For a nonfaulty node u, let(sl 0 ;sl ;sl ; :::; sl n,), 0 sl n, be the nondescendng safety level sequence of node u s n neghborng nodes n an n-cube, such that sl sl +, 0 <n,. The safety level of node u, sl(u), s defned as: f (sl 0 ;sl ;sl ; :::; sl n,) (0; ; ; :::; n, ),then sl(u) =n,elsef(sl 0 ;sl ;sl ; :::; sl k,) (0; ; ; :::; k, ) ^ (sl k = k, ) then sl(u) =k. In the above defnton, t s assumed that all faults are node faults. To extend ths defnton to cover lnk faults, both end nodes of a faulty lnk have to be assgned a safety level of 0 n order to be consstent wth the orgnal safety level defnton. The safety vector concept s a refnement of the safety level concept by provdng routng capablty to destnatons at dfferent dstances. More specfcally, each node u n an n-cube s assgned wth a safety vector sv(u) =(u ;u ; :::; u n ). Defnton [0]: The safety vector of a faulty node s (0; 0; :::; 0). If node u s an end node of a faulty lnk, the other end node wll be regstered wth a safety vector of (0; 0; :::; 0) at node u. Base for the frst bt: ( 0 f node u s an end-node of a faulty lnk u = otherwse Inductve defnton for the kth bt: u k = 8 < P : 0 f u n otherwse () k, n, k In the safety level (vector) model, a node n an n-cube s sad to be safe f ts safety level s n ((; ; :::; )); otherwse, t s unsafe. Two propertes related to safety levels and safety vectors are as follows: Property : If the safety level of a node s k (0 <kn), then there s at least one Hammng dstance path from ths node to any node wthn dstance-k. Property : Assume that (u ;u ; :::; u n ) s the safety vector assocated wth node u n a faulty n-cube. If u k =then seq seq f and only f each element n seq s larger than or equal to the correspondng element n seq. (0,,0) 0 0 (0,0,0) 00 (0,0,0) 0 (,0,) 00 (,0,) (0,0,0) (,0,0) 000 (0,0,0) Fgure. An example of a faulty 3-cube wth ts safety level and safety vector assgnments. there exsts at least one Hammng dstance path from node u to any node that s exactly dstance-k away. Based on the above two propertes, t s clear that a safe node n both models can reach any destnaton node (whch s wthn Hammng dstance n, the dameter of the cube) through a mnmal path. The safety vector model s an mprovement based on the safety level model. It can provde more and accurate nformaton about the number and dstrbuton of faults n an n-cube. However, the safety vector concept stll cannot effectvely present faulty lnk nformaton. Actually, t s not clear that an effcent codng method exsts under the assumpton that each node has only neghbor nformaton. Fg. shows an example of a 3-cube wth one faulty node and two faulty lnks. In ths example, the safety level of each node s ether 0 or,.e., a source node can only send a message to ts neghbors. Clearly, by nspecton, the safety level nformaton s not accurate. For example, nodes 0, 0, and can send a message to any nodes through a mnmal path that are dstance- or -3 away. Ths problem s partally resolved n the safety vector model, where the safety vectors assocated wth nodes 0 and are (0,,0) and (,0,), respectvely. Nodes 00, 00, and 0 stll have the lowest safety level (0,0,0). The reason that node 0 has a 0-bt at the nd bt of ts safety vector s that t has two neghbors 00 and 00 wth both 0-bt as the st bt of ther safety vectors. However, the two correspondng faulty lnks (00, 0) and (0, 00) do not span on the same dmenson, and hence, these two faulty nodes wll not block all the mnmal paths ntated from node 0 to a node that s dstance- away. Based on the above analyss, the drecton of each fault (especally lnk fault) s needed to provde accurate nformaton about fault dstrbuton. However, ths approach wll dramatcally ncrease the memory space requrement and the codng complexty. A compromse s therefore needed. 00 0
4 3. Extended Safety Vectors Proposed Model. In ths secton, we propose a new approach to code fault nformaton. In general, a good codng method s generated on the soundness of ts base. In all exstng approaches, the base s based on neghbor nformaton only. For both safety level and safety vector models, the above method s proved to be effectve for node faults, but not for lnk faults. Our approach here conssts of the followng two steps (see Fg. ):. Each node knows the exact fault nformaton wthn dstance-d.. Fault nformaton about nodes that are outsde dstance-d s coded n a specal way. In ths paper, we show an applcaton of the proposed model on d = ; that s, each node knows fault nformaton wthn dstance-. Informaton about faults that are more than dstance- away are coded. We show that d = s suffcent to handle lnk faults and there s no need to select a large d (ths wll be confrmed by our smulaton results later). Ths model s called extended safety vector, where the frst two bts of an extended safety vector (for a node) represent accurate fault nformaton and other bts k are coded based on the (k, )th bt of ts neghbors. Note that the regular safety vector model s a specal case of ths approach where d =. Results of our smulaton show a dramatc mprovement of ths approach over the safety vector model n handlng lnk faults. Extended Safety Vectors. Let esv(u) = (u ;u ; :::; u n ) be the extended safety vector of node u and esv(u) = (u () ;u() ; :::; u() n ) be the extended safety vector of node u (), u s neghbor along dmenson. We have the followng nductve defnton of extended safety vector esv(u). Defnton 3: The safety vector of a faulty node s (0; 0; :::; 0). If node u s an end node of a faulty lnk, the other end node wll be regstered wth a safety vector of (0; 0; :::; 0) at node u. Base for the frst bt: u =fnode u can reach any neghbor,.e., ( 0 f node u s an end-node of a faulty lnk u = otherwse Base for the second bt: u = f node u can reach any nonfaulty and faulty nodes that are two hops away through a mnmal path (a decson process wll be dscussed later); otherwse, u =0. Inductve defnton for the kth bt, where k 3: u k = 8 < P : 0 f u n otherwse () k, n, k u d precse nfo. coded nfo. Fgure. A new approach to code nformaton. In the extended safety vector model, n addton to the nformaton of adjacent lnks and nodes, each node has complete nformaton about adjacent lnks of ts neghbors. u = (or u = ) ndcates the exstence of a mnmal path to a nonfaulty nodes that are one hop (or two hops) away. For the case of u =0(or u =0), such a mnmal path may or may not exst, but for a gven source-destnaton par (that are one or two hops away) ts exstence can be easly verfed based on dstance- nformaton. We use coded nformaton for destnatons that are more than two hops away. Therefore, for the case of u k = 0, wth k >, the actual exstence of a mnmal path for a gven sourcedestnaton par cannot be verfed, that s, u k =provdes a suffcent condton for the exstence of a mnmal path to a dstance-k node, but t s not a necessary condton. To determne u, node u needs to keep faulty paths of length ntated from node u,.e., a path along whch there exsts at least one faulty lnk or node. A faulty path (u; u () ; (u () ) (j) ) can be smply represented by a dmenson sequence (; j). Clearly, an adjacent faulty lnk or node along dmenson can be represented as (; c ),where c = f; ; :::; ng,fg. That s, any path (u; u () ; (u () ) (k) ), where k c, s a faulty path of length. If both adjacent lnk and node along dmenson are healthy, but there are adjacent faulty lnks along dmensons n c 0 s a,wherec0 subset (ncludng empty set) of c, the correspondng faulty paths can be represented as (; c 0 ). Note that nformaton about (; c 0 ) s passed from node u() to node u. In general, each node u n an n-cube has exactly n pars of (; c 0 ),denoted as f (u) =f(; c 0 ):f; ; :::; ngg. Some(; ) s c0 correspond to healthy paths, where c 0 = fg s an empty set. Theorem : u = 0 for node u f and only f there exst (; c 0 ) and (j; ) n f (u) such that 6= and fjg\ c0 j fg\c0 j c 0 6=, where = fg s an empty set. Proof: There are two node-dsjont paths from node u to another node v that s dstance- away. Suppose these two nodes span on dmensons and j. Clearly, a path of length from node u to node v s (; j) and another s (j; ).
5 Calculatng extended safety vectors:. In the frst round, node u determnes u based on the status of ts adjacent lnks, and then, exchanges adjacent lnk and node status wth all ts neghbors.. In the second round, node u constructs f (u) whch s a lst of faulty paths of length based on the nformaton collected n the frst round. u s determned based on f (u), and then, exchanges u wth u 0 s of all ts neghbors. (0,,,) (0,,0,) 00 (,,,) (,0,,) (,,,) (,0,,) 0 00 (0,,,) (0,,0,) 0 (,,,) (0,0,0,0) (,0,,) (0,0,0,0) 0 (,,,) (,0,0,) 000 (,,,) (,0,0,) 00 (,,,) 00 (,,,) (,,,) (,0,,) 000 (,,,) (,0,,) 00 4 (0,,,) (0,,0,) 000 (,,,) (,0,,) (,0,,) 00 (0,0,,) (0,0,0,) 0000 (0,0,0,0) (0,0,0,0) In the kth round (3 k <n), node u determnes u k based on u k, s collected n the prevous round, and then, exchanges u k wth u 0 s of all ts neghbors. k 4. In the nth round, node u determnes u n based on u n, s collected n the prevous round. u cannot reach v f and only f (; j) s n (; c 0 ) (.e., that path s faulty) and (j; ) s n (j; c 0 ). In ths case, we have j fg \c 0 6= and fjg 6=. j \c0 In the example of Fg., f u =, then f (u) = f(; fg); (; f3g); (3; f; g)g. Based on the above theorem, the second bt u of the safety vector assocated wth node s. Clearly, bts u and u can be determned through rounds of nformaton exchanges among neghborng nodes and u 3, u 4,..., u n each needs one round. Therefore, the extended safety vector (u ;u ; :::; u n ) of node u n an n-cube can be calculated through n, rounds of nformaton exchanges among neghborng nodes. Theorem : The extended safety vector of each node n an n-cube can be determned through n, rounds of nformaton exchanges between adjacent nodes. 4. Examples and Propertes Fg. 3 shows an example of a faulty 4-cube wth two faulty nodes 000 and 0 and two faulty lnks (0000, 000) and (00, 0). The safety vector of each node s shown under both the safety vector and extended safety vector (on top) models. The safety level of each node s placed nsde each node. Nodes 000 and 0 have an extended safety vector (0; 0; 0; 0), nodes 000, 00, and 0 have an extended safety vector (0; ; ; ), 00 has (,0,,) and 0000 has (0,0,,), and the remanng nodes have a safety vector (; ; ; ). In the followng we show several propertes related to extended safety vectors. Theorem 3: Assume that (u ;u ; :::; u n ) s the extended safety vector assocated wth node u n a faulty n-cube. If Fgure 3. A faulty 4-cube wth two faulty nodes and two faulty lnks. u k = then there exsts at least one Hammng dstance path from node u to any node whch s exactly dstance-k away. Proof: We prove ths theorem by nducton on k. Ifu = (where k =), there s no adjacent faulty lnk. Clearly node u can reach all the neghborng nodes, faulty and nonfaulty. If u = (where k = ), based on the defnton of u, there s a mnmal path to any destnaton that s dstance- away from the source. Assume that ths theorem holds for k = l,.e., f u l = there exsts at least one Hammng dstance path from node u to any node whch s exactly dstance-l away. When k = l +,fu l+ =then Pn u() >n, (l +), whch means that there are at l most l neghbors whch have 0 at the lth bt of ther safety vectors. Therefore, among l +preferred neghbors, there s at least one neghbor, say node v, that has ts lth safety bt set. Based on the nducton assumpton, there s at least one Hammngdstance pathfrom node v to any destnaton node, say w, whch s dstance-l away. Connectng the lnk from node u to node v to the path orgnated from node v to destnaton node w, we construct a Hammng dstance path from node u to destnaton node w whch s dstance-(l +) away. Next we show that the extended safety vector s better than the regular safety vector n terms of accurately representng fault nformaton (Fgure 4 s such an example). Consder a vertex u n an n-cube wth safety vector sv(u) = (u ;u ; :::; u n ) and extended safety vector esv(u) =(u 0 ;u0 ; :::; u0 n ), the extended safety vector s sad to cover the safety vector at node u, fu 0 u k k for all k n. Intutvely, f ev(u) covers v(u) at the kth bt, then the routng based on the extended safety vector has at least the same routng capablty as one based on the safety vector to all destnatons that are dstance-k away. Theorem 4: For any gven faulty n-cube, esv(u) covers sv(u) for any node u n the cube.
6 Proof: We assume that a general node n a gven cube s represented as u, wth esv(u) = (u 0 ;u0 ; :::; ) and u0 n sv(u) = (u ;u ; :::; u n ) as extended safety vector and safety vector, respectvely. We prove the theorem by nducton on k n bt u k for all nodes n the cube. When k =, u has the same defnton as u 0 for all nodes. Clearly, u 0 u. When k =, based on Property, u = means that there s a mnmal path to any node that s dstance- away. On the other hand, u 0 =f and only f there s a mnmal path to any node that s dstance- away. Hence, f u = then u 0 =. The reverse condton normally does not hold. Therefore, u 0 covers u. Assume that the theorem holds for k = l >,.e., u 0 () u () l Pn u() l for all l. When k = l +, u l l+ = f >n,(l+) and =fp u 0 () l+ > n u0 l n, (l +). Based on P the fact that u 0 () u () for all, l l () where f; ; :::; ng, > n, (l +)mples n u0 l Pn u() >n,(l+),.e., u 0 =mples l l+ u l+ =. 5. Fault-Tolerant Routng Basc Idea. The routng algorthm s smlar to the one n [0]. Suppose that source node s, wth safety vector (s ;s ; :::; s n ), ntends to forward a message to a node that s dstance-k away. (s () ;s() ; :::; s() n ) s the safety vector of neghbor s (). The optmalty s guaranteed f the kth bt of ts safety vector s (s k =) or one of ts preferred neghbors (along dmenson ) (k, )th bt s,.e., s () =, k, n. Routng starts by forwardng the message to a preferred neghbor where the (k, )th bt of ts safety vector s one, and ths node n turn forwards the message to one of ts preferred neghbors that has n the (k,)th bt of ts safety vector, and so on. If the optmalty condton fals but there exsts a spare neghbor that has one n the (k +)th bt of ts safety vector, the message s frst forwarded to ths neghbor and then the optmal routng algorthm s appled. In ths case, the length of the resultant path s the Hammng dstance plus two. We call ths result suboptmal. Routng Algorthms. The routng process conssts of two parts: uncastng at source node s appled at the source node to decde the type of the routng algorthm and to perform the frst routng step. uncastng at ntermedate node s used at an ntermedate node. In the proposed routng process, a navgaton vector, N = s d, susedwhch s the relatve address between the source and destnaton nodes. Ths vector s determned at the source node and t s passed to a selected neghbor after resettng or settng (usng H () ) the correspondng bt n N. Upon recevng a routng message, each ntermedate node frst calculates ts preferred and spare neghbors based on the navgaton vec- Algorthm uncastng at source node begn N = s d; k = js dj; f s k =_9(s () k, =^N () =)_ (k =(or ) ^ a healthy -hop (or -hop) path along dmenson exsts) then optmal uncastng: send (m; N () ) to s (),wheres () k, =^N () = else f 9 (s () k+ =^N () =0) then suboptmal uncastng: send (m; N () ) to s (),wheres () k+ = else falure end. Algorthm uncastng at ntermedate node begn fat any ntermedate node u wth message m and navgaton vector N g f N =0 then stop else send (m; N () ) to u (),whereu () k, =^N () = end. tor assocated wth the message. If ths ntermedate node s dstance-(k +) away from the destnaton node (ths dstance can be determned based on the number of s n the navgaton vector), a preferred neghbor whch has n the kth bt of ts safety vector s selected. When a node receves a message wth an empty navgaton vector, t dentfes tself as the destnaton node by termnatng the routng process and by keepng a copy of ths message. Note that, at the source node, f both condtons for optmal and suboptmal routng fal, the proposed algorthm cannot be appled. Ths falure state can be easly detected at the source node. The cause of falure could be ether too many faults n the neghborhood or a network partton. 6. Performance Evaluaton The smulaton study focuses on the followng three aspects. () Percentage of optmal/suboptmal routng. () Comparson of safety vector and extended safety vector n terms of routng capablty. (3) Performance results when d = k (other than k =),.e., each node knows the exact fault nformaton that s wthn dstance-k. Percentage of optmal routng s measured by the probablty of an optmal routng usng the proposed approach for two randomly selected source and destnaton nodes. Agan, an optmal routng to a dstance-k destnaton s possble f
7 s k = for the source node or s () k, = for the source node s preferred neghbor along dmenson. In addton, suboptmal routng s feasble, f s () k+ = for the source node s spare neghbor along dmenson. When the source and destnaton nodes are separated by - or -hop, optmal routng can be decded drectly from the dstance- and dstance- nformaton at the source node. Note that a mnmal path may exst even when s and s are both zero. Routng capablty of safety vector and extended safety vector s compared manly under the above two measures. Tables and show smulaton results for 8-cubes and 0- cubes, respectvely. Each table contans three subtables for three dfferent dstrbutons of faults: (a) represents cases of all faults beng node faults; (b) for half faults beng node faults and the other half beng lnk faults; and (c) for all faults beng lnk faults. Wthn each cube, for a gven number of faults, these faults are randomly generated based on the specfced dstrbuton of lnk and node faults. We selected 00 dfferent fault dstrbutons for each case. For a gven fault dstrbuton, we randomly selected 00,000 source and destnaton pars. Percentage of the actual optmal routng s also reported (n the second column of each subtable). Ths also corresponds to cases when global fault nformaton s gven,.e., d = n. Percentage of optmal routng, when dstance-3 nformaton s gven, s shown n the thrd column of each subtable. Based on results n Tables and, the percentage of optmal routng under the extended safety vector model (when d =) stays very close to the one wth global nformaton (when d = n) for all cases. That s, the model for d = s suffcent. Note that when all faults are node faults, the safety vector and the extended safety vector models are the same. However, as the percentage of lnk faults ncreases, the results for the safety vector model deterorate quckly, especally for large numbers of faults. For example, when there are 75 lnk faults (no node faults) n a 0-cube, the percentage of optmal routng s only 35.8 percentage. For the extended safety vector model, the percentage of optmal routng remans hgh, especally when there s a hgh percentage of lnk faults. The summaton of percentages of optmal (Op) and suboptmal (SubOp) routng corresponds to the percentage of the applcablty of the corrspondng approach, whch s ether safety vector (d =) or extended safety vector (d =). 7. Conclusons We have proposed a new codng method of lmted global fault nformaton n an n-cube. Frst each node collects precse fault nformaton wthn dstance-d, andthen,fault nformaton about nodes that are more than dstance-d s coded n a specal way. A model, called extended safety vector, has been proposed whch s extended from the safety level and safety vector models to better handle lnk faults. The extended safety level model has been used to acheve optmal and suboptmal routng n an n-cube. A smulaton study has been conducted based on dfferent selectons of d and results have shown a sgnfcant mprovement under the proposed model over the safety vector model n handlng lnk faults, even for a small value of d such as d =. References [] M. S. Chen and K. G. Shn. Adaptve fault-tolerant routng n hypercube multcomputers. IEEE Trans. on Computers. 39, (), Dec. 990, [] J. Duato. A theory of fault-tolerant routng n wormhole networks. IEEE Trans. Parallal and Dstrbuted Syst. 8, (8), Aug. 998, [3] P. T. Gaughan and S. Yalamanchl. A famly of fault-tolerant routng protocols for drect multprocessor networks. IEEE Transactons on Parallel and Dstrbuted Systems. 6, (5), May 995, [4] Q. P. Gu and S. Peng. Uncast n hypercubes wth large number of faulty nodes. IEEE Trans. Parallal and Dstrbuted Syst. to appear. [5] Y. Lan. A fault-tolerant routng algorthm n hypercubes. Proc. of the 994 Internatonal Conference on Parallel Processng. August 994, III 63 - III 66. [6] T.C. Lee and J.P. Hayes. A fault-tolerant communcaton scheme for hypercube computers. IEEE Trans. on Computers. 4, (0), Oct. 99, [7] C. S. Raghavendra, P. J. Yang, and S. B. Ten. Free dmensons - an effectve approach to achevng fault tolerance n hypercubes. Proc. of the nd Internatonal Symposum on Fault-Tolerant Computng. 99, [8] Y. Saad and M. H. Schultz. Topologcal propertes of hypercubes. IEEE Transactons on Computers. 37, (7), July 988, [9] S. B. Ten and C. S. Raghavendra. Algorthms and bounds for shortest paths and dameter n faulty hypercubes. IEEE Transactons on Parallel and Dstrbuted Systems. Vol. 4, No. 6, June 993, [0] J. Wu. Relable communcaton n cube-based multcomputers usng safety vectors. IEEE Transactons on Parallel and Dstrbuted Systems. 9, (4), Aprl 998, [] J. Wu. Uncastng n faulty hypercubes usng safety levels. IEEE Transactons on Computers. 46, (), Feb. 997, [] J. Wu and E. B. Fernandez. Broadcastng n faulty hypercubes. Proc. of th Symposum on Relable Dstrbuted Systems. Oct. 99, -9.
8 #of Op Op Safety Vec. Ext. Safety Vec (a) When all faults are node faults n 8-cubes #of Op Op Safety Vec. Ext. Safety Vec (b) When half faults are node faults n 8-cubes #of Op Op Safety Vec. Ext. Safety Vec (c) When all faults are lnk faults n 8-cubes Table. Percentage of optmal and suboptmal routng under dfferent models. #of Op Op Safety Vec. Ext. SafetyVec (a) When all faults are node faults n 0-cubes #of Op Op Safety Vec. Ext. SafetyVec (b) When half faults are node faults n 0-cubes #of Op Op Safety Vec. Ext. SafetyVec (c) When all faults are lnk faults n 0-cubes Table. Percentage of optmal and suboptmal routng under dfferent models.
MANY experimental, and commercial multicomputers
402 IEEE TRANSACTIONS ON RELIABILITY, VOL. 54, NO. 3, SEPTEMBER 2005 Optimal, and Reliable Communication in Hypercubes Using Extended Safety Vectors Jie Wu, Feng Gao, Zhongcheng Li, and Yinghua Min, Fellow,
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationBridges and cut-vertices of Intuitionistic Fuzzy Graph Structure
Internatonal Journal of Engneerng, Scence and Mathematcs (UGC Approved) Journal Homepage: http://www.jesm.co.n, Emal: jesmj@gmal.com Double-Blnd Peer Revewed Refereed Open Access Internatonal Journal -
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationthe nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an
On Central Spannng Trees of a Graph S. Bezrukov Unverstat-GH Paderborn FB Mathematk/Informatk Furstenallee 11 D{33102 Paderborn F. Kaderal, W. Poguntke FernUnverstat Hagen LG Kommunkatonssysteme Bergscher
More informationA NOTE ON FUZZY CLOSURE OF A FUZZY SET
(JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationLoop-Free Multipath Routing Using Generalized Diffusing Computations
1 Loop-Free Multpath Routng Usng Generalzed Dffusng Computatons Wllam T. Zaumen J.J. Garca-Luna-Aceves Sun Mcrosystems, Inc. Computer Engneerng Department 901 San Antono Avenue School of Engneerng Palo
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More informationOn Fault-Tolerant Embedding of Meshes and Tori in a Flexible Hypercube with Unbounded Expansion
On Fault-Tolerant Embeddng of Meshes and Tor n a Flexble Hypercube wth Unbounded Expanson *JEN-CHIH LIN Department of Dgtal Technology Desgn, Natonal Tape Unversty of Educaton, No.34, Sec. 2, Hepng E.
More informationA Topology-aware Random Walk
A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationDeadlock-Free Path-Based Fault-Tolerant Multicast Communications on 2-D Mesh Networks-on-Chip
The CSI Journal on Computer Scence and Engneerng Vol. 6, No. 2 & 4 (b), 2008 Pages 36-45 Short Paper Deadlock-Free Path-Based Fault-Tolerant Multcast Communcatons on 2-D Mesh Networks-on-Chp Majed ValadBeg
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationTransaction-Consistent Global Checkpoints in a Distributed Database System
Proceedngs of the World Congress on Engneerng 2008 Vol I Transacton-Consstent Global Checkponts n a Dstrbuted Database System Jang Wu, D. Manvannan and Bhavan Thurasngham Abstract Checkpontng and rollback
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationAll-Pairs Shortest Paths. Approximate All-Pairs shortest paths Approximate distance oracles Spanners and Emulators. Uri Zwick Tel Aviv University
Approxmate All-Pars shortest paths Approxmate dstance oracles Spanners and Emulators Ur Zwck Tel Avv Unversty Summer School on Shortest Paths (PATH05 DIKU, Unversty of Copenhagen All-Pars Shortest Paths
More informationA Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes
A Low-Oerhead Routng Protocol for Ad Hoc Networks wth selfsh nodes Dongbn Wang 1, Xaofeng Wang 2, Xangzhan Yu 3, Kacheng Q 1, Zhbn Xa 1 1 School of Software Engneerng, Bejng Unersty of Posts and Telecommuncatons,100876,
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationMinimum Cost Optimization of Multicast Wireless Networks with Network Coding
Mnmum Cost Optmzaton of Multcast Wreless Networks wth Network Codng Chengyu Xong and Xaohua L Department of ECE, State Unversty of New York at Bnghamton, Bnghamton, NY 13902 Emal: {cxong1, xl}@bnghamton.edu
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationA Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics
A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationConnection-information-based connection rerouting for connection-oriented mobile communication networks
Dstrb. Syst. Engng 5 (1998) 47 65. Prnted n the UK PII: S0967-1846(98)90513-7 Connecton-nformaton-based connecton reroutng for connecton-orented moble communcaton networks Mnho Song, Yanghee Cho and Chongsang
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationReliable Unicasting in Faulty Hypercubes Using Safety Levels
IEEE TRANSACTIONS ON COMPUTERS, VOL. 46, NO. 2, FEBRUARY 997 24 Reliable Unicasting in Faulty Hypercubes Using Safety Levels Jie Wu, Senior Member, IEEE Abstract We propose a unicasting algorithm for faulty
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationQuerying by sketch geographical databases. Yu Han 1, a *
4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationLocalTree: An Efficient Algorithm for Mobile Peer-to-Peer Live Streaming
LocalTree: An Effcent Algorthm for Moble Peer-to-Peer Lve Streamng Bo Zhang S.-H. Gary Chan Department of Comp. Sc. & Eng. The Hong Kong Un. of Sc. & Tech. Clear Water Bay, Hong Kong Emal: {zhangbo, gchan}@cse.ust.hk
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationCell Count Method on a Network with SANET
CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationkccvoip.com basic voip training NAT/PAT extract 2008
kccvop.com basc vop tranng NAT/PAT extract 28 As we have seen n the prevous sldes, SIP and H2 both use addressng nsde ther packets to rely nformaton. Thnk of an envelope where we place the addresses of
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationRoutability Driven Modification Method of Monotonic Via Assignment for 2-layer Ball Grid Array Packages
Routablty Drven Modfcaton Method of Monotonc Va Assgnment for 2-layer Ball Grd Array Pacages Yoch Tomoa Atsush Taahash Department of Communcatons and Integrated Systems, Toyo Insttute of Technology 2 12
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More information