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.
We present two geometric routing algorithms that reliably deliver messages to all devices in a geocast region. One algorithm is based on flooding, the other on concurrent geometric routing. They are the fist known stateless geocasting algorithms. We formally prove the algorithms correct, evaluate their performance through abstract and concrete simulation and estimate their message complexity.
Autonomic Internet of Things is the creation of self-management capability in the Internet of Things system by embedding certain properties, in order to free human from all detail of the operation and management of the system while providing the system to always operate on the best performance. Some of these properties are self-healing, self-configuring, self-optimization and self-protection which...
A coloring of a graph is an assignment of colors to its nodes so that no two adjacent nodes are assigned the same color. Given a graph G, by a Grundy k-coloring of G mean any proper k-vertex coloring of G such that for each two colors i and j, i< j, every vertex of G colored by j has a neighbor with color i. The maximum k for which there exists a Grundy k-coloring is denoted by Γ (G) and called...
This paper describes a centralized routing algorithm based on permutation of M traffic flows entering the network. The proposed approach is significantly less complex than combinatorial approach and can be used as load-balancing tool. The main advantage of such approach is that many non-perspective flow permutations could be eliminated from the calculation very early. If a new flow enters the network...
Connecting points to the nearest point belonging to a set of lines is an interesting problem that arises in many practical problems, especially Infrastructure Design Problems. In this paper an algorithm is presented for this problem. This algorithm is based on enumeration. To test the performance we define and explain several heuristic approaches. The algorithms is then, in comparison to the other...
Virtualization of network infrastructure or its part by data centers (DC) provides flexible management of network topology and functions in real time. This method allows to get rid of the excess costs of expensive equipment and network service. Approaches to the development of engineering infrastructure of DC are changed followed the changes in the IT services model, the growth of computing power...
Estimating accurately important nodes for routing in modern and future networks is a key process with numerous benefits. Towards this goal, in this paper we propose Hyperbolic Traffic Load Centrality (HTLC), as a novel alternative to the Traffic Load Centrality (TLC) metric, used for ranking nodes with respect to their importance in the routing operation. HTLC is based on network embedding in hyperbolic...
In this paper heuristics are proposed for finding the shortest loopless path, from a source node to a target node, that visits a given set of nodes in a directed graph, such that it can be protected using a node-disjoint path. This type of problem may arise due to network management constraints. The problem of calculating the shortest path that visits a given set of nodes is at least as difficult...
The rapid development of IP networks requires high performance routers. The fast routing lookup engine in routers is a key problem to achieve higher throughput. In this paper, we present a new high performance IP lookup scheme combining path-compressed binary trie, hash algorithm and address aging technique. It can meet the search requirements of more than 10Gbps data stream and consumes less hardware...
Present design methodologies are integrating 10 to 100 embedded functional and storage blocks in a single system on chip and the number is going to increase in the near future. The bus based interconnections are not a suitable choice for MPSoC because of power and latency issue. To address the bus bottleneck for multi core chips, Networks on Chip (NoCs) emerges as an effective and promising alternative...
As the number of vehicles increases significantly, traffic congestion has become a major social problem in recent years. Such a situation can be alleviated effectively with the emerging of vehicular ad hoc network (VANET)-based real-time path planning systems. However, existing systems face the challenges of poor anti-congestion capability and high complexity. To address the related issues, an road...
Clustering algorithms have been widely used in wireless sensor networks for virtual backbone construction. They organize the nodes into smaller groups and form a structured topology allowing more efficient bandwidth usage and battery consumption. As the clustering algorithms are usually used for routing, it is crucial to measure the efficiency of the generated backbone in information transport. Failure...
Performance of a multicomputer largely depends on that of the underlying network communications such as multicast, which is essential for processors in multcomputer to exchange data and messages. Two major parameters used to evaluate multicast routing are the time it takes to deliver the message to all destinations and the traffic which refers to the total number of links involved. Direct network...
Distributed Routing Model (DRM) and Centralized Routing Model (CRM) are two mainstream routing models for Network-on-Chip (NoC). DRM is scalable and efficient, but its state learning is costly because exchanging network state must be in flooding form which may consume large amount of bandwidth. CRM monitors and send real-time network state to a central routing node as the basis of routing path computing...
This paper proposes a heuristic routing algorithm to design routes for all possible source destination pairs by provisioning erasure correcting code based instantaneous recovery technique with optimal traffic splitting, which was addressed for a source destination pair in a prior work. We consider a static routing problem in networks having the coding capability. When the links in a network have finite...
We propose two heuristics for solving the path geodiverse problem (PGD), in which the calculation of a number of geographically separated paths is required. The geodiverse paths can be used to circumvent physical challenges such as large-scale disasters in telecommunication networks. The heuristics we propose for solving PGD have significantly less complexity compared to the optimal algorithm we previously...
Recently, signal propagation delay in a circuit implemented in VLSI or PCB becomes a very important problem due to the increasing clock frequency, where signal delay should be adjusted to meet the requirement of the delay time. The delay can be roughly estimated by the net length.While, due to the circuit complexity and the high density of integration, a single layer routing may not be enough for...
Quantum circuit design flow consists of two main tasks: synthesis and physical design. Synthesis converts the design description into a technology-dependent netlist and then, physical design takes the fixed netlist, produces the layout, and schedules the netlist on the layout. Quantum physical design problem is intractable. This process can be divided into two main processes: scheduling and layout...
Device-to-device networks (D2D) underlaying cellular networks have been widely recognized as one of the major approaches for ubiquitous information exchange featuring future Internet of things (IoT). In this paper, we propose an interference-aware routing for wireless D2D networks. Our objective for routing is to minimize the hop-count, which can decrease not only the delay for D2D connections, but...
Maze solving has found extreme popularity in gaming and robotics but few other applications have been proposed. This paper explores the applicability of maze solving algorithms to the architectural domain. It explores the possibility of using maze routing for automatic evacuation map generation using the building's floor plans.
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.