Theoretical notes on regular graphs as applied to optimal network design

Authors:
Sanket Patil;Srinath Srinivasa
Affiliations:
International Institute of Information Technology, Bangalore, Karnataka, India;International Institute of Information Technology, Bangalore, Karnataka, India
Venue:
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Year:
2010

Citing 7
Cited 0

Hamilton circuits in the directed wrapped Butterfly network

Discrete Applied Mathematics
The impact of DHT routing geometry on resilience and proximity

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Data-centric storage in sensornets with GHT, a geographic hash table

Mobile Networks and Applications
Network robustness and graph topology

ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

IEEE/ACM Transactions on Networking (TON)
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although regular graphs have a long history, some of their properties such as diameter, symmetry, extensibility and resilience do not seem to have received enough attention in the context of network design. The purpose of this paper is to present some interesting theoretical results concerning regular graphs pertinent to optimal network design.