Star Local Area Networks: A Performance Study

Kamal, Kamal

doi:10.1109/tc.1987.1676930

Cited by 17 publications

(10 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The average transmission delays in the Broadcast Star, the Token Bus and the Ethernet are compared through an approximate analysis in [13]. The results in [13] confirm the observation made in Fig.…”

Section: Performance Of the Collision Avoidance Single Broadcast (Cassupporting

confidence: 72%

“…In this subsection, we present the performance ofthe Broadcast Star and the CASE Tree through analysis [17,14,13,4], simulations [18,16], and measurements [19,12]. Fig.…”

Section: Performance Of the Collision Avoidance Single Broadcast (Casmentioning

confidence: 99%

“…The CASB Tree allows only a single transmission on the network at a given time, while the CAMB Tree is more general and allows concurrent transmissions on the network. Many researchers have investigated various issues (such as station and switch protocols, switch designs, performance, network implementation) in the Collision Avoidance Tree [1,2,3,4,11,12,13]. An experimental CAMB Tree [12] and a commercial CASB Tree networks are also available [3].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Collision avoidance tree networks

Huang

Suda

1994

Computer Networks and ISDN Systems

View full text Add to dashboard Cite

The Collision Avoidance Tree is a new local area network based on a hardware device called collision avoidance switch, which arbitrates random access to a shared communications channel. Collision Avoid ance Tree combines the benefits of random access (low delay when traffic is light; simple, distributed, and therefore robust, protocols) with concurrency of transmission, excellent network utilization and suitability for the domain of high-speed, optical networking. The Collision Avoidance Tree is classified in two classes: the Collision Avoidance Single Broadcast (CASE) Tree and the Collision Avoidance Multiple Broadcast (CAMB) Tree. The CASE Tree allows only a single transmission on the network at a given time, while the CAMB Tree is more general and allows concurrent transmissions on the network. This paper describes network architectures (e.g., station and switch protocols) and designs and im plementations of the CASE and CAMB Trees. Performance results derived from analyses, simulations, measurements of experimental networks are also presented.

show abstract

Section: Performance Of the Collision Avoidance Single Broadcast (Cassupporting

confidence: 72%

“…In this subsection, we present the performance ofthe Broadcast Star and the CASE Tree through analysis [17,14,13,4], simulations [18,16], and measurements [19,12]. Fig.…”

Section: Performance Of the Collision Avoidance Single Broadcast (Casmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Collision avoidance tree networks

Huang

Suda

1994

Computer Networks and ISDN Systems

View full text Add to dashboard Cite

show abstract

“…It is well known that the Laplacian spectrum of star graph has already been determined, and star networks are one of the most common computer network topologies. Star-related structure of network are widely considered in many fields like the consensus problem and synchronization problem, and so on ( [2,[9][10][11][12][13][14][15]).…”

Section: Introductionmentioning

confidence: 99%

On Consensus of Star-Composed Networks with an Application of Laplacian Spectrum

Huang

Jiang

et al. 2017

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

In this paper, we mainly study the performance of star-composed networks which can achieve consensus. Specifically, we investigate the convergence speed and robustness of the consensus of the networks, which can be measured by the smallest nonzero eigenvalue λ2 of the Laplacian matrix and the H2 norm of the graph, respectively. In particular, we introduce the notion of the corona of two graphs to construct star-composed networks and apply the Laplacian spectrum to discuss the convergence speed and robustness for the communication network. Finally, the performances of the star-composed networks have been compared, and we find that the network in which the centers construct a balanced complete bipartite graph has the most advantages of performance. Our research would provide a new insight into the combination between the field of consensus study and the theory of graph spectra.

show abstract

“…An experimental broadcast star network and its performance measurement are found in [4, 51. Paper [13] models a broadcast star network as a polling system, and develops an approximate analysis assuming that the propagation delay between the stations and the switch is shorter than the packet transmission time. It is also assumed in [13] that the broadcast star operates under asynchronous mode, where transmissions of packets are not confined to the beginning of slots, and stations start transmission any time.…”

Section: Introductionmentioning

confidence: 99%

Performance analysis of a broadcast star local area network with collision avoidance

Kunio

Suda²

Proceedings.,10th International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Packet collisions and their resolution create a performance bottleneck in random access LANs. As a solution to this problem, a broadcast star network with collision avoidance has been proposed and studied in [2 -131. In a broadcast star network, collisions of simultaneously transmitted packets are avoided by means of hardware called a collision avoidance switch. While the channel is being used by one station, the collision avoidance switch blocks other stations from using it. This network implements random access protocols without the penalty of collisions among packets and combines the benefits of random access (low delay when traffic is light; simple, distributed, and therefore robust protocols) with excellent network utilization.In this paper, we analyze the performance of a broadcast star network, assuming synchronous operation of a network. In synchronous operation, the channel time is slotted, and stations transmit only at the beginning of a slot. We obtain the throughput and the distribution of transmission delays. It is also shown through simulations that a broadcast star operating under synchronous mode yields better performance than that operating under asynchronous mode, where transmissions of packets are not confined to the beginning of slots, and stations start transmission any time.

show abstract

Star Local Area Networks: A Performance Study

Cited by 17 publications

References 10 publications

Collision avoidance tree networks

Collision avoidance tree networks

On Consensus of Star-Composed Networks with an Application of Laplacian Spectrum

Performance analysis of a broadcast star local area network with collision avoidance

Contact Info

Product

Resources

About