Fault-Tolerant Routing Algorithm for BSN-Hypercube Using Unsafety Vectors
|
|
- Duane Ball
- 8 years ago
- Views:
Transcription
1 Journal of omputational Information Systems 7:2 (2011) Available at Fault-Tolerant Routing Algorithm for BSN-Hypercube Using Unsafety Vectors Wenhong WEI 1,, Yong LI 2 1 School of Electronic and Information Engineering, South hina University of Technology, Guangzhou , hina 2 Department of omputer Science, Dongguan University of Technology,, Dongguan , hina Abstract Biswapped network (BSN) is a recently proposed network model of parallel computing, which is built of 2N copies of an N-node basis network and its basic network may be hypercube, mesh and other networks, some algorithms such as basic communication operations algorithms, matrix multiplication algorithm and parallel sorting algorithm have been developed. In this paper, we proposed fault-tolerant routing algorithm on BSN-Hypercube using unsafety vectors. Firstly, we show how each node calculates numeric unsafety vectors, and then use them to achieve efficient fault-tolerant routing. Simulation results show that proposed algorithm has significant promotion in efficiency and stability. Keywords: Biswapped Network; Fault-routing Algorithm; Unsafety Vectors 1. Introduction Biswapped network (BSN), the new network is a class of hierarchical network and is tight related to the OTIS network [1]. BSN is of more regularity than the OTIS network. BSN is built of 2N copies of an N-node basic network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. In particular, if the basic network is a ayley digraph then so is the BSN, thus a systematic construction of large, scalable, modular, and robust parallel architectures are given, while maintaining many desirable attributes of the underlying basic network that comprises its clusters. Similar to OTIS network, some topological properties of BSN have been investigated [2], and lots of algorithms such as basic communication operations algorithms, matrix multiplication algorithm, parallel sorting algorithm and fault tolerance on the BSN have been developed [3-6]. A massively parallel computer system cannot avoid having failure components in real world. A realistic data communication scheme should have the capability of fault tolerance. BSN-Hypercube network is a kind of network whose basic network is hypercube in parallel computer system, and several fault-tolerant communication schemes have been proposed in previous research works which are based on either local information [7] or global information [8] in hypercube. Local-information-based routing yields sub-optimal routes (if not routing failure) due to the insufficient information upon which the routing decisions are made. Global-information-based routing can achieve optimal or near optimal routing, but often at the expense of orresponding author. addresses: hquwwh@tom.com (Wenhong WEI) / opyright 2011 Binary Information Press February, 2011
2 624 W. Wei et al. /Journal of omputational Information Systems 7:2 (2011) high communication overhead to maintain up-to-date network-wide fault information. In [9], Lan has presented a fault-tolerant routing algorithm based on local information, and which guarantees an optimal or near optimal routing. Lee and Hayes used the concept of unsafe nodes to design a fault tolerant routing strategy [10]. J.Al-Sadi used unsafety vectors to propose a new fault-tolerant routing for the binary n-cube [11]. Based on [11], in this paper, we develop fault-tolerant routing algorithm on BSN-Hypercube using unsafety vectors. Our paper is organized as follow: In section 2 we describe the structure of BSN and some conception of unsafety vectors. Section 3 presents the proposed fault-tolerant routing algorithm for the BSN-Hypercube. Some simulation results in the last section help to show availability of our work. 2. Preliminaries Definition 1. Let Ω be a graph with the vertex set V( Ω ) = { h1, h2,..., h n } and the arc set E( Ω ). Biswapped network ΣΩ ( ) =Σ= ( V( Σ), E( Σ )) is a graph defined as follows [1]: V(Σ) = {<g, p, 0>, <g, p, 1> g, p V(Ω)} and E(Σ) = {(<g, p 1, 0>, <g, p 2, 0>), (<g, p 1, 1>, <g, p 2, 1>) (p 1, p 2 ) E(Ω), g V(Ω)} {(<g, p, 0>, <p, g, 1>), (<g, p, 1>, <p, g, 0>) g, p V(Ω)} Intuitively, if we regard the basis network as group, the definition postulates 2N groups, each group being an Ω digraph: N groups, with nodes numbered group#, processor#, 0, form part 0 of the bipartite graph, and N groups constitute part 1, with associated node numbers group#, processor#, 1. Each group p in either part of Σ has the same internal connectivity as Ω (intra-group edges, forming the first set in the definition of E(Σ)). In addition, node g of group p in part 0/1 is connected to node p in group g of part 1/0 (inter-group or swap edges in the second set in the definition for E(Σ)). The name Biswapped network (BSN) arises from two defining properties of the network just introduced: when groups are viewed as super-nodes, the resulting graph of super-nodes is a complete 2N-node bipartite graph, and the inter-group links connect nodes in which the group number and the node number within group are interchanged or swapped. When Ω= H 4 is a hypercube having 4 nodes, an example of the network Σ(H 4 ) is denoted in Figure 1. Fig.1 An Example of BSN Whose Basic Network is H 4
3 W. Wei et al. /Journal of omputational Information Systems 7:2 (2011) Similar to swapped network (or OTIS), links between vertices of the same group are regarded as intra-group links, and links between vertices of between two groups follow the swapping strategy, which are regarded as inter-group links. In hypercube, the neighbor of a node along the i-th dimension is denoted (i). With respect to a given destination node D, a neighbor (i) of node is called a preferred neighbor for the routing from to D if the ith bit of D is 1. We say in this case that i is a preferred dimension. Neighbors other than preferred neighbors are called spare neighbors. Routing through a spare neighbor increases the routing distance by two over the minimum distance. An optimal path can be obtained by routing through all preferred dimensions in some order. node T is called an (, D)-preferred transit node if any preferred dimension for the routing from to T is also a preferred dimension for the routing from to D. 3. Algortihm 3.1. The Unsafety Sets alculations Definition 2. The first-level unsafety set 1 i n i S1 = f where of a node is defined as i f is give by (1) f i { = φ ( i) } if ( i) is fault Otherwise (2) In the formula, the n is the number of dimension in hypercube. Definition 3. An isolated node is associated with first-level unsafety set containing n+1 addresses of faulty nodes, i.e., = n+1. Definition 4. If for some node, = n, then node is called a dead-end node. Each node uses the unsafety set to determine the faulty set F, which comprises those nodes which are either faulty or unreachable from due to faulty nodes or links. This is achieved by performing m-1 exchanges with the reachable neighbors. After determining F, node calculates m unsafety sets denoted, S 2,..., S m, where m is an adjustable parameter between 1 and 2n+2. Definition 4. The k-level unsafety set S k, 1 k m, for node is given by S k = = { B F d( B, ) k} The k-level unsafety set S k represents node s view of the set of nodes at distance k from which are faulty or unreachable from due to faulty nodes and links. Notice that if the network is disconnected due to faulty nodes and links, s view about unreachable nodes may not be accurate. In this case massage of unreachability may occur. Figure 2 gives an outline of the Find_Unsafety_Sets algorithm that node uses
4 626 W. Wei et al. /Journal of omputational Information Systems 7:2 (2011) it to determine it s faulty and unsafety sets. Example 1. onsider a two-dimensional hypercube with 4 nodes as basic network, there are 32 nodes in BSN-Hypercube. Now, assumed there are 8 faulty nodes (faulty nodes are represented as black nodes), as shown in Figure 3. Table 1 shows the corresponding first-level unsafety set,, associated with each node. The Find_Unsafety_Sets algorithm calculates the sets S m for all 1 k m after calculating F. To achieve this, (m-1) exchanges of fault information are performed among neighboring nodes. Find_Unsafety_Sets(<g c, p c >) /* called by node to determine its faulty set F */ { = set of faulty or unreachable immediate neighbors; } F.= ; for( k=2; k<=m; k++){ for( i=1; i<=n; i++) { i if ( pc ( ) F ) { (i) send F to p c ; (i) (i) receive F from p c ; F = F F (i) ; send F to <p c, g c >; receive F p c, g > from <p c, g c >; < c F = F F < p c, gc > ; }}} for ( k=1; k<=m; k++) ={<g b, p b > F dist(<g c, p c >, <g b, p b >) = k } Fig.2 The Find_Unsafety_Sets Algorithm that Determines the Faulty Set for Node. Fig.3 BSN-Hypercube with 8 Faulty Nodes Let m=2n+2 and for the sake of specific illustrations let us compute the unsafety sets associated with node =<00, 00, 0>. First, the node assigns the addresses of its immediate faulty neighbours to its faulty set
5 W. Wei et al. /Journal of omputational Information Systems 7:2 (2011) F. Then each node performs 2n+1 exchanges of the new elements of its faulty set F with the immediate non-faulty neighbors. After determining F, node calculates m unsafety sets according to the distance between node and each element of F. So, the faulty set for node in our example, given in decimal representation, F ={<00, 01, 0>, <01, 11, 0>, <10, 10, 0>, <11, 10, 0>, <00, 00, 1>, <00, 11, 1>, <01, 01, 1>, <11, 11, 1>}, and the unsafety sets are ={<00, 01, 0>, <00, 00, 1>}, S 2 ={}, S 3 ={<00, 11, 1>, <01, 01, 1>}, S 4 ={<10, 10, 0>}, S 5 ={<01, 11, 0>, <11, 10, 0>, <11, 11, 1>}, and S 6 ={}. Table 1 The Unsafety Sets of Nodes in BSN-Hypercube with 8 Faulty Nodes. Node <00,00,0> <00,01,0> <00,10,0> <00,11,0> <01,00,0> <01,01,0> <01,10,0> <01,11,0> {<00,01,0>, <00,00,1>} faulty {<00,01,0>} { } { } {<01,01,1>, <01,10,1>} faulty {<01,11,0>} Node <10,00,0> <10,01,0> <10,10,0> <10,11,0> <11,00,0> <11,01,0> <11,10,0> <11,11,0> {<10,10,0>} { } faulty {<10,10,0>} {<11,10,0>, <00,11,1>} { } faulty {<11,10,0>, <11,11,1>} Node <00,00,1> <00,01,1> <00,10,1> <00,11,1> <01,00,1> <01,01,1> <01,10,1> <01,11,1> {<00,00,1>, {<00,00,1>, {<00,01,0>, faulty faulty faulty { } {<01,01,1>} <00,11,1>} <00,11,1>} <01,01,1>} Node <10,00,1> <10,01,1> <10,10,1> <10,11,1> <11,00,1> <11,01,1> <11,10,1> <11,11,1> { } { } {<10,10,0>} {<11,10,0>} { } {<01,11,0>, <11,11,1>} {<11,11,1>} faulty 3.2. Fault-Tolerant Algorithm Definition 5. For a given source nodes (denoted <g c, p c, i 1 >) and destination node D (denoted <g d, p d, i 2 >) in BSN-Hypercube, we define the (, D)-unsafety vector U,D = ( u, D, D 1, uk,, u, D m ) where its k th element is given by D u, k = { T S k, such that T is an (, D)-preferred transit node} In other words, D u, k is the number of faulty or unreachable (, D)-preferred transit nodes at distance k from <g c, p c, i>. D u, k can be viewed as a measure of routing unsafety at distance k from <g c, p c, i>, hence the name unsafety vectors for U,D. The algorithm for fault-tolerant routing on BSN-Hypercube as following: Nexthop_Fault-Tolerant_Routing(<g c, p c, i 1 >,<g d, p d, i 2 >) { if(i 1 = 0 and i 2 = 0) if(g c = g d and p c = p d ) return null; //reach destination if (p c = p d )
6 628 W. Wei et al. /Journal of omputational Information Systems 7:2 (2011) if (the node <p c, g c, 1> is not faulty) return <p c, g c, 1>; if ( a non-faulty neighbor (i) and (i) is not dead-end) return (i) ; return < Nexthop_UVH (g c, g d ), p c, 0>; if(i 1 = 1 and i 2 = 0) if(g c = g d and p c = p d ) if (the node <g c, p c, 0> is not faulty) return <g c, p c, 0>; if ( a non-faulty neighbor (i) and (i) is not dead-end) return (i) ; if(p c = g d ) if (the node <p c, g c, 0> is not faulty) return <p c, g c, 0>; if ( a non-faulty neighbor (i) and (i) is not dead-end) return (i) ; return < Nexthop_UVH (g c, p d ), p c, 1>; if(i 1 = 0 and i 2 = 1) if(g c = g d and p c = p d ) if (the node <g c, p c, 1> is not faulty) return <g c, p c, 1>; if ( a non-faulty neighbor (i) and (i) is not dead-end) return (i) ; if(p c = g d ) if (the node <p c, g c, 1> is not faulty) return <p c, g c, 1>; return < Nexthop_UVH (g c, p d ), p c, 0>; if(i 1 = 1 and i 2 = 1) if(g c = g d and p c = p d ) return null; //reach destination if(p c = p d ) if (the node <p c, g c, 0> is not faulty) return <p c, g c, 0>; if ( a non-faulty neighbor (i) and (i) is not dead-end) return (i) ;
7 W. Wei et al. /Journal of omputational Information Systems 7:2 (2011) return < Nexthop_UVH (g c, g d ), p c, 1>; } Nexthop_UVH (<p c, p d >) /*Nexthop routing function with unsafety vectors in hypercube*/ { if (p c = p d ) return null; if ( a preferred non-faulty neighbor (i) with least ( (i), D)-unsafety vector return (i) ; if ( a spare non-faulty neighbor (j) with least ( (j), D)-unsafety vector return (j) ; } U ( i ) D U, and (i) is not dead-end) ( j ) Fig.4 The Fault-tolerant Routing Algorithm, D and (j) is not dead-end ) 4. Experiments and Performance Evaluation This section conducts performance statistical results of the proposed unsafety vectors approach. To this end, a simulation study has been carried out for the unsafety vectors approach over a 512-node 4 dimensions BSN-Hypercube with different random distributions of faulty nodes. We started with a non-faulty BSN-Hypercube and then the number of faulty nodes was increased gradually up to 70% of the network size with random fault distribution. A total of 256 source-destination pairs where selected from each node to all other nodes in the network at each run. We compute the probability of routing failure and the average length of the successful routing when different percentages of nodes become faulty in BSN-Hypercube. A percentage of faulty nodes are randomly selected before simulation, and then these two metrics are measured by running the routing algorithm with fault tolerance. The probability that a node fails is varied from 0% - 70%. 256 tests are run for each failure probability. Figure 5 plots the probability that the routing ends in failure as a function of the probability of nodes failure. Note that our tests include the test cases in which the destination of a routing is faulty, which means that when the probability of nodes failure is 20%, about 20% of routing failure can not be avoided because the destination is faulty. When the probability of nodes failure is 70%, the fault-tolerant routing algorithm is capable of delivering messages. The routing length would inevitably increase when a routing encounters a faulty node on its way to the destination. Figure 6 plots the average hops required for the successful routing. The even curve in this figure indicates that the routing length is rarely influenced by faulty nodes when the probability of nodes failure is not high. In this example, the probability is no more than 40%. 5. onclusions In this paper, we have proposed an algorithm for fault-tolerant routing on BSN-Hypercube network based on the concept of unsafety vectors, as a first step in this algorithm, each node determines its view of the faulty set F of nodes which are either faulty or unreachable from. Equipped with these unsafety sets each node calculates unsafety vectors and uses them to achieve fault-tolerant routing in the
8 630 W. Wei et al. /Journal of omputational Information Systems 7:2 (2011) BSN-Hypercube. A performance result has revealed that the new algorithm performs substantially in terms of the routing distance and percentage of reachability even when the probability of faulty nodes arrived 70%. The probabilty that routing fails Unreachability % 10% 20% 30% 40% 50% 60% 70% The probablity that nodes fail The average length of successful routing Routing Length 0% 10% 20% 30% 40% 50% 60% 70% The probability of nodes fail Fig.5 The Probability that Routing Nodes in Failure Fig.6 The Average Length of Successful Routing Acknowledgement This work is supported by the Natural Science Foundation of hina (No ) and the Young Natural Science Foundation of Dongguan University of Technology (No. 2010QZ21). References [1] Wenjun.Xiao, Weidong.hen, Mingxin.He, Wenhong.Wei and B.Parhami. Biswapped Network and Their Topological Properties. Proceedings-Eighth AIS International onference on Software Eng., Artific. Intelligence, Networking, and Parallel/ Distributed omputing, 2007, pp [2] Wenhong Wei and Wenjun Xiao. Matrix Multiplication on the Biswapped-Mesh Network. Proceedings Eighth AIS International onference on Software Eng., Artific. Intelligence, Networking, and Parallel/Distributed omputing, 2007, pp [3] Wenhong Wei, Wenjun Xiao. Fault Tolerance in the Biswapped Network. The 8th International onference on Algorithms and Architectures for Parallel Processing, 2008, 5022: [4] Wenhong Wei, Wenjun Xiao. Algorithms of Basic ommunication Operation on the Biswapped Network. The 8th International onference on omputational Science, 2008, 5101: [5] Wenhong Wei, Wenjun Xiao. Efficient Parallel Algorithm for Sorting on the Biswapped Network. Journal of omputational Information Systems, 2008, 4(4): [6] Yulian Yu, Wenhong Wei. Load balancing on the biswapped network. Proceedings of the 2nd International onference on Intelligent Networks and Intelligent Systems, 2009, pp [7] M.S. hen, K.G. Shin, Adaptive fault-tolerant routing in hypercube multicomputers, IEEE Trans. omputers, 1990, 39 (12): [8] J.-P. Sheu, M.-Y. Su, A multicast algorithm for hypercube multiprocessors, Proc. Int. onf. Parallel Processing, 1992, pp [9] Y. Lan, An adaptive fault-tolerant routing algorithm for hypercube multicomputers, IEEE Trans. Parallel Distributed Syst. 1998, 6 (11): [10] T.. Lee, J.P. Hayes, A fault-tolerant communication scheme for hypercube computers, IEEE Trans. omputers 41 (10) (1992) [11] J. Al-Sadi, K. Day, M. Ould-Khaoua, Unsafety vectors: A new Fault-tolerant routing for the binary n-cube, Journal of Systems Architecture, 2002, 47( 9):
Fault Tolerance in the Block-Shift Network
IEEE TRANSACTIONS ON RELIABILITY, VOL. 50, NO. 1, MARCH 2001 85 Fault Tolerance in the Block-Shift Network Yi Pan, Member, IEEE Abstract The Block Shift Network (BSN) is a new topology for interconnection
More informationLoad balancing in a heterogeneous computer system by self-organizing Kohonen network
Bull. Nov. Comp. Center, Comp. Science, 25 (2006), 69 74 c 2006 NCC Publisher Load balancing in a heterogeneous computer system by self-organizing Kohonen network Mikhail S. Tarkov, Yakov S. Bezrukov Abstract.
More informationCharacter Image Patterns as Big Data
22 International Conference on Frontiers in Handwriting Recognition Character Image Patterns as Big Data Seiichi Uchida, Ryosuke Ishida, Akira Yoshida, Wenjie Cai, Yaokai Feng Kyushu University, Fukuoka,
More informationAn Ecient Dynamic Load Balancing using the Dimension Exchange. Ju-wook Jang. of balancing load among processors, most of the realworld
An Ecient Dynamic Load Balancing using the Dimension Exchange Method for Balancing of Quantized Loads on Hypercube Multiprocessors * Hwakyung Rim Dept. of Computer Science Seoul Korea 11-74 ackyung@arqlab1.sogang.ac.kr
More informationTopological Properties
Advanced Computer Architecture Topological Properties Routing Distance: Number of links on route Node degree: Number of channels per node Network diameter: Longest minimum routing distance between any
More informationLoad Balancing Between Heterogenous Computing Clusters
Load Balancing Between Heterogenous Computing Clusters Siu-Cheung Chau Dept. of Physics and Computing, Wilfrid Laurier University, Waterloo, Ontario, Canada, N2L 3C5 e-mail: schau@wlu.ca Ada Wai-Chee Fu
More informationInterconnection Networks Programmierung Paralleler und Verteilter Systeme (PPV)
Interconnection Networks Programmierung Paralleler und Verteilter Systeme (PPV) Sommer 2015 Frank Feinbube, M.Sc., Felix Eberhardt, M.Sc., Prof. Dr. Andreas Polze Interconnection Networks 2 SIMD systems
More informationLoad Balancing between Computing Clusters
Load Balancing between Computing Clusters Siu-Cheung Chau Dept. of Physics and Computing, Wilfrid Laurier University, Waterloo, Ontario, Canada, NL 3C5 e-mail: schau@wlu.ca Ada Wai-Chee Fu Dept. of Computer
More informationQuality of Service Routing Network and Performance Evaluation*
Quality of Service Routing Network and Performance Evaluation* Shen Lin, Cui Yong, Xu Ming-wei, and Xu Ke Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 {shenlin, cy, xmw,
More informationDistributed Computing over Communication Networks: Topology. (with an excursion to P2P)
Distributed Computing over Communication Networks: Topology (with an excursion to P2P) Some administrative comments... There will be a Skript for this part of the lecture. (Same as slides, except for today...
More informationA Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks
A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More informationA RDT-Based Interconnection Network for Scalable Network-on-Chip Designs
A RDT-Based Interconnection Network for Scalable Network-on-Chip Designs ang u, Mei ang, ulu ang, and ingtao Jiang Dept. of Computer Science Nankai University Tianjing, 300071, China yuyang_79@yahoo.com.cn,
More informationPerformance Analysis of QoS Multicast Routing in Mobile Ad Hoc Networks Using Directional Antennas
I.J.Computer Network and Information Security, 21, 2, 26-32 Published Online December 21 in MECS (http://www.mecs-press.org/) Performance Analysis of QoS Multicast Routing in Mobile Ad Hoc Networks Using
More informationRouting in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationSystem Interconnect Architectures. Goals and Analysis. Network Properties and Routing. Terminology - 2. Terminology - 1
System Interconnect Architectures CSCI 8150 Advanced Computer Architecture Hwang, Chapter 2 Program and Network Properties 2.4 System Interconnect Architectures Direct networks for static connections Indirect
More informationON A NEW MULTICOMPUTER INTERCONNECTION TOPOLOGY FOR MASSIVELY PARALLEL SYSTEMS
ON A NEW MULTICOMPUTER INTERCONNECTION TOPOLOGY FOR MASSIVELY PARALLEL SYSTEMS C. R. Tripathy 1 and N. Adhikari 2 Professor, Department of CSE, VSS University of Technology, Burla, Orissa, India write2na@gmail.com
More informationNovel Hierarchical Interconnection Networks for High-Performance Multicomputer Systems
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 20, 1213-1229 (2004) Short Paper Novel Hierarchical Interconnection Networks for High-Performance Multicomputer Systems GENE EU JAN, YUAN-SHIN HWANG *, MING-BO
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationDECENTRALIZED LOAD BALANCING IN HETEROGENEOUS SYSTEMS USING DIFFUSION APPROACH
DECENTRALIZED LOAD BALANCING IN HETEROGENEOUS SYSTEMS USING DIFFUSION APPROACH P.Neelakantan Department of Computer Science & Engineering, SVCET, Chittoor pneelakantan@rediffmail.com ABSTRACT The grid
More informationInterconnection Networks
CMPT765/408 08-1 Interconnection Networks Qianping Gu 1 Interconnection Networks The note is mainly based on Chapters 1, 2, and 4 of Interconnection Networks, An Engineering Approach by J. Duato, S. Yalamanchili,
More informationA SIMULATOR FOR LOAD BALANCING ANALYSIS IN DISTRIBUTED SYSTEMS
Mihai Horia Zaharia, Florin Leon, Dan Galea (3) A Simulator for Load Balancing Analysis in Distributed Systems in A. Valachi, D. Galea, A. M. Florea, M. Craus (eds.) - Tehnologii informationale, Editura
More informationExperiments on the local load balancing algorithms; part 1
Experiments on the local load balancing algorithms; part 1 Ştefan Măruşter Institute e-austria Timisoara West University of Timişoara, Romania maruster@info.uvt.ro Abstract. In this paper the influence
More informationPath Selection Methods for Localized Quality of Service Routing
Path Selection Methods for Localized Quality of Service Routing Xin Yuan and Arif Saifee Department of Computer Science, Florida State University, Tallahassee, FL Abstract Localized Quality of Service
More informationSTUDY AND SIMULATION OF A DISTRIBUTED REAL-TIME FAULT-TOLERANCE WEB MONITORING SYSTEM
STUDY AND SIMULATION OF A DISTRIBUTED REAL-TIME FAULT-TOLERANCE WEB MONITORING SYSTEM Albert M. K. Cheng, Shaohong Fang Department of Computer Science University of Houston Houston, TX, 77204, USA http://www.cs.uh.edu
More informationHow To Understand The Concept Of A Distributed System
Distributed Operating Systems Introduction Ewa Niewiadomska-Szynkiewicz and Adam Kozakiewicz ens@ia.pw.edu.pl, akozakie@ia.pw.edu.pl Institute of Control and Computation Engineering Warsaw University of
More informationCROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING
CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility
More informationA Fast Path Recovery Mechanism for MPLS Networks
A Fast Path Recovery Mechanism for MPLS Networks Jenhui Chen, Chung-Ching Chiou, and Shih-Lin Wu Department of Computer Science and Information Engineering Chang Gung University, Taoyuan, Taiwan, R.O.C.
More informationCOST MINIMIZATION OF RUNNING MAPREDUCE ACROSS GEOGRAPHICALLY DISTRIBUTED DATA CENTERS
COST MINIMIZATION OF RUNNING MAPREDUCE ACROSS GEOGRAPHICALLY DISTRIBUTED DATA CENTERS Ms. T. Cowsalya PG Scholar, SVS College of Engineering, Coimbatore, Tamilnadu, India Dr. S. Senthamarai Kannan Assistant
More informationDESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS
DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS K.V. Narayanaswamy 1, C.H. Subbarao 2 1 Professor, Head Division of TLL, MSRUAS, Bangalore, INDIA, 2 Associate
More informationDistributed Dynamic Load Balancing for Iterative-Stencil Applications
Distributed Dynamic Load Balancing for Iterative-Stencil Applications G. Dethier 1, P. Marchot 2 and P.A. de Marneffe 1 1 EECS Department, University of Liege, Belgium 2 Chemical Engineering Department,
More informationSensors & Transducers 2015 by IFSA Publishing, S. L. http://www.sensorsportal.com
Sensors & Transducers 2015 by IFSA Publishing, S. L. http://www.sensorsportal.com A Dynamic Deployment Policy of Slave Controllers for Software Defined Network Yongqiang Yang and Gang Xu College of Computer
More informationMulti-layer Structure of Data Center Based on Steiner Triple System
Journal of Computational Information Systems 9: 11 (2013) 4371 4378 Available at http://www.jofcis.com Multi-layer Structure of Data Center Based on Steiner Triple System Jianfei ZHANG 1, Zhiyi FANG 1,
More informationA New Forwarding Policy for Load Balancing in Communication Networks
A New Forwarding Policy for Load Balancing in Communication Networks Martin Heusse Yvon Kermarrec ENST de Bretagne BP 83, 985 Brest Cedex, France Martin.Heusse@enst-bretagne.fr Abstract We present in this
More informationEfficient Search in Gnutella-like Small-World Peerto-Peer
Efficient Search in Gnutella-like Small-World Peerto-Peer Systems * Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao School of Computer, National University of Defense Technology, 410073 Changsha, China
More informationAnalysis of QoS Routing Approach and the starvation`s evaluation in LAN
www.ijcsi.org 360 Analysis of QoS Routing Approach and the starvation`s evaluation in LAN 1 st Ariana Bejleri Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department,
More informationLinear Crossed Cube (LCQ): A New Interconnection Network Topology for Massively Parallel System
I. J. Computer Network and Information Security, 215, 3, 18-25 Published Online February 215 in MECS (http://www.mecs-press.org/) DOI: 1.5815/ijcnis.215.3.3 Linear Crossed Cube (): A New Interconnection
More informationTolerating Multiple Faults in Multistage Interconnection Networks with Minimal Extra Stages
998 IEEE TRANSACTIONS ON COMPUTERS, VOL. 49, NO. 9, SEPTEMBER 2000 Tolerating Multiple Faults in Multistage Interconnection Networks with Minimal Extra Stages Chenggong Charles Fan, Student Member, IEEE,
More informationModule 7. Routing and Congestion Control. Version 2 CSE IIT, Kharagpur
Module 7 Routing and Congestion Control Lesson 4 Border Gateway Protocol (BGP) Specific Instructional Objectives On completion of this lesson, the students will be able to: Explain the operation of the
More informationWeb Cluster Dynamic Load Balancing- GA Approach
Web Cluster Dynamic Load Balancing- GA Approach Chin Wen Cheong FOSEE, MultiMedia University 7545 Buit Beruang Malacca, Malaysia wcchin@mmu.edu.my Amy Lim Hui Lan Faculty of Information Technology MultiMedia
More informationPerformance Analysis of Spatial Reused Bandwidth Reservation in Ad Hoc Networks
I.J. Information Technology and Computer Science, 2,, 4-46 Published Online November 2 in MECS (http://www.mecs-press.org/) Performance Analysis of Spatial Reused Bandwidth Reservation in Ad Hoc Networks
More informationQUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering
More informationAn Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 1, FEBRUARY 2003 81 An Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks Krishna Phani Gummadi, Madhavarapu
More informationHyper Node Torus: A New Interconnection Network for High Speed Packet Processors
2011 International Symposium on Computer Networks and Distributed Systems (CNDS), February 23-24, 2011 Hyper Node Torus: A New Interconnection Network for High Speed Packet Processors Atefeh Khosravi,
More informationA Hierarchical Structure based Coverage Repair in Wireless Sensor Networks
A Hierarchical Structure based Coverage Repair in Wireless Sensor Networks Jie Wu Computer Science & Engineering Department Florida Atlantic University Boca Raton, FL 3343, USA E-mail: jie@cse.fau.edu
More informationEFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK
EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK S.Abarna 1, R.Padmapriya 2 1 Mphil Scholar, 2 Assistant Professor, Department of Computer Science,
More informationEfficient DNS based Load Balancing for Bursty Web Application Traffic
ISSN Volume 1, No.1, September October 2012 International Journal of Science the and Internet. Applied However, Information this trend leads Technology to sudden burst of Available Online at http://warse.org/pdfs/ijmcis01112012.pdf
More informationInterconnection Networks. Interconnection Networks. Interconnection networks are used everywhere!
Interconnection Networks Interconnection Networks Interconnection networks are used everywhere! Supercomputers connecting the processors Routers connecting the ports can consider a router as a parallel
More informationImprovisation of The Quality Of Service In ZigBee Cluster Tree Network
Improvisation of The Quality Of Service In ZigBee Cluster Tree Network Trupti Satavse, Vijyalaxmi Kadrolli Information Technology Terna College of Engineering Nerul, Navi-Mumbai, India Trupti1814@gmail.com
More informationA Comparison of General Approaches to Multiprocessor Scheduling
A Comparison of General Approaches to Multiprocessor Scheduling Jing-Chiou Liou AT&T Laboratories Middletown, NJ 0778, USA jing@jolt.mt.att.com Michael A. Palis Department of Computer Science Rutgers University
More informationPerformance of networks containing both MaxNet and SumNet links
Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for
More informationA Network Recovery Scheme for Node or Link Failures using Multiple Routing Configurations
A Network Recovery Scheme for Node or Link Failures using Multiple Routing Configurations Suresh Babu Panatula Department of Computer Science and Engineering Sri Sai Aditya Institute of Science and Technology,
More informationNetwork (Tree) Topology Inference Based on Prüfer Sequence
Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,
More informationComponents: Interconnect Page 1 of 18
Components: Interconnect Page 1 of 18 PE to PE interconnect: The most expensive supercomputer component Possible implementations: FULL INTERCONNECTION: The ideal Usually not attainable Each PE has a direct
More informationA Heuristic Approach to Service Restoration in MPLS Networks
euristic pproach to Service Restoration in MPS Networks Radim artoš and Mythilikanth Raman epartment of omputer Science, University of New ampshire urham, N 3, US. Phone: (3) -379, ax: (3) -393 -mail:
More informationLecture 23: Interconnection Networks. Topics: communication latency, centralized and decentralized switches (Appendix E)
Lecture 23: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Appendix E) 1 Topologies Internet topologies are not very regular they grew incrementally Supercomputers
More informationPEER TO PEER FILE SHARING USING NETWORK CODING
PEER TO PEER FILE SHARING USING NETWORK CODING Ajay Choudhary 1, Nilesh Akhade 2, Aditya Narke 3, Ajit Deshmane 4 Department of Computer Engineering, University of Pune Imperial College of Engineering
More informationInternational Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 3, May-June 2015
RESEARCH ARTICLE OPEN ACCESS Ensuring Reliability and High Availability in Cloud by Employing a Fault Tolerance Enabled Load Balancing Algorithm G.Gayathri [1], N.Prabakaran [2] Department of Computer
More informationMAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS
MAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS 1 M.LAKSHMI, 2 N.LAKSHMI 1 Assitant Professor, Dept.of.Computer science, MCC college.pattukottai. 2 Research Scholar, Dept.of.Computer science, MCC college.pattukottai.
More informationFault Localization in a Software Project using Back- Tracking Principles of Matrix Dependency
Fault Localization in a Software Project using Back- Tracking Principles of Matrix Dependency ABSTRACT Fault identification and testing has always been the most specific concern in the field of software
More informationScalability and Classifications
Scalability and Classifications 1 Types of Parallel Computers MIMD and SIMD classifications shared and distributed memory multicomputers distributed shared memory computers 2 Network Topologies static
More informationDYNAMIC GRAPH ANALYSIS FOR LOAD BALANCING APPLICATIONS
DYNAMIC GRAPH ANALYSIS FOR LOAD BALANCING APPLICATIONS DYNAMIC GRAPH ANALYSIS FOR LOAD BALANCING APPLICATIONS by Belal Ahmad Ibraheem Nwiran Dr. Ali Shatnawi Thesis submitted in partial fulfillment of
More informationAnnotation to the assignments and the solution sheet. Note the following points
Computer rchitecture 2 / dvanced Computer rchitecture Seite: 1 nnotation to the assignments and the solution sheet This is a multiple choice examination, that means: Solution approaches are not assessed
More informationPart 2: Community Detection
Chapter 8: Graph Data Part 2: Community Detection Based on Leskovec, Rajaraman, Ullman 2014: Mining of Massive Datasets Big Data Management and Analytics Outline Community Detection - Social networks -
More informationA Dynamic Programming Approach for Generating N-ary Reflected Gray Code List
A Dynamic Programming Approach for Generating N-ary Reflected Gray Code List Mehmet Kurt 1, Can Atilgan 2, Murat Ersen Berberler 3 1 Izmir University, Department of Mathematics and Computer Science, Izmir
More informationDynamic Congestion-Based Load Balanced Routing in Optical Burst-Switched Networks
Dynamic Congestion-Based Load Balanced Routing in Optical Burst-Switched Networks Guru P.V. Thodime, Vinod M. Vokkarane, and Jason P. Jue The University of Texas at Dallas, Richardson, TX 75083-0688 vgt015000,
More informationMEGA data centers have emerged as infrastructures for
IEEE TRANSACTIONS ON COMPUTERS, VOL. 62, NO. 7, JULY 2013 1303 Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers Deke Guo, Member, IEEE, Tao Chen, Member, IEEE,
More informationAN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION
INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION K.Anusha 1, K.Sudha 2 1 M.Tech Student, Dept of CSE, Aurora's Technological
More informationA ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING IN LEO SATELLITE CONSTELLATION NETWORK. Received September 2012; revised January 2013
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 10, October 2013 pp. 4139 4149 A ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING
More informationGenetic Based Web Cluster Dynamic Load Balancing in Fuzzy Environment
Genetic Based Web Cluster Dynamic Load Balancing in Fuzzy Environment Chin Wen Cheong & V.Ramachandran Faculty of Information Technology MultiMedia University 63100 CyberJaya, Malaysia wencheong1999@hotmail.com
More informationBSPCloud: A Hybrid Programming Library for Cloud Computing *
BSPCloud: A Hybrid Programming Library for Cloud Computing * Xiaodong Liu, Weiqin Tong and Yan Hou Department of Computer Engineering and Science Shanghai University, Shanghai, China liuxiaodongxht@qq.com,
More informationAn Energy Efficient Location Service for Mobile Ad Hoc Networks
An Energ Efficient Location Service for Mobile Ad Hoc Networks Zijian Wang 1, Euphan Bulut 1 and Boleslaw K. Szmanski 1, 1 Department of Computer Science, Rensselaer Poltechnic Institute, Tro, NY 12180
More informationDAG based In-Network Aggregation for Sensor Network Monitoring
DAG based In-Network Aggregation for Sensor Network Monitoring Shinji Motegi, Kiyohito Yoshihara and Hiroki Horiuchi KDDI R&D Laboratories Inc. {motegi, yosshy, hr-horiuchi}@kddilabs.jp Abstract Wireless
More informationGeneralized DCell Structure for Load-Balanced Data Center Networks
Generalized DCell Structure for Load-Balanced Data Center Networks Markus Kliegl, Jason Lee,JunLi, Xinchao Zhang, Chuanxiong Guo,DavidRincón Swarthmore College, Duke University, Fudan University, Shanghai
More informationChapter 12: Multiprocessor Architectures. Lesson 04: Interconnect Networks
Chapter 12: Multiprocessor Architectures Lesson 04: Interconnect Networks Objective To understand different interconnect networks To learn crossbar switch, hypercube, multistage and combining networks
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Experimental
More informationOpnet Based simulation for route redistribution in EIGRP, BGP and OSPF network protocols
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 1, Ver. IV (Jan. 2014), PP 47-52 Opnet Based simulation for route redistribution
More informationAn Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks
An Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks Ayon Chakraborty 1, Swarup Kumar Mitra 2, and M.K. Naskar 3 1 Department of CSE, Jadavpur University, Kolkata, India 2 Department of
More informationIntroduction to Parallel Computing. George Karypis Parallel Programming Platforms
Introduction to Parallel Computing George Karypis Parallel Programming Platforms Elements of a Parallel Computer Hardware Multiple Processors Multiple Memories Interconnection Network System Software Parallel
More informationSIP Service Providers and The Spam Problem
SIP Service Providers and The Spam Problem Y. Rebahi, D. Sisalem Fraunhofer Institut Fokus Kaiserin-Augusta-Allee 1 10589 Berlin, Germany {rebahi, sisalem}@fokus.fraunhofer.de Abstract The Session Initiation
More informationVaralakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
A Survey on P2P File Sharing Systems Using Proximity-aware interest Clustering Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
More informationCHAPTER 6 SECURE PACKET TRANSMISSION IN WIRELESS SENSOR NETWORKS USING DYNAMIC ROUTING TECHNIQUES
CHAPTER 6 SECURE PACKET TRANSMISSION IN WIRELESS SENSOR NETWORKS USING DYNAMIC ROUTING TECHNIQUES 6.1 Introduction The process of dispersive routing provides the required distribution of packets rather
More informationDynamic Load Balancing Algorithms for Distributed Networks
IJCSNS International Journal of Computer Science and Network Security, VOL.14 No.2, February 2014 125 Dynamic Load Balancing Algorithms for Distributed Networks M.Thejovathi M.Tech(CS&E), Jawaharlal Nehru
More informationArchitecture of distributed network processors: specifics of application in information security systems
Architecture of distributed network processors: specifics of application in information security systems V.Zaborovsky, Politechnical University, Sait-Petersburg, Russia vlad@neva.ru 1. Introduction Modern
More informationConsecutive Geographic Multicasting Protocol in Large-Scale Wireless Sensor Networks
21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications Consecutive Geographic Multicasting Protocol in Large-Scale Wireless Sensor Networks Jeongcheol Lee, Euisin
More informationHow To Understand The Network Of A Network
Roles in Networks Roles in Networks Motivation for work: Let topology define network roles. Work by Kleinberg on directed graphs, used topology to define two types of roles: authorities and hubs. (Each
More informationSecured Data Transmissions In Manet Using Neighbor Position Verfication Protocol
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue3 March, 2014 Page No. 5067-5071 Secured Data Transmissions In Manet Using Neighbor Position Verfication
More informationAn Empirical Study and Analysis of the Dynamic Load Balancing Techniques Used in Parallel Computing Systems
An Empirical Study and Analysis of the Dynamic Load Balancing Techniques Used in Parallel Computing Systems Ardhendu Mandal and Subhas Chandra Pal Department of Computer Science and Application, University
More informationLoad Balanced Optical-Network-Unit (ONU) Placement Algorithm in Wireless-Optical Broadband Access Networks
Load Balanced Optical-Network-Unit (ONU Placement Algorithm in Wireless-Optical Broadband Access Networks Bing Li, Yejun Liu, and Lei Guo Abstract With the broadband services increasing, such as video
More informationTechnology, Kolkata, INDIA, pal.sanjaykumar@gmail.com. sssarma2001@yahoo.com
Sanjay Kumar Pal 1 and Samar Sen Sarma 2 1 Department of Computer Science & Applications, NSHM College of Management & Technology, Kolkata, INDIA, pal.sanjaykumar@gmail.com 2 Department of Computer Science
More informationFuzzy Cognitive Map for Software Testing Using Artificial Intelligence Techniques
Fuzzy ognitive Map for Software Testing Using Artificial Intelligence Techniques Deane Larkman 1, Masoud Mohammadian 1, Bala Balachandran 1, Ric Jentzsch 2 1 Faculty of Information Science and Engineering,
More informationStudy of Different Types of Attacks on Multicast in Mobile Ad Hoc Networks
Study of Different Types of Attacks on Multicast in Mobile Ad Hoc Networks Hoang Lan Nguyen and Uyen Trang Nguyen Department of Computer Science and Engineering, York University 47 Keele Street, Toronto,
More informationDistance Degree Sequences for Network Analysis
Universität Konstanz Computer & Information Science Algorithmics Group 15 Mar 2005 based on Palmer, Gibbons, and Faloutsos: ANF A Fast and Scalable Tool for Data Mining in Massive Graphs, SIGKDD 02. Motivation
More informationGenetic Algorithm Based Interconnection Network Topology Optimization Analysis
Genetic Algorithm Based Interconnection Network Topology Optimization Analysis 1 WANG Peng, 2 Wang XueFei, 3 Wu YaMing 1,3 College of Information Engineering, Suihua University, Suihua Heilongjiang, 152061
More informationEXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL
EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL by Pedro Eduardo Villanueva-Pena, Thomas Kunz Carleton University January, 2006 This report examines mechanisms to gradually
More informationPreserving Message Integrity in Dynamic Process Migration
Preserving Message Integrity in Dynamic Process Migration E. Heymann, F. Tinetti, E. Luque Universidad Autónoma de Barcelona Departamento de Informática 8193 - Bellaterra, Barcelona, Spain e-mail: e.heymann@cc.uab.es
More informationFAULT TOLERANCE FOR MULTIPROCESSOR SYSTEMS VIA TIME REDUNDANT TASK SCHEDULING
FAULT TOLERANCE FOR MULTIPROCESSOR SYSTEMS VIA TIME REDUNDANT TASK SCHEDULING Hussain Al-Asaad and Alireza Sarvi Department of Electrical & Computer Engineering University of California Davis, CA, U.S.A.
More informationAn Adaptive Load Balancing to Provide Quality of Service
An Adaptive Load Balancing to Provide Quality of Service 1 Zahra Vali, 2 Massoud Reza Hashemi, 3 Neda Moghim *1, Isfahan University of Technology, Isfahan, Iran 2, Isfahan University of Technology, Isfahan,
More informationA Topology-Aware Relay Lookup Scheme for P2P VoIP System
Int. J. Communications, Network and System Sciences, 2010, 3, 119-125 doi:10.4236/ijcns.2010.32018 Published Online February 2010 (http://www.scirp.org/journal/ijcns/). A Topology-Aware Relay Lookup Scheme
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More information