scispace - formally typeset
Search or ask a question

Showing papers on "Wireless Routing Protocol published in 1985"


Journal ArticleDOI
TL;DR: In this article, the authors focus on fault location procedures suitable for use in networks that use distributed routing control through the use of routing tags and message transmission protocols and present a logical superset to those of the centralized control systems (where message routing is dictated by the actions of a global control unit).
Abstract: One class of networks suitable for use in parallel processing systems is the multistage cube network. The authors focus on fault location procedures suitable for use in networks that use distributed routing control through the use of routing tags and message transmission protocols. Faults occurring in the data lines can corrupt message routing tags transmitted over them and thereby cause misrouting of messages. Protocol lines (used in handshaking between network sources and destinations), if faulty, can prevent a message path from being established or can cause the path to `lock up' once transmission of data has begun. These faults have more pronounced effects on the network performance than faults previously considered for centralized routing control systems. The single-fault location procedures presented form a logical superset to those of the centralized control systems (where message routing is dictated by the actions of a global control unit) and can be adapted for use in both circuit and packet switching networks.

31 citations



Journal ArticleDOI
01 Jul 1985
TL;DR: A routing protocol is developed that achieves load sharing and combines the strengths of both virtual circuit and datagram networks and a characterization and a survey of multiple path routing in computer networks are presented.
Abstract: This paper presents a characterization and a survey of multiple path routing in computer networks. It also develops a routing protocol that achieves load sharing and combines the strengths of both virtual circuit and datagram networks.

10 citations


Proceedings ArticleDOI
01 Oct 1985
TL;DR: The design philosophy and functional characteristics of the EISN testbed are presented, and a series of routing and control experiments is described, as well as some additional experiments in voice/data integration using the Transmission Control Protocol (TCP) for the data transfers.
Abstract: The Experimental Integrated Switched Network (EISN) was set up to develop and experimentally evaluate new routing and control techniques potentially applicable in the Defense Switched Network, focusing on the new routing and preemption algorithms described in the companion paper [1]. Significant achievements in the EISN effort include establishment of a geographically distributed telecommunications testbed, featuring common channel signalling (CCS), multi-media trunking, and off-the-shelf digital switches with programmable out-board Routing/Control Processors (RCPs). Selected new algorithms have been evaluated in the form of actual implementations on the testbed. A preliminary description of the EISN testbed, its components, and its objectives was given at MILCOM '83 [2], along with earlier steady-state analysis results on the new adaptive routing algorithms. This paper focuses primarily on the EISN testbed as it is now implemented. The design philosophy and functional characteristics of the testbed are presented, and a series of routing and control experiments is described, as well as some additional experiments in voice/data integration using the Transmission Control Protocol (TCP) for the data transfers. The routing experiments are aimed at validating the logic and the CCS protocols developed for the new routing and preemption algorithms described in the companion paper.

2 citations



Book ChapterDOI
01 Jan 1985
TL;DR: This paper focuses on adaptive routing for radio networks of mobile nodes and two algorithms are proposed and their performance is evaluated and compared to that of flooding.
Abstract: After a brief review of the field of routing algorithms for communication networks this paper focuses on adaptive routing for radio networks of mobile nodes. Two algorithms are proposed and their performance is evaluated and compared to that of flooding.