Construct optimal diameter network and d-partition routing algorithm

Authors:
Qiang Ding;Ke Xu;Hui-shan Liu
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, P.R.China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R.China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R.China
Venue:
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 4
Cited 0

Minimum diameter of diregular digraphs of degree 2

The Computer Journal
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the topological structure of network using graph-theoretical properties and proposes a topology constructionmethod of regular directed graphs (or digraphs). The diameter of the topological digraph is ⌈logdn⌉. In this paper, we also propose a routing algorithm based thistopological structure and find its complexity is O(⌈logdn⌉).This algorithm has a smaller diameter and easier to construct than the existing algorithms, which can be used of downloading files and defending worms in structured peer-to-peer systems.