Message routing in a computer network

Details Message routing in a computer network Message routing in a computer network

1982-02-11

1984-08-14

Zache, Raulfe B.

Boots, shoes, and leggings

G06F 1516

Patent

active

044660600

ABSTRACT:
An adaptive distributed message routing algorithm that may be implemented in a computer program to control the routing of data messages in a packet message switching digital computer network. Network topology information is exchanged only between neighbor nodes in the form of minimum spanning trees, referred to as exclusionary trees. An exclusionary tree is formed by excluding the neighbor node and its links from the tree. From the set of exclusionary trees received a route table and transmitted exclusionary trees are constructed.

REFERENCES:
patent: 4247892 (1981-01-01), Lawrence
patent: 4251861 (1981-02-01), Mago
patent: 4412285 (1983-10-01), Neches et al.
Tajibnapis, W. D., "A Correctness Proof of a Topology Information Maintenance Protocol for a Distributed Computer Network", Communications of the ACM, Jul. 1977, pp. 477-485.
McQuillan, J. M., et al., "An Overview of the New Routing Algorithm for the ARPANET", Proceedings of the Sixth IEEE Data Communications Symposium, Nov. 1979, pp. 63-68.
Rosen, E. C., "The Updating Protocol of ARPANET'S New Routing Algorithm", Computer Networks, 4, 1980, pp. 11-19.

Affiliated with

Also associated with

Rating

Message routing in a computer network does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Message routing in a computer network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message routing in a computer network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-117191