A Passive Solution to the CPU Resource Discovery Problem in Cluster Grid Networks

We present the details of a novel method for passive resource discovery in cluster grid environments, where resources constantly utilize internode communication. Our method offers the ability to nonintrusively identify resources that have available CPU cycles; this is critical for lowering queue wait times in large cluster grid networks. The benefits include: 1) low message complexity, which facilitates low latency in distributed networks, 2) scalability, which provides support for very large networks, and 3) low maintainability, since no additional software is needed on compute resources. Using a 50-node (multicore) test bed (DETERlab), we demonstrate the feasibility of our method with experiments utilizing TCP, UDP, and ICMP network traffic. We use a simple but powerful technique that monitors the frequency of network packets emitted from the Network Interface Card (NIC) of local resources. We observed the correlation between CPU load and the timely response of network traffic. A highly utilized CPU will have numerous, active processes which require context switching. The latency associated with numerous context switches manifests as a delay signature within the packet transmission process. Our method detects that delay signature to determine the utilization of network resources. Results show that our method can consistently and accurately identify nodes with available CPU cycles (<;70 percent CPU utilization) through analysis of existing network traffic, including network traffic that has passed through a switch (noncongested). Also, in situations where there is no existing network traffic for nodes, ICMP ping replies can be used to ascertain this resource information.

[1]  C. Corbett,et al.  Passive Identification of Under-Utilized CPUs in High Performance Cluster Grid Networks , 2008, 2008 IEEE International Conference on Communications.

[2]  Raheem A. Beyah,et al.  Passive Classification of Wireless NICs during Rate Switching , 2008, EURASIP J. Wirel. Commun. Netw..

[3]  Mor Harchol-Balter,et al.  Resource discovery in distributed networks , 1999, PODC '99.

[4]  Fouad A. Tobagi,et al.  Network Topology Design to Optimize Link and Switching Costs , 2007, 2007 IEEE International Conference on Communications.

[5]  K. Siu,et al.  XXXXXXXXXX An O ( log n ) Randomized Resource Discovery Algorithm , 2000 .

[6]  J.A. Copeland,et al.  Using Active Scanning to Identify Wireless NICs , 2006, 2006 IEEE Information Assurance Workshop.

[7]  Georg Carle,et al.  Traffic Anomaly Detection Using K-Means Clustering , 2007 .

[8]  Kan Li,et al.  A Multi-Level Super Peer Based P2P Architecture , 2008, 2008 International Conference on Information Networking.

[9]  Vassilios V. Dimakopoulos,et al.  On the Performance of Flooding-Based Resource Discovery , 2006, IEEE Transactions on Parallel and Distributed Systems.

[10]  Raheem A. Beyah,et al.  A Passive Approach to Rogue Access Point Detection , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[11]  Raheem A. Beyah,et al.  Using network traffic to passively detect under utilized resources in high performance cluster grid computing environments , 2007, GridNets '07.

[12]  Volker Strumpen,et al.  Exploiting communication latency hiding for parallel network computing: model and analysis , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.