ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada / The integrated Network Enhanced Telemetry (iNET) environment is meant to build and improve on the existing unidirectional legacy telemetry links. The optimized network would have to be capable of providing bi-directional, spectrally efficient, reliable, dynamically allocated, real time or near real time access to video and other types of test data over a shared bandwidth, high capacity network. Developed specifically for providing a reliable means of communications for large numbers of users, cellular technology seems particularly suited to addressing iNET’s needs. This paper investigates the creation of a cellular model for enhanced throughput for data users wherein a user would dynamically be allocated high data rates dependent on parameters such as the received signal to noise ratio (SNR). Our future work will develop the average data performance, comparing both the time division multiple access (TDMA) and code division multiple access (CDMA) environments for potential application in iNET.

A proof of concept study into the working of network media capture and visualization through the use of Packet Capture in real-time. An application was developed that is able to capture tcp network packets; identify and display images in raw HTTP network traffic through the use of search, sort, error detection, timeout failsafe algorithms in real time. The application was designed for network administrators to visualize raw network media content together with its relevant network source \& address identifiers. Different approaches were tried and tested such as using Perl with GTK+ and Visual Studio C\# .Net. Furthermore two different types of image identification methods were used: raw magic string identification in pure tcp network traffic and HTTP Mime type identification. The latter being more accurate and faster. C# was seen as vastly superior in both speed of prototyping and final performance evaluation. The study presents a novel new way of monitoring networks on the basis of their media content through deep packet inspection

