Results 241 to 250 of about 4,428,295 (290)
Some of the next articles are maybe not open access.
Approximate Analysis of General Queuing Networks
IBM Journal of Research and Development, 1975An approximate iterative technique for the analysis of complex queuing networks with general service times is presented. The technique is based on an application of Norton's theorem from electrical circuit theory to queuing networks which obey local balance.
K. Mani Chandy +2 more
openaire +1 more source
Bell System Technical Journal, 1981
Priority service disciplines are widely used in computer and communications systems. Many such systems can be modeled by queuing networks, but presently developed theory does not allow solution of these models when priority service disciplines are present. For priority queuing networks that have a homogeneity property, we give some explicit results for
openaire +1 more source
Priority service disciplines are widely used in computer and communications systems. Many such systems can be modeled by queuing networks, but presently developed theory does not allow solution of these models when priority service disciplines are present. For priority queuing networks that have a homogeneity property, we give some explicit results for
openaire +1 more source
Queuing Analysis of Satellite Networks
Operations Research, 1970This paper models satellite communications systems by means of bipartite graphs. It assumes stochastic inputs and time delay is the factor of interest. The paper formulates the model and describes the routing and digital transmission schemes, assuming the network links to be synchronized. Messages may be transmitted only in the synchronized time slots,
openaire +3 more sources
Robustness of queuing network formulas
Journal of the ACM, 1983Analytic models of queuing networks have been observed to give good results for systems which do not conform to the assumptions of classical queuing theory. This has been explained to some extent by the recently proposed concept of operational analysis. However, the use of operational analysis for prediction of system performance involves a restrictive
openaire +2 more sources
Queuing algorithm for speculative Network Processors
International Journal of High Performance Computing and Networking, 2006This paper presents a queuing algorithm which is tailored for usage in speculative Network Processors (NPs). The queuing system uses Weighted-Fair Queuing queues (WFQ) which are extended by Priority Queues (PQ). While WFQ represents a common implementation in current routers supporting differentiated services, PQs allow to compensate extended protocol ...
Jürgen Foag, Thomas Wild
openaire +2 more sources
Operations Research, 1967
The equivalence of two concepts of the capacity is developed. Capacity is the limiting load ratio (arrival rate measured in service rate units) for stable behavior. It is also defined as the expected output rate of the system operated under a saturation load.
openaire +1 more source
The equivalence of two concepts of the capacity is developed. Capacity is the limiting load ratio (arrival rate measured in service rate units) for stable behavior. It is also defined as the expected output rate of the system operated under a saturation load.
openaire +1 more source
Queuing Analysis of Network Firewalls
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010Network firewalls act as the first line of defense against unwanted and malicious traffic targeting private networks connected to the Internet. Predicting the overall firewall performance, especially under attack, becomes crucial to network security engineers and designers in assessing how affective and tolerable a network firewall is, thereby be able ...
openaire +2 more sources
Queuing Networks for “Transparent” Calls
Automation and Remote Control, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the convolution algorithm for separable queuing networks
Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation - SIGMETRICS '76, 1976Research into queuing networks and their applications to computer systems is in a state of prosperity. The object of this paper is to discuss the computational aspect of separable queuing networks. Separable networks constitute that class of models for which a solution can be computed efficiently for fairly large problems. Open networks do not pose any
Martin Reiser, Hisashi Kobayashi
openaire +1 more source
Approximate Analysis of a Hierarchical Queuing Network
Operations Research, 1974A hierarchical queuing network is a layered network of queues in which all arrivals receive initial service from a primary server, and some customers receive additional service jointly from a primary and a secondary server. This paper considers the simplest such network, involving two levels and a single secondary server who functions as a consultant ...
openaire +3 more sources