Copyright © 1990 Published by Elsevier Science B.V.
Performance
Performance of a dynamically segmentable ring network
Available online 10 June 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The performance of a dynamically segmentable ring network (R-Segnet) based on the CSMA/CD local area network protocol is studied in this paper. Two routing algorithms for the bidirectional rign are considered. The first transmits a packet in either direction with equal probability while the secons always sends a packet via the shortest path to its destination. Throughput and delay performance comparisons are made against CSMA/CD and against a linear version of this segmentable network (Segnet). These comparisons are conducted for both clustered and nonclustered traffic patterns within the network. The results show that in all cases R-Segnet performs significantly better than conventional CSMA/CD. In the random-destination random-routing case, the performance of R-Segnet is almost similar to that of linear Segnet. When shortest-path routing is used, R-Segnet is shown to be clearly superior. The performance gains are also shown to be shared equitably by all stations in R-Segnet.
Author Keywords: local area networks; CSMA/CD; network performance; dynamically segmentable ring network







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)




