No / Cognitive Radio (CR) is an emerging technology used to significantly improve the efficiency of spectrum utilization. Although some spectrum bands in the primary user's licensed spectrum are intensively used, most of the spectrum bands remain underutilized. The introduction of open spectrum and dynamic spectrum access lets the secondary (unlicensed) users, supported by cognitive radios; opportunistically utilize the unused spectrum bands. However, if a primary user returns to a band occupied by a secondary user, the occupied spectrum band is vacated immediately by handing off the secondary user's call to another idle spectrum band. Multiple spectrum handoffs can severely degrade quality of service (QoS) for the interrupted users. To avoid multiple handoffs, when a licensed primary user appears at the engaged licensed band utilized by a secondary user, an effective spectrum handoff procedure should be initiated to maintain a required level of QoS for secondary users. In other words, it enables the channel clearing while searching for target vacant channel(s) for completing unfinished transmission. This paper proposes prioritized proactive spectrum handoff decision schemes to reduce the handoff delay and the total service time. The proposed schemes have been modeled using a preemptive resume priority (PRP) M/G/1 queue to give a high priority to interrupted users to resume their transmission ahead of any other uninterrupted secondary user. The performance of proposed handoff schemes has been evaluated and compared against the existing spectrum handoff schemes. Experimental results show that the schemes developed here outperform the existing schemes in terms of average handoff delay and total service time under various traffic arrival rates as well as service rates.

With the development of on-chip manufacturing technologies and the requirements of high-performance computing, the core count is growing quickly in Chip Multi/Many-core Processors (CMPs) and Multiprocessor System-on-Chip (MPSoC) to support larger scale parallel execution. Network-on-Chip (NoC) has become the de facto solution for CMPs and MPSoCs in addressing the communication challenge. In the thesis, we tackle a few key problems facing high-performance NoC designs. For general-purpose CMPs, we encompass a full system perspective to design high-performance NoC for multi-threaded programs. By exploring the cache coherence under the whole system scenario, we present a smart communication service called Advance Virtual Channel Reservation (AVCR) to provide a highway to target packets, which can greatly reduce their contention delay in NoC. AVCR takes advantage of the fact that we can know or predict the destination of some packets ahead of their arrival at the Network Interface (NI). Exploiting the time interval before a packet is ready, AVCR establishes an end-to-end highway from the source NI to the destination NI. This highway is built up by reserving the Virtual Channel (VC) resources ahead of the target packet transmission and offering priority service to flits in the reserved VC in the wormhole router, which can avoid the target packets’ VC allocation and switch arbitration delay. Besides, we also propose an admission control method in NoC with a centralized Artificial Neural Network (ANN) admission controller, which can improve system performance by predicting the most appropriate injection rate of each node using the network performance information. In the online control process, a data preprocessing unit is applied to simplify the ANN architecture and make the prediction results more accurate. Based on the preprocessed information, the ANN predictor determines the control strategy and broadcasts it to each node where the admission control will be applied. For application-specific MPSoCs, we focus on developing high-performance NoC and NI compatible with the common AMBA AXI4 interconnect protocol. To offer the possibility of utilizing the AXI4 based processors and peripherals in the on-chip network based system, we propose a whole system architecture solution to make the AXI4 protocol compatible with the NoC based communication interconnect in the many-core system. Due to possible out-of-order transmission in the NoC interconnect, which conflicts with the ordering requirements specified by the AXI4 protocol, in the first place, we especially focus on the design of the transaction ordering units, realizing a high-performance and low cost solution to the ordering requirements. The microarchitectures and the functionalities of the transaction ordering units are also described and explained in detail for ease of implementation. Then, we focus on the NI and the Quality of Service (QoS) support in NoC. In our design, the NI is proposed to make the NoC architecture independent from the AXI4 protocol via message format conversion between the AXI4 signal format and the packet format, offering high flexibility to the NoC design. The NoC based communication architecture is designed to support high-performance multiple QoS schemes. The NoC system contains Time Division Multiplexing (TDM) and VC subnetworks to apply multiple QoS schemes to AXI4 signals with different QoS tags and the NI is responsible for traffic distribution between two subnetworks. Besides, a QoS inheritance mechanism is applied in the slave-side NI to support QoS during packets’ round-trip transfer in NoC. / Med utvecklingen av tillverkningsteknologi av on-chip och kraven på högpresterande da-toranläggning växer kärnantalet snabbt i Chip Multi/Many-core Processors (CMPs) ochMultiprocessor Systems-on-Chip (MPSoCs) för att stödja större parallellkörning. Network-on-Chip (NoC) har blivit den de facto lösningen för CMP:er och MPSoC:er för att mötakommunikationsutmaningen. I uppsatsen tar vi upp några viktiga problem med hög-presterande NoC-konstruktioner.Allmänna CMP:er omfattas ett fullständigt systemperspektiv för att design högprester-ande NoC för flertrådad program. Genom att utforska cachekoherensen under hela system-scenariot presenterar vi en smart kommunikationstjänst, AVCR (Advance Virtual ChannelReservation) för att tillhandahålla en motorväg till målpaket, vilket i hög grad kan min-ska deras förseningar i NoC. AVCR utnyttjar det faktum att vi kan veta eller förutsägadestinationen för vissa paket före deras ankomst till nätverksgränssnittet (Network inter-face, NI). Genom att utnyttja tidsintervallet innan ett paket är klart, etablerar AVCRen ände till ände motorväg från källan NI till destinationen NI. Denna motorväg byggsupp genom att reservera virtuell kanal (Virtual Channel, VC) resurser före målpaket-söverföringen och erbjuda prioriterade tjänster till flisar i den reserverade VC i wormholerouter. Dessutom föreslår vi också en tillträdeskontrollmetod i NoC med en centraliseradartificiellt neuronät (Artificial Neural Network, ANN) tillträdeskontroll, som kan förbättrasystemets prestanda genom att förutsäga den mest lämpliga injektionshastigheten för varjenod via nätverksprestationsinformationen. I onlinekontrollprocessen används en förbehan-dlingsenhet på data för att förenkla ANN-arkitekturen och göra förutsägningsresultatenmer korrekta. Baserat på den förbehandlade informationen bestämmer ANN-prediktornkontrollstrategin och sänder den till varje nod där tillträdeskontrollen kommer att tilläm-pas.För applikationsspecifika MPSoC:er fokuserar vi på att utveckla högpresterande NoCoch NI kompatibla med det gemensamma AMBA AXI4 protokoll. För att erbjuda möj-ligheten att använda AXI4-baserade processorer och kringutrustning i det on-chip baseradenätverkssystemet föreslår vi en hel systemarkitekturlösning för att göra AXI4 protokolletkompatibelt med den NoC-baserade kommunikation i det multikärnsystemet. På grundav den out-of-order överföring i NoC, som strider mot ordningskraven som anges i AXI4-protokollet, fokuserar vi i första hand på utformningen av transaktionsordningsenheterna,för att förverkliga en hög prestanda och låg kostnad-lösning på ordningskraven. Sedanfokuserar vi på NI och Quality of Service (QoS)-stödet i NoC. I vår design föreslås NI attgöra NoC-arkitekturen oberoende av AXI4-protokollet via meddelandeformatkonverteringmellan AXI4 signalformatet och paketformatet, vilket erbjuder NoC-designen hög flexi-bilitet. Den NoC-baserade kommunikationsarkitekturen är utformad för att stödja fleraQoS-schema med hög prestanda. NoC-systemet innehåller Time-Division Multiplexing(TDM) och VC-subnät för att tillämpa flera QoS-scheman på AXI4-signaler med olikaQoS-taggar och NI ansvarar för trafikdistribution mellan två subnät. Dessutom tillämpasen QoS-arvsmekanism i slav-sidan NI för att stödja QoS under paketets tur-returöverföringiNoC / <p>QC 20201008</p>

One of the enabling technologies for Long Term Evolution (LTE) deployments is the femtocell technology. By having femtocells deployed indoors and closer to the user, high data rate services can be provided efficiently. These femtocells are expected to be depolyed in large numbers which raises many technical challenges including the handover management. In fact, managing handovers in femtocell environments, with the conventional manual adjustment techniques, is almost impossible to keep pace with in such a rapidly growing femtocell environment. Therefore, doing this automatically by implementing Self Organizing Network (SON) use cases becomes a necessity rather than an option. However, having multiple SON use cases operating simultaneously with a shared objective could cause them to interact either negatively or positively. In both cases, designing a suitable coordination policy is critical in solving negative conflicts and building upon positive benefits. In this work, we focus on studying the interactions between three self optimization use cases aiming at improving the overall handover procedure in LTE femtocell networks. These self optimization use cases are handover, Call Admission Control (CAC) and load balancing. We develop a comprehensive, unified LTE compliant evaluation environment. This environment is extendable to other radio access technologies including LTE-Advanced (LTE-A), and can also be used to study other SON use cases. Various recommendations made by main bodies in the area of femtocells are considered including the Small Cell Forum, the Next Generation Mobile Networks (NGMN) alliance and the 3rd Generation Partnership Project (3GPP). Additionally, traffic sources are simulated in compliance with these recommendations and evaluation methodologies. We study the interaction between three representative handover related self optimization schemes. We start by testing these schemes separately, in order to make sure that they meet their individual goals, and then their mutual interactions when operating simultaneously. Based on these experiments, we recommend several guidelines that can help mobile network operators and researchers in designing better coordination policies. / Thesis (Master, Electrical & Computer Engineering) -- Queen's University, 2012-12-05 22:35:27.538

Actuellement, nous constatons une augmentation de demande de services vidéo sur les réseaux P2P. Ces réseaux jouent un rôle primordial dans la transmission de contenus multimédia à grande échelle pour des clients hétérogènes. Cependant, le déploiement de services vidéo temps réel sur les réseaux P2P a suscité un grand nombre de défis dû à l’hétérogénéité des terminaux et des réseaux d’accès, aux caractéristiques dynamiques des pairs, et aux autres problèmes hérités des protocoles TCP/IP, à savoir les pertes de paquets, les délais de transfert et la variation de la bande passante de bout-en-bout. Dans ce contexte, l’objectif de cette thèse est d’analyser les différents problèmes et de proposer un mécanisme de transport vidéo temps réel avec le provisionnement de la qualité de Service (QoS). Ainsi, nous proposons trois contributions majeures. Premièrement, il s’agit d’un mécanisme de streaming vidéo adaptatif permettant de sélectionner les meilleurs pair émetteurs. Ce mécanisme permet de structurer les pairs dans des réseaux overlay hybrides avec une prise en charge des caractéristiques sémantiques du contenu et des caractéristiques physiques du lien de transport. Nous présentons ensuite un mécanisme d’ordonnancement de paquets vidéo combiné à une commutation de pairs et/ou de flux pour assurer un transport lisse. Finalement, une architecture de collaboration entre les applications P2P et les fournisseurs de services / réseaux est proposée pour supporter un contrôle d’admission de flux. / There is an increasing demand for scalable deployment of real-time multimedia streaming applications over Internet. In this context, Peer-to-Peer (P2P) networks are playing an important role for supporting robust and large-scale transmission of multimedia content to heterogeneous clients. However, the deployment of real-time video streaming applications over P2P networks arises lot of challenges due to heterogeneity of terminals and access networks, dynamicity of peers, and other problems inherited from IP network. Real-time streaming applications are very sensitive to packet loss, jitter / transmission delay, and available end-to-end bandwidth. These elements have key importance in QoS provisioning and need extra consideration for smooth delivery of video streaming applications over P2P networks. Beside the abovementioned issues, P2P applications lack of awareness in constructing their overlay topologies and do not have any explicit interaction with service and network providers. This situation leads to inefficient utilization of network resources and may cause potential violation of peering agreements between providers. The aim of this thesis is to analyze these issues and to propose an adaptive real-time transport mechanism for QoS provisioning of Scalable Video Coding (SVC) applications over P2P networks. Our contributions in this dissertation are threefold. First, we propose a hybrid overlay organization mechanism allowing intelligent organization of sender peers based on network-awareness, media- awareness, and quality-awareness. This overlay organization is further used for an appropriate selection of best sender peers, and the efficient switching of peers to ensure a smooth video delivery when any of the sender peers is no more reliable. Second, we propose a packet video scheduling mechanism to assign different parts of the video content to specific peers. Third, we present a service provider driven P2P network framework that enables effective interaction between service / network providers and P2P applications to perform QoS provisioning mechanism for the video streaming.

