Multiple class G-networks with iterated deletions

نویسندگان

  • Jean-Michel Fourneau
  • Leïla Kloul
  • Franck Quessette
چکیده

We present a new type of multiclass generalized networks of queues with a steady-state product form solution. At its arrival into a queue, a negative customer (or a signal) starts an iteration. At each step of the iteration, a customer is deleted according to a probability which may depend on the type of customer. The iteration stops when the deletion fails. We study networks with multiple classes of positive customers, one class of signals and three service disciplines: FIFO, LIFO/PR and PS.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple class G-networks with list-oriented deletions

We study a new dynamic of generalized networks of queues. We consider networks with multiple classes of customers and signals, and three types of service disciplines: FIFO, LIFO/PR and Processor Sharing. Moreover, we consider a probabilistic deleting mechanism based on iterated deletions of customers according to an arbitrary list of service stations. We prove that these networks have a steady-...

متن کامل

Controller Placement in Software Defined Network using Iterated Local Search

Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...

متن کامل

D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs

The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...

متن کامل

Comparison of Topological Indices Based on Iterated ‘Sum’ versus ‘Product’ Operations

The Padmakar-Ivan (PI) index is a first-generation topological index (TI) based on sums over all edges between numbers of edges closer to one endpoint and numbers of edges closer to the other endpoint. Edges at equal distances from the two endpoints are ignored. An analogous definition is valid for the Wiener index W, with the difference that sums are replaced by products. A few other TIs are d...

متن کامل

M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Perform. Eval.

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2000