International Telemetering Conference Proceedings / October 23-26, 2000 / Town & Country Hotel and Conference Center, San Diego, California / Bit error rate (BER) and bandwidth efficiency of several variations of enhanced Feher patented quadrature phase shift keying (FQPSK) [1] are described. An enhanced FQPSK increases the channel packing density of that of the IRIG 106-00 standardized FQPSK-B by approximately 50% in adjacent channel interference (ACI) environment. As the bandwidth efficiency of FQPSK-B DOUBLES (2×) that of pulse code modulation/Frequency modulation (PCM/FM) [5], the enhanced FQPSK, with a simpler transceiver than FQPSK-B, has a channel packing density of TRIPLE (3×) that of PCM/FM. One of the other enhanced FQPSK prototypes has an end to end system loss of only 0.4 dB at BER=1x10^(-3) and 0.5 dB at BER=1x10^(-4) from ideal linearly amplified QPSK theory. The enhanced FQPSK has a simple architecture, thus is inexpensive and has small size, for ultra high bit rate implementation. With low redundancy forward error correction (FEC) coding which expands the spectrum by approximately 10%, further improvement of about 3-4.5dB E N b o is attained with NLA FQPSK-B and enhanced FQPSK at BER=1x10^(-5) .

The growing demand on the variety of internet applications requires management of large scale networks by efficient Quality of Service (QoS) routing, which considerably contributes to the QoS architecture. The biggest contemporary drawback in the maintenance and distribution of the global state is the increase in communication overheads. Unbalancing in the network, due to the frequent use of the links assigned to the shortest path retaining most of the network loads is regarded as a major problem for best effort service. Localised QoS routing, where the source nodes use statistics collected locally, is already described in contemporary sources as more advantageous. Scalability, however, is still one of the main concerns of existing localised QoS routing algorithms. The main aim of this thesis is to present and validate new localised algorithms in order to develop the scalability of QoS routing. Existing localised routing, Credit Based Routing (CBR) and Proportional Sticky Routing (PSR), use the blocking probability as a factor in selecting the routing paths and work with either credit or flow proportion respectively, which makes impossible having up-to-date information. Therefore our proposed Highest Minimum Bandwidth (HMB) and Highest Average Bottleneck Bandwidth History (HABBH) algorithms utilise bandwidth as the direct QoS criterion to select routing paths. We introduce an Integrated Delay Based Routing and Admission Control mechanism. Using this technique Minimum Total Delay (MTD), Low Fraction Failure (LFF) and Low Path Failure (LPF) were compared against the global QoS routing scheme, Dijkstra, and localised High Path Credit (HPC) scheme and showed superior performance. The simulation with the non-uniformly distributed traffic reduced blocking probability of the proposed algorithms. Therefore, we advocate the algorithms presented in the thesis, as a scalable approach to control large networks. We strongly suggest that bandwidth and mean delay are feasible QoS constraints to select optimal paths by locally collected information. We have demonstrated that a few good candidate paths can be selected to balance the load in the network and minimise communication overhead by applying the disjoint paths method, recalculation of candidate paths set and dynamic paths selection method. Thus, localised QoS routing can be used as a load balancing tool in order to improve the network resource utilization. A delay and bandwidth combination is one of the future prospects of our work, and the positive results presented in the thesis suggest that further development of a distributed approach in candidate paths selection may enhance the proposed localised algorithms.

A broadside radiating, linearly polarized, electrically small Huygens source antenna system that has a large impedance bandwidth is reported. The bandwidth performance is facilitated by embedding non-Foster components into the near-field resonant parasitic elements of this metamaterial-inspired antenna. High-quality and stable radiation performance characteristics are achieved over the entire operational bandwidth. When the ideal non-Foster components are introduced, the simulated impedance bandwidth witnesses approximately a 17-fold enhancement over the passive case. Within this -10-dB bandwidth, its maximum realized gain, radiation efficiency, and front-to-back ratio (FTBR) are, respectively, 4.00 dB, 88%, and 26.95 dB. When the anticipated actual negative impedance convertor circuits are incorporated, the impedance bandwidth still sustains more than a 10-fold enhancement. The peak realized gain, radiation efficiency, and FTBR values are, respectively, 3.74 dB, 80%, and 28.01 dB, which are very comparable to the ideal values.

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal.