Les dernières décennies ont connu l’apogée des transmissions hertziennes, et celles à venir connaîtront incontestablement le développement et le déploiement intense de systèmes de communications sans-fil. Dès à présent, il est possible de communiquer par onde sur petite et très petite distance (LAN et PAN). Les populations se sont familiariséesavec les interfaces bluetooth (IEEE802.15) présentes dans la majorité des objetscommuniquant (ordinateur portable, téléphone, PDA, etc...). Les foyers s’équipentmaintenant facilement et à bas prix d’interfaceWi-Fi (IEEE802.11), afin de profiter d’uneutilisation nomade de leur accès internet. Ainsi, la forte croissance dumarché des offresinternet combinée avec celle du marché des téléphones mobiles ont habitués un large spectre d’utilisateurs à communiquer sans fil. Ce contexte sociologique et financier encourage donc l’arrivée de solutions nouvelles répondant à des besoins latents. Parmi ceux-là, le marché met en évidence le manque de système de communication sur moyenne distance (MAN). Les réseaux ad-hoc peuvent répondre à ce genre de besoin. Mais àce jour, les performances sont trop faibles pour les besoins des utilisateurs et elles dépendenttrop fortement de la densité desmachines nomades. Aussi, le consortiumIEEEcherche au travers de sa norme IEEE802.16 à fournir un système complet de communicationsans-fil sur moyenne distance (MAN). Appelé aussiWiMAX, ce système se basesur une architecture composée d’une station de base (BS) et de nombreux mobiles utilisateurs(SS). Le standard IEEE802.16 définit les caractéristiques de la couche physiqueet de la couche MAC. Il décrit l’ensemble des interactions et événements pouvant avoirlieu entre la station de base et les stations mobiles. Enfin, le standard fournit différents paramètres et variables servant aux mécanismes de communication. Comme tout nouveau standard émergeant, la norme IEEE802.16 ne profite pas d’un état de l’art aussi développé que celui du IEEE802.11 par exemple. Aussi, de nombreuses études et idées sont à développer.En premier lieu, nous effectuons un large rappel de la norme WiMAX et en particulier le IEEE802.16e. Associé à cela, nous dressons un état de l’art des travaux traitant des aspects et perspectives liés au sujet de notre étude.Par la suite, nous proposons un modèle novateur de performance des communicationsIEEE802.16e. Au travers de ce modèle, nous développons une étude générale et exhaustive des principaux paramètres de communication. L’étude explicite l’impact deces paramètres ainsi que l’influence de leur évolutions possibles. De cela, nous critiquonsla pertinence de chacun d’eux en proposant des alternatives de configurations.5En sus, nous proposons un mécanisme novateur favorisant le respect de qualité de service(QoS) sur couche AC.Nous développons un principe original d’établissement de connexion favorisant l’accès aux communications sensibles aux délais de transmission.Dans une dernière partie, nous déterminons la capacité d’un système IEEE802.16 à gérer les arrivées et départs des utilisateurs. Tout en y associant une étude de performance d’un nouvel algorithme de contrôle d’admission. Cet algorithme d’admission vise à remplir des objectifs multiples : empêcher les famines de ressources sur les trafics les moins prioritaires, favoriser l’admission des utilisateurs en maintenant une gestion optimale de la ressource radio. Notre étude aboutit à une modélisation et une critique des variations de paramètre associés à ce nouvel algorithme. Nous y intégrons par la suite le principe de mobilité où les utilisateurs ont la capacité de se mouvoir au sein d’une cellule. Cette intégration se fait en y associant des mécanismes originaux afin d’assurer la pérennité du service aux utilisateurs mobiles. / The last decade witnessed the peak of the hertzian communications. The following ones will undoubtedly testify the intensive deployment and the development of all wireless ways of transmission. Due to cheaper equipments, the people are now used with all sorts of connected objects : laptop, smartphone, pad, and more recently, Connected Video display and audio diffusers. All these stuffs allow to keep an access to internet, even in a nomad use. This economical and sociological context promotes the emerging of new solutions metting latent needs by offering better performances. Consumer studies highlight particularly the lack of transmissions solution for Metropolitan Area Networks (MAN). Ad-hoc wireless solutions lead to satisfy the MAN needs, but the throughput is too importantly related to the ad-hoc customer capacity and density over the MAN coverage.The IEEE consortium seeks, through its IEEE802.16e standart, to provide a wireless transmission technology specifically design for the middle range network. Knowed as WiMAX, this system are based on a point to multipoint architecture. WiMAX standart gathers Base Station (BS) and Subscriber Stations (SS), and defines for both the Physical and MAC layer in the OSI Model. In addition, the standart proposes a set of default parameters for the two first OSI Layers.As any emerging standart, the IEEE802.16e suffers form a lack of litterature (works, studies and enhancement proposals). More studies are explicitly needed to craft and tune the IEEE802.16e standart in order to better answer to the specific issues met in the actual context of transmission.In a first step, we present in a large scale the IEEE802.16e standart specifications. In addition we highlight the main state of art linked to this subject.Second, we propose an original performance model, the first one that takes in account all the MAC layer parameters of the standart. Based on this model, we lead a general and exhaustive performance study of each communication parameters. This study highlights the importance of each parameters and propose some enhancements in fonction of the type of Quality of Service (QoS). In addition, we introduce an call engaging mecanism which respects the QoS on the MAC layer.In a last part, we compute the IEEE802.16e capacity to manage the incoming and leaving calls. we perform this study by introducing a new Connection Admission Control (CAC). The CAC algorithm achieves sevral objectives : prevent from the lack of ressource for the lowest priority flows as well as optimize the radio resource consumption to facilitate the access for the users. Our study is concluded by proposing an new capacity model and algorithm for the CAC. Moreover, this last proposal prevents the call drop due to user mobility.

