Thesis (Ph. D.)--Ohio State University, 2005. / Title from first page of PDF file. Document formatted into pages; contains xix, 136 p.; also includes graphics (some col.). Includes bibliographical references (p. 129-136). Available online via OhioLINK's ETD Center

CAPES / Nessa dissertação de mestrado apresentamos um novo método HARQ para sistemas de comunicação cooperativa, denominado Retransmissão Parcial Codificada (RPC). Esse método é baseado na retransmissão de apenas uma fração da palavra código original por parte dos nós cooperativos, aplicando a essa fração um ganho de potência apropriado. Os resultados numéricos utilizando códigos LDPC e HARQ Tipo-I com Chase Combining mostram que o RPC supera os esquemas HARQ cooperativos tradicionais considerando os protocolos AAF e SDF. Além disso, mostramos que a vazão (throughput) do RPC, utilizando apenas um único relay, pode ser consideravelmente maior que a vazão de alguns métodos HARQ cooperativos que utilizam múltiplos relays. / In this master thesis we present a novel HARQ scheme for cooperative communication systems, called Coded Partial Retransmission (CPR). The method is based on the retransmission of only a fraction of the original codeword by the cooperating nodes, applying an appropriate power allocation. Numerical results using LDPC codes and Type-I HARQ with Chase Combining show that CPR outperforms regular cooperative HARQ techniques considering both AAF and SDF protocols. Additionally, we show that the CPR throughput, using a single relay, may be considerably larger than the throughput of some regular cooperative HARQ schemes using multiple relays.

CAPES / Nessa dissertação de mestrado apresentamos um novo método HARQ para sistemas de comunicação cooperativa, denominado Retransmissão Parcial Codificada (RPC). Esse método é baseado na retransmissão de apenas uma fração da palavra código original por parte dos nós cooperativos, aplicando a essa fração um ganho de potência apropriado. Os resultados numéricos utilizando códigos LDPC e HARQ Tipo-I com Chase Combining mostram que o RPC supera os esquemas HARQ cooperativos tradicionais considerando os protocolos AAF e SDF. Além disso, mostramos que a vazão (throughput) do RPC, utilizando apenas um único relay, pode ser consideravelmente maior que a vazão de alguns métodos HARQ cooperativos que utilizam múltiplos relays. / In this master thesis we present a novel HARQ scheme for cooperative communication systems, called Coded Partial Retransmission (CPR). The method is based on the retransmission of only a fraction of the original codeword by the cooperating nodes, applying an appropriate power allocation. Numerical results using LDPC codes and Type-I HARQ with Chase Combining show that CPR outperforms regular cooperative HARQ techniques considering both AAF and SDF protocols. Additionally, we show that the CPR throughput, using a single relay, may be considerably larger than the throughput of some regular cooperative HARQ schemes using multiple relays.

