routing algorithm

This paper presents a new approach to determine the shortest path between two points in AUTOCAD using Auto LISP for cabling purposes. The algorithm is initialized by setting the origin and destination points and uses a series of intermediate points to approximate the optimal path. These points are iteratively refined through error minimization to ensure trajectory accuracy. The algorithm calculates the total distance of the shortest path and visually shows it with a red line. This method effectively handles complex environments with multiple obstacles and provides a computationally efficient solution for routing in AUTOCAD.

Network-on-chip provides an efficient communication platform for Systems-on-chip. The static power consumption is an important issue in these networks. Switching the power supply on virtual channels during idle time is a common method for reducing the network power consumption. The traffic load at the network level and non-continuous idle period of virtual channel have caused the sources to be switched on and off continuously, which leads to increase in power consumption and other overheads. This will be more important, in partially connected 3D chip networks in which a limited number of vertical connections has been used. In this paper, a routing algorithm is proposed who employs an appropriate policy for packet distribution, and reduces the load distribution in the network and creates a continuous idle time for the resources, result in suitable power management in the network. In this routing scheme the network is divided to north and south region and some restriction applied in usage of elevators in each region and try to increase the utilization of the used resources as well as the ideal time of low traffic paths. The simulation results, derived by BookSim, show the proposed method improve the network power consumption by 18% to 30% comparing previous algorithms, and the network delay has been reduced by 32%.

Network-on-chip is a router-based paradigm that determines the path of packet passing from the source to destination by a routing pattern through simplified protocols of the public data communication network. Sometimes, it is impossible to send packets from source to destination due to the communication problems caused by network elements in NoC such as routers and faulty links. In most cases, fault-tolerant algorithms select a reliable path using definite criteria. Therefore, in this paper, a reliable path is selected using a multi-criteria decision making technique through an adaptive approach according to the density status received from the adjacent nodes along with the path length so that when a failure occurs, a reliable path with similar QoS features is replaced by rating different paths among network nodes. The weight path selection strategy in NoCs to detect the minimal output port and multi-criteria decision making approach with VIKOR method has improvement over the basic routing algorithm in terms of delay and throughput. The algorithm hardware overhead has a reasonably low cost that maintains scalability for large scale On-Chip networks implementations.

Today, video conferencing is one of the most sought after features of the Internet. The purpose of routing algorithms in online video conferencing is to increase the number of requests accepted according to Quality of Service (QoS) satisfaction. Most research in this field focuses solely on bandwidth, and relatively few studies consider both bandwidth and delay constraints. In this paper, we propose a new routing algorithm in the context of MPLS networks with fuzzy rules approach that considers both bandwidth limitation and end-to-end delay (bandwidth-delay) for path searches. The fuzzy system is a fuzzy weighted prediction model for filtering high resource requests. A combination of traditional routing and MPLS improves the mobility mechanism, scalability and overall network performance. We name the proposed algorithm as Fuzzy Bandwidth and Delay Routing Algorithm (FBDRA). The FBDRA is attempting to delay requests with high bandwidth and maximum end-to-end delay. We will use Matlab R2017a to simulate many different scenarios and measure criteria such as the number of requests received, average route length, and load balancing. In addition, we compare the performance of FBDRA compared to some of the previous related work such as MHA, WSP, MIRA, BCRA, MIRAD, BGDG, BGLC, SAMCRA and MDMF. The simulation results show that the FBDRA provides the best performance for video conferencing.