Please use this identifier to cite or link to this item:
Title: Performance of a dynamically segmentable ring network
Authors: Wong, W. 
Lye, K. 
Ko, C. 
Keywords: CSMA/CD
dynamically segmentable ring network
local area networks
network performance
Issue Date: Jul-1990
Citation: Wong, W.,Lye, K.,Ko, C. (1990-07). Performance of a dynamically segmentable ring network. Computer Communications 13 (6) : 331-336. ScholarBank@NUS Repository.
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. © 1990.
Source Title: Computer Communications
ISSN: 01403664
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jan 27, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.