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.
Freedom from deadlock is one of the most important issues when designing routing algorithms in on-chip/off-chip networks. Many works have been developed upon Dally's theory proving that a network is deadlock-free if there is no cyclic dependency on the channel dependency graph. However, finding such acyclic graph has been very challenging, which limits Dally's theory to networks with a low number...
This paper proposes an algorithm that uses predefined weights to create broadcast routes for a WirelessHART network. The network topology is represented by a graph, and the algorithm uses information of the devices present in the network to build the broadcast graph. At each iteration of the algorithm, a device is selected and then added to the broadcast solution graph. A cost function determines...
Wireless Sensor Network (WSN) is widely used in IOT, military and environmental application. However, WSN is energy-constrained and the network nodes placed in hostile environment are hard to replace. Therefore, designing an energy-efficient routing algorithm is significant. Many solutions have been proposed to optimize energy consumption in conventional wireless sensor network, but they don't work...
Among the schemes proposed for failure recovery in software-defined networks, installing backup paths in advance is considered to be an effective approach to reduce the recovery latency. However, the pre-installation poses undue storage overheads on flow tables. In this paper, we propose a customized and cost-efficient backup scheme, which achieves fast recovery from any single-link failure. We introduce...
In Information-Centric Networks (ICN), contents are cached on some intermediary routers. This creates thus a new situation which is totally different from the traditional path-selection paradigm: the source/destination paradigm no longer exists; instead, the new paradigm is how to find a path through a selected group of caches, so that the content is delivered via the shortest way. This paper addresses...
Interconnection networks must meet the communication demands of current High-Performance Computing systems. In order to interconnect efficiently the end nodes of these systems with a good performance-to-cost ratio, new network topologies have been proposed in the last years that leverage high-radix switches, such as Slim Fly. Adversarial traffic patterns, however, may reduce severely the performance...
In High-Performance Computing (HPC) systems, the design of the interconnection network is crucial. Indeed, the network topology, the switch architecture and the routing scheme determine the network performance and ultimately the system one. As the number of endnodes in HPC systems grows, and the supported applications become increasingly demanding for communication, the use of techniques to deal with...
In this paper, an adaptive routing and wavelength assignment algorithm based on cost updating (CU-RWA) has been proposed to optimize route selection in optical networks. The classical shortest path algorithms, such as the Dijkstra algorithm, always cause high blocking probability and unbalanced load when making a routing decision. Consequently, the algorithm which is able to train the network and...
Valiant routing, the use of a random intermediate node to distribute network traffic, has been proposed for a number of recent HPC network topologies. It is also commonly used as a bulding block for adaptive routing algorithms, which use shortest path routes when possible, but revert to Valiant routing when necessary to avoid hot spots. We show that the version of Valiant routing proposed for the...
Today, with the rapid development of information technology in all areas of life, a large amount of information is created every second. In recent years, many network topologies have been proposed to find the most effective communication method. The folded hypercube is one of those networks, which is a variant of the hypercube, which is one of the most popular topologies for interconnection networks...
Wireless devices such as sensors have increasingly more processing, storage, and networking capabilities, making wireless sensor networks (WSNs) get lots of attentions in recent years. In addition, the cost of sensors is constantly decreasing making it possible to use large quantities of these sensors in a wide variety of important applications in environmental, military, commercial, health care,...
A Q-learning based congestion table dynamic adjusted NoC routing scheme is presented to reduce the impact of the packet transfer delay on system performance in condition of network congestion. First, according to the degree of congestion, each router selects between DyXY routing scheme and Q-learning based routing scheme. The proposed routing algorithm relies on transfer latency of each packet and...
Data center energy consumption has become one of the top concerns in designing and operating large-scale data centers as cloud service providers such as Amazon, Google, IBM and Microsoft have begun to establish more data centers in response to growing requests in clouds. In recent years, extensive efforts have been put into the research of reducing the energy consumption of servers. With the improvement...
For deep space networks, the major challenge is that transmission power consumption is serious while the power resource is limited. In this paper, we proposed a Temporal Graph Model based Power Aware Routing algorithm using a weighted metric of remaining power level, data rate and distance of nodes for determining routes. The traditional standards and techniques of static networks is hard to solve...
In Network on Chip (NoC), the number of cores get increases gradually in the past few decades. This affect the performance of the mesh and this leads to evolution of new topological concept. The king topology provides the high grade evolution of the humanistic mesh and torus topologies. This network exhibits a number of interesting characteristics which helps to achieve, reduced execution time of...
The routing algorithms for wireless sensor networks (WSN) are in process of optimization for addressing issues like energy conservation, delay and throughput in presence of limited resources in terms of memory, CPU processing power and power source (batteries). Although, it has not been possible to date, a development of routing algorithm addressing all the issues of WSN. Various tradeoffs exists...
In this paper, a new tool is proposed to provide a solution for the implementation of generic 3D Network-on-Chips (NoCs) to serve different applications. The proposed tool denoted by 3D-NOCET, is based on the 3D Direct-Elevator routing algorithm. The 3D-NOCET tool allows the user to create different combinations of 3D-NoCs based on the 2D-routing topology, number of tiers and number of routers per...
The energy consumed by the networking resources to access the computational and storage resources is one of the factors to be considered in the cloud data center. In SDN, the network virtualization showcases the business in the network resource allocation when traffic is generated from the source host to the destination host. The network switches in the cloud based data centric network acquire the...
Due to the concept of smart city being gradually prevailed in recent years, the wireless routing algorithm for Low-Rate Wireless Personal Area Networks is an important research for data collecting network, which is used for managing and collecting sensing data in the city. Chiu and Chen proposed an adaptive link-list routing algorithm with wormhole mechanism. The algorithm is a low collision wireless...
Flexible spectrum ROADMs facilitate networks to support channels operating at heterogeneous line rates by allocating spectral resources in a dynamic and flexible manner leading to better Spectral Efficiency. In a realistic network, traffic scenario is very dynamic in nature leading to continuous tear down of existing demands and set up of new demands. This dynamic tear down and set up process leads...
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.