Cette thèse porte sur l’étude d’un réseau de soins hiérarchique stochastique avec rejet où les patients sont transférés lorsque la capacité de l’hôpital d’accueil n’est pas suffisante. Les patients sont alors redirigés vers un autre hôpital, ou hors du réseau. Une application concrète sur les réseaux de périnatalité est proposée, et nous avons identifié plusieurs verrous scientifiques fondamentaux d’un point de vue stratégique et opérationnel. Dans la partie stratégique, nous nous sommes intéressés à un problème de planification de capacité dans le réseau. Nous avons développé un modèle de localisation et de dimensionnement non-linéaire qui tient compte de la nature stochastique du système. La linéarisation du modèle permet de résoudre des problèmes de taille réelle en temps raisonnable. Nous avons développé dans un second temps de nouvelles méthodologies d’approximation permettant d’évaluer la performance du réseau en termes de probabilité de rejet et de transfert entre hôpitaux. Dans la partie opérationnelle, nous avons étudié des politiques de pilotage d’admission optimales pour différentes tailles de réseaux de manière utiliser au mieux les ressources hospitalières. Finalement, nous avons construit un modèle de simulation couplant multi-agents et événements discrets permettant la validation des résultats précédents et l’évaluation de performance du système de manière réaliste. / In this thesis, by being motivated from the challenges in perinatal networks, we address design, evaluation and flow control of a stochastic healthcare network where there exist multiple levels of hospitals and different types of patients. Patients are supposed urgent; thus they can be rejected and overflow to another facility in the same network if no service capacity is available at their arrival. Rejection of patients due to the lack of service capacity is the common phenomenon in overflow networks. We approach the problem from both strategic and operational perspectives. In strategic part, we address a location & capacity planning problem for adjusting the network to better meet demographic changes. In operational part, we study the optimal patient admission control policies to increase flexibility in allocation of resources and improve the control of patient flow in the network. Finally, in order to evaluate the performance of the network, we develop new approximation methodologies that estimate the rejection probabilities in each hospital for each arriving patient group, thus the overflow probabilities among hospitals. Furthermore, an agent-based discrete-event simulation model is constructed to adequately represent our main applicationarea: Nord Hauts-de-Seine Perinatal Network. The simulation model is used to evaluate the performance of the complex network and more importantly evaluate the strength of the optimal results of our analytical models. The developed methodologies in this thesis are combined in a decision support tool, foreseen under the project “COVER”, which aims to assist health system managers to effectively plan strategic and operational decisions of a healthcare network and evaluate the performance of their decisions.

