Performance modeling and analysis of a priority token-ring network

The performance of token-ring networks with priority traffic is analyzed under a uniform Poisson traffic model. Approximate expressions are obtained for the mean access and waiting times of each of the priority classes. Our ring model considers the finite time that it takes for the priority informat...

Full description

Saved in:
Bibliographic Details
Published inProceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications pp. 973 - 979 vol.2
Main Authors Doganata, Y.N., Bisdikian, C.C., Tantawi, A.N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1994
Subjects
Application software
Computer networks
Delay effects
Performance analysis
Processor scheduling
Protocols
Streaming media
Telecommunication traffic
Traffic control
Video sharing
Online AccessGet full text

Cover

More Information
Summary:The performance of token-ring networks with priority traffic is analyzed under a uniform Poisson traffic model. Approximate expressions are obtained for the mean access and waiting times of each of the priority classes. Our ring model considers the finite time that it takes for the priority information to propagate on the ring. Also, a network adaptor architecture is considered where there exists a single queue for packets of all priority levels that are serviced in FIFO order, but when a packet is scheduled for transmission at a station, it competes only with the same or higher priority packets residing at the head of the queues at the rest of the stations.< >
ISBN:0780318250
9780780318250
DOI:10.1109/ICC.1994.368955