Filters








7,545 Hits in 8.6 sec

Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables [chapter]

Koichi Wada, Wei Chen
2000 Lecture Notes in Computer Science  
We study the problem of designing fault-tolerant routings with small routing tables for a k-connected network of n processors in the surviving route graph model. The surviving route graph R (G, ρ)  ...  We can construct (2, 1)tolerant edge-routing on G with O(n √ n) routes and route degree O( √ n). Concluding Remarks We have shown two optimal edge-routings with smaller routing tables.  ...  Optimal Routing for k-Connected Graphs In this section, we show that for n-node k-connected graphs with n ≥ 2k 2 , we can construct a (3, k − 1)-tolerant bidirectional edge-routing λ such that the route  ... 
doi:10.1007/3-540-40064-8_28 fatcat:qxwvurh4pfhmxfx62lwuja6oze

Optimal fault-tolerant routings with small routing tables for k-connected graphs

Koichi Wada, Wei Chen
2004 Journal of Discrete Algorithms  
We study the problem of designing fault-tolerant routings with small routing tables for a kconnected network of n processors in the surviving route graph model. The surviving route graph R (G, ρ)  ...  Takahiro Honda for their useful discussion.  ...  This research is supported in part by Research Foundation for the Electrotechnology of Chubu(R-11138) and a Scientific Research Grant-In-Aid from the Ministry of Education, Science and Culture, Japan,  ... 
doi:10.1016/j.jda.2004.04.009 fatcat:3cu6wpw5draodibcpamzlkasuu

Fault-Tolerant Secure Routing Based on Trust Evaluation Model in Data Center Networks

Ningning Liu, Weibei Fan, Jianxi Fan, Hui Zheng, Xingsi Xue
2022 Security and Communication Networks  
However, the routing algorithms proposed earlier for graphs cannot be applied to all topological graphs.  ...  Based on the comprehensive interactive trust evaluation network security model, this study analyzes the advantages and disadvantages of relevant algorithms and proposes a fault-tolerant routing algorithm  ...  Optimizing a fault-tolerant routing algorithm is an effective method at present.  ... 
doi:10.1155/2022/9339515 fatcat:uy3inxkburbjdhemgdq6pqr5qi

Optical quorum cycles for efficient communication

Cory J. Kleinheksel, Arun K. Somani
2015 Photonic network communications  
Many optical networks face heterogeneous communication requests requiring topologies to be efficient and fault tolerant.  ...  With this new method of topology construction, unicast and multicast communication requests do not need to be known or even modeled a priori.  ...  David Lastine for his thoughtful discussion and his contributions and results presented in a conference paper [3] that are adapted in our presentation in Sections 5.2.1, 5.2.2, 6, and 7.  ... 
doi:10.1007/s11107-015-0561-8 fatcat:zowue4iruffcdes4rx4dw5a3xe

Graph-theoretic analysis of structured peer-to-peer systems

Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh
2003 Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '03  
Since generalized de Bruijn graphs possess very short average routing distances and high resilience to node failure, they are well suited for structured peer-to-peer networks.  ...  Having confirmed that de Bruijn graphs offer the best diameter and highest connectivity among the existing peer-to-peer structures, we offer a very simple incremental building process that preserves optimal  ...  Fault Tolerance of DHTs Fault tolerance of peer-to-peer networks is an equally important topic. Liben-Nowell et al.  ... 
doi:10.1145/863955.863999 dblp:conf/sigcomm/LoguinovKRG03 fatcat:yuvgtuupnnfajo2ddxn6ijzlhe

Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks

Hossein Habibian, Ahmad Patooghy
2017 Journal of Supercomputing  
A cube-connected-cycles (CCC) is a regular graph, suitable for constructing the interconnection network of parallel or multi-node computer systems.  ...  To make a CCC-based parallel computer more resilient to node/link faults, this paper proposes an optimal routing method that guarantees to find a shortest path between the source and the destination nodes  ...  Fig. 1 . 1 Structure of a CCC graph. Fig. 2 .Fig. 3 . 23 A CCC network with two faulty nodes in dark color and one broken link depicted as a dashed line. Contents of the routing table.  ... 
doi:10.1007/s11227-017-2033-7 fatcat:b67vfjz6nbbwplle3egywa6nra

Paths to stardom

Mihai Lupu, Beng Chin Ooi, Y. C. Tay
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
We conduct a comprehensive graph-theoretic analysis from the point of view of PDMS and identify the necessary conditions for a graph to be considered a potential network structure for a PDMS.  ...  We complement our analytical study with extensive experimental results and identify three measures that provide significant information about the potential of a [Cayley] graph to support the requirements  ...  The authors would also like to thank Quang Hieu Vu and Cristina David for their help in running parts of the experiments and for their valuable comments regarding this work.  ... 
doi:10.1145/1376616.1376646 dblp:conf/sigmod/LupuOT08 fatcat:gthrnriofbe6pdtj6ykipujpv4

Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

D. Loguinov, J. Casas, Xiaoming Wang
2005 IEEE/ACM Transactions on Networking  
Since generalized de Bruijn graphs possess very short average routing distances and high resilience to node failure, they are well suited for structured peer-to-peer networks.  ...  Having confirmed that de Bruijn graphs offer the best diameter and highest connectivity among the existing peerto-peer structures, we offer a very simple incremental building process that preserves optimal  ...  DE BRUIJN GRAPHS A. Motivation One of the goals of this work is to build a distributed hash table (DHT) on top of fixed-degree graphs with provably optimal routing diameter.  ... 
doi:10.1109/tnet.2005.857072 fatcat:z5omeotcfffnlg2i2uycvldesa

