Browse Prior Art Database

Synchronous Token Ring Protocol With Minimum Bandwidth Consumption

IP.com Disclosure Number: IPCOM000062510D
Original Publication Date: 1986-Dec-01
Included in the Prior Art Database: 2005-Mar-09
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Bux, W: AUTHOR

Abstract

This article is concerned with a token ring protocol which allows the transmission of synchronous information with minimum bandwidth consumption. In known token ring systems providing priority tokens at regular intervals for transmission of synchronous information in slotted frames, each such frame must circulate twice and is empty when issued from the synchronous bandwidth manager (SBM), and when returning to it. The invention suggests how to avoid the waste of bandwidth in this procedure. Each slotted frame for synchronous information circulates only once, and is then buffered in the SBM instead of being discarded. When a new slotted synchronous frame is to be released at the beginning of the next synchronous period, the SBM releases the buffered frame which carries on the information in it to the respective destinations.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 60% of the total text.

Page 1 of 1

Synchronous Token Ring Protocol With Minimum Bandwidth Consumption

This article is concerned with a token ring protocol which allows the transmission of synchronous information with minimum bandwidth consumption. In known token ring systems providing priority tokens at regular intervals for transmission of synchronous information in slotted frames, each such frame must circulate twice and is empty when issued from the synchronous bandwidth manager (SBM), and when returning to it. The invention suggests how to avoid the waste of bandwidth in this procedure. Each slotted frame for synchronous information circulates only once, and is then buffered in the SBM instead of being discarded. When a new slotted synchronous frame is to be released at the beginning of the next synchronous period, the SBM releases the buffered frame which carries on the information in it to the respective destinations. Thus, no empty slots ever occur on the ring, and only half of the time is required for synchronous information transfer because the number of slotted frames is reduced from two to one per synchronous period. In detail, the operation is as follows: Assume that a connection exists between two stations A and B, and that each frame issued by the SBM first passes A and then B before returning to the SBM. At the beginning of epoch n, the SBM issues a synchronous frame containing buffered information of epoch n-1. When station A receives the frame, it copies the information destined f...