Traffic Assignment Problem
Mostrando 1-8 de 8 artigos, teses e dissertações.
-
1. Wavelength assignment using a hybrid evolutionary computation to reduce cross-phase modulation
In this paper, we propose a hybrid methodology based on Graph-Coloring and Genetic Algorithm (GA) to solve the Wavelength Assignment (WA) problem in optical networks, impaired by physical layer effects. Our proposal was developed for a static scenario where the physical topology and traffic matrix are known a priori. First, we used fixed shortest-path routin
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2014-06
-
2. Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
This paper proposes three novel integer linear programming (ILP) formulations, where the first model deals with the Grooming, Routing, Wavelength Assignment, and Carrier Ethernet Interface Allocation Problem (GRWA-I); the second to Traffic Re-Grooming Problem (TRGP) to accommodate demand changes in a GRWA-I network scenarios; and the third to Traffic Re-Groo
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2013-12
-
3. Smoothed analysis in Nash equilibria and the Price of Anarchy / Análise suavisada em equilíbrios Nash e no preço da anarquia
São analisados nesta dissertação problemas em teoria dos jogos, com enfoque no efeito que perturbações acarretam em jogos. A análise suavizada (smoothed analysis) é utilizada para tal análise, e dois tipos de jogos são o foco principal desta dissertação, jogos bimatrizes e o problema de atribuição de tráfego (Traffic Assignment Problem.) O algo
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 2012
-
4. Performance analysis of IP traffic grooming over WDM networks with variable granularity flows. / Análise de desempenho da agregação de tráfego IP em redes WDM com variação da granularidade dos fluxos.
The present work covers the IP traffic grooming strategies in optical WDM networks. Using an entire wavelength to transport an individual traffic flow in a WDM network is inefficient. The problem known as traffic grooming consists in the multiplexing of different traffic flows in a single wavelength within a lightpath. The allocation of multiple traffic flow
Publicado em: 2006
-
5. Análise lógica de protocolos, proposta e avaliação de desempenho de um algoritmo de atribuição de rótulo baseado em SRLG em um ambiente GMPLS-WDM. / Protocol logical analysis, proposal and performance evaluation of a label assignment algorithm based on SRLG in a GMPLS-WDM environment.
To satisfy the explosive increasing demands of voice and data traffic, optical networks based on WDM and GMPLS are being developed. The GMPLS´ suite of protocols is currently being considered as the control plane for optical networks and it is compounded of signaling and routing protocols, and also the link management protocol (LMP). The LMP is an important
Publicado em: 2006
-
6. Planejamento de redes WDM com proteção para caminhos opticos
This dissertation is a study about the initial traffic deployment in wavelength-routed WDM (Wavelength Division Multiplexing) optical networks with path protection. We make an introduction of the key technologies and the major network planning aspects. We introduce some architectures for transport provisioning to various client network architectures. The RWA
Publicado em: 2004
-
7. ANALYSIS OF THE PROBLEM OF TRAFFIC CHANNEL ASSIGNMENT IN MOBILE CELLULAR SYSTEMS / UMA ANÁLISE DO PROBLEMA DA ALOCAÇÃO DOS CANAIS DE TRÁFEGO EM SISTEMAS MÓVEIS CELULARES
In this work the problem of traffic channel assignment in móbile cellular systems is adressed. The use of more efficient assignment methods represents one of the main alternatives to enhance the performance of congested systems. Moreover, the ceaseless reduction of cell sizes requires the adoption of more flexible methods already proposed are presented, and
Publicado em: 1996
-
8. Encaminhamento de chamadas telefonicas : analise de desempenho
This work presents a study about telephone networks routing plan assignment problems. Basically, two problems are studied: minimal cost routing plan assignment and optimal performance routing plan assignment. The junction network dimensioning problem is formulated as a multi-commodity minimal cost flux problem. The solution ofthis problem leads to a routing
Publicado em: 1994