Priorities and performance in packet-switching Networks☆
References (18)
Some extensions to Multi-class Queueing Network Analysis
- et al.
Open Closed, and Mixed Networks of Queues with Different Classes of Customers
JACM22.2
(April 1975) - et al.
Arpanet Routing Algorithm Improvements, First Semiannual Technical Report
BBN Report no. 3803
(April 1978) - et al.
Graceful Preemption for Multi-Link Layer Protocols
Dynamic Models of Shortest Path Routing Algorithms for Communication Networks
The MVA Priority Approximation ACM
Trans. on Comp. Systems
(Nov. 1984)Queueing Network Models of Multi-Programming
Doctoral Dissertation, Harvard University, Div. Eng. and Applied Science
(May 1971)Measurements and Analysis of ARPANET traffic: May 1982 and March 1983
BBN Technical Report No. 5349
(May 1983)- et al.
Analysis and Synthesis of Computer Systems
(1980)
There are more references available in the full text version of this article.
Cited by (4)
Topological design of a distributed computer communication network in a noisy environment
1989, Computer CommunicationsA topology designing system for a computer network
1998, Journal of Computer Science and TechnologyA system for priority routing and capacity assignment in packet switched networks
1992, Annals of Operations ResearchA priority queue with two priority classes whose nonpriority class call has preemptive and nonpreemptive parts
1989, Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
- ☆
This work was partially supported by a grant from the National Sciences and Engineering Research Council of Canada. Some of the research was done while the author was with BBN, Cambridge, Mass.
Copyright © 1986 Published by Elsevier B.V.