O crescente aumento da demanda de tráfego nas redes celulares vem aumentando a necessidade de uma melhor utilização dos recursos do sistema, já que sua expansão é custosa. Nas estações rádio base (ERB), a disponibilidade de largura de faixa de freqüências é limitada e desta maneira, em uma rede de comunicação móvel celular, o controle de admissão de chamadas exerce grande influência no desempenho do sistema, pois determina a utilização de banda das ERBs e se uma determinada quantidade de recursos (banda) será alocado ou não para uma determinada chamada. O desempenho da rede pode ser atrelado a determinados parâmetros, como a probabilidade de bloqueio de novas chamadas, probabilidade de bloqueio de chamadas handoff e a utilização de banda da rede. Este trabalho propõe um controle de admissão de chamadas que, no atendimento de uma chamada, faz o empréstimo de banda de chamadas em andamento na célula no caso de banda insuficiente. O sistema adota um mecanismo heurístico que determina a banda disponível para novas chamadas conforme os valores de certos parâmetros do sistema. O empréstimo de banda é realizado em chamadas em andamento nas células até níveis mínimos estabelecidos para cada tipo de chamada, que se diferenciam pelas necessidades de banda de cada uma. O algoritmo foi aplicado às bandas e características de uma rede de terceira geração (3G), que possui chamadas de voz, videoconferência, interação multimídia, e-mail, downloads e transferência de arquivos e a uma rede GSM/GPRS (global system for mobile communications/ general packet radio service), que possui chamadas de voz e de dados. Os resultados mostram melhorias na probabilidade de bloqueio de novas chamadas, probabilidade de bloqueio de handoff e na utilização de banda do sistema. / The recent growth in traffic loads in cellular networks has seen the need for a better use of system resources as its expansion is expensive. In the base transceiver station (BTS), the bandwidth availability is limited. Thus, in cellular networks the call admission control greatly influences the system performance because it determines the bandwidth use of the BTSs and if an amount of resources will or will not be allocated to a call. The network performance can be evaluated by parameters such as blocking probability of new calls, dropping probability of handoff calls and bandwidth use. This work proposes a call admission control that carries out the bandwidth borrowing when a call arrives and there is not enough bandwidth. The system makes use of a heuristic mechanism that determines the available bandwidth for the new calls according to some parameter values of the system. The bandwidth borrowing is applied to the cell ongoing calls until the minimum levels for each type are met. The algorithm was applied to the bandwidths and characteristics of a third generation cellular network, which supports voice calls, videoconference, multimedia interaction, e-mails, downloads and file transfers. It was also applied to a GSM/GPRS (global system for mobile communications/ general packet radio service), which supports voice and data calls. The results show improvements in the blocking probability of new calls, dropping probability of handoff calls and in the bandwidth use of the system.