Orientadores: Edson Moschim, Felipe Rudge Barbosa / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-19T06:49:01Z (GMT). No. of bitstreams: 1 Martins_IndayaraBertoldi_D.pdf: 4857444 bytes, checksum: dd92f8f5d511ebe8130c0e4a7ee7e722 (MD5) Previous issue date: 2011 / Resumo: Neste trabalho investiga-se através de simulação computacional, o desempenho de Redes Ópticas Avançadas, usando tecnologia de Chaveamento de Pacotes Ópticos (Optical Packet Switching - OPS), com topologias em anel e malha, e nós ópticos com roteamento sem conversão eletro-óptica dos pacotes, e sem armazenadores na camada óptica de transporte. São analisados parâmetros como capacidade da rede, vazão efetiva, número médio de saltos, e fração de perda de pacotes; introduz-se também um novo fator de desempenho da rede. São propostas novas configurações para as topologias analisadas, as quais se revelaram com melhor desempenho que as tradicionais. Constatou-se que a aplicação de armazenadores eletrônicos (buffers) na interface de entrada/saída do cliente (ingresso/egresso à rede) praticamente eliminou a perda de pacotes ópticos. A fim de subsidiar planejamento para proteção da rede, analisa-se o impacto de falha de enlaces e de nós no desempenho das varias arquiteturas analisadas. A rede em malha é a que sempre apresenta os melhores resultados. Foi também feita uma avaliação dos modelos de redes adotados para tráfego IP, visando aplicação na convergência de redes de fibras e redes sem-fio (wireless-fiber). Uma conclusão importante deste trabalho é que o grau de conexões dos nós das redes é mais relevante para capacidade e desempenho do que apenas o número de nós da rede. Este trabalho não analisa limitações físicas de transmissão porque focaliza redes metropolitanas de acesso, com os pacotes ópticos nunca percorrendo distâncias superiores a 60 ou 70 km / Abstract: In this work the performance of advanced optical networks was investigated through computational simulations using optical packet switching (OPS) technology, with mesh and ring topologies. Routing in the optical nodes is carried out without electro-optical conversion of the optical packets and buffering is not used on the optical layer. The analyses are based on the network parameters capacity, throughput, average number of hops, packet loss fraction; an additional performance factor is introduced in this work. New network and node configurations are proposed and analyzed, and it was verified that they perform better than traditional topologies. It was verified that the application of electronic buffer on end-client input and output interfaces (ingress/egress of the optical network) practically eliminate optical packet loss, which mostly occur at input to the optical layer. In order to subsidize the network protection planning, analyses of the impact of link and node failure in the various architectures was studied. The mesh network obtained the best results in all situations. A network model adopted for IP traffic was also evaluated in order to consider the adequacy of our models to this traffic and the convergence of fiber networks and wireless networks (wireless-fiber). Important conclusions are that the models are simple and perform very well under various conditions, and that the degree of interconnection of the nodes is more relevant for capacity and performance than just the number of network nodes. Actually in some cases it is better to increase connectivity than number of nodes. Finally, this work does not analyze the physical limitations of transmission because it focuses on metropolitan access networks, with optical packets having a limited number of hops and never exceeding distances greater than 60 or 70 km / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

A unique all-optical 1x2 self-routed switch is introduced. This switch routes an optical packet from one input to one of two possible outputs. The header and payload are transmitted separately in the system, and the header bits are processed in parallel thus increasing the switching speed as well as reducing the amount of buffering required for the payload. A 1x2 switching operation is analysed and a switching ratio of up to 14dB is obtained. The objective of the research was to investigate a unique all-optical switch. The switch works by processing the optical bits in a header packet which contains the destination address for a payload packet. After the destination address is processed the optical payload packet gets switched to one of two outputs depending on the result of the optical header processing. All-optical packet switching in the optical time domain was accomplished by making use of all-optical parallel processing of an optical packet header. This was demonstrated in experiments in which a three bit parallel processing all-optical switching node was designed, simulated and used to successfully demonstrate the concept. The measure of success that was used in the simulated experiments was the output switching ratio, which is the ratio between the peak optical power of a high bit at the first output and the peak optical power of a high bit at the second output. In all experimental results the worst case scenario was looked at, which means that if there was any discrepancy in the peak value of the output power then the measurement’s minimum/maximum value was used that resulted in a minimum value for the switching ratio. The research resulted in an optical processing technique which took an optical bit sequence and delivered a single output result which was then used to switch an optical payload packet. The packet switch node had two optical fibre inputs and two optical fibre outputs. The one input fibre carried the header packet and the other input fibre carried the payload packet. The aim was to switch the payload packet to one of the two output fibres depending on the bit sequence within the header packet. Also only one unique address (header bit sequence) caused the payload packet to exit via one of the outputs and all the other possible addresses caused the payload packet to exit via the other output. The physical configuration of the all-optical switches in the parallel processing structure of the switching node determined for which unique address the payload packet would exit via a different output than when the address was any of the other possible combinations of sequences. Only three Gaussian shaped bits were used in the header packet at a data rate of 10 Gbps and three Gaussian shaped bits in the payload packet at a data rate of 40 Gbps, but in theory more bits can be used in the payload packet at a decreased bit length to increase throughput. More bits can also be used in the header packet to increase the number of addresses that can be reached. In the simulated experiments it was found that the payload packet would under most circumstances exit both outputs, and at one output it would be much larger than at the other output (where it was normally found to be suppressed when compared to the other output’s optical power). The biggest advantage of this method of packet-switching is that it occurs all-optically, meaning that there is no optical to electronic back to optical conversions taking place in order to do header processing. All of the header processing is done optically. One of the disadvantages is that the current proposed structure of the all-optical switching node uses a Cross-Gain Modulator (XGM) switch which is rather expensive because of the Semiconductor Optical Amplifier (SOA). In this method of packet-switching the length of the payload packet cannot exceed the length of one bit of the header packet. This is because the header processing output is only one header bit length long and this output is used to switch the payload packet. Thus any section of the payload packet that is outside this header processing output window will not be switched correctly / Dissertation (MEng (Electronic Engineering))--University of Pretoria, 2007. / Electrical, Electronic and Computer Engineering / unrestricted

