A multidimensional robust greedy algorithm for resource path finding in large-scale distributed networks

Authors:
Aida Vosoughi;Kashif Bilal;Samee Ullah Khan;Nasro Min-Allah;Juan Li;Nasir Ghani;Pascal Bouvry;Sajjad Madani
Affiliations:
North Dakota State University, Fargo, ND;COMSATS Institute of IT, Abbottabad, Pakistan;North Dakota State University, Fargo, ND;COMSATS Institute of IT, Islamabad, Pakistan;North Dakota State University, Fargo, ND;University of New Mexico, Albuquerque, NM;University of Luxembourg, Luxembourg;COMSATS Institute of IT, Abbottabad, Pakistan
Venue:
Proceedings of the 8th International Conference on Frontiers of Information Technology
Year:
2010

Citing 8
Cited 1

Fault-tolerant computer system design

Fault-tolerant computer system design
Finding the k Shortest Paths

SIAM Journal on Computing
Measuring the Robustness of a Resource Allocation

IEEE Transactions on Parallel and Distributed Systems
Computer Networks: A Systems Approach, 3rd Edition

Computer Networks: A Systems Approach, 3rd Edition
A survey of peer-to-peer content distribution technologies

ACM Computing Surveys (CSUR)
Survey of research towards robust peer-to-peer networks: search methods

Computer Networks: The International Journal of Computer and Telecommunications Networking
Robust CDN replica placement techniques

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
All of Statistics: A Concise Course in Statistical Inference

All of Statistics: A Concise Course in Statistical Inference

Convergence analysis of evolutionary algorithms in the presence of crash-faults and cheaters

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a robust greedy algorithm and four of its variants for the resource path finding problem in distributed networks. In contrast to the existing solutions that rely on a single minimum cost path for each request, the proposed algorithm makes use of finding "robust" paths for each request within the network. We give a mathematical definition of robustness for the resource path finding problem in distributed networks. The four proposed variants are then compared with each other and with a traditional "non-robust" path finding algorithm. The simulation results show interesting improvement in solution quality when robustness is incorporated into the path finding algorithm for distributed networks.