نتایج جستجو برای: discrete time queuing theory

تعداد نتایج: 2619743  

1998
Anastasios DOULAMIS Nikolaos DOULAMIS Stefanos KOLLIAS

In this paper modeling and queuing analysis of variable-bit-rate (VBR) MPEG coded video sources transmitted over B-ISDN networks are studied. A low pass version of the aggregate MPEG sequence is examined so that the network resources are analytically predicted. Based on this simplified signal, a discrete-state continuous-time Markov chain is proposed to approximate the MPEG video traffic. Then,...

Journal: :international journal of industrial mathematics 2015
s. sedehzadeh‎ r. tavakkoli-‎moghaddam‎‎ f. jolai‎

one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to ...

  Response time is one of the critical web service quality dimensions. It refers to how long it takes that a web service responds to request of a user. In order to manage the response time, pricing schemes can work as an efficient access control mechanism. In this paper, we study competition between two providers offering functionally same web services where there is a monopoly service provider...

Journal: :SIAM Journal of Applied Mathematics 2015
L. Forestier-Coste Simone Göttlich Michael Herty

Starting from discrete event simulations based on sampled data we simulate the interplay between product density and flux. Data-fitting helps to determine the right parameters for clearing functions to close first and second order conservation laws. For the first order case well-known relations from M/M/1-queuing theory can be reproduced and numerically extended to transient behavior. To includ...

2010
Rahav Dor Joseph M. Lancaster Mark A. Franklin Jeremy Buhler Roger D. Chamberlain

Queuing theory provides a theoretical framework for quantitative understanding of the performance of streaming applications. There are questions, however, as to the suitability of queuing models to real applications. Here, we investigate the correspondence between a relatively simple queuing model of an FPGA-accelerated BLAST implementation and empirical measurements taken from executions of th...

E. Teimoury Reza Rashid S. M. Seyedhoseini

Cross-docking is a logistic concept, which plays an important role in supply chain management by decreasing inventory holding, order packing, transportation costs and delivery time. Paying attention to these concerns, and importance of the congestion in cross docks, we present a mixed-integer model to optimize the location and design of cross docks at the same time to minimize the total transpo...

2015
S. SENTHILKUMAR C. RAGAVAN

Mobile ad-hoc networks pose real difficulty in finding the multihop shortest paths because of continuous changing positions of the nodes. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of Ad-hoc networks. In this paper we proposed an enhanced r...

Journal: :CoRR 2018
Derya Malak Muriel Médard Edmund M. Yeh

We propose two schemes for selective-repeat ARQ protocols over packet erasure channels with unreliable feedback: (i) a hybrid ARQ protocol with soft combining at the receiver, and (ii) a coded ARQ protocol, by building on the uncoded baseline scheme for ARQ, developed by Ausavapattanakun and Nosratinia. Our method leverages discrete-time queuing and coding theory to analyze the performance of t...

2011
Xuegang Ban Peng Hao Zhanbo Sun

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel ...

Journal: :Foundations and Trends in Signal Processing 2013
Yariv Ephraim Brian L. Mark

A bivariate Markov process comprises a pair of random processes which are jointly Markov. One of the two processes in that pair is observable while the other plays the role of an underlying process. We are interested in three classes of bivariate Markov processes. In the first and major class of interest, the underlying and observable processes are continuous-time with finite alphabet; in the s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید