Abstract
This article provides an overview of doubly linked networks. We first classify the doubly linked network on the basis of the number of tuples used to represent each node address in the network. Then, each subclass of network is further partitioned into loop or nonloop categories. Various routing algorithms are studied and grouped into static or adaptive routing type, based on the number of paths between nodes used in the point-to-point message transmission. The useful protocols of the token ring and the register insertion ring and their relative advantages are also described. Some issues, such as multiple destinations routing, graceful degradation on cluster faults, and network behavior under unbalanced traffic conditions, in a doubly linked network are still open. There seems to be a need for new protocols when optical fiber is used as the medium for message transmission, which necessitates high-quality and large bandwidth data transmission. © 1996 John Wiley & Sons, Inc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
