Performance modeling and analysis of a priority token-ring network
New Orleans, LA（1994）
摘要
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
更多查看译文
关键词
packet switching,performance evaluation,queueing theory,telecommunication traffic,token networks,fifo order,approximate expressions,finite time,mean access time,mean waiting time,network adaptor architecture,packets queue,performance analysis,performance modeling,priority information,priority levels,priority token-ring network,priority traffic,ring model,uniform poisson traffic model,application software,computer networks,ring network,protocols
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要