A Vascular-Network-Based Nonuniform Hierarchical Fault-Tolerant Routing Algorithm for Wireless Sensor Networks

Hongbing Li, Peng Gao, Qingyu Xiong, Weiren Shi, Qiang Chen
2012 International Journal of Distributed Sensor Networks  
According to the distribution characteristics of the vascular network and inspirations to the fault tolerance for wireless sensor networks, a mathematical model and network topology are, respectively,  ...  Aiming at the issue that the nodes' failures affect the network's stability and service quality, a vascular-network-based fault-tolerant routing algorithm is presented by nonuniform hierarchical clustering  ...  Hu et al. present a hybrid routing scheme and an immune cooperative PSO algorithm for fault-tolerant routing problem [21] .  ... 
doi:10.1155/2012/981380 fatcat:42ln2govvzfqplnvz4vgevrqmq

Fault Tolerant (N, K)-Star Power Network Topology For Multi-Agent Communication In Automated Power Distribution Systems

Ning Gong, Michael Korostelev, Qiangguo Ren, Li Bai, Saroj Biswas, Frank Ferrese
2015 Zenodo  
The conclusion is reached that (n,k)-star topology model has measurable advantages compared to standard bus power systems while exhibiting fault tolerance properties in power restoration, as well as showing  ...  Fault tolerance is becoming an important challenge in the design processes of the distributed power system topology.  ...  ACKNOWLEDGMENT The authors would like to acknowledge ONR for funding this work.  ... 
doi:10.5281/zenodo.1337824 fatcat:gblp6gyvjjhqfebxh3j7ngx7vu

AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH

CHIAO-WEI CHIU, KUO-SI HUANG, CHANG-BIAU YANG, CHIOU-TING TSENG
2014 International Journal of Foundations of Computer Science  
This paper focuses on the design of the fault-tolerant routing algorithm for the (n, k)-star graph.  ...  We adopt the idea of collecting the limited global information used for routing on the n-star graph to the (n, k)-star graph.  ...  The distance of two nodes in a fault-free S n,k is Fault-Tolerant Routing with Safety Vector on S n,k 729 Table 1 . The comparison of Sn and S n,k .  ... 
doi:10.1142/s0129054114500300 fatcat:iaepnsjvtrg35n5h7gj4sd5vza

A Fault-tolerant Improved OLSR Protocol using k-Connected m-Dominating Set

Vinayagam P. S.
2017 International Journal of Computer Network and Information Security  
To overcome this, k-Connected m-Dominating CDS (kmCDS) could be used to construct fault-tolerant virtual backbone structure.  ...  In this direction, the present paper proposes a Fault-Tolerant Improved Optimized Link State Routing (FT-IOLSR) protocol that uses kmCDS to form fault-tolerant virtual backbone, effectively replacing the  ...  In this direction, the present paper proposes Fault-Tolerant Optimized Link State Routing (FT-IOLSR) protocol that uses kmCDS to construct fault-tolerant virtual backbone, effectively replacing MPR set  ... 
doi:10.5815/ijcnis.2017.12.07 fatcat:6tn2gfgkbnclna4fc4l7qumxdq

A Fault-Tolerant Multipoint Cycle Routing Algorithm (MCRA) [chapter]

David Lastine, Suresh Sankaran, Arun K. Somani
2012 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
In this paper we propose a new efficient fault tolerant multipoint routing algorithm for optical networks.  ...  We also provide an ILP formulation for routing multipoint request and compare its results with the output of our best heuristic algorithm.  ...  Consider implementing a fault tolerant multicast connection as a set of fault tolerant unicast connections.  ... 
doi:10.1007/978-3-642-30376-0_23 fatcat:wrve7xe23jctxolna7ceo4ibde

Dcell

Chuanxiong Guo, Haitao Wu, Kun Tan, Lei Shi, Yongguang Zhang, Songwu Lu
2008 Proceedings of the ACM SIGCOMM 2008 conference on Data communication - SIGCOMM '08  
DCell is fault tolerant since it does not have single point of failure and its distributed fault-tolerant routing protocol performs near shortest-path routing even in the presence of severe link or node  ...  DCell is a recursively defined structure, in which a high-level DCell is constructed from many low-level DCells and DCells at the same level are fully connected with one another.  ...  , the members of the Wireless and Networking Group of Microsoft Research Asia for their early feedback, Frans Kaashoek and the anonymous reviewers for their valuable suggestions that help to improve the  ... 
doi:10.1145/1402958.1402968 dblp:conf/sigcomm/GuoWTSZL08 fatcat:536ysqcnsfav3a2x6wkys3twmy

Dcell

Chuanxiong Guo, Haitao Wu, Kun Tan, Lei Shi, Yongguang Zhang, Songwu Lu
2008 Computer communication review  
DCell is fault tolerant since it does not have single point of failure and its distributed fault-tolerant routing protocol performs near shortest-path routing even in the presence of severe link or node  ...  DCell is a recursively defined structure, in which a high-level DCell is constructed from many low-level DCells and DCells at the same level are fully connected with one another.  ...  , the members of the Wireless and Networking Group of Microsoft Research Asia for their early feedback, Frans Kaashoek and the anonymous reviewers for their valuable suggestions that help to improve the  ... 
doi:10.1145/1402946.1402968 fatcat:ume2k3o5nngq3bopkmv5ze66wa
« Previous Showing results 1 — 15 out of 7,545 results