Path-additive Functions in Stochastic Flow Networks with Markovian Routing

نویسنده

  • Michael Tortorella
چکیده

1.1. Rationale The Jackson network [1] is a basic model favored as a useful beginning approach to many queueing network problems. Its appeal stems from not only its product-form solution for the joint distribution of the number of customers in each queue but also from the simplicity of the structures of the model. Markovian routing is one such structure. The purpose of this paper is to study some ramifications of Markovian routing in a flow network that need not be a Jackson network, principally so that a method can be devised to compute crossnetwork values of phenomena whose values on single links are known. The main result is a simple equation for path-additive functions in a flow network in equilibrium (not necessarily a Jackson network) that has Markovian routing. We use this equation to compute latency and jitter in telecommunications packet networks. The class of flow networks we consider includes open queueing networks as well as generalizations of flow networks of the type introduced by Ford and Fulkerson [2].

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

ثبت نام

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

منابع مشابه

Synchronization criteria for T-S fuzzy singular complex dynamical networks with Markovian jumping parameters and mixed time-varying delays using pinning control

In this paper, we are discuss about the issue of synchronization for singular complex dynamical networks with Markovian jumping parameters and additive time-varying delays through pinning control by Takagi-Sugeno (T-S) fuzzy theory.The complex dynamical systems consist of m nodes and the systems switch from one mode to another, a Markovian chain with glorious transition probabili...

متن کامل

Combination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks

This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...

متن کامل

DIMACS Technical Report 2006 - 06 December 2006 Generalized Traffic Equations

This paper considers the problem of computing certain performance parameters of stochastic networks that have Markovian routing but are not otherwise Jackson networks. A scheme using this model for approximating address-based routing is described. The method relies on generalizing the traffic equation to special subsets of the flows in the network.

متن کامل

Dynamic Multi Period Production Planning Problem with Semi Markovian Variable Cost (TECHNICAL NOTE)

This paper develops a method for solving the single product multi-period production-planning problem, in which the production and the inventory costs of each period arc concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production-planning problem can be Stated as a ...

متن کامل

Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks

Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007