Reduce Network Traffic Cost by Merging Maintenance Messages in Single-hop Routing Mechanisms

摘要

In performance sensitive networks, Single-hop routing mechanisms demonstrate lower lookup latencies and failure rates for Peer-to-Peer (P2P) applications than multi-hop ones. However, each node in single-hop routing mechanisms has to maintain a big routing table, making it unsuitable for large networks due to the upsurge of the traffic maintenance with inflation of network scale. To fill this gap, this paper proposes a message-merging mechanism to reduce the maintenance consumption from the implementation aspect. This paper studies the messages dissemination structure and introduces a traffic reduction schema by merging the same route messages into one, which reduces a lot of message maintenance consumption. Furthermore, the approach is evaluated in the simulation and the result shows good experimental performance.