隨著智慧家庭概念與技術的興盛與成熟，未來ISP(Internet Service Provider)業者勢必面臨管理大量智慧家庭中各種不同應用競爭頻寬資源的情況。為因應大量且繁雜類型的應用服務彼此競爭智慧家庭端及ISP端的頻寬資源，考量並應用適當的頻寬分配法則以盡可能優化使用者體驗(QoE)是本研究的研究動機。相關文獻的排程演算法如TDPSS (Time Domain Priority Set Scheduler)、MSCDL (Mac Scheduler)、Proportional Fair (PF)及Adaptive Modified Largest Weighted Delay First (AMLWDF)等。若要用以管理大量智慧家庭的頻寬資源時，ISP業者須將家庭申辦頻寬方案以及ISP端的系統頻寬分開考量。ISP在整合(aggregate)多個家庭的頻寬資源請求時，會依服務類別分配頻寬，最後依據不同類別採取適當處理，進而提升不同應用的QoS品質。 本篇論文著重於延遲時間的考量，提出能分類來自各個智慧家庭中，屬於不同 QCI (QoS Class Identifier)級別的頻寬請求並以不同佇列存放，依DADS (Delay Aware Dynamical Scheduling)演算法計算優先權值。我們利用保障頻寬與動態配置頻寬給不同用戶服務佇列，並優先分配頻寬給較高優先權的用戶服務，以期在維持一定公平性的前提下，盡可能地降低延遲來提升QoS品質。 在我們的實驗數據分析中，我們將DADS和其他方法如MSCDL、PF、TDPSS以及AMLWDF進行公平性、產能、延遲以及抖動率等效能優劣的比較與分析。最後在總結與未來研究方向，我們歸納與整理了DADS與PF、MSCDL、TDPSS以及AMLWDF等演算法的效能優劣。實驗結果顯示，在延遲上，DADS勝過PF和TDPSS，但略輸MSCDL及AMLWDF；在抖動率及產能上，DADS均較其它四者為差；公平性上則是劣於TDPSS、PF及MSCDL但優於AMLWDF。雖然DADS在整體的表現並非最好，但在特別重視延遲時間的Category1類別(包含QCI級別為1、2及5的應用服務)的延遲效能僅輸AMLWDF些許，而產能卻明顯勝過AMLWDF，由此可見DADS在Category1的表現最佳。 / With the concept and technology of smart homes becoming more and more mature and popular, Internet service provider (ISP) must face managing large set of various applications from smart homes which competing for bandwidth resources. In order to enhance Quality of Services (QoS) of a lot of various applications while they are competing bandwidth resources of both smart homes (home internal) and Internet service provider (home external), we propose a QoS aware bandwidth allocation criterion to optimize Quality of user Experience (QoE). Since ISP has to manage bandwidth resources of large set of smart homes, in the proposed criterion each ISP separates the bandwidth resources for home external bandwidth and system bandwidth of ISP, respectively. Then, aggregates bandwidth requests of large number of smart homes according to distinct service classes. This thesis focuses on the performance index of delay. We proposed to classify bandwidth requests from smart homes and put them into different queues, finally, calculate priority values by DADS (Delay Aware Dynamical Scheduling) algorithm. The proposed method is able to effectively reduce delay time with certain degree of fairness guarantee by dynamically allocate bandwidth resources for services with distinct service priorities. In the experiments, we compared DADS with other algorithms such as MSCDL (Mac Scheduler), PF (Proportional Fair), TDPSS (Time Domain Priority Set Scheduler) and AMLWDF (Adaptive Modified Largest Weighted Delay First), etc. in terms of fairness, throughput, delay and jitter. The experiments results show that DADS performs much better than PF and TDPSS but a bit worse than MSCDL and AMLWDF in terms of delay. However, DADS shows no better performance than all other algorithms in terms of jitter and throughput. In fairness comparison, DADS is worse than PF, TDPSS and MSCDL but is better than AMLWDF. Though DADS has no superior performance on overall indices, it is a bit worse than AMLWDF in delay of Category1 (including QCI 1, 2 and 5), its throughput is better than AMLWDF. Therefore, DADS’s performance is the best on Category1 considering overall indices.

