The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Deadlocks are an important issue in the design of interconnection networks. A successful approach is to restrict the routing function such that it satisfies a necessary and sufficient condition for deadlock-free routing. Typically, such a condition states that some (extended) dependency graph must be a cyclic. Defining and proving such a condition is complex. Proving that a routing function satisfies...
Aiming at constructing a delay and delay variation bounded Steiner tree in the real-time streaming media communication, we discuss in this paper a multicast routing algorithm based on searching a directed graph (MRASDH).In the construction of the multicast tree, there always exist some nodes and links in the network topology that do not affect the outcome of the tree constructed. Therefore, based...
In the traditional distributed spanning tree (DST), randomly selecting representatives makes some nodes become critical nodes, which increase the load of critical nodes and also reduce the fault tolerance of systems. To resolve this problem, an improved DST structure and a searching algorithm were proposed. In this paper, we describe a representative selection rule first, which provides a good load...
Among existing countermeasures against Reactive Jamming Attacks in Wireless Sensor Networks, the detection of trigger nodes whose transmissions invoke the jammer nodes has been proposed and developed as an efficient jamming-resistent routing scheme in unreliable WSN environments. Sequential group testing techniques were adopted in our previous work to alleviate the overhead of trigger detection in...
This paper aims to find the most optimal Grey-Fuzzy routing algorithm within multinomial time about the NP-complete problem of multi-objective optimization QoS routing. With the help of Grey-Fuzzy theory, this algorithm achieves an O(mn) time complexity through integrating the QoS metrics to a Grey-Fuzzy synthetic attribute according to its membership degree and grey degree. Our algorithm can use...
Variable bandwidth circuit switching is an approach in which a variable amount of bandwidth is reserved over the duration of circuit, in contrast to the fixed amount of bandwidth reserved in traditional circuit switching and advance reservation. In this paper, we focus on the routing and scheduling problem in variable bandwidth circuit switching. We develop three heuristics and compare the performances...
In this paper the problem of reducing congestion in WDM networks based on unidirectional de Bruijn graphs has been addressed in the presence of node faults. We propose a polynomial time routing algorithm for reducing congestion and analyze its time complexity. Congestion is defined as the maximum of the number of lightpaths propagating through a link over all links in the network. Congestion optimization...
This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed...
Array multipliers are preferred for smaller operand sizes due to their simpler VLSI implementation, in-spite of their linear time complexity. The tree multipliers have time complexity of O (log n) but are less suitable for VLSI implementation since, being less regular, they require larger total routing length, which may degrade their performance. Some hybrid architectures called dasiaarray of arraypsila...
Since there is no fixed infrastructure or centralized management in wireless sensors networks (WSNs), a connected dominating set (CDS) has been proposed as the virtual backbone. The CDS play a major role in routing, broadcasting, coverage and activity scheduling. To reduce the traffic during communication and prolong network lifetime, it is desirable to construct a minimum CDS (MCDS). Self-stabilization...
For faster connection establishment, previously proposed Pruned Vertically Stacked Optical Banyan (P-VSOB) networks used plane fixed routing (PFR) algorithm, and has O(log2N) routing complexity. Blocking probability has also been analyzed for these kinds of networks with given amount of crosstalk. In EP-VSOB networks, a few regular banyan planes are added with the PVSOB networks. Necessary routing...
A layered algorithm of bidirectional search is proposed for the problem of the route with multiple restrictions. The first step is to calculate the reachability set of path to each intermediate nodes using starting from the source nodes and the target nodes separately; and the second is to filtrate the path in the set. The reachability of paths can be obtained from the adjacent matrix transform, and...
This paper presents a new Clos network routing algorithm in order to reduce the high time complexity of original algorithm for Clos network. The paper illustrates that it is an independent problem whether a column in specification matrix is completive. As a result, it eliminates backtrackings among columns and backtrackings among elements in the same column. The presented algorithm completely achieves...
All-to-all personalized communication, also known as complete exchange, is one of the most dense communication patterns in parallel computing. In this paper, we propose new indirect algorithms for complete exchange on all-port ring and tori. The new algorithms fully utilize all communication links and transmit messages along shortest paths to completely achieve the theoretical lower bounds on message...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.