Multiterminal Path Flows for Packet‐Switching Communication Networks
- 1 July 1975
- Vol. 5 (3) , 205-236
- https://doi.org/10.1002/net.1975.5.3.205
Abstract
A communication network is modeled by a weighted graph, where vertices represent stations with storage capabilities and branches represent communication channels with assigned capacity weights. The network is assumed to operate in a packet‐switching store‐and‐forward manner.Assuming messages, of random length, to arrive at the network according to a Poisson stream, a Terminal Path Delay Matrix (TPDM) is defined and calculated for the network. Analysis and synthesis problems related to the network and its TPDM, assuming multi‐terminal non‐simultaneous flows, are studied.Keywords
This publication has 6 references indexed in Scilit:
- Message Path Delays in Packet-Switching Communication NetworksIEEE Transactions on Communications, 1975
- Communication networks: Message path delaysIEEE Transactions on Information Theory, 1974
- The flow deviation method: An approach to store‐and‐forward communication network designNetworks, 1973
- Routing in computer networksNetworks, 1971
- Distance matrix of a graph and its realizabilityQuarterly of Applied Mathematics, 1965
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963