INFORMATION TRANSMISSION CHARACTERISTICS OF LADDER TYPE COMPUTER NETWORKS.

Norio Shiratori, Shoichi Noguchi

    Research output: Contribution to journalArticle

    Abstract

    A systematic algorithm is given for determining the traffic density of the transmission path for the case of fixed path selection in a ladder type computer network. The algorithm is then used to examine the effect of inserting a bypass into a system in the case of parallel and crossing types, indicating its effectiveness. It is shown that the effect varies with the direction of transmission of the inserted bypass. It is also shown that a ladder type computer network in which the main loop employs bilateral transmission can be considered as being decomposed into ladder type computer networks with main loops employing unilateral transmission in opposite directions by controlling the packet routing.

    Original languageEnglish
    Pages (from-to)54-61
    Number of pages8
    JournalSystems, computers, controls
    Volume9
    Issue number1
    Publication statusPublished - 1978 Jan

    ASJC Scopus subject areas

    • Engineering(all)

    Fingerprint Dive into the research topics of 'INFORMATION TRANSMISSION CHARACTERISTICS OF LADDER TYPE COMPUTER NETWORKS.'. Together they form a unique fingerprint.

  • Cite this