Abstract
A store-and-forward communication network under a maximal message delay criterion is considered. It is shown that the overall channel capacityC and the associated minimal maximal delayγ, as well as the maximal delayγ and the associated minimal overall capacityC, are characterized by a unique Delay-Capacity (γC) product number. The latter is related to a Delay-Capacity product (γC)+ number, uniquely determined solely by the topological structure of the communication network. Basic characteristics of the optimal delay and capacity assignment, a useful algoritm for the calculation of (γC)+ and simple upper and lower bounds on (γC)+, are derived for store-and-forward tree networks. Synthesis considerations and applications to hierarchical communication networks are noted.
Similar content being viewed by others
References
I. Rubin, Communication networks: Message path delays,IEEE Trans. On Information Theory,20, No. 6, (1974), pp. 738–745.
I. Rubin, Message path delays in packet-switching communication networks,IEEE Trans. on Communications,23, No. 2, (1975) pp. 186–192.
I. Rubin, Multiterminal path flows for packet-switching communication networks,Networks, to appear.
I. Rubin, An approximate time-Delay analysis for packet-switching communication networks, IBM Report, RC5202, IBM Thomas J. Watson Research Center, Yorktown-Heights, New York, Jan. 1975.
L. Kleinrock, Scheduling, queueing, and delays in time-shared systems and computer networks, inComputer-Communication Networks, Ed. by N. Abramson and F. F. Kuo, Prentice-Hall, Englewood Cliffs, New Jersey, 1973.
F. Harary,Graph Theory, Addison-Wesley, Reading, Mass., 1971.
Author information
Authors and Affiliations
Additional information
Communicated by A. V. Balakrishnan
This work was supported by the Office of Naval Research under Grant N00014-69-A-0200-4041 and N00014-75-C-0609 and by the National Science Foundation under Grant ENG 75-03224.
Rights and permissions
About this article
Cite this article
Rubin, I. The Delay-Capacity product for store-and-forward communication networks: Tree networks. Appl Math Optim 2, 197–222 (1975). https://doi.org/10.1007/BF01464267
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01464267