On the Addressing Problem of Loop Switching

Abstract

R. L. Graham and H. O. Pollak recently proposed an addressing scheme to J. R. Pierce's Loop Switching Network—a network system which would exploit the one‐way nature of much data transmission. Our paper provides a generalization of the scheme and proposes a new approach to certain unanswered questions.

On Isometric Embeddings of Graphs

“…A number of papers have appeared in the past few years which deal with various properties of graphs that have isometric embeddings in certain metric and semimetric3 spaces (e.g., see [Asl,As2,As3,ADel,ADe2,ADzl,ADz2,Avl,Av2,BGK,Dew,Dezl,Dez2,Dj,F,GP1,GP2,Kl,K2,K3,Y]). …”

Hybrid gridnet :

“…In this example, the three bytes shown are for gateways 1, 2, and 4 of loop Bl of Note that loop Bl is connected to loop A through its gate 3 and as a consequence, no byte in the status report is required for gate 3. In this example, it is assumed that:…”

“…There are four ways by which a gateway station can successfully act to extend a circuit that is being established, depending upon the target circuit destination. connect to its own DTE, 2) place the connection request in the buffer shared with its adjacent foreign loop station, 3) connect to an S circuit, or 4) connect to a T circuit. The gateway station can perform the first two of these actions while it is in secondary station status, but it will normally acquire primary status in order to connect to either an S or a T circuit.…”

Addressing the Petersen graph

“…1. 1 The notion of addressing used here follows that of Graham and Pollak [3], except that they use the symbols 0, 1, * with the asterisk playing the role of our symbol 0. We will find the choice of a, b, 0 to be algebraically convenient in Theorem 1.…”