Showing papers on "Routing protocol published in 1974"
TL;DR: A protocol that supports the sharing of resources that exist in different packet switching networks is presented and provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process- to-process connections.
Abstract: A protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process-to-process connections. Some implementation issues are considered, and problems such as internetwork routing, accounting, and timeouts are exposed.
802 citations
TL;DR: The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.
Abstract: The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.
226 citations
01 Jan 1974
TL;DR: The NETCHANGE Protocol as discussed by the authors is based on Baran's Hot Potato Heuristic Routing Doctrine and has been implemented on the MERIT Computer Network and its correctness has been proved.
Abstract: In order for the nodes of a distributed computer network to communicate, each node must have information about the network's topology. Since nodes and links sometimes crash, a scheme is needed to update this information. One of the major constraints on such a scheme is that it may not involve a central controller. In this report a straightforward scheme involving adjacency matrices and a broadcast scheme are discussed and their inadequacies described. The NETCHANGE Protocol which is based on Baran's “Hot Potato Heuristic Routing Doctrine,” is presented. This system has been implemented on the MERIT Computer Network and its correctness has been proved. We end by showing how the NETCHANGE Protocol can be modified into a shortest path algorithm.
2 citations
TL;DR: This paper describes the construction of a mathematical model and the results of its use in planning the pattern of routing in a national, complex distribution network; the model's particular feature being its ability to balance return loads on routes where two-way flow is possible.
Abstract: This paper describes the construction of a mathematical model and the results of its use in planning the pattern of routing in a national, complex distribution network; the model's particular feature being its ability to balance return loads on routes where two-way flow is possible.
2 citations