ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Communications
Volume 13, Issue 6, July-August 1990, Pages 331-336
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (543 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0140-3664(90)90055-L    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1990 Published by Elsevier Science B.V.

Performance

Performance of a dynamically segmentable ring network

WC Wong, KM Lye and CC Ko

Department of Electrical Engineering, National University of Singapore, 10, Kent Ridge Crescent, Singapore 0511

Available online 10 June 2003.

Purchase the full-text article



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

Article Outline

• References

Computer Communications
Volume 13, Issue 6, July-August 1990, Pages 331-336
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.