Abstract
An interdisciplinary approach for computing the point‐to‐point message delay, a measure of congestion in a computer communication network, is derived by the inclusion of a queueing theory result in a probabilistic automaton model. This network model is structurally composed of the interconnection of two distinct repetitive probabilistic automatons. The formulation of the solution is based on the network probability transition matrix which represents the state transitions for the number of customers in the GI/G/1 queue at each computer node and the intranode and internode port routing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
