Journal ArticleDOI
SNA routing: past, present, and possible future
Reads0
Chats0
TLDR
This paper reviews the evolution of routing mechanisms in IBM's Systems Network Architecture since its inception in 1974 to the present and possible evolutionary paths that may be taken in the future to address the problems of large heterogeneous networks.Abstract:
This paper reviews the evolution of routing mechanisms in IBM's Systems Network Architecture (SNA) since its inception in 1974 to the present. Routing mechanisms are related to changes in the application and communications environment. Also discussed are possible evolutionary paths that may be taken in the future to address the problems of large heterogeneous networks.read more
Citations
More filters
A Framework for QoS-based Routing in the Internet
TL;DR: In this article, the authors describe some of the QoS-based routing issues and requirements, and propose a framework for QoSbased routing in the internet, which does not specify an Internet standard of any kind.
Proceedings ArticleDOI
Choice of allocation granularity in multipath source routing schemes
TL;DR: It is observed that as the burstiness of the arrival process increases, the per-packet allocation is able to accommodate bursts in a more graceful fashion, resulting in better performance and a more equitable distribution of network resources.
Proceedings ArticleDOI
An efficient multipath forwarding method
TL;DR: It is demonstrated that for multipath sets that are suffix matched, forwarding can be efficiently implemented with (1) a per packet overhead of a small, fixed-length path identifier, and (2) router space overhead linear in K, the number of alternate paths between a source and a destination.
Journal ArticleDOI
SNA Networks of Small Systems
TL;DR: SNA/LEN is discussed, a possible extension of Systems Network Architecture intended to allow peer, dynamic, and easy to use networking functions for a variety of node sizes down to and including the new generation of personal computers.
Patent
Digital data message transmission networks and the establishing of communication paths therein
Frank W. Brice,R. A. Weingarten +1 more
TL;DR: In this article, a digital data message transmission network of interconnected network elements (12,14,16,18,20, 32,34,36,40,44) maintains topology data bases (112) recording the potentially available communication routes through the network and the status of the network elements thereof, each node originating a message interrogating base to ascertain a suitable route; when connected into a route, whether completed or not, recording the adjacent elements; when detecting the failure of any next adjacent link or node sending a ROUTE FAILURE MESSAGE to the
References
More filters
Journal ArticleDOI
The New Routing Algorithm for the ARPANET
TL;DR: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations.
Journal ArticleDOI
A Responsive Distributed Routing Algorithm for Computer Networks
TL;DR: A new distributed algorithm is presented for dynamically determining weighted shortest paths used for message routing in computer networks that the paths defined do not form transient loops when weights change and the number of steps required to find new shortest paths when network links fail is less than for previous algorithms.
Journal ArticleDOI
A Review of the Development and Performance of the ARPANET Routing Algorithm
TL;DR: This paper presents a comprehensive review of the ARPANET routing algorithm, from its original implementation to the authors' plans for future modifications, and describes in detail subsequent modifications and the actual implementation currently in use.
Journal ArticleDOI
A correctness proof of a topology information maintenance protocol for a distributed computer network
TL;DR: The Topology Information Protocol that was implemented on the MERIT Computer Network is presented and explained; this protocol is quite general and could be implemented on any computer network.
Journal ArticleDOI
Routing and flow control in systems network architecture
TL;DR: The adaptive trafic-pacing "window" size algorithm that is the basis of the global flow control in SNA is described and described, which helps to avoid congestion at both the local and global levels.
Related Papers (5)
Performance analysis of asymmetric packet switch modules with channel grouping
Soung Chang Liew,K.W. Lu +1 more