Spelling suggestions: "subject:"aireless networks."" "subject:"fireless networks.""
221 |
A QoS-aware resources sharing architecture for homogeneous and heterogeneous wireless networksKunst, Rafael January 2017 (has links)
O atual modelo de alocação espectral implementado pelas autoridades governamentais somado à crescente demanda por recursos imposta pela implementação de modernas aplicações e serviços de rede irá resultar em um problema relacionado à escassez de recursos em um futuro próximo. Lidar com este problema demanda esforços no sentido de melhorar a alocação de recursos. Uma das maneiras de atingir este tipo de melhoria é permitir o compartilhamento de recursos entre operadores em redes homogêneas e heterogêneas que podem implementar diferentes tecnologias, como a utilização coletiva do espectro e de recursos licenciados. Diversos trabalhos relacionados à esta pesquisa foram propostos. Entretanto, estes trabalhos geralmente identificam a necessidade de obter recursos adicionais, porém buscam por esses recursos sem levar em conta os requisitos de qualidade de serviço e o custo envolvido no compartilhamento desses recursos. Considerando esse contexto, nesta tese, uma nova arquitetura é proposta para permitir a implementação do compartilhamento de recursos e para encorajar operadores a alugarem recursos sobressalentes levando em conta o custo e a qualidade de serviço oferecida. Esta abordagem permite que operadores tenha ganhos com o aluguel dos recursos, ao mesmo tempo em que o cliente recebe serviços com maior qualidade. As principais contribuições da arquitetura proposta incluem o projeto de um controlador de recursos para coordenar o processo de compartilhamento. Esse controlador busca estabelecer contratos de serviço dinâmicos levando em conta a qualidade de serviço requerida. Para tanto, é necessária a troca de informações que, no caso da arquitetura proposta, é mantida baixa para evitar que a rede seja sobrecarregada e acabe interferindo com o tráfego de dados. Além disso, a solução proposta é capaz de tomar decisões rápidas sobre a alocação de recursos, o que permite o redirecionamento do tráfego sem que ocorram interferências com os demais usuários. A arquitetura proposta é modela analiticamente e simulada com o auxílio da ferramenta Matlab. O desempenho da proposta é medido em três diferentes cenários, considerando tanto redes homogêneas, quanto heterogêneas. A sobrecarga gerada pela troca de informações de controle corresponde a menos de 1% do tráfego total da rede, o que é desprezível do ponto de vista da interferência com o tráfego de dados. As decisões rápidas tomadas pela arquitetura são baseadas na previsão acurada do tráfego futuro da rede e permitem o redirecionamento do tráfego para outras redes em um tempo até 46% abaixo do limite máximo especificado na literatura para este tipo de redirecionamento. Os resultados mostram ainda que as métricas de atraso e variação do atraso também são mantidas abaixo dos limites especificados, o que indica que a qualidade de serviço é garantida nos cenários avaliados. / The static model currently applied by governmental authorities for allocating the spectrum of frequencies and the increasing demand for network resources imposed by modern applications and services may lead to a resources scarcity problem in the near future. Dealing with this problem demands improvements on resources allocation. One of the ways of providing such improvements is by allowing resources sharing among network operators in both homogeneous and heterogeneous network scenarios. These network operators may implement different technologies, such as collective use of spectrum and licensed shared access to the spectrum of frequencies. Many related works have been proposed in the same context of the presented research, however these related works generally identify the need for additional resources and search for available resources without taking into account the QoS requirements of the resources renter and the costs involved in the resources sharing initiative. Therefore, in this thesis, a novel architecture is proposed to facilitate the implementation of resources sharing and consequently encourage network operators to lease their underutilized resources taking into account both the cost and the QoS requirements. This approach allows the network operator which is serving the resources to improve its profits at the same time that allows quality of service improvements to the resources renter. The main contributions of the proposed architecture include but are not limited to the design of a multilevel resources broker to control the resources sharing process. This broker is concerned on dynamically establishing a service level agreement that takes into account the quality of service requirements of resources renter. This process focuses on exchanging a small amount of control information to prevent the overhead from interfering with the legitimate traffic of the network operators. Another important contribution of the proposed approach is to improve the resources allocation in comparison with related work. Furthermore, the proposed solution is capable of taking fast decisions regarding resources allocation, what leads to the implementation of fast handover, allowing the traffic steering without interfering with incumbent users. The proposed architecture is modeled analytically and simulated using Matlab to evaluate its behavior in three different scenarios, considering both homogeneous and heterogeneous networks. The overhead in practical operation scenarios is kept under 1% of the total network traffic, what is considered not to interfere with the transmissions of the network operators. The fast decisions taken by the resources sharing architecture are based on accurate traffic load forecasting, what leads to fast handover, attaining times up to 46% lower than the maximum allowed handover duration. Results also show that both delay and jitter metrics are controlled to be maintained below their specific thresholds of the analyzed applications and therefore, the QoS is guaranteed for the resources renter, considering the coexistence of up to 500 devices.
|
222 |
JTP, an energy-aware transport protocol for mobile ad hoc networksRiga, Niky 22 March 2016 (has links)
Wireless ad-hoc networks are based on a cooperative communication model, where all nodes not only generate traffic but also help to route traffic from other nodes to its final destination. In such an environment where there is no infrastructure support the lifetime of the network is tightly coupled with the lifetime of individual nodes. Most of the devices that form such networks are battery-operated, and thus it becomes important to conserve energy so as to maximize the lifetime of a node.
In this thesis, we present JTP, a new energy-aware transport protocol, whose goal is to reduce power consumption without compromising delivery requirements of applications. JTP has been implemented within the JAVeLEN system. JAVeLEN~\cite{javelen08redi}, is a new system architecture for ad hoc networks that has been developed to elevate energy efficiency as a first-class optimization metric at all protocol layers, from physical to transport. Thus, energy gains obtained in one layer would not be offset by incompatibilities and/or inefficiencies in other layers.
To meet its goal of energy efficiency, JTP (1) contains mechanisms to balance end-to-end vs. local retransmissions; (2) minimizes acknowledgment traffic using receiver regulated rate-based flow control combined with selected acknowledgments and in-network caching of packets; and (3) aggressively seeks to avoid any congestion-based packet loss. Within this ultra low-power multi-hop wireless network system, simulations and experimental results demonstrate that our transport protocol meets its goal of preserving the energy efficiency of the underlying network. JTP has been implemented on the actual JAVeLEN nodes and its benefits have been demoed on a real system.
|
223 |
A photonic generation and transmission system for millimetre-wave futuristic communicationsAl-Dabbagh, Rasha Khalid Mohammed January 2018 (has links)
In this thesis, a fully millimetre-wave (mm-wave) generation and transmission system is proposed for futuristic communications. Significant challenges have been dealt with regarding the proposed system, including designing the mm-wave generation and transmission technique, and its application in cellular networks. These challenges are presented through five main contributions and validated via Optiwave Design Software and MATLAB simulation tools. Firstly, three novel photonic generation methods are proposed and designed based on the characteristics of Brillouin fibre laser and the Stimulated Brillouin Scattering (SBS) effects with phase modulation. The mm-wave carriers are successfully generated with a tuning capability from 5 to 90 GHz. Also, these carriers are with good Signal to Noise Ratio (SNR) up to 51 dB, and low noise signal power of about -40 dBm. The impact of these methods is obtaining stable mm-waves appropriate for Radio over Fibre (RoF) transmission systems in 5G optical networks. Secondly, a full-duplex RoF system with the generation of a 64 GHz mm-wave is proposed. Successful transmission of the mm-wave over a fibre link is achieved for up to 100 km of fibre with a data rate of 5 Gbits/s. The main impact of this system is cost reduction and performance improvement by simplifying mm-wave generation and transmission over fibre. Also, it ensures a useful communication link for small cell networks. Thirdly, a hybrid Fibre/Free-space optical (FSO) system for the generation and transmission of 64 GHz mm-wave is proposed. This optical system provides a low latency communication link and overcomes mm-wave high path losses. A successful mm-wave transmission is achieved over a 10 km fibre length, and 2 km FSO link length with a good Bit Error Rate (BER) of about 1.5×10-13 and a data rate of 10 Gbits/s. This system increases the network coverage area by transmitting the mm-wave over the FSO link to the areas with natural obstacles the laying of fibre cables impossible. Also, it can be used as an effective solution under emergency disaster conditions. Fourthly, a comprehensive study of the wireless propagation performance for different mm-wave bands (28, 60, and 73 GHz) as cellular networks is investigated and compared with the 2.4 GHz Ultra-High Frequency band (UHF). A map-based scenario is proposed for the deployment of Base Stations (BSs) within the Brunel University London Campus map to consider real blockage effects. This investigation involved specifying which mm-wave spectrum can enhance the futuristic cellular networks, by evaluating the coverage and rate trends. Comparative results show that the 73 GHz bands can achieve the higher rate with good coverage and the lowest interference effects than the other mm-wave bands. Finally, a simplified path loss model is proposed to estimate precisely the 28 GHz mm-wave performance, which is considered a key component in 5G networks in outdoor applications. The proposed path loss model captures the diffraction and specular reflection impacts on mm-wave wireless propagation.
|
224 |
Analisador de redes WirelessHART com capacidade de detecção de coexistênciaMachado, Tatiane Martins January 2014 (has links)
O uso de redes sem fio no ambiente industrial está crescendo cada vez mais devido às vantagens que estas redes apresentam comparadas aos sistemas cabeados. No entanto, é necessário que as redes sem fio apresentem a mesma robustez que as redes cabeadas. Para isso, é necessário garantir o enlace de rádio frequência entre os dispositivos e também é preciso que a rede atenda aos requisitos de comunicação em tempo real. O protocolo WirelessHART foi criado em 2007, sendo o primeiro padrão aberto de comunicação sem fio especialmente desenvolvido para ambientes industriais. Esse protocolo vem ganhando cada vez mais aplicabilidade na indústria devido à sua alta confiabilidade e robustez. Por se tratar de um protocolo recente, ainda existem muitas pesquisas em andamento, sendo uma das áreas relacionada a ferramentas para análise e monitoramento da rede. Tais ferramentas têm como objetivo principal capturar as mensagens que trafegam na rede, ou seja, atuam como um sniffer. No entanto, o protocolo WirelessHART apresenta algumas peculiaridades quando comparado a outras redes sem fio, como por exemplo, o uso de 15 canais diferentes. Devido a isso, muitos sniffers já propostos para redes sem fio não podem ser utilizados, pois capturam dados em apenas uma frequência. Outra questão está relacionada ao monitoramento de redes já instaladas, onde os dispositivos podem se encontrar em locais de difícil acesso. Dessa forma, é necessário que a ferramenta tenha mobilidade, ou seja, não necessite estar conectada a um computador, por exemplo. Então, uma vez que ainda não existe uma ferramenta de monitoramento ideal para redes WirelessHART, este trabalho propõe um nova ferramenta, que apresenta vantagens, tais como: captura de dados nos 15 canais utilizando apenas um receptor de rádio, armazenamento local dos dados capturados utilizando um cartão de memória e medição da energia nos canais, para obter informações a respeito de interferências na rede. Além disso, uma aplicação offline de análise dos dados apresenta estatísticas e análises a respeito dos dados capturados. Este trabalho apresenta alguns conceitos teóricos importantes a respeito do protocolo e os detalhes da implementação da ferramenta. Os resultados obtidos mostram que a ferramenta está atuando corretamente como um sniffer e está realizando a detecção de interferências na rede. Um estudo de caso mostra o comportamento da rede WirelessHART coexistindo com o padrão IEEE 802.11. / The use of wireless networks in industrial environment is growing due to the advantages of these networks compared to wired systems. However, the wireless networks must have the same robustness that wired networks. It is necessary to ensure the link between devices and it is also necessary that the network meets the requirements of real-time communication. The WirelessHART protocol was created in 2007, and it is the first open wireless communication standard specifically designed for industrial environments. This protocol has been gaining increasing applicability in industry due to its high reliability and robustness. Because it is a recent protocol, there are still many ongoing researches. One of them is related to tools for analyzing and monitoring the network. Such tools have the main objective to capture the messages that travel on the network, acting as a sniffer. However, the WirelessHART protocol has some peculiarities as compared to other wireless networks, such as the use of 15 different channels. Because of this, many sniffers already proposed for wireless networks can not be applied, because they capture data on only one frequency. Another issue is related to the monitoring networks already installed, where devices can be found in places of difficult access. Thus, it is necessary that the tool has mobility, i.e., does not need to be connected to a computer, for example. So, since there is still no ideal monitoring tool for WirelessHART networks, this paper proposes a new tool, which has advantages such as: data capture in 15 channels using only one radio receiver, local storage of captured data using a memory card and measuring the energy in the channels for getting information about interference in the network. In addition, an offline application presents statistics and analysis about the captured data. This paper presents some important theoretical concepts about the protocol and implementation details of the tool. The results show that the tool is working properly as a sniffer and it’s performing the interference detection in the network . A case study shows the behavior of the WirelessHART network coexisting with IEEE 802.11 standard.
|
225 |
Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHARTDickow, Victor Hugo January 2014 (has links)
A aplicação de redes sem fio vem crescendo consideravelmente nos últimos anos. Protocolos baseados nesta tecnologia estão sendo desenvolvidos para uma grande variedade de aplicações. A confiabilidade é um dos principais requisitos dos protocolos de comunicação nos ambientes industriais. Interferências, ambiente ruidoso e o grande risco das aplicações industriais que são monitoradas são fatores que elevam os níveis de exigência no que se refere à confiabilidade, redundância e segurança do protocolo. O protocolo WirelessHART é um padrão de comunicação sem fio desenvolvido especificamente para monitoramento e controle de processos com os requisitos necessários para ser utilizado em ambientes industriais. A norma do WirelessHART define diversos aspectos técnicos a serem utilizados no desenvolvimento de algoritmos. Os algoritmos de roteamento e escalonamento de mensagens são de grande relevância para o cumprimento dos requisitos temporais, de confiabilidade e segurança. Requisitos de roteamento e escalonamento são especificados, porém, os algoritmos a serem utilizados não são definidos. O objetivo nessa dissertação é analisar alguns dos principais algoritmos que tem sido propostos especificamente para o protocolo WirelessHART e apresentar um conjunto capaz de ser aplicado nesse protocolo. Análises e comparações entre os algoritmos são realizadas proporcionando um estudo aprofundado sobre seus impactos no desempenho do protocolo. / The application of wireless networks has grown considerably in recent years. Protocols based on this technology are being developed for a great variety of applications. Reliability is one of the main requirements for communication protocols in industrial environments. Interferences, noisy environment and high risk processes that are monitored are factors that increase the levels of requirements in terms of reliability, redundancy and security of the protocol. The WirelessHART protocol is a wireless communication standard specifically designed for process monitoring and control applications with the necessary requirements for to be used in industrial environments. The WirelessHART standard defines several technical aspects to be used in the development of the algorithms. The algorithms of routing and scheduling messages are highly relevant to meeting the timing requirements of reliability and safety. Routing and scheduling strategies are specified, however, the routing and scheduling algorithms are not defined for use. The goal of this dissertation is to analyze some of the main algorithms that have been proposed specifically for the WirelessHART protocol and to present a set able to be applied in this protocol. Analyzes and comparisons between algorithms are realized by providing a detailed study of their impacts on the protocol performance.
|
226 |
Cooperative Localization In Wireless Networked SystemsCastillo-Effen, Mauricio 22 October 2007 (has links)
A novel solution for the localization of wireless networked systems is presented. The solution is based on cooperative estimation, inter-node ranging and strap-down inertial navigation. This approach overrides limitations that are commonly found in currently available localization/positioning solutions. Some solutions, such as GPS, make use of previously deployed infrastructure. In other methods, computations are performed in a central fusion center. In the robotics field, current localization techniques rely on a simultaneous localization and mapping, (SLAM), process, which is slow and requires sensors such as laser range finders or cameras.
One of the main attributes of this research is the holistic view of the problem and a systems-engineering approach, which begins with analyzing requirements and establishing metrics for localization. The all encompassing approach provides for concurrent consideration and integration of several aspects of the localization problem, from sensor fusion algorithms for position estimation to the communication protocols required for enabling cooperative localization. As a result, a conceptual solution is presented, which is flexible, general and one that can be adapted to a variety of application scenarios. A major advantage of the solution resides in the utilization of wireless network interfaces for communications and for exteroceptive sensing. In addition, the localization solution can be seamlessly integrated into other localization schemes, which will provide faster convergence, higher accuracy and less latency.
Two case-studies for developing the main aspects of cooperative localization were employed. Wireless sensor networks and multi-robot systems, composed of ground robots, provided an information base from which this research was launched. In the wireless sensor network field, novel nonlinear cooperative estimation algorithms are proposed for sequential position estimation. In the field of multi-robot systems the issues of mobility and proprioception, which uses inertial measurement systems for estimating motion, are contemplated. Motion information, in conjunction with range information and communications, can be used for accurate localization and tracking of mobile nodes. A novel partitioning of the sensor fusion problem is presented, which combines an extended Kalman filter for dead-reckoning and particle filters for aiding navigation.
|
227 |
Neprekidnost sesije IP servisa kod heterogenih mobilnih mreža primenom softverski definisanih mreža / IP Session continuity in heterogeneous mobile networks using Software DefinedNetworkingBojović Petar 28 January 2019 (has links)
<p>Ova disertacija se bavi istraživanjem problema kontinuiteta IP<br />mrežnih sesija u oblasti komunikscija u mobilnim računarskim mrežama.<br />Cilj istraživanja u okviru ove doktorske disertacije je da se definiše<br />rešenje problema mobilnosti primenjivo na heterogene bežične mreže<br />primenom metode softverski definisanog umrežavanja. U okviru<br />istraživanja prikazana je i praktična implementacija predloženog<br />rešenja. Tokom istraživanja su dobijeni rezultati koji ukazuju na potrebu<br />integracije postojećih tradicionalnih bežičnih mreža sa softverski<br />definisanim mrežama. Osnovu predloženog rešenja predstavlja<br />inkrementslan pristup u pogledu uvođenja novih SDN funkcionslnosti u<br />bežične IP mreže. Kroz implementaciju minimalnog seta SDN<br />funkcionalnosti gradi se tzv. hibridni model SDN mreže. Glavni<br />doprinos ovog istraživanja se ogleda u definisanju postupka koji će<br />omogućiti da se prevaziđe problem mobilnosti u aktuelnom konceptu<br />heterogenih bežičnih računarskih mreža. Ovakav model rešenja, pruža<br />značajan doprinos i sa aspekta ulaganja u promenu infrastrukture u<br />bežičnim mrežama. Implementacijom hibridnog modela, redukuje se<br />potreba za potpunim, ali i značajnim, uvođenjem virtuelne<br />infrastrukture bazirane na fleksibilnim softverski definisanim<br />mrežama.</p> / <p>This dissertation investigates the problem of IP networking communication<br />sessions continuity in mobile computer networks. The aim of the research within<br />this doctoral dissertation is to define a solution to the mobility problem<br />applicable to heterogeneous wireless networks using the software-defined<br />networking method. The research also demonstrates the practical<br />implementation of the proposed solution. During the research were obtained<br />results that indicate the need for integration of software-defined networks into<br />existing traditional wireless networks. The basis of the proposed solution is an<br />incremental approach in terms of introducing new SDN functionality into<br />wireless IP networks. Through the implementation of the minimal set of SDN<br />functionality, the so-called hybrid model of the SDN network is being built. The<br />main contribution of this research is reflected in the definition of a process that<br />will allow to overcome the problem of mobility in the current concept of<br />heterogeneous wireless computing networks. This solution model, also provides<br />a significant contribution from the aspect of investing in the change of<br />infrastructure in wireless networks. Implementation of the hybrid model reduces<br />the need for a complete replacement with a virtual infrastructure based on<br />flexible software-defined networks.</p>
|
228 |
algorithmes de clustérisation et routage dans les réseaux Ad Hoc / Clustering algorithms and routing protocaols in wireless mobile networksGuizani, Badreddine 04 April 2012 (has links)
Le passage à l’échelle des protocoles de routage est un des problèmes les plus critiques pour les réseauxmobiles sans fil à grande envergure. Dans ce cadre, le concept de clusterisation peut être mis à profit dans lafonction de routage afin d’améliorer les performances de ces réseaux. En premier lieu, cette thèse présentenotre algorithme de clusterisation à 1-saut alpha-SSCA (α-Stability Structure Clustering Algorithm) qui apour objectif d’améliorer la stabilité de la structure des clusters. Un algorithme générique de clusterisationà K-sauts est également proposé en ayant le même but de stabilité visé par alpha-SSCA tout en réduisant lenombre de clusters générés et en étant indépendant de la métrique d’élection des cluster-heads. Ensuite, nousprésentons notre proposition d’un protocole de routage à état des liens des clusters qui exploite les apports denotre mécanisme de clusterisation α-SSCA. Ce protocole, appelé CLSR (Cluster-based Link State Routing),vise à réduire le trafic de contrôle afin d’améliorer les performances du réseau à large échelle. Nous avonsproposé aussi une version hiérarchique du protocole CLSR. Ce protocole de routage introduit une hiérarchiedans la structure des clusters qui permet de réduire le nombre de clusters en groupement des clusters prochesdans un même cluster. L’objectif principal de ce protocole hiérarchique est d’améliorer la scalabilité de CLSRquand le nombre de noeuds dans le réseau augmente considérablement. / Scalability is one of critical challenges for routing protocols in large scale mobile wireless networks. In thiscontext, clustering technique seems a promising approach to overcome the scalability problem. First, we proposea one hop clustering algorithm, alpha-SSCA (alpha-Stability Structure Clustering Algorithm), whichaims to improve the stability of the clusters structure. Second, we present a proposal of a generic K-hopsclustering algorithm which is independent of the metrics used to elect cluster-heads. The main contributionof this last algorithm is to enhance the stability of the clusters structure while reducing the number of clusters.Clustering mechanism is introduced in our proposed routing protocol CLSR (Cluster-based Link StateRouting) in order to reduce the control overhead. The main objective of CLSR is to take profit of the stablestructure of clusters to enhance the network scalability.We propose also a second proactive link-state protocolwhich is based on hierarchical clustering. This protocol makes use of hierarchical clustering to more reducethe routing overhead.
|
229 |
Simulator for Resource Allocation in Hybrid NetworksLi, Cai January 2005 (has links)
<p>Much work has been done in simulating traditional cellular networks. But with the incoming of ad-hoc network technology, the next generation networks will employ hybrid network architectures using both cellular and ad-hoc networking concepts. </p><p>We investigate how to create a simulator being able to simulate a hybrid wireless network. This involves setting up a cellular network and an ad-hoc network respectively. However, the most important thing is how to integrate them seamlessly. </p><p>Fortunately, there has already been a simulator called SIMRA which simulates a UMTS cellular network. Therefore, this thesis work is greatly simplified as how to extend and improve SIMRA to implement a simulator for hybrid wireless network. We selected J-sim as the developing platform for our simulator and our development was greatly based on the wireless package provided by the latest version of J-sim. </p><p>To evaluate the new simulator, different resource allocation algorithms were run against it and the results were compared to those generated by earlier extensions to SIMRA under the same simulation settings. It showed that the resource allocation algorithms behaved similarly under the hybrid wireless network environment. Nevertheless, there are some discrepancies in behaviors of algorithms used for evaluation that still need to be studied.</p>
|
230 |
Utility-based Optimisation of Resource Allocation for Wireless NetworksCurescu, Calin January 2005 (has links)
<p>From providing only voice communications, wireless networks aim to provide a wide range of services in which soft real-time, high priority critical data, and best effort connections seamlessly integrate. Some of these applications and services have firm resource requirements in order to function properly (e.g. videoconferences), others are flexible enough to adapt to whatever is available (e.g. FTP). Providing differentiation and resource assurance is often referred to as providing quality of service (QoS). In this thesis we study how novel resource allocation algorithms can improve the offered QoS of dynamic, unpredictable, and resource constrained distributed systems, such as a wireless network, during periods of overload.</p><p>We propose and evaluate several bandwidth allocation schemes in the context of cellular, hybrid and pure ad hoc networks. Acceptable quality levels for a connection are specified using resource-utility functions, and our allocation aims to maximise accumulated systemwide utility. To keep allocation optimal in this changing environment, we need to periodically reallocate resources. The novelty of our approach is that we have augmented the utility function model by identifying and classifying the way reallocations affect the utility of different application classes. We modify the initial utility functions at runtime, such that connections become comparable regardless of their flexibility to reallocations or age-related importance.</p><p>Another contribution is a combined utility/price-based bandwidth allocation and routing scheme for ad hoc networks. First we cast the problem of utility maximisation in a linear programming form. Then we propose a novel distributed allocation algorithm, where every flow bids for resources on the end-to-end path depending on the resource ``shadow price'', and the flow's ``utility efficiency''. Our periodic (re)allocation algorithms represent an iterative process that both adapts to changes in the network, and recalculates and improves the estimation of resource shadow prices.</p><p>Finally, problems connected to allocation optimisation, such as modelling non-critical resources as costs, or using feedback to adapt to uncertainties in resource usage and availability, are addressed.</p>
|
Page generated in 0.0426 seconds