This paper compares three dynamic multipoint routing algorithms for widearea packet switched networks like asynchronous transfer mode (ATM) networks. The three algorithms compared are the greedy algorithm, the source ...
详细信息
This paper presents an investigation into feasibility performance gains for routing protocols. routing protocols are crucial for WSN activity because sensors are not capable to realise individually overall system task...
详细信息
ISBN:
(纸本)9780769536743
This paper presents an investigation into feasibility performance gains for routing protocols. routing protocols are crucial for WSN activity because sensors are not capable to realise individually overall system tasks. Because of that, sensors need to have more or less tightly integrated cooperation, based on information exchange, between them. We propose relational approach, based on set theory, which considers three relations: subordination, tolerance and collision. Using these relations we perform initial organization, but them is no necessity to perform any reorganization during a network lifetime. The obtained results show that providing relatively high collision intensity quotient, nodes can avoid selectively malfunctioned nodes. On the other side, decreasing subordination intensity quotient inhibits error dissemination process.
It is commonly believed that Ant routing algorithms cannot be applied with the TCP transport layer. We show that, contrary to this belief, TCP in the transport layer still enables the adaptive algorithms to extend the...
详细信息
ISBN:
(纸本)9783540718048
It is commonly believed that Ant routing algorithms cannot be applied with the TCP transport layer. We show that, contrary to this belief, TCP in the transport layer still enables the adaptive algorithms to extend the range of load levels under which they can find efficient routing policies.
routing algorithms for networks-on-chip (NoCs) typically only have a small number of virtual channels (VCs) at their disposal. Limited VCs pose several challenges to the design of fully adaptive routing algorithms. Fi...
详细信息
ISBN:
(纸本)9781467308243;9781467308267
routing algorithms for networks-on-chip (NoCs) typically only have a small number of virtual channels (VCs) at their disposal. Limited VCs pose several challenges to the design of fully adaptive routing algorithms. First, fully adaptive routing algorithms based on previous deadlock-avoidance theories require a conservative VC re-allocation scheme: a VC can only be re-allocated when it is empty, which limits performance. We propose a novel VC reallocation scheme, whole packet forwarding (WPF), which allows a non-empty VC to be re-allocated. WPF leverages the observation that the majority of packets in NoCs are short. We prove that WPF does not induce deadlock if the routing algorithm is deadlock-free using conservative VC re-allocation. WPF is an important extension of previous deadlock-avoidance theories. Second, to efficiently utilize WPF in VC-limited networks, we design a novel fully adaptive routing algorithm which maintains packet adaptivity without significant hardware cost. Compared with conservative VC re-allocation, WPF achieves an average 88.9% saturation throughput improvement in synthetic traffic patterns and an average 21.3% and maximal 37.8% speedup for PARSEC applications with heavy network loads. Our design also offers higher performance than several partially adaptive and deterministic routing algorithms.(1)
The AntNet algorithm for adaptive routing is implemented on a LAN using the TCP/IP protocol. A study is made of the relative merits of different reinforcement parameters central to the stable operation of the algorith...
详细信息
ISBN:
(纸本)0780375149
The AntNet algorithm for adaptive routing is implemented on a LAN using the TCP/IP protocol. A study is made of the relative merits of different reinforcement parameters central to the stable operation of the algorithm. The case of a constant reinforcement leads to slow but dependable performance whereas adaptive reinforcement appears to be sensitive to the window over which statistics are estimated.
In this work, several aspects on IP routing for LEO satellite networks are investigated. First, a proper downlink routing procedure is defined, which has the advantage to allow the identification of the egress satelli...
详细信息
ISBN:
(纸本)078037651X
In this work, several aspects on IP routing for LEO satellite networks are investigated. First, a proper downlink routing procedure is defined, which has the advantage to allow the identification of the egress satellite, without the need of information from GPS systems to determine the position of the destination mobile terminal. Furthermore, the performance of the routing algorithm that minimizes the number of hops are evaluated through simulations, for an Iridium-like and a Teldesic-like constellation in order to show the sensitivity of the routing algorithms to the availability of cross-seam ISLs. A modification of the "minimization of number of hops" algorithm is proposed, which allows to reduce the total path length, and hence, the end-to-end delay. The idea is to exploit as much as possible inter-plane ISLs at higher latitudes. The comparison between the two IP routing algorithms shows that the proposed algorithm can significantly reduce the end-to-end delay when the source interface and the destination interface are largely spaced in latitude and longitude.
Interconnection networks have been widely adopted in multicomputer systems, clusters, or chip multiprocessors (CMPs) for high performance and low latency. Among various routing algorithms in interconnection networks, ...
详细信息
ISBN:
(纸本)9781424433681
Interconnection networks have been widely adopted in multicomputer systems, clusters, or chip multiprocessors (CMPs) for high performance and low latency. Among various routing algorithms in interconnection networks, adaptive routing shows the best performance with most traffic types. In this paper, we propose two practical adaptive routing algorithms, called Adaptive Injection (AI) and Adaptive Layer Selection (AL), which utilize the pipelined architecture and multi-layer networks. In AI, a node adaptively selects a layer to which it injects a packet according to the current network status. After injection, the packet uses deterministic routing. In AL, a packet can change the layers during its delivery. AI is especially good when the network size is small, while AL shows better performance in general. In addition, these adaptive decisions are made only when the remaining hops are less than some threshold value, or oblivious routing is selected in other cases. The simulation results show that considering the remaining hops successfully decreases the number of adaptive decisions and two proposed routing schemes show better performance than previous adaptive algorithms. On the average, AI outperforms existing routing algorithms in terms of throughput by 7.1% similar to 65.2%. AL with AI shows better performance especially when the network size is large. Its throughput is improved by 12.5% similar to 73.8% in an (8 x 8) mesh network.
Storage Area Networks (SANs) provide the scalability required by the IT servers. InfiniBand (IBA) interconnect is very likely to become the de facto standard for SANs as well as for NOWs. The routing algorithm is a ke...
详细信息
ISBN:
(纸本)3540440496
Storage Area Networks (SANs) provide the scalability required by the IT servers. InfiniBand (IBA) interconnect is very likely to become the de facto standard for SANs as well as for NOWs. The routing algorithm is a key design issue in irregular networks. Moreover, as several virtual lanes can be used and different network issues can be considered, the performance of the routing algorithms may be affected. In this, paper we evaluate three existing routing algorithms (up*/down*, DFS, and smart-routing) suitable for being applied to IBA. Evaluation has been performed by simulation under different synthetic traffic patterns an I/O traces. Simulation results show that the smart-routing algorithm achieves the highest performance.
Hypercube is the most important and attractive network communication model that is widely used in parallel computing and routing algorithm. And spiking neural P system is currently much investigated in membrane comput...
详细信息
ISBN:
(纸本)9783319092652;9783319092645
Hypercube is the most important and attractive network communication model that is widely used in parallel computing and routing algorithm. And spiking neural P system is currently much investigated in membrane computing. The purpose of this paper is to propose a new solution using SN P systems to the broadcast routing problem. Two SN P systems are constructed for dealing with the broadcast problem in n dimensional hypercube with or without faulty nodes. Some examples are given to show the effectiveness of the algorithm. The broadcast technique provides a new thought comparing to traditional broadcast algorithms.
In this paper we propose new advances towards the development of a commercial tool to address the inventory and transportation problem, i.e. the problem of minimising both the transport and inventory costs of a retail...
详细信息
ISBN:
(纸本)9780780394872
In this paper we propose new advances towards the development of a commercial tool to address the inventory and transportation problem, i.e. the problem of minimising both the transport and inventory costs of a retail chain that is supplied from a central warehouse. On the first level, we employ an evolutionary algorithm to evolve the delivery patterns for each shop. On a second level we obtain the delivery routes using two different algorithms: the bi-directional multistart sweep (daisy) algorithm and the daisy algorithm enhanced with local neighbourhood search. The experiments performed show that both methods can obtain acceptable results consistently and within a short timescale. The results are also of a lower cost than those obtained by other strategies employed in previous research, showing that employing a more efficient routing algorithm is effective in reducing costs, although for the cases studied the reduction is not significant. Furthermore, they confirm the interest of addressing the optimisation problem jointly, rather than minimising separately inventory and transport.
暂无评论