Enhanced convolution approach for CAC in ATM networks, an analytical study and implementation

The characteristics of service independence and flexibility of ATM networks make the control problems of such networks very critical. One of the main challenges in ATM networks is to design traffic control mechanisms that enable both economically efficient use of the network resources and desired quality of service to higher layer applications. Window flow control mechanisms of traditional packet switched networks are not well suited to real time services, at the speeds envisaged for the future networks. In this work, the utilisation of the Probability of Congestion (PC) as a bandwidth decision parameter is presented. The validity of PC utilisation is compared with QOS parameters in buffer-less environments when only the cell loss ratio (CLR) parameter is relevant. The convolution algorithm is a good solution for CAC in ATM networks with small buffers. If the source characteristics are known, the actual CLR can be very well estimated. Furthermore, this estimation is always conservative, allowing the retention of the network performance guarantees. Several experiments have been carried out and investigated to explain the deviation between the proposed method and the simulation. Time parameters for burst length and different buffer sizes have been considered. Experiments to confine the limits of the burst length with respect to the buffer size conclude that a minimum buffer size is necessary to achieve adequate cell contention. Note that propagation delay is a no dismiss limit for long distance and interactive communications, then small buffer must be used in order to minimise delay. Under previous premises, the convolution approach is the most accurate method used in bandwidth allocation. This method gives enough accuracy in both homogeneous and heterogeneous networks. But, the convolution approach has a considerable computation cost and a high number of accumulated calculations. To overcome this drawbacks, a new method of evaluation is analysed: the Enhanced Convolution Approach (ECA). In ECA, traffic is grouped in classes of identical parameters. By using the multinomial distribution function instead of the formula-based convolution, a partial state corresponding to each class of traffic is obtained. Finally, the global state probabilities are evaluated by multi-convolution of the partial results. This method avoids accumulated calculations and saves storage requirements, specially in complex scenarios. Sorting is the dominant factor for the formula-based convolution, whereas cost evaluation is the dominant factor for the enhanced convolution. A set of cut-off mechanisms are introduced to reduce the complexity of the ECA evaluation. The ECA also computes the CLR for each j-class of traffic (CLRj), an expression for the CLRj evaluation is also presented. We can conclude that by combining the ECA method with cut-off mechanisms, utilisation of ECA in real-time CAC environments as a single level scheme is always possible.

Mobility based energy efficient and multi-sink algorithms for consumer home networks

With the fast development of the Internet, wireless communications and semiconductor devices, home networking has received significant attention. Consumer products can collect and transmit various types of data in the home environment. Typical consumer sensors are often equipped with tiny, irreplaceable batteries and it therefore of the utmost importance to design energy efficient algorithms to prolong the home network lifetime and reduce devices going to landfill. Sink mobility is an important technique to improve home network performance including energy consumption, lifetime and end-to-end delay. Also, it can largely mitigate the hot spots near the sink node. The selection of optimal moving trajectory for sink node(s) is an NP-hard problem jointly optimizing routing algorithms with the mobile sink moving strategy is a significant and challenging research issue. The influence of multiple static sink nodes on energy consumption under different scale networks is first studied and an Energy-efficient Multi-sink Clustering Algorithm (EMCA) is proposed and tested. Then, the influence of mobile sink velocity, position and number on network performance is studied and a Mobile-sink based Energy-efficient Clustering Algorithm (MECA) is proposed. Simulation results validate the performance of the proposed two algorithms which can be deployed in a consumer home network environment.

Obstacle avoidance routing scheme through optimal sink movement for home monitoring and mobile robotic consumer devices

In recent years, ZigBee has been proven to be an excellent solution to create scalable and flexible home automation networks. In a home automation network, consumer devices typically collect data from a home monitoring environment and then transmit the data to an end user through multi-hop communication without the need for any human intervention. However, due to the presence of typical obstacles in a home environment, error-free reception may not be possible, particularly for power constrained devices. A mobile sink based data transmission scheme can be one solution but obstacles create significant complexities for the sink movement path determination process. Therefore, an obstacle avoidance data routing scheme is of vital importance to the design of an efficient home automation system. This paper presents a mobile sink based obstacle avoidance routing scheme for a home monitoring system. The mobile sink collects data by traversing through the obstacle avoidance path. Through ZigBee based hardware implementation and verification, the proposed scheme successfully transmits data through the obstacle avoidance path to improve network performance in terms of life span, energy consumption and reliability. The application of this work can be applied to a wide range of intelligent pervasive consumer products and services including robotic vacuum cleaners and personal security robots1.

Bio-inspired ant colony optimization based clustering algorithm with mobile sinks for applications in consumer home automation networks

With the fast development of wireless communications, ZigBee and semiconductor devices, home automation networks have recently become very popular. Since typical consumer products deployed in home automation networks are often powered by tiny and limited batteries, one of the most challenging research issues is concerning energy reduction and the balancing of energy consumption across the network in order to prolong the home network lifetime for consumer devices. The introduction of clustering and sink mobility techniques into home automation networks have been shown to be an efficient way to improve the network performance and have received significant research attention. Taking inspiration from nature, this paper proposes an Ant Colony Optimization (ACO) based clustering algorithm specifically with mobile sink support for home automation networks. In this work, the network is divided into several clusters and cluster heads are selected within each cluster. Then, a mobile sink communicates with each cluster head to collect data directly through short range communications. The ACO algorithm has been utilized in this work in order to find the optimal mobility trajectory for the mobile sink. Extensive simulation results from this research show that the proposed algorithm significantly improves home network performance when using mobile sinks in terms of energy consumption and network lifetime as compared to other routing algorithms currently deployed for home automation networks.

