Navegando por Assunto "Roteamento"

Agora exibindo 1 - 6 de 6

Acesso aberto (Open Access)
Aprovisionamento dinâmico de recursos em redes ópticas elásticas multiplexadas por divisão de espaço considerando limitações de camada física
(Universidade Federal do Pará, 2019-06-07) LOBATO, Fabricio Rossy de Lima; CARTAXO, Adolfo da Visitação Tregeira; COSTA, João Crisóstomo Weyl Albuquerque; http://lattes.cnpq.br/9622051867672434
In elastic optical networks (EONs) employing weakly-coupled single-mode multi-core fibers (MCF), inter-core crosstalk (XT) can affect significantly the network performance, particularly when the number of cores and the path length increase. Hence, from the network perspective, the impairment-aware (IA) routing, spectrum and core assignment (RSCA) problem is an important research challenge of MCF-EONs. In this thesis, we propose a dynamic provisioning methodology that solves independently the IA-RSCA problem taking impairments physical layer into account. To achieve the XT impact minimization, we decompose the IA-RSCA problem into two subproblems: the IA routing sub-problem and the IA spectrum and core assignment (IA-SCA) sub-problem. For the routing solution, a precomputation method based on the k-shortest path is used, and a physical layer impairment verification phase is performed taking the required optical signal to noise ratio into account. For the IA-SCA sub-problem, the novel XT-aware greedy algorithm is proposed to minimize the XT impact on the MCF-EONs performance as follows: for each new connection, the level of detected XT power of the new connection and interfering connections relative to the XT power threshold of each connection is minimized on the average over all those connections. This minimization is achieved by choosing the core and frequency slot of the new connection. In order to take the spectral overlapping extension of the new and interfering connections into account in the detected XT power, a novel frequency slot overlapping index is introduced. The performance of the proposed algorithm is evaluated through computer simulations. The results show that the total blocking probability and network average utilization achieved by the proposed algorithm are better than the ones obtained by core prioritization, random and first-fit strategies, for different scenarios of XT level and spectrum fragmentation.
Acesso aberto (Open Access)
Avaliação de técnicas de paralelização de algoritmos bioinspirados utilizando computação GPU: um estudo de casos para otimização de roteamento em redes ópticas
(Universidade Federal do Pará, 2015-03-06) TADAIESKY, Vincent Willian Araújo; SANTANA, Ádamo Lima de; http://lattes.cnpq.br/4073088744952858
The applications on distribution logistics are diverse, such as the transportation planning and delivery of goods or in telecommunication networks data routing. Given the breadth and capillarity of these problems, studies have been developed to reduce network operating costs of this magnitude, especially regarding the demand for electricity. Therefore, this work proposes a method of resolution of routing problems with high demand. The proposed method is based on bio-inspired algorithms, which combined with other methods, ensure the integrity of the solutions, as well as its proximity to optimum. Nevertheless, such algorithms becomes computationally expensive as the application complexity in question grows and, therefore, multiprocessor environment, like GPU Computing platforms, has being widely used to increase bio-inspired algorithms performance. Thus, this work aims perform tests about the widespread parallelization techniques of these algorithms, intending to make an evaluation of which strategies has better relation with each tested algorithm. In order to do this, the routing problem in WDW optics networks with high demand level was used as a case study, in which it is needed define which are the better routes to demands sent simultaneously. The algorithms that assisted the tests were Genetic Algorithms and Swarm Particle Optimization, which are highly disseminated. The results show that the parallelization strategy to be used depends as much on the platform in which has been implemented, as the problem to be treaty.
Acesso aberto (Open Access)
Mecanismo de roteamento cross-layer em redes móveis Ad Hoc sem fio: um modelo de inteligência computacional com eficiência energética e suporte a mobilidade e QoE
(Universidade Federal do Pará, 2016-03-18) CARVALHO, Tássio Costa de; FRANCÊS, Carlos Renato Lisboa; http://lattes.cnpq.br/7458287841862567
The evolution of wireless communications technologies has led to the need to provide network support for data and video applications and thus promote the development of new types of network configurations adapted to these new requirements. MANET is an important type of operation networks that employs mechanisms that can enable dynamic autoconfiguration, which requires a higher efficiency of its routing protocols. These protocols can also be challenged due to energy failures that are becoming increasingly severe in relation to the common networks failure; furthermore, the quality of the multimedia stream corresponds to a fundamental premise to the next generation wireless networks and the future Internet. This thesis proposes a new routing mechanism based on cross-layer paradigm to enhance the main routing protocols, by inserting new metrics in a computational intelligence decision making based on fuzzy systems, providing energy efficiency, support to manage mobility and quality experience to the devices, choosing the best route for the flow of computer networks. The proposal is evaluated in network simulator, demonstrating its efficiency through network results, quality of experience metrics and maximizing the communication’s lifetime.
Acesso aberto (Open Access)
Otimização de cobertura, consumo de energia, roteamento e agregação de dados em rede de sensores sem fio utilizando algoritmos genéticos e lógica fuzzy
(Universidade Federal do Pará, 2011-03-04) NUNES, Thiêgo Maciel; MONTEIRO, Dionne Cavalcante; http://lattes.cnpq.br/4423219093583221; CERQUEIRA, Eduardo Coelho; http://lattes.cnpq.br/1028151705135221
The Wireless Sensor Networks (WSN) have limited capacities for processing, storage, communication (bandwidth) and power source, besides having features and basic requirements of a WSN such as: the need for self-organization, communication with diffusion of short-range and multihop routing. This work proposes a tool that optimizes the positioning and the packages delivered through the use of Genetic Algorithm (GA). To resolve the routing problem that improves power consumption and maximize data aggregation is proposed the use of fuzzy logic in the routing protocol Ad hoc Ondemand Distance Vector (AODV). This customization is entitled AODV - Fuzzy for Wireless Sensor Networks (AODV-FWSN). The results show that the proposed solution is efficient and can prolong the life of the WSN and improve the rate of data delivery when compared to similar solutions.
Acesso aberto (Open Access)
Políticas de alocação de espectro em roteamento baseado em balanceamento de cargas e fragmentação para redes ópticas elásticas
(Universidade Federal do Pará, 2015-02-05) DONZA, André Cunha de Sousa; COSTA, João Crisóstomo Weyl Albuquerque; http://lattes.cnpq.br/9622051867672434; FRANCÊS, Carlos Renato Lisboa; http://lattes.cnpq.br/7458287841862567
The rigid nature of wavelength division multiplexing (WDM) routed networks leads to inefficient capacity utilization. Thus, flexible networks are a possible breakthrough for optical technology, as long as they provide higher spectrum efficiency use. In order to assess the possible applicability of flexible networks, this work proposes a performance evaluation strategy based on simulations and comparisons between obtained results. Several discrete-time simulations were carried out in two simulators developed in Matlab in order to analyze different spectrum allocation policies (First-Fit, Smallest-Fit, Exact-Fit and Random-Fit) in some algorithms for single path routing: The External Fragmentation Aware Assignment (FA), the Shortest Path with Maximum Spectrum Reuse (SPSR) and the Balanced Load Score Spectrum Assignment (BLSA). Two network topologies were used: a small 6-node subset of Cost239 and a 7-node random topology. With no physical layer effects as restrictions, comparisons were made between the different techniques studied, aiming to point out, based on the specific features of the proposed scenarios, the most appropriate method of spectral allocation in terms of blocking frequency between the four considered spectrum allocation policies.
Acesso aberto (Open Access)
Um Protocolo de roteamento colaborativo para transmissão de vídeo com computação em névoa em redes ad hoc veiculares
(Universidade Federal do Pará, 2019-03-22) BEZERRA, Paulo Henrique Gonçalves; CERQUEIRA, Eduardo Coelho; ROSÁRIO, Denis Lima do; http://lattes.cnpq.br/8273198217435163
Vehicular Ad hoc Networks (VANETs) play an important role in the efficiency of road traffic by improving safety and acting as a facilitator of services for passengers, drivers and public safety officers. Recent improvements in the routing protocols and topologies used in vehicular networks have contributed to improvements in scalability, reliability and the quality of the information-sharing experience. Vehicles can cooperate with each other to stream videos of accidents or disasters and provide visual information of the monitored area with great precision. This Ph.D thesis proposes a Collaborative Routing Protocol for Video streaming VANETs (CRPV) using the service of fog storage to minimize the sharing of content. The routing table is based on an indicator that is generated by combining the speed, location and recording angle parameters of each vehicle involved in vehicular collaboration to reduce the unnecessary exchange of video data in vehicle-to-vehicle communications. The results of the simulations show that the proposed model performs favorably when compared to other routing protocols with respect to the availability of end-to-end communication and Quality of Experience.