Results 301 to 310 of about 56,152 (322)
Some of the next articles are maybe not open access.
2012
Traditional telephone networks were designed to implement a single type of communication service, i.e., the telephone service. Today’s telecommunication networks implement a wide range of communication services. In this section we introduce Markov models of communication services that compete for the bandwidth of a finite-capacity communication link.
László Lakatos +2 more
openaire +1 more source
Traditional telephone networks were designed to implement a single type of communication service, i.e., the telephone service. Today’s telecommunication networks implement a wide range of communication services. In this section we introduce Markov models of communication services that compete for the bandwidth of a finite-capacity communication link.
László Lakatos +2 more
openaire +1 more source
2015
Most realistics computer and communication systems are very complex networks of subsytems and the jobs processed by such systems involve wide-ranging service requirements. In many cases the arrival and service processes are non-Markovian and the service discipline may use priorities in scheduling service requests. While Mean Value Ananlysis can be used
openaire +1 more source
Most realistics computer and communication systems are very complex networks of subsytems and the jobs processed by such systems involve wide-ranging service requirements. In many cases the arrival and service processes are non-Markovian and the service discipline may use priorities in scheduling service requests. While Mean Value Ananlysis can be used
openaire +1 more source
1999
This chapter describes a spatial queueing model for stochastic service systems in which customers or units move about and receive services in a region or a general space. The state of such a system is a point process on a space that evolves over time as a “measure-valued” Markov jump process.
openaire +1 more source
This chapter describes a spatial queueing model for stochastic service systems in which customers or units move about and receive services in a region or a general space. The state of such a system is a point process on a space that evolves over time as a “measure-valued” Markov jump process.
openaire +1 more source
Queueing Systems for Computer Systems
2005In Chap. 4 the analysis of queueing performance only involved a single queueing center. Even when more than one queueing center was available, the customer only visited one of them. Such single queueing centers can only be used successfully to represent a single device or single component of a computer system, e.g., a disk drive.
openaire +1 more source