research-article

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

Authors:

Juan Li,

Sajjad MadaniAuthors Info & Claims

FIT '10: Proceedings of the 8th International Conference on Frontiers of Information Technology

Article No.: 16, Pages 1 - 6

https://doi.org/10.1145/1943628.1943644

Published: 21 December 2010 Publication History

Get Access

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.

References

[1]

S. Ali, A. A. Maciejewski, H. J. Siegel, and J.-K. Kim. Measuring the robustness of a resource allocation. IEEE Transactions on Parallel and Distributed Systems, 15:630--641, 2004.

Digital Library

Google Scholar

[2]

S. Androutsellis-Theotokis and D. Spinellis. A survey of peer-to-peer content distribution technologies. ACM Comput. Surv., 36(4):335--371, 2004.

Digital Library

Google Scholar

[3]

D. Eppstein. Finding the k shortest paths. SIAM J. Comput., 28(2):652--673, 1999.

Digital Library

Google Scholar

[4]

C. Jin, Q. Chen, and S. Jamin. Inet: Internet topology generator, 2000.

Google Scholar

[5]

S. U. Khan, A. A. Maciejewski, and H. J. Siegel. Robust cdn replica placement techniques. In IPDPS '09: Proceedings of the 2009 IEEE International Symposium on Parallel & Distributed Processing, pages 1--8, Washington, DC, USA, 2009. IEEE Computer Society.

Digital Library

Google Scholar

[6]

L. L. Peterson and B. S. Davie. Computer Networks: A Systems Approach, 3rd Edition. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003.

Digital Library

Google Scholar

[7]

D. K. Pradhan, editor. Fault-tolerant computer system design. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1996.

Digital Library

Google Scholar

[8]

J. Risson and T. Moors. Survey of research towards robust peer-to-peer networks: search methods. Comput. Netw., 50(17):3485--3521, 2006.

Digital Library

Google Scholar

[9]

J. Smith, L. D. Briceño, A. A. Maciejewski, H. J. Siegel, T. Renner, V. Shestak, J. Ladd, A. Sutton, D. Janovy, S. Govindasamy, A. Alqudah, R. Dewri, and P. Prakash. Measuring the robustness of resource allocations in a stochastic dynamic environment. In In Proceedings of the 21 st International Parallel and Distributed Processing Symposium (IPDPS 2007, 2007.

Crossref

Google Scholar

[10]

L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer Science+Business Media, New York, NY, USA, 2005.

Digital Library

Google Scholar

Cited By

View all

Bouvry PMayer RMuszynski JPetcu DRauber ATempesti GTrinh TVarrette S(2015)Resilience within Ultrascale Computing SystemSupercomputing Frontiers and Innovations: an International Journal10.14529/jsfi1502032:2(46-63)Online publication date: 6-Apr-2015
https://dl.acm.org/doi/10.14529/jsfi150203

Index Terms

A multidimensional robust greedy algorithm for resource path finding in large-scale distributed networks
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
      2. Network flows
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows

Recommendations

A label-setting algorithm for finding a quickest path

The quickest path problem is to find a path to send a given amount of data from the source to the destination with minimum transmission time. To find the quickest path, existing algorithms enumerate nondominated paths with distinct capacity, and then ...
A path finding implementation for multi-layer networks

The goal of the OptIPuter project is to tightly couple research applications with dynamically allocated paths. Since OptIPuter is a multi-disciplinary project, the paths through the network often span multiple network domains, and the applications are ...
Approximating Shortest Path in Large-Scale Road Networks with Turn Prohibitions Using Multi-constrained Path Algorithm
CIMSIM '13: Proceedings of the 2013 Fifth International Conference on Computational Intelligence, Modelling and Simulation

Multi-Constrained Path (MCP) algorithms are path finding algorithms, unlike conventional routing algorithms, they not only give a path between source and destination, also verifies whether the path satisfies the given constraints (Right turn, Left turn ...

Comments

Information & Contributors

Information

Published In

FIT '10: Proceedings of the 8th International Conference on Frontiers of Information Technology

December 2010

281 pages

ISBN:9781450303422

DOI:10.1145/1943628

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGAI: ACM Special Interest Group on Artificial Intelligence

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 December 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

FIT '10

Sponsor:

FIT '10: 8th International Conference on Frontiers of Information Technology

December 21 - 23, 2010

Islamabad, Pakistan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
93
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bouvry PMayer RMuszynski JPetcu DRauber ATempesti GTrinh TVarrette S(2015)Resilience within Ultrascale Computing SystemSupercomputing Frontiers and Innovations: an International Journal10.14529/jsfi1502032:2(46-63)Online publication date: 6-Apr-2015
https://dl.acm.org/doi/10.14529/jsfi150203

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A label-setting algorithm for finding a quickest path

A path finding implementation for multi-layer networks

Approximating Shortest Path in Large-Scale Road Networks with Turn Prohibitions Using Multi-constrained Path Algorithm

Comments

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A label-setting algorithm for finding a quickest path

A path finding implementation for multi-layer networks

Approximating Shortest Path in Large-Scale Road Networks with Turn Prohibitions Using Multi-constrained Path Algorithm

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations