Skip to main navigation Skip to search Skip to main content

A low cost method for determining the entire network path bandwidths of indirect high-performance computer networks

  • Beihang University
  • IAPCM

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Bandwidth is an important performance metric for high-performance computer network (HINET). How to determine large-scale HINET path bandwidths quickly and precisely is a highly pivotal challenge for parallel application performance analysis and prediction, optimizing end-to-end data transport performance, network management, etc. However, it is hard to determine the entire network point-to-point bandwidths of HINET since it often costs amounts of measurement time. Existing path bandwidth measurement methods focus on improving the accuracy of single path bandwidth measurement, however, lack considerations for reducing the entire network path bandwidths measurement times. To address this issue, we present an efficient method to generate the full-scale point-to-point bandwidth measurement plan for rapidly obtaining each path bandwidth in HINET. For evaluating, a source routing Fat-tree simulator and comprehensive experiments were conducted for different application scenarios. Both experimental and analysis showed that our method can reduce the measurement times significantly. In particular, compared to the exhaustive method, the measurement times of our method are one in 185 for the entire path bandwidth fault and can save 95% measurement times in 1024 nodes network with synthetic traffic.

Original languageEnglish
Title of host publicationProceedings - 16th IEEE International Symposium on Parallel and Distributed Processing with Applications, 17th IEEE International Conference on Ubiquitous Computing and Communications, 8th IEEE International Conference on Big Data and Cloud Computing, 11th IEEE International Conference on Social Computing and Networking and 8th IEEE International Conference on Sustainable Computing and Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018
EditorsJinjun Chen, Laurence T. Yang
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages15-22
Number of pages8
ISBN (Electronic)9781728111414
DOIs
StatePublished - 2 Jul 2018
Event16th IEEE International Symposium on Parallel and Distributed Processing with Applications, 17th IEEE International Conference on Ubiquitous Computing and Communications, 8th IEEE International Conference on Big Data and Cloud Computing, 11th IEEE International Conference on Social Computing and Networking and 8th IEEE International Conference on Sustainable Computing and Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018 - Melbourne, Australia
Duration: 11 Dec 201813 Dec 2018

Publication series

NameProceedings - 16th IEEE International Symposium on Parallel and Distributed Processing with Applications, 17th IEEE International Conference on Ubiquitous Computing and Communications, 8th IEEE International Conference on Big Data and Cloud Computing, 11th IEEE International Conference on Social Computing and Networking and 8th IEEE International Conference on Sustainable Computing and Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018

Conference

Conference16th IEEE International Symposium on Parallel and Distributed Processing with Applications, 17th IEEE International Conference on Ubiquitous Computing and Communications, 8th IEEE International Conference on Big Data and Cloud Computing, 11th IEEE International Conference on Social Computing and Networking and 8th IEEE International Conference on Sustainable Computing and Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018
Country/TerritoryAustralia
CityMelbourne
Period11/12/1813/12/18

Keywords

  • Entire network paths
  • HINET
  • Path bandwidth determination

Fingerprint

Dive into the research topics of 'A low cost method for determining the entire network path bandwidths of indirect high-performance computer networks'. Together they form a unique fingerprint.

Cite this