Abstract: Gossip-based protocols for group communication have attractive scalability and reliability properties. The gossip schemes studied so far typically assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. In this study, we present a design of a routing algorithm that has the properties of gossip style of disseminating link state updates with the intention of making it faster than the current algorithms.