2023Unpublished venueRequires access

Reliability and Packet Transfer Efficiency of Sparkle Topologies

Abhishek Joshi, V. Subedha

Open publisher page 0 citations

Abstract

Distributed computing through topology control involves making changes to the underlying network (modeled as a graph) to decrease the cost of distributed algorithms when executed across the modified networks. Topology construction builds reduced topology and topology maintenance adopts the reduced topology when the current topology is no longer optimal. This study makes major contributions to topology control by constructing new topologies named sparkle topologies using a ring topology, structured web topology, sun topology, and star topology. The efficiency of the sparkle topologies is checked by calculating the reliability using Wiener Index and data transfer using Cisco packet simulation. Data transmission times, the number of hops required, and the number of potential failure points are all reduced in sparkle topologies compared to ring topologies.

About this research paper

What this paper is about

Distributed computing through topology control involves making changes to the underlying network (modeled as a graph) to decrease the cost of distributed algorithms when executed across the modified networks. Topology construction builds reduced topology and topology maintenance adopts the reduced topology when the current topology is no longer optimal. This study makes major contributions to topology control by constructing new topologies named sparkle topologies using a ring topology, structured web topology, sun topology, and star topology. The efficiency of the sparkle topologies is checked by calculating the reliability using Wiener Index and data transfer using Cisco packet simulation. Data transmission times, the number of hops required, and the number of potential failure points are all reduced in sparkle topologies compared to ring topologies.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Distributed computing through topology control involves making changes to the underlying network (modeled as a graph) to decrease the cost of distributed algorithms when executed across the modified networks. Topology construction builds reduced topology and topology maintenance adopts the reduced topology when the current topology is no longer optimal. This study makes major contributions to topology control by constructing new topologies named sparkle topologies using a ring topology, structured web topology, sun topology, and star topology. The efficiency of the sparkle topologies is checked by calculating the reliability using Wiener Index and data transfer using Cisco packet simulation. Data transmission times, the number of hops required, and the number of potential failure points are all reduced in sparkle topologies compared to ring topologies.

Key concepts: Network topology, Topology (electrical circuits), Logical topology, Ring network, Comparison of topologies, Computer science, Extension topology, Computer network

Related papers

Back to paper searchBrowse research topicsOriginal source
Reliability and Packet Transfer Efficiency of Sparkle Topologies — Research Paper | ScholarLens