A tecnologia WDM (Wavelength Division Multiplexing) e a introdução de OXCs (Optical Cross Connect) e OADMs (Optical Add/Drop Multiplexer) puramente ópticos podem dotar as redes ópticas da função de networking, ou seja, da capacidade de manipular comprimentos de onda de forma a implementar o roteamento destes. Esta possibilidade implica em uma nova forma de relacionamento das aplicações com a camada física, sendo a arquitetura GMPLS candidata a estabelecer tal relacionamento. Soluções eficientes para o problema de alocação de recursos e roteamento de tráfego tornam-se uma necessidade imperiosa em projeto, expansão e gerenciamento de redes ópticas. A contribuição desta tese consiste em relacionar funcionalidades tais como: agregação (grooming) de tráfego, mecanismo de controle de admissão de chamadas (CAC), mecanismos de restauração e alocação de conversores em redes ópticas heterogêneas, avaliando-se as métricas de probabilidade de bloqueio, probabilidade do tráfego bloqueado e imparcialidade (fairness). Tais funcionalidades são tratadas separadamente na literatura. Com este objetivo em mente modela-se a rede com duas camadas: a camada física e a camada virtual. Estabelecem-se duas políticas de agregação de tráfego MrTV (minimização da rota na topologia virtual) e MrTF (minimização da rota na topologia física) e analisa-se o desempenho destas em relação à porcentagem de tráfego bloqueado. Em seguida um mecanismo de controle de admissão de chamadas (CAC) é implementado e sua influência em termos de imparcialidade (fairness) e probabilidade de bloqueio é analisada. A simulação e análise de redes ópticas, como a Rede NSFnet e a Rede Nacional Italiana são executadas por meio da implementação de um grafo baseado em Zhu e Mukherjee [28]. Como resultado, a política MrTF apresenta menor porcentagem de tráfego bloqueado do que a política MrTV para as redes simuladas e a implementação de um mecanismo de janela deslizante (rolling window) tornou o mecanismo de CAC mais otimizado. A utilidade de se implantar conversores de comprimento de onda apenas em alguns nós da rede (conversão esparsa) é estudada e uma análise sobre a probabilidade de bloqueio e a imparcialidade da rede desta distribuição de conversores é apresentada. Finalmente, técnicas de restauração na camada física e virtual são implementadas e uma análise da influência destes sobre a probabilidade de bloqueio e a imparcialidade da rede é executada. / The Wavelength Division Multiplexing (WDM) technology as well as both the introduction of all optical OXCs (Optical Cross Connect) and OADMs (Optical Add/Drop Multiplexer) may provide the optical network with the networking function, i.e, the capacity to manipulate wavelengths in order to implement their routing. This possibility implies a new type of relationship between applications and the physical layer. The likely candidate to establish such relationships is GMPLS architecture. Efficient solutions to both the problems of allocating resources and traffic routing become an enhanced requirement in the design, expansion and management of optical networking. The present study focus at the relationship between functionalities such as traffic grooming, network fairness improvement, protection/restoring mechanisms and wavelength conversion in heterogeneous optical networks, evaluating the metrics of blocking probability, probability of traffic blocked and fairness. These functionalities are separately treated in literature. With this goal in mind, a two-layer representation is used in order to model the network: the physical and virtual layers, respectively. Two policies on traffic grooming are set up, as follows: MrTV (route minimizing on virtual topology) and MrTF (route minimizing on physical topology). The performance of such policies is analyzed regarding the percentage of blocked traffic. Next, a mechanism for call admission control (CAC) is implemented and its influence in terms of fairness and blocking probability is discussed. The simulations of optical networks such as NSFnet and the Italian National Network are carried out through a graph based in Zhu and Mukherjee [28]. As a result, MrTF policy presents a smaller percentage of blocked traffic than the MrTV for the simulated networks and the rolling window mechanism has allowed the optimization of the call admission control (CAC) mechanism. The usefulness of placing wavelength converters in a few networks nodes (spare conversion) is studied and an analysis on the blocking probability is presented. Next, the network fairness for this distribution of wavelength converters is presented. Finally, techniques for restoring both physical and virtual layers are also implemented and an analysis regarding their influence on the blocking probability and the network fairness is carried out.

