Topics: higher-level net models, timed and stochastic nets. Abstract System analysis is often done due to qualitative and quantitative aspects. Queueing networks and Petri nets are suitable and wide spread model worlds for such a form of analysis, because for both a well founded theory exists. The problem is that Petri nets and queueing networks are only suitable for qualitative analysis resp. ...

While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless networks sessions can experience location-dependent channel errors. This may lead to situations in which a session receives significantly less service than it is supposed to, while another receives mor...

Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present Version 2.0 of our tool QPME (Queueing Petri net Modeling Environment) ...

Traffic congestion is increasing in over populated urban areas, our traditional traffic management system can no longer solve this problem. However, problem be solved by converting road networks into queueing networks. This paper proposes, the use of an open Jackson Queueing Model which equated with existing network to calculate waiting time vehicles network, further processed put optimized sta...

In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...

This paper poposes an analytic approach to compute end-to-end delays in queueing networks composed of BMAP/PH/1 queues. The approximations for the first two moments of the end-to-end delays are based on corresponding moments for the delays at each node in the network. In a traffic-based decomposition of queueing networks, different techniques for the departure process approximation, including t...

Product-form closed queueing networks are widely-used analytical models for the performance analysis of computer and communication systems. Since the publication in 1963 of Jackson’s theorem, the first significant development in the theory of queueing networks, hundreds of papers have been devoted to the topic. Nevertheless, several important theoretical issues remain open. Among these, the eff...

This paper proposes a performance evaluation model for e ective job scheduling in global computing systems. The proposed model represents a global computing system by a queueing network, in which servers and networks are represented by queueing systems. Evaluation of the proposed model showed that the model could simulate behavior of an actual global computing system and job scheduling on the s...

A very well known and popular technique for the performance evaluation of current computer and operating systems is analytical modeling based on queueing networks because it is easy to understand and use compared to other modeling techniques. For so called product form queueing networks e cient exact and approximate analysis algorithms exist but most queueing networks of realistic systems do no...

Instability in packet networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload generates instability. However, some results showing that instability can happen also in underloaded queueing networks appeared in the literature. Underload instabilities can be produced either by customer routes that visit several time...