Spelling suggestions: "subject:"queuing analysis""
1 |
Managing Inventory, Transportation and Location in a Supply ChainAbouee Mehrizi, Hossein 05 January 2012 (has links)
We consider three problems on inventory, transportation and location in a supply chain. In Chapter 2, we study Multilevel Rationing (MR) and Strict Priority (SP) stock allocation policies for a centralized single product multi-class M/G/1 make-to-stock queueing systems. To obtain the total cost of the system under these policies, we introduce a new method called “customer composition”. Using this method, we focus on the proportion of customers of each class out of the total number of customers in the queue since the number of customers in M/G/1 queues is invariant for any non-idling and non-anticipating policy. We consider a series of two-priority M/G/1 queues with an exceptional service time in each busy period to characterize the customer composition. We derive closed form expressions for the costs of SP and MR policies using these results.
In Chapter 3, we consider a two-echelon inventory system with a congested centralized production facility and several Distribution Centers (DCs). We assume that the production and transportation times are stochastic that are generally distributed, and customers arrive to each DC according to an independent Poisson process. Inventory at DCs is managed using the one-for-one replenishment policy. We use the customer composition approach to characterize the total inventory carrying and backlog costs of the system under the FCFS, SP and MR allocation policies at the warehouse. For the special case of exponentially distributed production and transportation times, we use the unit-flow method and derive closed form expressions for the optimal cost and base-stock level of the DCs. We numerically demonstrate that prioritization using either the SP or the MR policy could be very beneficial in comparison with the FCFS policy.
In Chapter 4, we study a two-echelon supply chain with a set of suppliers, a set of retailers and a set of capacitated cross-docks which are to be established. The demand of the retailers could be satisfied from the suppliers through the cross-docks. The objective is to determine the number and location of cross-docks, the assignment of retailers to suppliers so that the total cost of pipeline and retailers’ inventory, transportation, and facility location is minimized. We formulate the problem as a non-linear mixed integer programming and derive several structural results for special cases of the problem. To solve the general problem, we show that it can be written as a cutting stock problem and develop a column generation algorithm to solve it. We investigate the efficiency of the proposed algorithm numerically.
|
2 |
Managing Inventory, Transportation and Location in a Supply ChainAbouee Mehrizi, Hossein 05 January 2012 (has links)
We consider three problems on inventory, transportation and location in a supply chain. In Chapter 2, we study Multilevel Rationing (MR) and Strict Priority (SP) stock allocation policies for a centralized single product multi-class M/G/1 make-to-stock queueing systems. To obtain the total cost of the system under these policies, we introduce a new method called “customer composition”. Using this method, we focus on the proportion of customers of each class out of the total number of customers in the queue since the number of customers in M/G/1 queues is invariant for any non-idling and non-anticipating policy. We consider a series of two-priority M/G/1 queues with an exceptional service time in each busy period to characterize the customer composition. We derive closed form expressions for the costs of SP and MR policies using these results.
In Chapter 3, we consider a two-echelon inventory system with a congested centralized production facility and several Distribution Centers (DCs). We assume that the production and transportation times are stochastic that are generally distributed, and customers arrive to each DC according to an independent Poisson process. Inventory at DCs is managed using the one-for-one replenishment policy. We use the customer composition approach to characterize the total inventory carrying and backlog costs of the system under the FCFS, SP and MR allocation policies at the warehouse. For the special case of exponentially distributed production and transportation times, we use the unit-flow method and derive closed form expressions for the optimal cost and base-stock level of the DCs. We numerically demonstrate that prioritization using either the SP or the MR policy could be very beneficial in comparison with the FCFS policy.
In Chapter 4, we study a two-echelon supply chain with a set of suppliers, a set of retailers and a set of capacitated cross-docks which are to be established. The demand of the retailers could be satisfied from the suppliers through the cross-docks. The objective is to determine the number and location of cross-docks, the assignment of retailers to suppliers so that the total cost of pipeline and retailers’ inventory, transportation, and facility location is minimized. We formulate the problem as a non-linear mixed integer programming and derive several structural results for special cases of the problem. To solve the general problem, we show that it can be written as a cutting stock problem and develop a column generation algorithm to solve it. We investigate the efficiency of the proposed algorithm numerically.
|
3 |
Exploiting Reconfigurable Antennas in Communication Systems with Delay-Sensitive ApplicationsHammad, Eman 2011 December 1900 (has links)
Wireless communication systems continue to face the challenge of time varying quality of the underlying communication channel. When a slow fading channel goes into a deep fade, the corresponding communication system might face successive decoding failures at the destination, and for delay-sensitive communication systems, this amounts to delays that are not desired. In such situations, it becomes a priority to get out of the deep fades. Many techniques and approaches are already available in the literature to counteract fading effects. This work is motivated by recent advances in fast reconfigurable antennas, which provide new means to change the statistical profile of fading channels, and hence reduce the probability of prolonged fades. Fast reconfigurable antennas are poised to improve overall performance, especially for delay-sensitive traffic in slow-fading environments. This potential enhanced performance motivates this study of the queueing behavior of point-to-point communication systems with reconfigurable antennas. We focus on finite-state channels with memory, and we analyze the queueing behavior of the wireless communication system over erasure channels, for a traditional system versus a reconfigurable antenna implementation. We provide numerical results for situations where using reconfigurable antennas yield substantial performance gains in terms of throughput, delay and buffer overflow.
|
4 |
Parallel Memory System Architectures for Packet Processing in Network Virtualization / ネットワーク仮想化におけるパケット処理のための並列メモリシステムアーキテクチャKorikawa, Tomohiro 23 March 2021 (has links)
京都大学 / 新制・課程博士 / 博士(情報学) / 甲第23326号 / 情博第762号 / 新制||情||130(附属図書館) / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 大木 英司, 教授 守倉 正博, 教授 岡部 寿男 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM
|
5 |
On the Performance Assessment of Advanced Cognitive Radio NetworksChu, Thi My Chinh January 2015 (has links)
Due to the rapid development of wireless communications together with the inflexibility of the current spectrum allocation policy, radio spectrum becomes more and more exhausted. One of the critical challenges of wireless communication systems is to efficiently utilize the limited frequency resources to be able to support the growing demand of high data rate wireless services. As a promising solution, cognitive radios have been suggested to deal with the scarcity and under-utilization of radio spectrum. The basic idea behind cognitive radios is to allow unlicensed users, also called secondary users (SUs), to access the licensed spectrum of primary users (PUs) which improves spectrum utilization. In order to not degrade the performance of the primary networks, SUs have to deploy interference control, interference mitigating, or interference avoidance techniques to minimize the interference incurred at the PUs. Cognitive radio networks (CRNs) have stimulated a variety of studies on improving spectrum utilization. In this context, this thesis has two main objectives. Firstly, it investigates the performance of single hop CRNs with spectrum sharing and opportunistic spectrum access. Secondly, the thesis analyzes the performance improvements of two hop cognitive radio networks when incorporating advanced radio transmission techniques. The thesis is divided into three parts consisting of an introduction part and two research parts based on peer-reviewed publications. Fundamental background on radio propagation channels, cognitive radios, and advanced radio transmission techniques are discussed in the introduction. In the first research part, the performance of single hop CRNs is analyzed. Specifically, underlay spectrum access using M/G/1/K queueing approaches is presented in Part I-A while dynamic spectrum access with prioritized traffics is studied in Part I-B. In the second research part, the performance benefits of integrating advanced radio transmission techniques into cognitive cooperative radio networks (CCRNs) are investigated. In particular, opportunistic spectrum access for amplify-and-forward CCRNs is presented in Part II-A where collaborative spectrum sensing is deployed among the SUs to enhance the accuracy of spectrum sensing. In Part II-B, the effect of channel estimation error and feedback delay on the outage probability and symbol error rate (SER) of multiple-input multiple-output CCRNs is investigated. In Part II-C, adaptive modulation and coding is employed for decode-and-forward CCRNs to improve the spectrum efficiency and to avoid buffer overflow at the relay. Finally, a hybrid interweave-underlay spectrum access scheme for a CCRN is proposed in Part II-D. In this work, the dynamic spectrum access of the PUs and SUs is modeled as a Markov chain which then is utilized to evaluate the outage probability, SER, and outage capacity of the CCRN.
|
6 |
Análise de desempenho de sistemas de comunicação OFDM-TDMA utilizando cadeias de Markov e curva de serviço / Performance analysis of OFDM-TDMA wireless systems basedCosta, Victor Hugo Teles 06 December 2013 (has links)
Submitted by Jaqueline Silva (jtas29@gmail.com) on 2014-12-12T17:31:05Z
No. of bitstreams: 1
Dissertação-Victor Hugo Teles Costa-2013.pdf: 20678399 bytes, checksum: a39c778934ebe127bd74f506467fe0a3 (MD5) / Rejected by Jaqueline Silva (jtas29@gmail.com), reason: on 2014-12-12T17:31:57Z (GMT) / Submitted by Jaqueline Silva (jtas29@gmail.com) on 2014-12-12T19:42:30Z
No. of bitstreams: 2
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Dissertação-Victor Hugo Teles Costa-2013.pdf: 20678399 bytes, checksum: a39c778934ebe127bd74f506467fe0a3 (MD5) / Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2014-12-16T09:25:22Z (GMT) No. of bitstreams: 2
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Dissertação-Victor Hugo Teles Costa-2013.pdf: 20678399 bytes, checksum: a39c778934ebe127bd74f506467fe0a3 (MD5) / Made available in DSpace on 2014-12-16T09:25:22Z (GMT). No. of bitstreams: 2
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Dissertação-Victor Hugo Teles Costa-2013.pdf: 20678399 bytes, checksum: a39c778934ebe127bd74f506467fe0a3 (MD5)
Previous issue date: 2013-12-06 / This paper presents a model based on Markov Chains and enhanced with
the use of Kernel Density Estimation and of MMFM (Markov Modulated Fluid
Model) in order to evaluate the performance of the transmission link in OFDMTDMA
systems. For that purpose, traffic models based on the Kernel method and
the MMFM with adjusted autocorrelation function are proposed. From the model
implemented for the OFDM-TDMA system, it was derived equations for estimation
of QoS parameters such as delay and average queue size in the buffer. The
obtained results confirm that the proposed model is efficient in describing the link
performance indicators. The use of MMFM to model the arrival process improves
the QoS parameter estimates of the queueing model making their values very close
to those of the simulation results. It was also developed an equation to the OFDMTDMA
system’s service curve. Through this equation and the concept of Envelope
Process, it was proposed an equation to estimate the probability of buffer overflow
in OFDM-TDMA systems. The results show that the estimates of the overflow probability
based on the system’s service curve are very close to the ones obtained by
simulations and that the computational complexity to obtain them is significantly
reduced compared to the model based on Markov Chains due to the absence of
matrix computation. / Este trabalho apresenta um modelo baseado em Cadeias de Markov e aprimorado
com o uso do método de Kernel de estimação não-paramétrica e de MMFM
(Markov Modulated Fluid Model) com o objetivo de avaliar e descrever o desempenho
do enlace de transmissão em sistemas OFDM-TDMA. Para tal, modelos de tráfego
baseados no Método de Kernel e em MMFM com ajuste da função de autocorrelação
são propostos. A partir do modelo implementado para o sistema OFDM-TDMA,
foram obtidas equações para estimação de parâmetros de QoS como retardo e tamanho
médio da fila no buffer. Os resultados obtidos confirmam que o modelo proposto
é bastante eficiente ao descrever os indicadores de desempenho do sistema. O uso de
MMFM para modelar o processo de chegada de pacotes aprimora os estimadores de
parâmetros de QoS tornando as estimativas bem próximas dos valores obtidos com
as simulações. Também deduziu-se uma equação para a curva de serviço de Sistemas
OFDM-TDMA. Em seguida, utilizando-se desta curva de serviço e do conceito de
Processo Envelope foi proposta uma equação para estimação de probabilidade de
transbordo do buffer em sistemas OFDM-TDMA. Os resultados obtidos mostram
que as estimativas de probabilidade de transbordo baseadas na curva de serviço do
sistema se aproximam bem dos resultados da simulação e a complexidade computacional
do cálculo necessário para obtê-los é significativamente reduzida em relação
ao modelo definido utilizando Cadeias de Markov.
|
Page generated in 0.053 seconds