Radius Restrained Distributed Breadth First Search Flooding in Large-Scale Multimedia Communication

This paper proposed an algorithm of radius restrained distributed breadth first search flooding for call routing in multimedia communication. By knowing the information of neighbor nodes in finite scope, this algorithm does breadth first search and selects the least number of next forwarding neighbor nodes to reduce redundant information in broadcasting routing information. Simulation results demonstrate that the proposed algorithm lessens the average forwarding times and shortens the delay in transferring routing information. Especially, it can decrease the redundant information to the greatest extent in large scale multimedia communication.