Frame content independent stripping

ABSTRACT

Token rings have the property that a station that transmits a frame on the ring is responsible for removing the frame after it has been delivered to the destination stations. The algorithm to perform the frame removal is called 'Frame Stripping'. Most existing algorithms strip frames based on their content. This is not always adequate. The need for a new algorithm arises from the fact that frames transmitted by a station need not have the station's own address as the source address for a variety of reasons - such as when a bridge transmits a frame or when another address is used as the source address by a station instead of its original station address. This paper discusses a new frame content independent stripping (FCIS) algorithm for token rings. The FCIS algorithm counts the number of frames transmitted by the station after capturing the token. In addition, the station places a special delimiter frame at the end of the transmission of frames, before releasing the token. The station then strips all received frames until either the number of frames stripped equals the number of frames transmitted or when either the delimiter frame or a token is received. We demonstrate that the FCIS algorithm has a minimal impact on the performance of the ring. We study the robustness of the algorithm to errors and demonstrate that its reliability is as good as the inherent mechanisms of the token ring. The algorithm studied here is very simple to implement and interoperates with other stations not implementing this algorithm. The algorithm places no topological restrictions on the network and has the attractive feature of removing large fragments and no-owner frames.

REFERENCES

• 1: ANSI/~EEE Std. 802.1d "MAC Bridge Specifications," (unapproved draft), PS02.1d/D8, Institute of" Electrical and Electronic Engineers, Match 28, 1989.
• 2: ANS# S#d. 802.5-1989, "Token Ring Access Method and Physical Layer Specifications," Institute of F__.2ectrical and F=2ecttonic Engineers.
• 3: ANS# Draft Appendix to ANSIHEI# Std. 802.5- 1989, "Enhancement for Multiple Ri# Netwoz#", (unapproved draft), PS02.SD/D15 (89/25), Institute of Electrical and Electronic Engineers.
• 4: FDDI Media Access Control, American National Standard, ANSI X3.139-1987.
• 5: Grow, R.M,. "A Timed Token Protocol. for Local A:ea Netwozks," Electro/82, token Access Protocols (I7/.'1), May 1982.
• 6: Hutchison, L," The Role of Concentrators in FDDI Rings," Proceedings of 14th Conference on Locaj Area Networks, October, 1989.
• 7: Jain, R., "E#or Characteristics of FDDL" Digi#L Equipment Corporation DEC-TR-553, June, },988.
• 8: J'oknson, M,J'., "Fairness of Charmel Access for Non-Time- Critical Tra.ffic Using the FDDI Token Ring Protocol." NASA Ames Research Center, Research Institute for Advanced Computer Science (RIACS), RkACS TR 86.9. March, 1986.
• 9: Po#el, J., # "Imernet Protocol Specification", SRI International, Menlo Park. CA, Sept. 198 I. RFC - 79 I.
• 10: Po#el, J'., Ed. "Transmission Control Protocol Specification", SR.I intemationa.t, Menlo Pazk., CA, Sept. 1981. R#C - 793
• 11: Ross, F.E., "FDD!- A Tutorial," # Comrnumcations Magazine, May 1986-voL24, No.5.
• 12: Sevcik, ILC.. Johnson, M.J., "Cycle Time Proper#,es of The FDDI Token Ring Protocol.," University of Toronto. The Computer Systems Research Institute (CSR# Technical Report CSRI-I'}9, April, 1986.
• 13: Stewart, B., Hawe, B., Kisby, A., "Local Area Network Connection," Telecommunications Magazine, April 1984.
• 14: Ulm, 5.M., "A Timed Token Ring Local Area Network and its Performance Characteristics," IEF#, Feb, 198Z.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.5 Local and Wide-Area Networks
          Subjects: Token rings

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Distributed networks

General Terms:
Algorithms, Design, Performance