Performance Modeling for Communication Networks at a Switching Node

DOI10.1109/TCOM.1984.1096165MaRDI QIDQ3335694zbMATH OpenOpenAlexFDO

Authors G. B. Agnew, Jon W. Mark

Publication date 1984

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcom.1984.1096165

zbMATH Keywords

buffer overflowcommunications networkfour-class traffic admissionisolated nodeminimum delay routing algorithmNetwork performanceswitching node

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• A versatile model for predicting the performance of deflection-routing networks
• General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
• Combined routing and flow control in computer communication networks: A two-level adaptive scheme
• On adaptive allocation of the buffer memory of a packet switching node
• A new modelling approach of wormhole-switched networks with finite buffers

Cited in

(4)

• On iterative solutions for performance of high-speed switching networks
• scientific article; zbMATH DE number 5613794 (Why is no real title available?)
• scientific article; zbMATH DE number 708997 (Why is no real title available?)
• Performance modeling and evaluation of circuit switching using Clos networks

This page was built for publication: Performance Modeling for Communication Networks at a Switching Node

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335694)