O aumento da demanda por sistemas computacionais mais eficientes para obter alto desempenho impôs novos desafios à comunidade de pesquisa, que precisou buscar por novas plataformas heterogêneas para grandes aplicações. Para utilizar todo o potencial dessas plataformas, podese agrupar a aplicação em grupos menores de modo que cada grupo seja executado em uma unidade de processamento específica, para reduzir o gargalo de comunicação, de acordo com o comportamento de comunicação durante a execução da aplicação. Com o propósito de oferecer um agrupamento mais eficiente, este projeto propõe a análise de agrupamento de uma aplicação levando em consideração não só o volume total de dados, mas também a distribuição desse volume durante o tempo de execução associado à restrição da banda e da taxa de transmissão. Embora alguns trabalhos considerem o volume total de dados para o agrupamento, não é evidenciado como esse volume é distribuído e como a restrição de banda afeta o agrupamento. Assim, neste projeto foi implementado um framework para sugerir um agrupamento considerando a distribuição do volume de comunicação e restrições de banda. Além disso, foi desenvolvido um módulo de extensão para a ferramenta externa MCProf (Memory and Communication Profiler) com o objetivo de obter a distribuição do volume de comunicação. A validação do framework foi realizada por meios de testes de agrupamentos de aplicações nos quais foram comparados o tempo de comunicação do agrupamento gerado pela execução do framework em relação aos resultado dos agrupamentos considerando os trabalhos da literatura. O uso desta abordagem apresentou um aumento no desempenho que variou de 1,117X a 2,621X para as aplicações usadas nos experimentos. / The increased demand for more efficient computing systems to achieve high performance proposed new challenges to the research community, which needed to search for new heterogeneous platforms for large applications. To utilize the full potential of these platforms, the application can be grouped into small groups that runs on a specific processing unit to reduce the communication bottleneck according to the communication behavior during application execution . With the purpose of offering a more efficient clustering, this project proposes the analysis of clustering of an application taking into account not only the total volume of data, but also the distribution of that volume during the execution time associated to the band and restriction of rate transmission. Although some studies consider the total volume of data for the cluster, it is not clear how this volume is distributed and how the band constraint affects clustering. Thus, in this project was implemented a framework to suggest a cluster considering the distribution of the volume of communication and band restrictions. In addition, an extension module was developed for the external tool MCProf (Memory and Communication Profiler) in order to obtain the distribution of the communication. The validation of the framework was performed by clsutering tests which used applications in which the communication time of the cluster generated by the execution of framework was compared to the results of the clusters considering the literature. The use of this approach showed an increase in performance ranging from 1.117X to 2.621X for the applications used in the experiments.

Made available in DSpace on 2016-04-04T18:31:32Z (GMT). No. of bitstreams: 1 Aturo Jose Fenile Peris.pdf: 4348655 bytes, checksum: 34479e7af136c0f06a1b46d21b30c1c4 (MD5) Previous issue date: 2012-06-22 / The design of the IEEE 802.11 standard allows, in certain situations, competition for access to the transmission medium results in an anomaly. As a result of this anomaly, mobile stations that should achieve high rates of transmission are impaired and don t get those rates. The consequence is the transmission capacity low utilization of the wireless system and the natural increasing of the time mobile stations stays on (and consuming energy); because of this, the increase in energy consumption is another effect of this anomaly. From this scenario, one way to deal with this anomaly is to have a better utilization of the wireless transmission medium. In this context, this work proposes a bench for studies of flow control in IEEE 802.11; this bench allows the management of bandwidth and the collection of traffic statistics from users sessions connected to the wireless network. As a resulting study from the bench using, there is a proposal to mitigate the anomaly through the user traffic management. The results indicate that the controlling the traffic from users who are in poor wireless transmission may produce a better utilization of transmission capacity of an IEEE 802.11 access point. / A concep??o do padr?o IEEE 802.11 permite que, em determinadas situa??es, a competi??o pelo acesso ao meio de transmiss?o resulte em uma anomalia. Como resultado dessa anomalia, esta??es m?veis que deveriam conseguir altas taxas de transmiss?o s?o prejudicadas e acabam por n?o conseguir essas taxas. A consequ?ncia ? o baixo aproveitamento da capacidade de transmiss?o do sistema sem fio e o natural aumento do tempo em que as esta??es m?veis permanecem ligadas e consumindo energia; por conta disso, o aumento no consumo de energia ? outro efeito dessa anomalia. A partir desse cen?rio, uma forma de combater essa anomalia ? a melhoria da utiliza??o do meio de transmiss?o sem fio. Nesse contexto, este trabalho apresenta uma proposta de bancada para estudos de controle de vaz?o em redes IEEE 802.11; essa bancada permite gerenciar a largura de banda e coletar dados estat?sticos relativos ao tr?fego das sess?es dos usu?rios conectados ? rede sem fio. Como estudo resultante da utiliza??o da bancada, h? uma proposta de mitiga??o da anomalia por meio da gest?o do tr?fego dos usu?rios. Os resultados indicam que o controle do tr?fego de usu?rios que est?o em m?s condi??es de transmiss?o sem fio pode melhorar o aproveitamento da capacidade de transmiss?o de um ponto de acesso IEEE 802.11.