Les systèmes de 3G offrent de nouveaux services support (bearer services) à plus hauts débits pour les modes de transmission "paquet". Ces services vont coexister avec la voix (ou d'autres services temps réels), des scénarios de trafic mixte, voix et données, doivent être envisagés. La norme UMTS permet effectivement aux utilisateurs d'avoir plus d'un service activé simultanément. Les différentes classes de trafic augmentent la complexité de la gestion des ressources radios. Dans ce contexte, deux types de fonctions sont étudiés: l'allocation de TFCI et l'ordonnancement de paquets. Leur impact sur la qualité de service (QoS) ainsi que sur la capacité du système est évalué. On propose des améliorations de ces mécanismes dans le but d'augmenter la capacité du système et par conséquent d'améliorer la QoS des utilisateurs. Les études se restreignent au sens montant, c'est à dire aux transmissions du mobile (User Equipment ou UE) vers le réseau. Un premier mécanisme pour lequel un effort d'amélioration est fait, est l'adaptation du lien radio par variation du débit instantané transmis. On simule le cas d'une transmission multiservice (voix et données). L'UE doit partager un débit global qui lui est alloué entre les différents services activés. Ces derniers sont véhiculés dans des radio bearers (tuyaux supports). À chaque intervalle élémentaire de transmission (Transmission Time Interval, TTI), l'UE sélectionne un sous-débit pour chaque bearer; ceci se fait par la sélection d'un "format de transport" à appliquer pendant la durée TTI. Cette procédure s'effectue dans la couche MAC (Medium Access Control); le résultat de la sélection est une combinaison de formats de transport (Transport Format Combination, TFC) que la couche physique doit utiliser. La procédure, nommée sélection de TFC, permet d'adapter la transmission des différents services aux conditions variables de la propagation radio: elle détermine notablement la performance de transmission. L'algorithme de sélection de TFC est tracé dans ses grandes lignes dans la norme. Un de ses principes est de favoriser le trafic temps réel au détriment des services de données par paquet. Cependant, le trafic temps réel peut être perturbé par le trafic de données sous certaines conditions, en particulier pour les mobiles éloignés de la station de base (Node B). On propose un algorithme de sélection de TFC qui limite ces perturbations et qui offre une plus large zone de couverture aux services temps réels. En plus, il améliore la QoS du service de données et le débit effectif de l'UE sans augmenter sa puissance de transmission. Un autre type d'études concerne l'ordonnancement de paquets entre les différents utilisateurs ou UEs. C'est une procédure qui est contrôlée par la partie fixe du réseau. Nous l'étudions principalement par simulation en considérant divers mécanismes ou variations. Un premier mécanisme est nommé fast Variable Spreading Factor (fast VSF): les UEs distants changent rapidement leur facteur d'étalement (SF) afin de conserver une puissance de transmission constante, ce qui vise à stabiliser l'interférence inter-cellulaire. Un deuxième mécanisme étudié est un accès paquet décentralisé (decentralized mode) utilisant une information en retour sur le niveau global d'interférence dans la cellule. Un troisième mécanisme nommé "fast scheduling" (ordonnancement rapide) raccourcit le cycle d'ordonnancement. Les résultats ont montré que dans le cas de faible ou moyenne charge dans la cellule, le mode décentralisé réduit le délai par paquet jusqu'à 25 %. L'ordonnancement rapide augmente la capacité du système jusqu' à 10%. En plus, il améliore la QoS perçue par les utilisateurs en terme de débit par utilisateur et délai par paquet transmis.

Orientadores: Peter Jurgen Tatsch, Marcos Rogerio Salvador / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-14T19:15:56Z (GMT). No. of bitstreams: 1 Oliveira_ViniciusGarciade_M.pdf: 16025820 bytes, checksum: 7d131f46cf420654c7f70129842770a7 (MD5) Previous issue date: 2009 / Resumo: A convergência das aplicações, dos serviços e das redes de telecomunicação está mudando o mundo e o jeito como as pessoas agem e interagem. Embora com limitações, computação distribuída, teleconferência, tele-educação rádio, televisão e jogos já são possíveis na Internet. É razoável propor que em um futuro próximo estas limitações tendam a desaparecer e será possível suportar aplicações bem mais sofisticadas e complexas, tais como realidade virtual e tele-presença. ...Observação: O resumo, na íntegra, poderá ser visualizado no texto completo da tese digital. / Abstract: The convergence of the services, applications and telecommunication networks is changing the way people do their things and interact to each other. With limitations, distributed computing, teleconference, tele-education, radio, television and games are already possible through the Internet. In a close future these limitations probably will disappear and it will be possible to provide new and more sophisticated applications as virtual reality and tele-presence....Note: The complete abstract is available with the full electronic document / Mestrado / Telecomunicações / Mestre em Engenharia Elétrica

Multiple-input, multiple-output (MIMO) techniques have been proposed to meet the needs for higher data rates and lower delays in future wireless communication systems. The downlink capacity of multiuser MIMO systems is achieved when the system transmits to several users simultaneously. Frequently, many more users request service than the transmitter can simultaneously support. Thus, the transmitter requires a scheduling algorithm for the users, which must balance the goals of increasing throughput, reducing multiuser interference, lowering delays, ensuring fairness and quality of service (QoS), etc. In this thesis, we investigate the application of genetic algorithms (GAs) to perform scheduling in multiuser MIMO systems. GAs are a fast, suboptimal, low-complexity method of solving optimization problems, such as the maximization of a scheduling metric, and can handle arbitrary functions and QoS constraints. We first examine a system that transmits using capacity-achieving dirty paper coding (DPC). Our proposed GA structure both selects users and determines their encoding order for DPC, which affects the rates they receive. Our GA can also schedule users independently on different carriers of a multi-carrier system. We demonstrate that the GA performance is close to that of an optimal exhaustive search, but at a greatly reduced complexity. We further show that the GA convergence time can be significantly reduced by tuning the values of its parameters. While DPC is capacity-achieving, it is also very complex. Thus, we also investigate GA scheduling with two linear precoding schemes, block diagonalization and successive zero-forcing. We compare the complexity and performance of the GA with "greedy" scheduling algorithms, and find the GA is more complex, but performs better at higher signal-to-noise ratios (SNRs) and smaller user pool sizes. Both algorithms are near-optimal, yet much less complex than an exhaustive search. We also propose hybrid greedy-genetic algorithms to gain benefits from both types of algorithms. Lastly, we propose an improved method of optimizing the transmit covariance matrices for successive zero-forcing. Our algorithm significantly improves upon the performance of the existing method at medium to high SNRs, and, unlike the existing method, can maximize a weighted sum rate, which is important for fairness and QoS considerations. / Communications

No description available.