D.Ing. / Conventional traffic models used for the analysis of packet-switched data are Markovian in nature and are based on assumptions, such as Poissonian arrivals. The introduction of packet oriented networks has resulted in an influx of information highlighting numerous discrepancies from these assumptions. Several studies have shown that traffic patterns from diverse packet-switched networks and services exhibit the presence of properties such as self-similarity, long-range dependencies, slowly decaying variances, "heavy tailed" or power law distributions, and fractal structures. Heavy Tailed distributions decay slower than predicted by conventional exponential assumptions and lead to significant underestimation of network traffic variables. Furthermore, it was shown that the statistical multiplexing of multiple packet-switched sources do not give rise to a more homogenous aggregate, but that properties such as burstiness are conserved. The results of the above mentioned studies have shown that none of the commonly used traffic models and assumptions are able to completely capture the bursty behaviour of packet- and cellbased networks. Artificial Intelligent methods provide the capability to extract the inherent characteristics of a system and include soft decision-making approaches such as Fuzzy Logic. Adaptive methods such as Fuzzy Logic Self-learning algorithms have the potential to solve some of the most pressing problems of traffic Modelling and Management in modern packet-switched networks. This dissertation is concerned with providing alternative solutions to the mentioned problems, in the following three sub-sections; the Description of Heavy Tailed Arrival Distributions, Timeseries Forecasting of bursty Traffic Intensities, and Management related Soft Decision-Making. Although several alternative methods, such as Kalman Filters, Bayesian Distributions, Fractal Analysis and Neural Networks are considered, the main emphasis of this work is on Fuzzy Logic applications.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Includes bibliographical references. / by Tam-Anh Chu. / M.S.

