Routing Procedures in Communications Networks-Part II: Directory Procedures

This part of the report on routing procedures is devoted to procedures involving no random choices. Estimates of the average traverse time of each message and average traffic flow through each node are derived by statistical methods and compared with the corresponding results obtained in Part I for...

Full description

Saved in:
Bibliographic Details
Published inI.R.E. transactions on communications systems Vol. 10; no. 4; pp. 329 - 335
Main Author Prosser, R.
Format Journal Article
LanguageEnglish
Published 01.12.1962
Subjects
Bibliographies
Large-scale systems
Mathematics
Queueing analysis
Relays
Routing
Statistical analysis
Telecommunication traffic
Telephony
Traffic control
Online AccessGet full text

Cover

More Information
Summary:This part of the report on routing procedures is devoted to procedures involving no random choices. Estimates of the average traverse time of each message and average traffic flow through each node are derived by statistical methods and compared with the corresponding results obtained in Part I for routing procedures based on random choices. These estimates are verified by means of a large-scale simulation experiment. The overwhelming advantages of directory procedures in efficiency and capacity of operation are expressed quantitatively by these results. The disadvantages of directory procedures are also investigated. Principal among these are the necessity of determining optimal routes from directory information and maintaining the directories in the presence of a hostile or fluid environment. Estimates of the degradation characteristics of such procedures are obtained under various assumptions on the effects of the environment. The final section presents a summary and conclusions.
ISSN:0096-2244
2162-2132
DOI:10.1109/TCOM.1962.1088692