Showing papers on "Hazy Sighted Link State Routing Protocol published in 1982"

A Distributed Routing Design for a Broadcast Environment

Abstract: In this paper, we will present the need for distributed network control in a packet radio environment, the criteria used for its evaluation, and an overview of the network algorithms chosen to maintain routing information and to route user traffic The routing algorithm, known as tiered rings, functions by building a distributed tree of shortest path routes to each packet radio in the network The information kept by each node grows only linearly as the network expands The design uses the radio channel efficiently by providing shortest path routing and by taking advantage of the information available in a broadcast environment

Routing of telephone traffic to minimize network blocking

Abstract: The problem of optimum routing of telephone traffic to minimize network blocking is formulated for a class of routing schemes. The necessary conditions for minimum-blocking routing are shown to be analogous to conditions for minimum-delay routing in a store-and-forward data network. A method is described for calculating an optimum routing on the basis of centralized computational for the network. Owing to its computational complexity, however, the method is more useful for off-line studies than for real-time adaptive routing.

A distributed routing protocol for a packet radio network

Abstract: : Packet Radio is a digital communications concept which offers the user the capability to pass voice and other data in a radio network which may link high power computers with small mobile radios containing microprocessors. The technique of routing digital traffic from source to destination depends on the operational requirements of the network. Most routing concepts today centralize network control (in varying degrees) for normal operations.