[pt] Redes Manhattan Street (MS) têm sido descritas como um arranjo linear bidimensional de nós, semelhante à configuração de ruas e avenidas de Manhattan. O roteamento por deflexão é implementado encaminhando os pacotes que atingem um determinado nó a uma de suas saídas de forma síncrona ou assíncrona. O principal objetivo deste trabalho consiste na simulação e análise de redes totalmente ópticas configuradas segundo a topologia MS. O roteamento por deflexão e o assincronismo são considerados, para evitar complexidade eletrônica e armazenamento de pacotes no domínio óptico. Serão apresentadas as características das redes MS, suas propriedades estruturais e os parâmetros utilizados para analisar seu desempenho. Uma metodologia analítica dedicada a obtenção teórica destes parâmetros será introduzida. Serão apresentados alguns conceitos básicos sobre simulação de redes;diversas simulações da rede proposta utilizando os protocolos UDP e TCP; uma descrição do software que foi utilizado para realizar as simulações; uma comparação entre os resultados obtidos através da simulação e os obtidos através da metodologia analítica; e uma análise do efeito da latência na vazão do protocolo TCP. / [en] Manhattan Street (MS) Networks are bidimensional linear node sets arranged as the avenues and streets of Manhattan. The simulation and analysis of all-optical MS networks is the central target of this paper. In order to avoid using complex electronics and/or optical domain buffers, the deflection routing and the asynchronism are taken into account in the analysis. Deflection routing is performed by conveying incoming packets towards one of the two outputs. The characteristics of MS Networks are presented, along with their structural properties and the parameters used for performance analysis. An analytical methodology for the theoretical obtaining of these parameters is described. Some basic concepts on network simulation are discussed. Several simulations of the proposed network are presented, using both UDP and TCP protocols, and the software used for simulations is also described. The obtained results are compared and discussed with respect to the previously described analytic methodologies. Finally, the effect of network latency on the TCP-protocol throughput is assessed.

In past and recent literature, random access protocols have been investigated with growing interest. In particular, the Slotted ALOHA protocol has been extensively used in satellite communications, and has also attracted considerable attention in many areas of wireless communication systems, especially in the cellular mobile environment. In this thesis, we investigate the performance of Slotted ALOHA, an effective random access protocol, in a Weibull fading environment. We study the performance metrics based on the signal-to-interference-and-noise ratio (SINR) model, in a cellular network system, assuming two captures models. The capture effect, also called co-channel interference tolerance, is the ability to correctly receive a strong signal from one transmitter despite significant interference from other transmitters. We derive closed-formed expressions and numerical evaluations for both the capture probability and the system throughput. he analytical results will be validated with computer simulations. Finally, to mitigate the effects of Weibull fading channel we also consider the effect of dual selection diversity that will increase the capture probability and the system throughput. / by Jean N. Rene. / Thesis (M.S.C.S.)--Florida Atlantic University, 2013. / Includes bibliography. / Mode of access: World Wide Web. / System requirements: Adobe Reader.

Siu Chun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 66-68). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Thesis Overview --- p.3 / Chapter 2 --- Background and Related work --- p.4 / Chapter 2.1 --- Emergence of IP-over-ATM --- p.4 / Chapter 2.2 --- ATM architecture --- p.5 / Chapter 2.3 --- Scheduling issues in output-queued switch --- p.6 / Chapter 2.4 --- Scheduling issues in input-queued switch --- p.18 / Chapter 3 --- The Deadline-ordered Burst-based Parallel Scheduling Strategy --- p.23 / Chapter 3.1 --- Introduction --- p.23 / Chapter 3.2 --- Switch and queueing model --- p.24 / Chapter 3.2.1 --- Switch model --- p.24 / Chapter 3.2.2 --- Queueing model --- p.25 / Chapter 3.3 --- The DBPS Strategy --- p.26 / Chapter 3.3.1 --- Motivation --- p.26 / Chapter 3.3.2 --- Strategy --- p.31 / Chapter 3.4 --- The Deadline-ordered Burst-based Parallel Iterative Matching --- p.33 / Chapter 3.4.1 --- Algorithm --- p.34 / Chapter 3.4.2 --- An example of DBPIM --- p.35 / Chapter 3.5 --- Simulation results --- p.33 / Chapter 3.6 --- Discussions --- p.46 / Chapter 3.7 --- Future work --- p.47 / Chapter 4 --- The Quasi-static DBPIM Algorithm --- p.50 / Chapter 4.1 --- Introduction --- p.50 / Chapter 4.2 --- Quasi-static path scheduling principle --- p.51 / Chapter 4.3 --- Quasi-static DBPIM algorithm --- p.56 / Chapter 4.4 --- An example of Quasi-static DBPIM --- p.59 / Chapter 5 --- Conclusion --- p.63 / Bibliography --- p.65