a shortest path problem is a practical issue in networks for real-world situations. this paper addresses the fuzzy shortest path (fsp) problem to obtain the best fuzzy path among fuzzy paths sets. for this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (ifss) in order to determine the fuzzy shortest path. moreover, this algorithm is developed for ...

This paper concerns about the radio propagation models used for the upcoming 4 th Generation (4G) of cellular networks known as Long Term Evolution (LTE). The radio wave propagation model or path loss model plays a very significant role in planning of any wireless communication systems. In this paper, a comparison is made between different proposed radio propagation models that would be used fo...

In an optical wavelength division multiplexing (WDM) network establishing a survivable connection involves computation of least cost disjoint (working and protection) paths. In this work we study the problem of computing edge/node disjoint path pair in WDM networks with full wavelength converters for providing shared protection. To enable greater resource sharing among protection paths we intro...

Although various types of path indexes – indexes on path expressions – have been proposed for efficient processing of object-oriented queries, conventional join algorithms do not effectively utilize them. We propose a new join algorithm called OID join algorithm that effectively utilizes (multiple) path indexes in object-oriented databases. When (multiple) path indexes are available for a query...

Computing the shortest path in a graph is an important problem and it is very useful in various applications. The standard shortest path problem has been studied extensively and intensively, but it can’t handle the situation when there is a switch cost between arcs. For example, in a train transportation network, the switch cost between arcs contains waiting time in stations, times of transfer ...