Nesta dissertação, os principais conceitos de MEMS, suas aplicações, processos de fabricação, componentes e sistemas são abordados. O objetivo desta dissertação é o estudo detalhado de chaves MEMS para aplicações em RF, que apresentam bom comportamento em altas freqüências e com potencial de melhoria em sua banda de operação. Em particular, aprofundou-se o estudo para o caso de uma chave MEMS de membrana capacitiva paralela sobre um guia de onda coplanar ou CPW - Coplanar Waveguide. O objetivo foi o de ampliar sua banda de operação, mantendo-se outras especificações inalteradas. Partindo-se de uma chave com banda de operação nula para critérios de perda de retorno e isolação mínimas iguais a 20 dB, com alteração na geometria da chave foi possível obter-se uma banda de 28 GHz e posteriormente ampliá-la para 31 GHz, praticamente sem alteração nas demais características elétricas. / In this thesis, the main concepts of MEMS, their application, fabrication processes, components and systems are addressed. The objective of the thesis is a detailed study of MEMS switches for RF applications, that present good performance at high frequencies and with a potential for bandwidth improvement. More specifically, the study was deeply conducted for shunt capacitive membrane MEMS switches over CPW - Coplanar Waveguide. In this case, the objective was to enlarge the operation bandwidth, keeping the other specifications unchanged. Starting with a switch with null operational bandwidth for criteria of minimum return loss and isolation of 20 dB, after a modification in the switch geometry, it was possible to obtain an operational bandwidth of 28 GHz and then to enlarge it to 31 GHz, keeping almost unchanged the other electric characteristics.

