The computer and microelectronics technologies are developing very quickly nowadays. In the mean time, the modern integrated avionics systems are burgeoning unceasingly. The modern integrated modular architecture more and more requires the low-latency and reliable communication databus with the high bandwidth. The traditional avionics databus technology, such as ARINC429, can not provide enough high speed and size for data communication, and it is a problem to achieve transmission mission successfully between the advanced avionic devices with the sufficient bandwidth. AFDX(Avionics Full Duplex Switched Ethernet) is a good solution for this problem, which is the high-speed full duplex switched avionic databus, on the basis of the Ethernet technology. AFDX can not only avoid Ethernet conflicts and collisions, but also increase transmission rate with a lower weigh of the databus. AFDX is now adopted by A380,B787 aircraft successfully. The avionics data must be delivered punctualy and reliablely, so it is very essential to validate the real-time performance of AFDX during the design process. The simulation is a good method to acquire the network performance, but it only happends in some given set of scenarios, and it is impossible to consider every case. So a sophisticatd network performance method for the worst-case scenario with the pessimistic upper bound requires to be deduced. The avionic design engineers have launched many researches in the AFDX simulation and methods study. That is the goal that this thesis is aimming for. The development of this project can been planned in the following two steps. In the first step, a communication platform plans to be implemented to simulate the AFDX network in two versions – the RTAI realtime framework and Linux user space framework. Ultimately, these frameworks need to be integrated into net-ASS, which is an integrated simulation and assessment platform in the cranfield’s lab.The second step deduces an effective method to evaluate network performance, including three bounds(delay,backlog and output flow), based on the NC. It is called Network Calculus. It is an internet theory keeping the network system in determistic way. It is also used in communication queue management. This mathematics method is planed to be verified with simulation results from the AFDX simuation communication platform, in order to assure its validity and applicability. All in all, the project aims to assess the performance of different network topologies in different avionic architectures, through the simulation and the mathematical assessment. The technologies used in this thesis benefit to find problems and faults in the beginning stage of the avionics architecture design in the industrial project, especially, in terms of guarantee the lossless service in avionics databus.

Internet ha supuesto el despegue de las redes de conmutación de paquetes, las ha convertido en un medio al que todo el mundo quiere acceder, y ha obligado a replantear todas las previsiones que manejaban los operadores sobre el tráfico que iban a soportar sus redes en cada una de sus partes: el acceso, la agregación y la dorsal. Precisamente, la evaluación de estas y otras situaciones deben estar incluidas en el proceso de diseño y planificación de cualquier red, en lo que se ha denominado planificación estratégica. La estimación de la demanda de tráfico resulta especialmente importante porque permite al operador anticiparse a situaciones de congestión y bloqueo de la red. Utiliza herramientas de modelado del tráfico, bien para su cálculo analítico o para su estudio mediante simulación, y al ser una herramienta fundamental, existe un extenso catálogo de modelos de tráfico: genéricos y particularizados, de fuentes individuales y de redes completas, de elementos de interconexión y de enlaces. En esta Tesis, se han analizado los diferentes modelos existentes y se ha desarrollado un nuevo modelo que tiene en cuenta el comportamiento del tráfico desde su preparación por parte de la capa de aplicación, hasta su inserción en la capa física. El modelo propuesto parte de la solución ON-OFF tradicional, aunque aplicado a tres niveles diferentes (conexión, sesión y ráfaga), de forma que cada estado ON se encuentra modulado por el modelo correspondiente a la capa inferior. Como alternativa más simple, surgen los modelos multifuente, que intentan introducir el efecto de la interacción entre las diferentes fuentes, también conocido como agregación. Para considerar este caso, se ha realizado un estudio de modelos específicos para su aplicación a puntos de agregación, especialmente los situados en la red de acceso, al ser ésta la parte de la red que más alto coste presenta en su implementación. Partiendo del modelo ON-OFF para una sola fuente, se ha propuesto una variante multifuente, que aprovecha las propiedades de la función de distribución binomial para realizar el cálculo del tráfico agregado por un número determinado de fuentes. El resultado ha sido comparado mediante la observación de flujos reales, tal como propone la teoría del Network Calculus, y que ha sido evaluada y aplicada en este trabajo con ejemplos prácticos que se han incluido en el documento. El estudio realizado en esta Tesis concluye que el tráfico de fuente está condicionado a tres premisas fundamentales: el usuario, el servicio y la tecnología de acceso, de donde surge un nuevo concepto que especifica de forma sistemática y ordenada todas las variaciones, denominada CASUAL (Cubo de Acceso/Servicios/Usuarios de Asignación Libre) y ha sido aplicada en una herramienta realizada a su efecto, junto con los modelos de tráfico de fuente propuestos. / Internet has been the catalyst of the development of packet switched networks, which have become the resource which everyone wants to access. As a consequence, the operators need to recalculate all their forecasts about the traffic to be transported by their networks. In fact, the evaluation of these and other situations should be included within the design and planning phases of any network, in the so called strategic planning overall process.Traffic demand estimation is particularly interesting, since it allows the operator to anticipate bottlenecks and blocking situations of the network. It uses traffic modelling tools, either for their analytical or simulation-based study. Since they have become an essential tool, there is a wide range of traffic models: generic and particularized, for individual sources and complete networks, for interconnection elements and links.In this thesis, we have analyzed the different models and have developed a new model that takes into account traffic patterns from preparation by the application layer to its insertion into the physical layer. The proposed model is based on the traditional on-off solution, but applied to three different levels (connection, session and burst), so that each ON state is modulated by the model corresponding to the bottom layer. As a simpler alternative, multisource models emerge, seeking to introduce the effect of the interaction between different sources, also known as aggregation. To consider this case, it has made a study of specific models for application to aggregation points, especially those located in the access network, as this is the part of the network that has higher cost in implementation. Based on the ON-OFF model for a single source, is a proposed multi-source variant, which exploits the properties of the binomial distribution function for the calculation of the aggregate traffic for a specified number of sources. The result has been compared by observation of actual flows, as proposed by the theory of Network Calculus, and has been evaluated and implemented in this work with practical examples that are included in the document.The study in this thesis concludes that the traffic source is conditioned on three fundamental premises: the user, service and technology access, where there was a new concept that specifies a systematic and orderly all the variations, called CASUAL (Cube of Access / Services / Users with Free Allocation) and has been implemented in a tool made of its effect, along with the traffic source models proposed.

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.