En aquesta tesi proposem dos esquemes de xarxa amb control d'admissió per al trànsit elàstic TCP amb mecanismes senzills. Ambdós esquemes són capaços de proporcionar throughputs diferents i aïllament entre fluxos, on un "flux" es defineix com una seqüència de paquets relacionats dins d'una connexió TCP. Quant a l'arquitectura, ambdós fan servir classes de paquets amb diferents prioritats de descart, i un control d'admissió implícit, edge-to-edge i basat en mesures. En el primer esquema, les mesures són per flux, mentre que en el segon, les mesures són per agregat. El primer esquema aconsegueix un bon rendiment fent servir una modificació especial de les fonts TCP, mentre que el segon aconsegueix un bon rendiment amb fonts TCP estàndard. Ambdós esquemes han estat avaluats satisfactòriament a través de simulació en diferents topologies de xarxa i càrregues de trànsit. / In this thesis we propose two network schemes with admission control for TCP elastic traffic using simple mechanisms. Both schemes are able to provide different throughputs and isolation between flows, where a flow is defined as a sequence of related packets within a TCP connection. Regarding to the architecture, both use packet classes with different discarding priorities and an admission control that is implicit, edge-to-edge and based on measurements. In the first scheme, measurements are per-flow, while in the second one, measurements are per-aggregate. The first scheme achieves a good performance using a special modification of TCP sources, while the second scheme achieves a good performance with standard TCP sources. Both schemes have been evauated succesfully through simulation in different network topologies and traffic loads.

In recent years, there has been a rapid growth in deployment and usage of realtime network applications, such as Voice-over-IP, video calls/video conferencing, live network seminars, and networked gaming. The continued increase in the popularity of realtime applications requires a more intense focus on the provision of strict guarantees for Quality of Service (QoS) parameters such as delay, jitter and packet loss in access networks. At the same time, wireless networking technologies have become increasingly popular with a wide array of devices such as laptop computers, Personal Digital Assistants (PDAs), and cellular phones being sold with built-in WiFi and WiMAX interfaces. For realtime applications to be popular over wireless networks, simple, robust and effective QoS mechanisms suited for a variety of heterogeneous wireless networks must be devised. Implementing the same QoS mechanisms across multiple neighbouring networks aids seamless handover by ensuring that a flow will be treated in the same way, both before and after handover. To provide guaranteed QoS, an access network should limit load using an admission control algorithm. In this research, we propose a method to provide effective admission control for variable bit rate realtime flows, based on the Central Limit Theorem. Our objective is to estimate the percentage of packets that will be delayed beyond a predefined delay threshold, based on the mean and variance of all the flows in the system. Any flow that will increase the percentage of delayed packets beyond an acceptable threshold can then be rejected. Using simulations we have shown that the proposed method provides a very effective control of the total system load, guaranteeing the QoS for a set of accepted flows with negligible reductions in the system throughput. To ensure that flow data is transmitted according to the QoS requirements of a flow, a scheduling algorithm must handle data intelligently. We propose methods to allow more efficient scheduling by utilising existing Medium Access Control mechanisms to exchange flow information. We also propose a method to determine the delay-dependent "value" of a packet based on the QoS requirements of the flow. Using this value in scheduling is shown to increase the number of packets sent before a predetermined deadline. We propose a measure of fairness in scheduling that is calculated according to how well each flow's QoS requirements are met. We then introduce a novel scheduling paradigm, Delay Loss Controlled-Earliest Deadline First (DLC-EDF), which is shown to provide better QoS for all flows compared to other scheduling mechanisms studied. We then study the performance of our admission control and scheduling methods working together, and propose a feedback mechanism that allows the admission control threshold to be tuned to maximise the efficient usage of available bandwidth in the network, while ensuring that the QoS requirements of all realtime flows are met. We also examine heterogeneous/vertical handover, providing an overview of the technologies supporting seamless handover. The issues studied in this area include a method of using the Signal to Noise Ratio to trigger handover in heterogeneous networks and QoS Mapping between heterogeneous networks. Our proposed method of QoS mapping establishes the minimum set of QoS parameters applicable to individual flows, and then maps these parameters into system parameter formats for both 802.11e and 802.16e networks.