Processadores embarcados utilizam eficientemente o paralelismo a nível de instrução para atender as necessidades de desempenho e energia em aplicações atuais. Embora a melhoria de performance seja um dos principais objetivos em processadores em geral, ela pode levar a um impacto negativo no consumo de energia, uma restrição crítica para sistemas atuais. Nesta dissertação, apresentamos o SoMMA, uma arquitetura de memória gerenciada por software para processadores embarcados capaz de reduz consumo de energia e energy-delay product (EDP), enquanto ainda aumenta a banda de memória. A solução combina o uso de memórias gerenciadas por software com a cache de dados, de modo a reduzir o consumo de energia e EDP do sistema. SoMMA também melhora a performance do sistema, pois os acessos à memória podem ser realizados em paralelo, sem custo em portas de memória extra na cache de dados. Transformações de código do compilador auxiliam o programador a utilizar a arquitetura proposta. Resultados experimentais mostram que SoMMA é mais eficiente em termos de energia e desempenho tanto a nível de processador quanto a nível do sistema completo. A técnica apresenta speedups de 1.118x e 1.121x, consumindo 11% e 12.8% menos energia quando comparando processadores que utilizam e não utilizam SoMMA. Há ainda redução de até 41.5% em EDP do sistema, sempre mantendo a área dos processadores equivalentes. Por fim, SoMMA também reduz o número de cache misses quando comparado ao processador baseline. / Embedded processors rely on the efficient use of instruction-level parallelism to answer the performance and energy needs of modern applications. Though improving performance is the primary goal for processors in general, it might lead to a negative impact on energy consumption, a particularly critical constraint for current systems. In this dissertation, we present SoMMA, a software-managed memory architecture for embedded multi-issue processors that can reduce energy consumption and energy-delay product (EDP), while still providing an increase in memory bandwidth. We combine the use of software-managed memories (SMM) with the data cache, and leverage the lower energy access cost of SMMs to provide a processor with reduced energy consumption and EDP. SoMMA also provides a better overall performance, as memory accesses can be performed in parallel, with no cost in extra memory ports. Compiler-automated code transformations minimize the programmer’s effort to benefit from the proposed architecture. Our experimental results show that SoMMA is more energy- and performance-efficient not only for the processing cores, but also at full-system level. Comparisons were done using the VEX processor, a VLIW reconfigurable processor. The approach shows average speedups of 1.118x and 1.121x, while consuming up to 11% and 12.8% less energy when comparing two modified processors and their baselines. SoMMA also shows reduction of up to 41.5% on full-system EDP, maintaining the same processor area as baseline processors. Lastly, even with SoMMA halving the data cache size, we still reduce the number of data cache misses in comparison to baselines.

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / Em razÃo da crescente demanda de usuÃrios mÃveis por conteÃdos criados com formato especÃfico e personalizado, ou adaptado para atender suas necessidades e preferÃncias no uso da web, as redes convergentes sensÃveis ao contexto incorporam uma promissora tecnologia para permitir aplicaÃÃes de serviÃos personalizados a mÃltiplos usuÃrios. O projeto C-CAST (Context Casting) (C-CAST, 2012) foi estabelecido para arquiteturas de redes convergentes sensÃveis ao contexto para suportar sessÃes com qualidade de serviÃo (QoS - Quality of Service) de forma garantida a mÃltiplos usuÃrios, simultaneamente, independentemente de suas tecnologias de conexÃo sem fio. O mecanismo de controle do C-CAST Legado introduz questÃes de degradaÃÃo de desempenho, visto que a abordagem de sinalizaÃÃo adotada à direcionada por fluxo. Isto significa que a carga de sinalizaÃÃo aumenta exponencialmente com o nÃmero de admissÃes de fluxo. Este trabalho propÃe o C-CAST AvanÃado, o qual aperfeiÃoa o sistema do C-CAST Legado pela extensÃo de mecanismos inovadores que integram um controle dinÃmico da largura de banda sobreaprovisionada por classes de serviÃo e alocaÃÃo de Ãrvores overlay. Por meio dessa estratÃgia, busca-se reduzir taxas de sinalizaÃÃo de controle e alocaÃÃo de recursos em todo o sistema. A avaliaÃÃo do C-CAST AvanÃado à conduzida por meio de simulaÃÃo, demonstrando seus benefÃcios em relaÃÃo ao C-CAST Legado, por otimizar significativamente os nÃveis de desempenho de todo o sistema de rede, enquanto mantÃm usuÃrios com a melhor percepÃÃo de qualidade. / Due to the increase demand of mobile users for content created in a specific and customized way, or adapted to comply with the needs and preferences in web usage, converged networks which are context-sensitive have been incorporated to a promising technology and enabled applications of personalized services to multiple users. The C-CAST project (Context Casting) was established to converged network architectures to support context-sensitive sessions with quality of service (QoS - Quality of Service) in a manner to guarantee to multiple users simultaneously, regardless of their wireless technologies. The C-CAST control mechanism of the Legacy introduces issues of performance degradation, once the signaling approach adopted is directed per-flow, which means that the signaling load increases exponentially with the number of admissions flow. This work proposes the Advanced of C-CAST, which reconstruct the C-CAST legacy system by the extent of innovative mechanisms that integrate dynamic control of provisioned bandwidth by the service classes and allocation overlay trees. Through this strategy, it seeks to reduce rates of control signaling and allocating resources throughout the system. The C-CAST Advanced evaluation is conducted through simulation, demonstrating its benefits in relation to C-CAST Legacy, by significantly optimization the performance levels of the entire network system while keep the network users with the best quality perception.