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.
The delay constrained least cost (DCLC) problem is to find the least cost path in a network subject to a delay constraint. Due to its NP-complete property, many heuristic methods have been proposed. However, these methods suffer from either high computation and communication complexity or low success ratio in finding the optimal path, or lack of scalability. In this paper, a new delay constrained...
An intersection-centric routing algorithm of traffic simulation system and priority algorithm are proposed by us before. When there are many simulating vehicles, the performance of the system is very crucial. Change the core algorithm may be the way to get better performance. After trying some algorithms, an IBF* algorithm is proposed to fit the requirement of intersection-centric routing based on...
We present an overview of combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are allowed. Namely, the input dataset is represented by a comparison oracle that given any three points X,Y,Z answers whether Y or Z is closer to X. We assume that the similarity order of the dataset satisfies the four variations...
The most popular routing algorithm in p2p network is that every node keeps a route table which records a certain number of other nodes. Such algorithm selects neighbor nodes at random, and this reduces routing efficiency. In this paper a new algorithm of optimizing p2p overlay network topology is proposed, which is based on minimum maximum k-means principle. According to the communication history,...
We propose new strategies in core selection methods and core-based tree (CBT) construction based on new methods of computing delay variation. As a result, we propose an algorithm, which guarantees that the delay from the source to any destination does not exceed a real-time constraint. Furthermore, we address the problem of satisfying the delay variation constraint under cost minimization. We present...
A hardwired algorithm for computing the variable precision multiplication is presented in this paper. The computation method is based on the use of a parallel multiplier of size m to compute the multiplication of two numbers of n times m bits. These numbers are represented in the variable precision floating point format, but in this work only the mantissas are considered; the exponents are easily...
Shadow price and Vickrey price are two classic metrics that can be applied to measure the relative importance of links in a communication network. Each metric has been extensively investigated and enjoys important applications. We study the underlying connections between these two metrics with seemingly different definitions, under a general mathematical model of multipath multi-session multicast...
Multicast routing with quality-of-service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu Search...
The single-source shortest path problem (SSSP), known as the basis of many application areas, is a fundamental matter in graph theory. In this paper, a new efficient algorithm named Li-Qi (LQ) is proposed for SSSP to find a simple path of minimum total weights from a designated source vertex to each vertex. The algorithm is based on the ideas of the queue and the relaxation, The main differences between...
The LSP routing algorithm in MPLS becomes the core and hot topic of traffic engineering. This paper presents a new routing scheme that uses the current bandwidth availability and the traffic flow distribution to achieve traffic engineering in IP networks. It reduces the interference among competing flows by balancing the number and quantity of flows carried by a link to achieve efficient routing of...
As the network is growing exponentially, challenges and issues also increases. They affect the performance of the network. Many factors contribute to improve the performance of the network. One such factor is finding the path quickly. In this paper, we are going to find a shortest path faster compared to Dijkstra's shortest path algorithm. We have introduced new ideas in building the end-to-end path...
Multi-layer obstacle-avoiding rectilinear Steiner tree construction is an essential problem in physical design for advanced SoC and nano technologies. This paper unifies obstacle-avoiding rectilinear Steiner tree construction either for single or for multiple routing layers. Experimental results show that our algorithm outperforms the state-of-the-art works for both cases.
Multicast communication is one of the general patterns of collective communication in multiprocessors. On hypercube network, the optimal multicast path problem is NP-hard and all existing multicast path algorithms are heuristic. Aiming to reduce the communication traffic, we propose a new heuristic multicast path algorithm which consists of a preprocessing algorithm and a message routing algorithm...
This paper investigates the shortest paths tree problem taking single link failure into account. Let G be a graph modeled by network with vertex set V and edge set E. Given a specified vertex s. A shortest paths tree Ts={e1, e2, hellip, en-1} rooted at s satisfies the path from s to ui in Ts is a shortest path in G, where ei=(ui, vi) and ui=parent(vi). Let |PG(s,t)| be the cost of the shortest (s,...
It had been proved that routing and wavelength assignment (RWA) in an arbitrary mesh optical network is an NP-complete problem. Previous works intended to solve this problem through various approaches, such as heuristics algorithm or graph theory. However, the computational time would increase exponentially with the problem size. Especially to a dynamic traffic model, the connection requests arrive...
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...
Networks on chips (NoCs) provide a mechanism for handling complex communications in the next generation of integrated circuits. At the same time, lower yield in nano-technology, makes self repair communication channels a necessity in design of digital systems. This paper proposes a reliable NoC architecture based on specific application mapped onto an NoC. This architecture is capable of recovering...
For a unicast/multicast session, network coding is generally implemented via random coding and broadcasting at intermediate nodes, an especially favorable solution in wireless networks. The corresponding broadcast traffic can be minimized by finding the max (s, t)-flow of the network and by sending packets only along the max flow. All existing algorithms for this task, e.g. the push-&-relabel...
The QoS routing is based on the computing of each flow as regards the dynamic request, the routing computing is more frequent and the granularity of resource distribution is more smaller. Aiming at fast routing computing, the method of pre-computing for parallel computing based on QoS matrices is proposed: the Pareto subset of viable path which satisfy routing constrain will be taken into account,...
The Niagara2 CMT system-on-chip incorporates many design-for-test features to achieve high test coverage for both arrays and logic. All the arrays are tested using memory built-in-self-test. This is supplemented with scan-based testing. Logic is tested with standard ATPG for slow-speed defects and extensive use of transition test, along with logic built-in-self-test for the SPARC cores, for at-speed...
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.