期刊名称：International Journal of Computer Science and Network
印刷版ISSN：2277-5420
出版年度：2013
卷号：2
期号：6
页码：184-195
出版社：IJCSN publisher
摘要：Dynamic networks are prevalent everywhere rightfrom Internet, Local Area Networks, Mobile Ad hoc networksto Wireless Sensor Networks. Communication networks, socialnetworks, Web, transportation networks infrastructuresrepresent dynamic networks due to the dynamics that influenceits topologies, connectivity, reliability and fault-tolerance. Thenetwork dynamics is rigorously influenced by the inputparameters like data, communication, computational overloads,data traffic, data congestion, inclusion and exclusion of dataresources over time. Hence, to identify optimal paths in suchdynamic networks where communication nodes come and go,network communication edges may crash and recover, is anon-trivial problem. In this paper we present a rigorous studyon various shortest path finding algorithms in dynamicnetworks. Although the research on this problem spans overmore than thirty years, in the last couple of years many novelalgorithmic techniques have been proposed. An arduous effortis made to abstract some combinatorial and algebraicproperties. Also, common data-structural tools that are at thebase of those techniques are described and compared.
