An approximation of Newton's method has been used recently in routing algorithms in computer networks, which is based on the assumption that the matrix of second derivatives of the objective function (Hessian) is ...
详细信息
An approximation of Newton's method has been used recently in routing algorithms in computer networks, which is based on the assumption that the matrix of second derivatives of the objective function (Hessian) is diagonal. It is demonstrated that in message-switched networks some specific nondiagonal elements exist and therefore the Hessian is not diagonal. Moreover, it is found that these elements are of the same order as the diagonal ones.
General purpose routing algorithms for a network-on-chip (NoC) platform may not be able to provide sufficient performance for some communication intensive applications. This may be because of low adaptivity offered by...
详细信息
General purpose routing algorithms for a network-on-chip (NoC) platform may not be able to provide sufficient performance for some communication intensive applications. This may be because of low adaptivity offered by a general purpose routing algorithm resulting in some links getting highly congested. In this study the authors demonstrate that it is possible to design highly efficient application-specific routing algorithms which distribute traffic more uniformly by using information regarding applications communication behaviour (communication topology and communication bandwidth). The authors use off-line analysis to estimate expected load on various links in the network. The result of this analysis is used along with the available routing adaptivity in each router to distribute less traffic to links and paths which are expected to be congested. The methodology for application-specific routing algorithms is extended to incorporate these features to design highly adaptive deadlock-free routing algorithms which also distribute traffic more uniformly and reduce network congestion. The authors discuss architectural implications and analyse area and power overheads of the proposed approach on the design of a table-based NoC router.
Whenever new routing algorithms are proposed, corresponding performance gains are reported. Are these gains the same for different interconnect scenarios? Do the proposed techniques always outperform the previous ones...
详细信息
Technologies Intermittent Cutting Problem and Endpoint Cutting Problem for cutting the sheet material belong to so called resource-saving technologies. These technologies allow to overlap the contours of cut-off detai...
详细信息
Two important issues in the design of interconnection networks for massively parallel computers are scalability and small diameter. A new interconnection network topology, called octagon-connected torus (OCT), is prop...
详细信息
Two important issues in the design of interconnection networks for massively parallel computers are scalability and small diameter. A new interconnection network topology, called octagon-connected torus (OCT), is proposed. The OCT network combines the small diameter of octagon topology and the scalability of torus topology. The OCT network has better properties, such as small diameter, regular, symmetry and the scalability. The nodes of the OCT network adopt the Johnson coding scheme which can make routing algorithms simple and efficient. Both unicasting and broadcasting routing algorithms are designed for the OCT network, and it is based on the Johnson coding scheme. A detailed analysis shows that the OCT network is a better interconnection network in the properties of topology and the performance of communication.
This paper proposes a strategy of designing routing algorithms for connectionless packet-switched networks. This strategy consists of three design elements as follows: [A] the notion of ideal routings is introduced to...
详细信息
This paper proposes a strategy of designing routing algorithms for connectionless packet-switched networks. This strategy consists of three design elements as follows: [A] the notion of ideal routings is introduced to provide the upper performance limits attained by improving routing algorithm and it serves as a standard to measure the performance of other algorithms;[B] a method of constructing simple algorithms is presented under implementation conditions from ideal routings;[C] a method is described to enhance the performance limits of [A]. By using these elements, simple algorithms with a maximum degree of performance attainment are realized. By "degree of performance attainment", we mean that we can see how much room is left for the improvement of algorithms. We develop [A] and [B] with the performance measures of throughput and average packet delay and the M/M/1 queuing network. We decide ideal static routings and their performance limits from [A]. We obtain a new simple algorithm from [B] based on the notion of the ideal routings in implementation conditions. The designed algorithm improves the throughput and the average delay, which are comparable to those from ideal static routings. This improvement is contrasted to the adaptive and distributed OSPF (Open Shortest Path First), a standard Internet routing protocol.
It is necessary to reduce the consumption of network node energy and the network load for solving the query design for routing algorithm in wireless sensor network, thus this article presents query gain routing algori...
详细信息
It is necessary to reduce the consumption of network node energy and the network load for solving the query design for routing algorithm in wireless sensor network, thus this article presents query gain routing algorithms and load balancing mechanism. This algorithm selects routing node by querying the routing information of gain matrix according to the successful record of historical query. The load balancing mechanism queries the energy information, which records node in the routing process and transfers load to balance the energy consumption of each node in the query path. This algorithm is able to effectively aware routing load to reduce the network energy consumption and avoid the data collision. The experimental result shows that compared with other query routing strategy, the query gain routing can increase the success rate of query under the condition of reducing the node energy consumption, but the load balancing mechanism can reduce the energy consumption of query gain routing further and prolong the network life cycle more effectively.
Technologies Intermittent Cutting Problem and Endpoint Cutting Problem for cutting the sheet material belong to so called resource-saving technologies. These technologies allow to overlap the contours of cut-off detai...
详细信息
Technologies Intermittent Cutting Problem and Endpoint Cutting Problem for cutting the sheet material belong to so called resource-saving technologies. These technologies allow to overlap the contours of cut-off details. This paper is devoted to review of mathematical models for cut-off (lie details by these technologies and algorithms for defining the cutter route according to some technological restrictions. (C) 2016, IFAC (International Federation of Automatic. Control) Hosting by Elsevier Ltd. All rights reserved.
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.
暂无评论