Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this paper, we present a multi-objective Integer Linear Program (ILP) for the joint throughput optimization and traffic engineering problem in Wavelength-Division Multiplexing (WDM) networks. The proposed model simultaneously maximizes the aggregated throughput, minimizes the resource consumption, and achieves load balancing by minimizing the maximum link utilization (MLU). Even though the ILP...
Traffic driven based load balancing routing scheme in CogMesh network is proposed. SMC (secondary mesh client) accessing to CMR (cognitive mesh router) using Ad Hoc way is considered in the paper. A novel routing metric was proposed to describe the load state of a path, which was suitable for traffic demand. Choosing a light-loaded route and a light-loaded link guarantees a lower end-to-end delay...
DCUR follows the same procedure as define in Bellman-Ford but uses two vectors, namely least cost and least delay vector. The main drawback of DCUR is its assumption of link costs. It means that the minimum cost path is more often chosen and therefore the load distribution is not fair for the minimum cost paths. In this paper we propose a way to modify the cost and delay metrics dynamically in the...
We propose a new location-based stochastic routing approach that is well-suited for wireless sensor networks deployed for public safety applications such as emergency evacuations or search and rescue operations. We first introduce a new modeling and evaluation framework based on Markov chains for randomized routing. Based on this evaluation framework, we study the load balancing and routing performance...
Network services are provided by means of dedicated service gateways, through which traffic flows are directed. Existing work on service gateway placement has been primarily focused on minimizing the length of the routes through these gateways. Only limited attention has been paid to the effect these routes have on overall network performance. We propose a novel approach for the service placement...
How to improve the whole processing capability, the availability and survivability of network by use of load balancing is studied in this paper. To solve the problem with dynamic traffic, a novel dynamic weight based traffic sharing (DW-TS) algorithm is proposed. In DW-TS, we introduce the idea of traffic engineering algorithm-minimum interference routing algorithm (MIRA) in generalized multi-protocol...
One of the today issues in software engineering is to find new effective ways to deal intelligently with the increasing complexity of distributed computing systems. In this context a crucial role is played by the balancing of the work load among all nodes in a system composed of interconnected nodes that enter and exit the system without following any rule. To address this issue, we are experimenting...
In this paper we present a methodology to design fault-tolerant routing algorithms for two-dimensional mesh networks. Our methodology, Dynamic intermediate node algorithm (DINA) supports fully adaptive routing, does not degrade performance in the absence of faults, and supports a reasonably large number of faults without significantly degrading performance. Consequently, this work examines fault tolerant...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.