This paper presents a distributed algorithm to determine fault avoiding routes between source-destination end-node pairs in an all-optical network. Fault-tolerant routing for WDM routed all-optical networks has not be...
详细信息
This paper presents a distributed algorithm to determine fault avoiding routes between source-destination end-node pairs in an all-optical network. Fault-tolerant routing for WDM routed all-optical networks has not been studied in details in the literature except for using protection switching or loopback recovery. Such schemes use predetermined protection mechanism and hence assume that the protection path is not faulty. This paper considers extensions to a dynamic routing scheme (presented earlier by these authors for fault-free networks) to handle rerouting in case of fault occurrence. The performance degradations of the network because of fault occurrence are then studied in terms of blocking probability and set-up time through simulations.
This paper presents an efficient distributed dynamic channel allocation algorithm for mobile communications systems. The algorithm is based upon the mutual exclusion model, where the channels are grouped by the number...
详细信息
ISBN:
(纸本)076950728X
This paper presents an efficient distributed dynamic channel allocation algorithm for mobile communications systems. The algorithm is based upon the mutual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels can not be shared concurrently within the cluster. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most (worst case) O(N-g * N(n)logN(n)) messages, where N-g is the number of groups and N-n is the number of neighbors. This is compared to Choy's algorithm which requires O(N-g(2) * N-n), where N-g is the number of groups. Our simulations experiments indicate that DDRA algorithm outperforms previous schemes. A 5% reduction in the denial rate, and a 10-30% reduction in the acquisition time channel were obtained using our algorithm when compared to previous algorithm.
We propose a new distributed delay-constrained unicast routing algorithm which can always find a delay-constrained path with small message complexity if such a path exists. At each network node, limited information ab...
详细信息
We propose a new distributed delay-constrained unicast routing algorithm which can always find a delay-constrained path with small message complexity if such a path exists. At each network node, limited information about the network state is needed and only a small amount of computation is required. Simulation results show that the proposed algorithm has much better cost performance than the least delay path algorithm. (C) 1998 Elsevier Science B.V.
Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new distribute...
详细信息
Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new distributed dynamic delay-constrained least-cost multicast routing algorithm (DDDCLCMR) to support these applications. DDDCLCMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDDCLCMR performs very good in terms of delay and cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known.
We propose a new distributed delay-constrained unicast routing algorithm which can always find a delay-constrained path with small message complexity if such a path *** each network node,limited information about the ...
详细信息
ISBN:
(纸本)7800908275
We propose a new distributed delay-constrained unicast routing algorithm which can always find a delay-constrained path with small message complexity if such a path *** each network node,limited information about the network state is needed and only a small amount of computation is *** results show that the proposed algorithm has much better cost performance than the least delay path algorithm.
We present a distributed algorithm for converging autonomous mobile robots with limited visibility toward a single point. Each robot is an omnidirectional mobile processor that repeatedly: 1) observes the relative pos...
详细信息
We present a distributed algorithm for converging autonomous mobile robots with limited visibility toward a single point. Each robot is an omnidirectional mobile processor that repeatedly: 1) observes the relative positions of those robots that are visible;2) computes its new position based on the observation using the given algorithm;3) moves to that position. The robots' visibility is limited so that two robots can see each other if and only if they are within distance V of each other and there are no other robots between them. Our algorithm is memoryless in the sense that the next position of a robot is determined entirely from the positions of the robots that it can see at that moment. The correctness of the algorithm is proved formally under an abstract model of the robot system in which: 1) each robot is represented by a point that does not obstruct the view of other robots;2) the robots' motion is instantaneous;3) there are no sensor and control error;4) the issue of collision is ignored. The results of computer simulation under a more realistic model give convincing indication that the algorithm, if implemented on physical robots, will be robust against sensor and control error.
A distributed reconfiguration method is proposed for a three-dimensional reconfigurable structure, composed of many identical mechanical units. The method aims to enable the structure to transform itself into a desire...
详细信息
A distributed reconfiguration method is proposed for a three-dimensional reconfigurable structure, composed of many identical mechanical units. The method aims to enable the structure to transform itself into a desired structure from an arbitrary initial configuration. The proposed method is implemented in such a way that each unit has identical software as well as hardware, so that any unit can play any role in the system. It is also featured by a stochastic relaxation process, which allows the system to converge to a given target structure by searching for a proper unit motion over many degrees of freedom. Furthermore, the method is extended for the structure to reconfigure itself dynamically according to the environment. The effectiveness of the method is confirmed by computer simulations.
We propose a simple and elegant distributed self-stabilizing algorithm to find the center of an arbitrary tree graph. The algorithm is uniform over all nodes of the tree. We prove the self-stabilization of the distrib...
详细信息
We propose a simple and elegant distributed self-stabilizing algorithm to find the center of an arbitrary tree graph. The algorithm is uniform over all nodes of the tree. We prove the self-stabilization of the distributed algorithm using mathematical induction; we did not need to design a bounded function on the global state (which is customary for proving correctness of self-stabilizing algorithms).
Locating a center or a median in a graph is a fundamental graph-theoretic problem. Centers and medians are especially important in distributed systems because they are ideal locations for placing resources that need t...
详细信息
Locating a center or a median in a graph is a fundamental graph-theoretic problem. Centers and medians are especially important in distributed systems because they are ideal locations for placing resources that need to be shared among different processes in a network. This paper presents simple self-stabilizing algorithms for locating centers and medians of trees. Since these algorithms are self-stabilizing, they can tolerate transient failures. In addition, they can automatically adjust to a dynamically changing tree topology. After the algorithms are presented, their correctness is proven and upper bounds on their time complexity are established. Finally, extensions of our algorithms to trees with arbitrary, positive edge costs are sketched.
暂无评论