http://iet.metastore.ingenta.com
1887

Analysis and simulation of message-switched loop data networks

Analysis and simulation of message-switched loop data networks

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Proceedings of the Institution of Electrical Engineers — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The loop or ring-type data networks using full duplex-communication links between the nodes have been investigated. The results presented in the paper concern two specific modes for handling the messages. These are termed ‘store and forward’ and ‘check and forward’. Both modes have been analysed using extensions of the single-server queueing theory and also simulated extensively using GPSS software.The message traffic is Poisson distributed and can arise from any node with equal probability. The destination is selected to be any other node again with equal probability. The study has also considered the performance of the two modes for traffic having priorities. One conclusion arrived at in this investigation is that the traffic with priorities can be better handled by a network which handles messages in either store and forward or check and forward mode depending on the priority of the message.

References

    1. 1)
      • Farmer, W.D., Newhall, E.E.: `An experimented distributed switching system to handle high speed aperiodic data', Proceedings ACM Symposium, October 1969.
    2. 2)
      • J.R. Pierce . How far can data loops go. IEEE Trans. , 527 - 530
    3. 3)
      • Rahman, M.: `Analysis and simulation of a full duplex data communication network', 1972, M.A.Sc. thesis, University of Waterloo, Waterloo Canada.
    4. 4)
      • Reames, C.C., Liu, M.T.: `Loop network for simultaneous transmission of variable-length messages', 2nd Annual Symposium on Computer Architecture, 1975, Houston, Texas, p. 7–12.
    5. 5)
      • Kaye, A.R.: `Analysis of a distributed control loop for data transmission', Proceedings of the Symposium on Computer Communications Networks and Teletraffic, April 1972, Polytechnic Institute of Brooklyn, p. 47–58.
    6. 6)
      • R. Anderson , J. Hayes , D. Sherman . Simulated performance of ring switched data networks. IEEE Trans. , 576 - 591
    7. 7)
      • Dube, J.D.: `Investigation of message traffic parameters in loop type data communication networks', 1974, M.A.Sc. thesis, University of Waterloo, Waterloo Canada.
    8. 8)
      • L. Kleinrock . (1972) , Stochastic message flow and delay.
    9. 9)
      • J.C. Majithia , J.D. Dube . Results for a loop network with a hybrid message handling protocol. Proc. IEE , 8 , 775 - 776
http://iet.metastore.ingenta.com/content/journals/10.1049/piee.1977.0036
Loading

Related content

content/journals/10.1049/piee.1977.0036
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address