[PDF] Top 20 Towards shortest path identification on large networks

... Complex large scale networks are massive in size of data and the information that they hold and ...with large scale “Big Data” have vital importance. As our networks are evolving incessantly ... See full document

... The large volumes of stormwater enter- ing the system can cause either backflow and/or the activation of combined sewer overflows due to pipe overloading, thus leading to the generation of new flow ... See full document

... In recent papers [6, 7], the authors presented the MapReduce-based approach for shortest path problem in large-scale network. The proposed approach works in four stages including the map and reduce ... See full document

... on path queries that find the shortest path between a source and a destination of the ...the shortest paths for a large number of simultaneous path queries in road ...travel ... See full document

... driving path only passes one of a few important transit ...the shortest path can only be computed on a complete ...fast shortest path computation on a portion of entire index which can ... See full document

... The Gravitational Search Algorithm that is used in this study, is a new algorithm proposed by Rashedi in 2008, and is an attempt to establish a new population-based search algorithm based on gravity rules. One of the ... See full document

... In [5], the authors consider the problem of obtaining a schedule of minimum length under the SINR interfer- ence model. They assume that the transmission rates are fixed and that each transmitting node selects opti- ... See full document

... system towards the potential failure of sensor ...which path hopping is to be ...the path to get the shortest possible path from sender to receiver ...a large amount of sensors ... See full document

... all-optical networks. The objective is to minimize the overall routing light path by choosing the dynamic path routing which is discussed below in the flow ...with shortest light path ... See full document

... 318 The driving principle of Subdue’s approach is the use of the minimum description length (MDL) principle to evaluate the interestingness of a substructure. The use of MDL rather than frequency to evaluate a ... See full document

... There are some challenges why we use underwater devices. First, radio is not suitable for underwater because of extremely limited propagation while acoustic waves is a promising form of underwater communications. ... See full document

... online shortest path computa- tion; the shortest path result is computed/updated based on the live traffic ...and large transmission ...compute shortest path on a small ... See full document

... Sensor Networks (WSN) have become a critical research issue for a wide range of applications such as environmental monitoring, medical, habitat monitoring, surveillance and tracking systems with the improvement of ... See full document

... a large number of algorithms for various conditions and ...computer networks and distributed processing has brought renewed interest in the subject with a new twist: time ...dependent shortest ... See full document

... Since network lifetime and nodes energy are two major constraints in designing any routing protocol for WSN, to a large extent research has been made to accomplish the goal. Therefore, the enhanced routing process ... See full document

... (wireless) networks? WSN s are a special type of MANET s but introduce additional challenges in the design of protocols and ...usually large number of nodes and the severe resource limitations of the nodes, ... See full document

... The Dijkstra’s algorithm is used to calculate and estimate the optimal path between two interceding points on a network using a connected graph that is made up of nodes and edges. It assigns a cost value to each ... See full document

... This paper organized as follows: In section 2 some basic concepts on Intuitionistic fuzzy set theory have been introduced .Section 3 includes the modified algorithm for finding shortest path from source ... See full document

... Road, footpath and land-cover data for Kibera were extracted from OpenStreetMap data for Nairobi and Kibera. The Kibera boundary and the locations of public toilets were obtained from the Map Kibera project (Hagen, ... See full document

... Finding shortest simple paths in a directed graph is a fundamental problem in many engineering ...k shortest paths in a directed graph, plays an important role in many application domains, such as providing ... See full document