Submitted by Cássia Santos (cassia.bcufg@gmail.com) on 2016-12-16T13:58:28Z No. of bitstreams: 2 Tese - Flávio Geraldo Coelho Rocha - 2016.pdf: 4809831 bytes, checksum: e575d503488bc0e0cb8f1a1b3478d982 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2016-12-16T16:59:35Z (GMT) No. of bitstreams: 2 Tese - Flávio Geraldo Coelho Rocha - 2016.pdf: 4809831 bytes, checksum: e575d503488bc0e0cb8f1a1b3478d982 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2016-12-16T16:59:35Z (GMT). No. of bitstreams: 2 Tese - Flávio Geraldo Coelho Rocha - 2016.pdf: 4809831 bytes, checksum: e575d503488bc0e0cb8f1a1b3478d982 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-11-22 / Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG / In this work, in order to describe network traffic characteristics, such as long-range dependence among samples, self-similarity and multiscale behavior, we propose a Multifractal Adaptive Model based on a multiscale cascade in the Wavelet Domain. We compare the proposed model performance with those of other models presented in the literature. It is also proposed an envelope process for the network traffic that takes into account parameters of the Multifractal Adaptive Model. Furthermore, we derive an equation in order to estimate the buffer overflow probability for both a simplified communication system with a single server, single queue and finite buffer, and to a wireless network multiuser scenario based on OFDM technology. To this end, we consider the service curve of the round-robin scheduling algorithm of the OFDM network. Taking into account the envelope process and the service curve we obtain, through the Network Calculus theory, the maximum delay experienced by users of the OFDM network. Moreover, assuming a similar network scenario to an LTE network, we propose a joint channel-aware and queue-aware resource scheduling algorithm. Based on the presented scheduler, we propose a minimum service curve for the LTE user and through this we propose an approach to accomplish maximum delay guarantee. / Neste trabalho, com o objetivo de descrever características do tráfego de redes, tais como longa-dependência entre amostras, autossimilaridade e comportamento multiescala, propõe-se um Modelo Multifractal Adaptativo baseado em uma cascata multiescala no domínio Wavelet. O desempenho do modelo proposto é comparado a outros modelos presentes na literatura. Também é proposto um processo envelope para o tráfego de redes que leva em consideração parâmetros do Modelo Multifractal Adaptativo proposto. Além disso, deduz-se uma equação para o cálculo da probabilidade de transbordo do buffer, tanto para um sistema de comunicação simplificado com servidor único, fila única e buffer finito, quanto para um ambiente multiusuário de rede sem fio baseado na tecnologia OFDM. Para tanto, utiliza-se a curva de serviço do escalonador round-robin da rede OFDM. Utilizando-se do processo envelope e da curva de serviço, obtém-se por meio do Cálculo de Rede a estimativa para o retardo máximo experimentado pelos usuários da rede OFDM. Em seguida, assume-se um ambiente de rede similar ao de uma rede LTE e propõe-se para essa rede um escalonador de recursos sensível às condições do canal de comunicação e à probabilidade de transbordo do buffer. Com base no escalonador apresentado, propõe-se uma curva de serviço mínima para o usuário da rede LTE e por meio dessa, propõe-se uma abordagem para garantia de retardo.