Aproximações para Redes Estocásticas Sinalizantes sob Tráfego Pesado

• Ano de defesa: 2009
• Autor(a) principal: Leite, Saul de Castro
• Orientador(a): Fragoso, Marcelo Dutra
• Banca de defesa: Murad, Marcio Arab , Val, João Bosco Ribeiro do , Yoneyama, Takashi
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Laboratório Nacional de Computação Científica
• Programa de Pós-Graduação: Programa de Pós-Graduação em Modelagem Computacional
• Departamento: Serviço de Análise e Apoio a Formação de Recursos Humanos
• País: BR
• Palavras-chave em Português: Teoria das filas; Processos estocásticos; Aproximações por tráfego pesado; Redes estocásticas
• Palavras-chave em Inglês: stochastic networks; stochastic processes
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: https://tede.lncc.br/handle/tede/112

This work is concerned with the characterization of weak-sense limits of networks of queues which can send and receive signals. These signals can be used, among other things, to auto control the queues. It is shown that, under certain conditions, the system can be approximated by a reflected stochastic differential equation. The benefits of such an approximation are that it describes the transient evolution of these systems and allows for the introduction of controls. Following that, a more general approach is presented using stochastic Petri nets. A new class of these nets is introduced to serve as an unifying approach to treat systems that can be described by discrete quantities that suffer stochastic changes in time. The class is general enough to include the stochastic Petri nets, the Jackson network, and Gelenbe's network with signals of the type "negative customer" and "triggers." The main goal in this approach is to obtain, in a unifying way, an approximation that can be readily applied in several practical problems.