By Topic

On Switching Problems Requiring Queuing Theory in Computer-Based Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Eisen, M. ; IBM Corp., Res. Ctr., Yorktown Heights, NY, USA

Consider N terminal sets connected to a "black box" by N lines, one from each set. This box has K \leq N output lines. This box connects one of the input lines to one of the output lines when so requested and breaks that connection when the terminal has finished transmission. The output lines can be connected to the input lines in many different ways. Each method leads to a different cost and efficiency. As a measure of efficiency, we take the average time that a message, which arrives at random, has to wait before it can be transmitted. Using queuing theory we show that the mean waiting time is the same for any method of services however, the standard deviations differ.

Published in:

Communications Systems, IRE Transactions on  (Volume:10 ,  Issue: 3 )