• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2014, Vol. 36 ›› Issue (12): 2272-2279.

• 论文 • Previous Articles     Next Articles

Network calculus for fattree network           

Qin Guangjun,ZHU Mingfa,XIAO Limin,RUAN Li   

  1.   (1.State Key Laboratory of Software Development Environment,Beihang University,Beijing 100191;
    2.School of Computer Science and Engineering,Beihang University,Beijing 100191,China)
  • Received:2014-08-30 Revised:2014-11-01 Online:2014-12-25 Published:2014-12-25

Abstract:

 Network calculus is one of the most important performance analysis tools in the network research area. The classical network calculus is mainly focused on the QoS, and the maximum backlog, the maximum network delay and the service curve are the significant analyzing metrics. However, the researchers in the highperformance computing systems are more concerned about the throughput, the communication latency, the network saturation point, etc., which cannot be inferred from the classical network calculus. The queuing theory is introduced into the network calculus, the communication latency and the throughput formulas are derived, and a network calculus analysis method for highperformance network calculus is proposed. Based on the analysis method, the uniform traffic pattern of the fattree network is analyzed. The analysis results indicate that the method can efficiently describe the network communication process and capture the saturation point, and basically be consistent with simulated results.

Key words: fat-tree network;network calculus;communication latency;throughput;traffic patterns