Optimal broadcasting on incomplete star graph interconnection networks

Chen, Tzung-Shi; Wang, Nen-Chung

doi:10.1016/j.sysarc.2004.10.003

Cited by 6 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, star graphs can be extended in such a way that, first, it accommodates any number of vertices. In the literature, there are several approaches to extend the definition of the star graph in such a way that it can accommodate any number of vertices . Second, the degree of each vertex is bounded by

\frac{2 lnN}{lnlnN} (1 + o (1))

, where N denotes the number of vertices in a graph.…”

Section: Star Graphsmentioning

confidence: 99%

An optimal inherently stabilizing routing algorithm for star P2P overlay networks

Karaata

Alsulaiman

2016

Concurrency and Computation

View full text Add to dashboard Cite

Summary Star graphs possess many desirable properties such as scalable node degrees and diameters, which are essential to facilitate reduced routing table sizes and low maximum path length for routing in large P2P networks. In addition, because a large number of disjoint paths are available and each data/replica in an n‐star can be placed in an (n − 1)‐star, load balancing and alleviation of network bottlenecks can be implemented in star P2P overlay networks. Therefore, star networks have been proposed as viable alternatives to existing overlay topologies for large P2P networks. In this paper, we propose an optimal stabilizing and inherently stabilizing algorithm for routing messages over all disjoint paths between two peers in a star P2P overlay network. The algorithm is optimal in terms of its time complexity in rounds and the length of the longest path traversed by the messages, and fault tolerant due to being stabilizing and inherently stabilizing, allowing the system to withstand transient faults. The algorithm can be used to increase network reliability and survivability in P2P networks. In addition, the usage of all disjoint paths to route messages between two peers leads to increased network bandwidth while distributing the communication overhead across the network and eliminating network bottlenecks in P2P networks. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

\frac{2 lnN}{lnlnN} (1 + o (1))

, where N denotes the number of vertices in a graph.…”

Section: Star Graphsmentioning

confidence: 99%

An optimal inherently stabilizing routing algorithm for star P2P overlay networks

Karaata

Alsulaiman

2016

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Broadcasting and multicasting on star graph interconnection networks has been discussed in [6,9,31,32].…”

Section: Broadcastmentioning

confidence: 99%

Properties of a hierarchical network based on the star graph

Imani

Sarbazi-Azad

2010

Information Sciences

View full text Add to dashboard Cite

“…The problem of embedding spanning trees in the star interconnection network has been addressed in [6,7,18]. These spanning trees where mostly used as broadcast trees in the network.…”

Section: Different Tree Structuresmentioning

confidence: 99%

Perfect load balancing on the star interconnection network

2007

View full text Add to dashboard Cite

In this paper, we use the regular distribution method to design a perfect load balancing algorithm for an n-star with a maximum error of 1 and a time complexity of 3n(n + 1). This algorithm is based on the novel notion of leader trees. A second algorithm proposed in this paper as an enhancement to our first algorithm and uses an arbitrary spanning tree as the leader tree and has a worst time complexity of 2.25n 2 − 3n + 0.75. We also discuss the issue of dynamically selecting the leader tree and hybrid load balancing algorithms in general. Furthermore, we present a hybrid algorithm for load balancing on the star interconnection network which benefits from a diffusion load balancing preprocessing phase and shows a smaller mean time complexity than our two first algorithms.

show abstract

Optimal broadcasting on incomplete star graph interconnection networks

Cited by 6 publications

References 20 publications

An optimal inherently stabilizing routing algorithm for star P2P overlay networks

An optimal inherently stabilizing routing algorithm for star P2P overlay networks

Properties of a hierarchical network based on the star graph

Perfect load balancing on the star interconnection network

Contact Info

Product

Resources

About