Gestão em redes para a construção de políticas públicas: um estudo sobre as atividades e prevenção e repressão à lavagem de dinheiro no Brasil

O objetivo desta pesquisa foi compreender de que modo a emergência de estilos de gestão pública baseados em rede pode contribuir para a construção de políticas públicas relacionadas à prevenção e repressão à lavagem de dinheiro. O arcabouço teórico fundamentou-se nas teorias de redes interorganizacionais, mais especificamente, nas redes de políticas públicas. Foram estudadas relações de colaboração e cooperação que, por transcenderem os limites organizacionais, garantem maior flexibilidade e abrangência ao processo de construção de políticas públicas. As reflexões sobre estas teorias foram realizadas a partir de um contexto empírico específico: o da articulação entre instituições brasileiras que atuam na prevenção e repressão à lavagem de dinheiro. Este contexto foi escolhido pela percepção de que a prática de ilícitos financeiros traz enormes prejuízos a nações que precisam superar desigualdades econômicas e sociais. A escolha metodológica foi motivada por questões ontológicas e epistemológicas que apontaram a metodologia reflexiva como a mais adequada para o alcance dos objetivos propostos na pesquisa. A partir da construção dos dados empíricos foi possível criar construtos que sintetizam os benefícios e desafios da constituição de redes de políticas públicas. As conexões interpretativas subsequentes reforçam a ideia de que os espíritos democrático, republicano e de cooperação devem nortear os valores compartilhados na rede. Assim, se a atuação interna da rede se aprimora, torna-se possível superar entraves endógenos (foco apenas na boa reputação externa) e exógenos (pressão das elites corruptas) à rede, o que resulta em uma melhor interação entre os participantes, gerando resultados mais efetivos para a sociedade.

Redes estratégicas no contexto luso-brasileiro: estudo de caso na indústria do petróleo

Desde seu surgimento, a área de estratégia apresenta como características centrais a criação, uso e difusão de modelos que ajudam a construir e manter a autoridade do estrategista da grande empresa e o forte embasamento nas teorias econômicas e no paradigma da entidade autônoma. No cenário teórico dessa disciplina, predominam os referenciais produzidos no ambiente anglo-americano, a prescrição de modelos estratégicos universais e a falta profundidade teórica e conceitual que ajude a melhor compreender o fenômeno das redes. Esse arcabouço teórico dominante na disciplina designa maior relevância e foco à tese da mercadização, que reproduz os princípios do neoliberalismo e marginaliza as demais teorias de mercado que também são de fundamental importância para a compreensão do desempenho das empresas e das redes. Exemplos de teorias marginalizadas são as que endereçam o reconhecimento das interfaces entre poder, política, mercado, Estado e sociedade. Especialmente em economias emergentes assim como em economias em transição, como é o caso do Brasil e de Portugal respectivamente, essas teorias marginalizadas revelam o reconhecimento de que estratégias de não-mercado são tão importantes quanto estratégias de mercado. Dada a atual relevância das operações envolvendo as organizações híbridas Petrobras e Galp, em especial na indústria petrolífera de Brasil e Portugal, por meio de um estudo de caso a presente dissertação busca identificar como e porque são formadas redes de organizações híbridas na indústria petrolífera luso-brasileira e como estratégias de mercado e de não-mercado interagem nessas redes.

Design and Analysis of Optical Interconnection Networks for a Dataflow Parallel Computer

This work shows the design, simulation, and analysis of two optical interconnection networks for a Dataflow parallel computer architecture. To verify the optical interconnection network performance on the Dataflow architecture, we have analyzed the load balancing among the processors during the parallel programs executions. The load balancing is a very important parameter because it is directly associated to the dataflow parallelism degree. This article proves that optical interconnection networks designed with simple optical devices can provide efficiently the dataflow requirements of a high performance communication system.

A DOE based approach for the design of RBF artificial neural networks applied to prediction of surface roughness in AISI 52100 hardened Steel turning

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Optimization of query results in peer-to-peer database supported by semantics

The development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous. However, it is a challenge to ensure the efficient search for information without compromising the autonomy of each node and network flexibility, given the structural characteristics of these networks. On the other hand, some studies propose the use of ontology semantics by assigning standardized categorization of information. The main original contribution of this work is the approach of this problem with a proposal for optimization of queries supported by the Ant Colony algorithm and classification though ontologies. The results show that this strategy enables the semantic support to the searches in peer-to-peer databases, aiming to expand the results without compromising network performance. © 2011 IEEE.

Análise e desempenho de redes de acesso sem fio

Pós-graduação em Engenharia Elétrica - FEIS

Roteamento de consultas em banco de dados peer-to-peer utilizando colônias de formigas e ontologias

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Desenvolvimento de redes neurais para previsão de cargas elétricas de sistemas de energia elétrica

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Projeto otimizado de redes neurais artificiais para predição da rugosidade em processos de usinagem com a utilização da metodologia de projeto de experimentos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Análise de redes sociais e aspectos financeiros da produção de tilápias em tanques-rede na uhe de Ilha Solteira

Pós-graduação em Agronegócio e Desenvolvimento - Tupã

Dynamic Routing in Translucent WDM Optical Networks: The Intradomain Case

Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.