ON BUFFERING IN LOOP COMPUTER NETWORKS.

Norio Shiratori*, Shoichi Noguchi, Juro Oizumi

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    The stationary probability distribution of the number of packets and the mean queue length within the station buffer as well as the mean waiting time for a loop computer network employing dispersed control are derived. Studies are also made of the transmission channel traffic density and station queue lengths when transmission channels are added to the system with provision being made for bilateral transmission and bypassing. Quantitative evaluation is made of the effectiveness of bilateral and bypass transmission in reducing the traffic load on the main loop. In addition, a star system is considered in which the overall number of transmission channels and the number of shortest interstation connecting channels are small. Comparison is made with the case of no bypass and a system having few bypass channels.

    Original languageEnglish
    Title of host publicationSyst Comput Controls
    Pages50-58
    Number of pages9
    Volume7
    Edition3
    Publication statusPublished - 1976 May

    ASJC Scopus subject areas

    • Engineering(all)

    Fingerprint

    Dive into the research topics of 'ON BUFFERING IN LOOP COMPUTER NETWORKS.'. Together they form a unique fingerprint.

    Cite this