This paper considers the problem of permutation packet routing on a root n x root n mesh-connected array of processors. Each node in the array is assumed to be independently faulty with a probability bounded above by ...
详细信息
This paper considers the problem of permutation packet routing on a root n x root n mesh-connected array of processors. Each node in the array is assumed to be independently faulty with a probability bounded above by a value p. This paper gives a routing algorithm which, if p less than or equal to 0.29, will with very high probability route every packet that can be routed in O(root n log n) steps with queue lengths that are O(log(2) n). Extensions to higher-dimensional meshes are given.
A detailed analysis of convergence rate is presented for an iterative path formulated optimal routing algorithm. In particular, it is quantified, analytically, how the convergence rate changes as the number of nodes i...
详细信息
A detailed analysis of convergence rate is presented for an iterative path formulated optimal routing algorithm. In particular, it is quantified, analytically, how the convergence rate changes as the number of nodes in the underlying graph increases. The analysis is motivated by a particular path formulated gradient projection algorithm that has demonstrated excellent convergence rate properties through extensive numerical studies. The analytical result proven in this note is that the number of iterations for convergence depends on the number of nodes only through the network diameter.
The rapid growth of multi-core systems highlights the need for efficient Network-on-Chip (NoC) design to ensure seamless communication. Cache coherence, essential for data consistency, substantially reduces task compu...
详细信息
The purpose of this research is to review the existing literature on clustering protocols in wireless sensor networks (WSNs) and to analyze the methodologies used to anticipate the position of mobile sinks in WSNs, as...
详细信息
This paper addresses the problem of survivable lightpath provisioning in wavelength division multiplexed networks taking into consideration the optical signal performance degradation triggered by the physical impairme...
详细信息
ISBN:
(纸本)9781424423910
This paper addresses the problem of survivable lightpath provisioning in wavelength division multiplexed networks taking into consideration the optical signal performance degradation triggered by the physical impairments Of transparent optical networks as a routing constraint. This work proposes a resource efficient provisioning scheme that takes into consideration both working and protection traffic. In order to maximize the utilization of spare capacity the backup multiplexing technique is applied in combination with suitable wavelength assignment algorithms differentiating the two types of traffic. In addition, to provide the required quality guarantees an impairment aware routing algorithm that incorporates the main physical layer characteristics of large-scale optical networks into its path computation process is proposed. The performance of the proposed solution is investigated and compared to other conventional RWA algorithms (Le shortest path, minimum hop and random wavelength assignment) through simulations of a typical mesh long-haul network.
The shortest path problem is possibly the most important problem for data routing in multimedia communication. Chen and Chin have proposed a new variant of shortest path problem, termed the quickest path problem. The ...
详细信息
ISBN:
(纸本)0818690143
The shortest path problem is possibly the most important problem for data routing in multimedia communication. Chen and Chin have proposed a new variant of shortest path problem, termed the quickest path problem. The quickest path problem is find quickest paths in a computer network to transmit a given amount of data with minimal transmission time. The selection of quickest paths depends on both the characteristics of the computer network and the amount of data to be transmitted. The quickest path problem is to find quickest paths to send a certain amount of data through a communication network. Besides, if the quickest paths are required to go through a specified path, then the restricted problem is called the constrained quickest path problem. In this paper, some new distributed routing algorithms are developed for multimedia data transfer in an asynchronous communication network For all pairs of nodes in a network, an O(mn) messages and O(m) time distributed algorithm is first presented to find constrained quickest paths, and then an O(mn) messages and O(m) time distributed algorithm is present to enumerate the first k quickest paths.
We propose a provably good performance-driven global routing algorithm for both cell-based and building block design. The approach is. based on a new bounded-radius minimum routing tree formulation, which simultaneous...
详细信息
This paper studies load balancing for multipath Internet routing. We focus on hash-based load balancing algorithms that work on the flow level to avoid packet reordering which is detrimental for the throughput of tran...
详细信息
ISBN:
(纸本)9781424404247
This paper studies load balancing for multipath Internet routing. We focus on hash-based load balancing algorithms that work on the flow level to avoid packet reordering which is detrimental for the throughput of transport layer protocols like TCP. We propose a classification of hash-based load balancing algorithms, review existing ones and suggest new ones. Dynamic algorithms can actively react to load imbalances which causes route changes for some flows and thereby again packet reordering. Therefore, we investigate the load balancing accuracy. and flow reassignment rate of load balancing algorithms. Our exhaustive simulation experiments show that these performance measures depend significantly on the traffic properties and on the algorithms themselves. As a consequence, our results should be taken into account for the application of load balancing in practice.
In structured overlay networks with millions of nodes, it is essential to optimize the extent to which routing paths are shortened for more efficient message routing. However, various metrics, such as the physical pos...
详细信息
ISBN:
(纸本)9781479983421
In structured overlay networks with millions of nodes, it is essential to optimize the extent to which routing paths are shortened for more efficient message routing. However, various metrics, such as the physical positions of nodes, network latencies, node lifespan, and node availability, other than the number of hops, can be considered. Methods have been proposed to efficiently design extended algorithms that consider metrics other than the number of hops. However, a real world application requires a suitable set of metrics, and the set varies by application. We propose mergeable flexible routing tables (mergeable-FRT), a routing algorithm design framework for structured overlays, which supports the efficient design of algorithms. Mergeable-FRT-based extended algorithms can be designed by merging existing algorithms, so that algorithms with new metrics or algorithms to which are added new metrics can be designed by reusing existing algorithms. In mergeable-FRT, algorithms are defined using a sequence of sticky entry sieve functions and can be merged by merging these sequences. However, when these sequences are merged repeatedly, the effect of extensions is much stronger than the effect of path length reduction, and the number of hops progressively increases. Mergeable-FRT therefore defines a minimum through parameter to control the effect of sticky entry sieves and supports the balancing of the effect due to extensions with that due to the reduction of path length. For mergeable-FRT algorithms based on FRT-Chord with arbitrary extensions, we prove that the path length is O(log |N|) by configuring a minimum through parameter when routing tables are converged. Using sticky entry sieves, we design and implement group FRT-Chord (GFRT-Chord) and proximity-aware FRT-Chord (PFRT-Chord) and their merged algorithms, PGFRT-Chord and GPFRT-Chord. Experimental results show that the extended algorithms have merged features inherited from the original algorithms and that the mi
The German Collaborative Research Centre 637 "Autonomous Cooperating Logistic Processes - A Paradigm Shift and its Limitations", develops, among other things, autonomous routing algorithms for transport netw...
详细信息
ISBN:
(纸本)9780791848364
The German Collaborative Research Centre 637 "Autonomous Cooperating Logistic Processes - A Paradigm Shift and its Limitations", develops, among other things, autonomous routing algorithms for transport networks. The discussed algorithm is designed to match goods and vehicles and to continuously make route decisions within a dynamic transport network. Here, each object makes its own decisions. It is called Distributed Logistics routing Protocol DLRP. Because of obvious similarities to the Vehicle routing Problem (VRP), one question arises for both practitioners and researchers: How efficient is this protocol compared to traditional, established algorithms or in comparison to the optimal solution? This article tries to answer this question, which appears simple on the first and challenging on the second view.
暂无评论