Single Shortest Path Research Articles

Ant colony based IP traceback scheme

In the modernized era, numerous types of attacks are noticed on the internet, along with the utmost destructive attacks called distributed denial of service attacks. With these types of attacks legitimate users are not able to access the authorized services. IP traceback scheme is the only way to trace the original source of the attack. Researchers have proposed various traceback schemes in the past, but none is able to provide comprehensive efficient results because mostly traceback schemes work on single shortest path from victim to attackers. In the latest scenario, it becomes more challengeable if single path destroys with no other option has for trace back. In this paper, we proposed a new scheme where three best shortest paths out of many different paths are considered from victim to the attackers. With this it not only confirms the guarantee of traceback but also depicts improved results if any one or more than one paths are destroyed to catch the attacker. The simulation results are shown and compared with other techniques which have only single path to reach the attackers.

Method of Distribution Network Resources after Restoration, the Networks MPLS-TE Use of Various Telecommunications Technologies to Construct Backbone Networks

The modern telecommunication system is characterized by the rapid improvement of information and communication technologies, such as the improvement in the data rate, power consumption and Quality of Service (QoS). Based on this development, the next generation network (NGN) is shaped. The NGN is represented by a packet transport network demarcated functions and services. To provide transport functions in NGN, using Multi-Protocol Label Switching (MPLS) technology, there are two main problems, which are multipath routing and traffic distribution, which are what this paper works with. Accordingly, this paper proposes a solution to these two problems using optimization procedures to find the shortest path Dijkstra and Bellman-Ford, which is characterized by a high-speed-oriented selection of a single shortest path between the source and the destination, based on several selected criteria related to the optimal use of the network resources. Solving the information flow distribution problems in large number of nodes network applying salesman procedure or having NP-completeness, causes significant time delay, which means that the proposed solution is not suitable for real time applications. Accordingly, for real time applications, there is a need to move to other methods based on the use of several independent shortest paths.

Path ensembles and a tradeoff between communication efficiency and resilience in the human connectome.

Computational analysis of communication efficiency of brain networks often relies on graph-theoretic measures based on the shortest paths between network nodes. Here, we explore a communication scheme that relaxes the assumption that information travels exclusively through optimally short paths. The scheme assumes that communication between a pair of brain regions may take place through a path ensemble comprising the k-shortest paths between those regions. To explore this approach, we map path ensembles in a set of anatomical brain networks derived from diffusion imaging and tractography. We show that while considering optimally short paths excludes a significant fraction of network connections from participating in communication, considering k-shortest path ensembles allows all connections in the network to contribute. Path ensembles enable us to assess the resilience of communication pathways between brain regions, by measuring the number of alternative, disjoint paths within the ensemble, and to compare generalized measures of path length and betweenness centrality to those that result when considering only the single shortest path between node pairs. Furthermore, we find a significant correlation, indicative of a trade-off, between communication efficiency and resilience of communication pathways in structural brain networks. Finally, we use k-shortest path ensembles to demonstrate hemispherical lateralization of efficiency and resilience.

Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks

In a network in which multiple domains are defined due to geographical and/or administrative reasons, only a limited amount of domain information is exchanged by domain service providers. Topology aggregation is a method used to facilitate this limited information exchange. The amount of information provided for each domain may vary based on the technical and management decisions taken by the service provider. For instance, some domains may choose to provide only a single shortest path between two border nodes, while another may be able to provide a pair of disjoint paths with minimum total cost. In such cases, end-to-end protected path routing needs to facilitate and use different amounts of domain information provided by domain service providers in order to find the best solution. In this work, we propose several approaches that help find a pair of disjoint end-to-end paths that may traverse multiple domains from source to destination and result in minimum total cost. These approaches include methods for inter-domain information exchange that carry costs of disjoint paths within a domain. The performance of minimizing the total cost of a pair of end-to-end paths is investigated. Finally, the blocking probabilities of these various approaches due to the existence of trap topologies in the network are also discussed.

Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks

In a network in which multiple domains are defined due to geographical and/or administrative reasons, only a limited amount of domain information is exchanged by domain service providers. Topology aggregation is a method used to facilitate this limited information exchange. The amount of information provided for each domain may vary based on the technical and management decisions taken by the service provider. For instance, some domains may choose to provide only a single shortest path between two border nodes, while another may be able to provide a pair of disjoint paths with minimum total cost. In such cases, end-to-end protected path routing needs to facilitate and use different amounts of domain information provided by domain service providers in order to find the best solution. In this work, we propose several approaches that help find a pair of disjoint end-to-end paths that may traverse multiple domains from source to destination and result in minimum total cost. These approaches include methods for inter-domain information exchange that carry costs of disjoint paths within a domain. The performance of minimizing the total cost of a pair of end-to-end paths is investigated. Finally, the blocking probabilities of these various approaches due to the existence of trap topologies in the network are also discussed.

Multiple paths extraction in images using a constrained expanded trellis

Single shortest path extraction algorithms have been used in a number of areas such as network flow and image analysis. In image analysis, shortest path techniques can be used for object boundary detection, crack detection, or stereo disparity estimation. Sometimes one needs to find multiple paths as opposed to a single path in a network or an image where the paths must satisfy certain constraints. In this paper, we propose a new algorithm to extract multiple paths simultaneously within an image using a constrained expanded trellis (CET) for feature extraction and object segmentation. We also give a number of application examples for our multiple paths extraction algorithm.

Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures

The routing problem is one of the most widely studied problems in VLSI design. Maze-routing algorithms are used in VLSI routing and robot path planning. Efficiency of the parallel maze routing algorithms which were mostly based on C. Y. Lee's algorithm8is poor. In this paper, we propose time-efficient algorithms to solve the maze-routing problem on a reconfigurable mesh architecture. The constant-time algorithms presented include: (i) testing the existence of specific types of paths between two terminals, and (ii) finding an absolute shortest path (ASP) and a shortest duplex-path (SDP). In addition, a fast algorithm to find the single shortest path (SSP) is presented. The simulation results indicate that a large percentage of the shortest paths that exist between two randomly selected terminals fall into one of the categories studied in this paper.

Shortest Path of Emergency Vehicles under Uncertain Urban Traffic Conditions

Emergency vehicle characteristics amplify the stochastic nature of transportation networks. The emergency vehicle operator who aims at reaching his destination in the fastest time possible cannot rely on “average” data alone. Each emergency event has its own implications (accident, fire, injury, security event, etc.) and must be dealt with as an individual incident. The need to deal with each event separately led, first, to the development of a stochastic shortest-path algorithm that refers to the dynamic traffic flow and then to a presentation method of the results so as to incorporate the operator's accumulated knowledge. The whole algorithm is based on a K shortest-path model incorporated with a simulation element in order to consider stochastic characteristics. The stochastic model uses a new definition, namely, the probability that a given path is the shortest. In contrast to a deterministic model, which yields a single shortest path, the stochastic model yields a set of paths, each having a different probability. This set of paths, along with relevant information for the emergency vehicle, is presented in a particular way to the operator. In addition, it was found that the arrangement of information is vital to the selection of the most promising path.