Skip to search formSkip to main contentSkip to account menu

Star network

Known as: Star toplogy, Star topology 
Star networks are one of the most common computer network topologies. In its simplest form, a star network consists of one central node, typically a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations
Circular layoutCompactPCI SerialEdge coloringFailing badly

Broader (1)

Network topology

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Maximizing data gathering capacity of wireless sensor networks using mobile relays
Recently, the availability of numerous low-cost robotic units (e.g., Packbot, Robomote, and Khepera) has made it possible to… 
2010
2010
ATCA/xTCA-based hardware for control and data acquisition on Nuclear Fusion fast control plant systems
In contemporary control and data acquisition systems for Nuclear Fusion devices, the galloping need for high channel density and… 
2009
2009
Surveillance of robots using multiple colour or depth cameras with distributed processing
We introduce a general approach for surveillance of robots using depth images of multiple distributed smart cameras which can be… 
2008
2008
Hybrid Particle Swarm Optimiser using multi-neighborhood topologies
Hybrid Particle Swarm Optimization (PSO) algorithm that combines the idea of global best model with the idea of local best model… 
Highly Cited
2007
Highly Cited
2007
Differential Evolution Based Particle Swarm Optimization
A new, almost parameter-free optimization algorithm is developed in this paper as a hybrid of the barebones particle swarm… 
2007
2007
SecureRank: A Risk-Based Vulnerability Management Scheme for Computing Infrastructures
In this paper, we introduce a new scheme called SecureRank for prioritizing vulnerabilities to patch in computing systems… 
2000
2000
Parallel Processor Configuration Design with Processing/Transmission Costs
A computer configuration design problem where the objective is to configure a parallel processor to do processing in a cost… 
1996
1996
Graph learning with a nearest neighbor approach
In this paper, we study how to traverse all edges of an unknown graph G = (V;E) that is bi-directed and strongly connected. This… 
1989
1989
Designing optimal fault-tolerant star networks
The advance in VLSI technology and the continuing decline in the cost of computer hardware have made the construction of complex… 
1987
1987
Comments on "Throughput Analysis for Persistent CSMA Systems"
We present a brief and simple analysis of asynchronous (unslotted) 1-Persistent CSMA protocols in the worst-case star topology… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)