| Abstract: | In this study we consider flooding, a fundamental mechanism for network discovery and query routing, in unstructured peer-to-peer networks. Flooding has well-known properties such as fast responses and quick network coverage but at the same time it suffers from high overheads due to unnecessarily generated traffic (duplicate messages). Although there has been a significant amount of research on strategies that try to moderate this drawback, there has been no work that aims at quantifying it. This is the subject of this paper; we analyse the behaviour of flooding related to duplicate messages and provide simple bounds and approximate models to assess the associated overheads. |
