Routing and Flow Control in TYMNET
- 1 April 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 29 (4) , 392-398
- https://doi.org/10.1109/tcom.1981.1095020
Abstract
TYMNET uses two mechanisms for moving data: a tree structure for supervisory control of the original network and a virtual circuit approach for everything else. Each mechanism is described. The routing and flow control is contrasted with ideal routing and flow control, and also with conventional packet-switched networks. One of the mechanisms described, the virtual circuit as implemented in TYMNET, is compared to the ideal. This mechanism avoids several inefficiencies found in other packet networks. The tree structure is shown to have several problems which increase roughly with the square of the size of the network.Keywords
This publication has 4 references indexed in Scilit:
- On algorithms for finding the k shortest paths in a networkNetworks, 1979
- A performance comparison of labeling algorithms for calculating shortest path treesPublished by National Institute of Standards and Technology (NIST) ,1973
- TYMNETPublished by Association for Computing Machinery (ACM) ,1971
- A note on two problems in connexion with graphsNumerische Mathematik, 1959