IMI/Publicaţii/CSJM/Ediţii/CSJM v.19, n.3 (57), 2011/

A √(N/G) Method for Generating Communication Sets

Authors: Rupali Bhardwaj, V. S. Dixit, Anil Kr. Upadhyay
Keywords: Quorum; Coterie; Communication sets; Network traffic


In the fully meshed network, where every node is connected directly to every other node, network traffic is very high because in the fully meshed network, number of communication links is (N*(N-1))/2 and communication cost is 2 X N X (N-1), where N is total number of nodes in the network. To minimize network traffic, we propose an algorithm for generation of communication sets that allows any two nodes to communicate by traversing at most two nodes regardless of the network size by dividing the nodes in the system into subgroups of size G where G ≥ 1, which are then organized into quorum groups of size k1 = (√(N/G)aprox.) in a method similar to that used in Maekawa's algorithm except that now quorum groups are constructed out of subgroups instead of nodes. The performance analysis of the proposed partitioning algorithm shows that it significantly reduces network traffic as well as total number of communication links required for a node to communicate with other nodes in the system.

Rupali Bhardwaj
Institution: Krishna Institute of Engineering and Technology, Mahamaya Technical University, Noida, India Address: Department of MCA, KIET, Ghaziabad, India

Dr. V.S.Dixit
Institution: Atmaram Sanatan Dharmshala, Delhi University,Delhi,India
Address: Department of CS, ARSD College, Delhi University, Delhi, India

Anil Upadhyay
Institution: Mata Rajkaur Institute of Engineering and Technology, Mahrishi Dayanand University, Rohtak, Haryana, India
Address: Department of Applied Science, MRKIET, Rewari, India


Adobe PDF document0.21 Mb