V. Kompella, J. Pasquale, and G. Polyzos, "Two Distibuted Algorithms for the Constrained Steiner Tree Problem", in Proceedings of the second International conference on Computer Communications and Networking (ICCCN'93), pp 343-349, 1993.  Home/Search   Document Not in Database   Summary   Related Articles

....with dense edges, it will be difficult for any node to have all the information required to do routing. For this reason a set of distributed algorithms that require a limited information kept at each node are proposed. The first distributed heuristic algorithms had been proposed by Kompella et al. [20] where they proposed two algorithms based on the centralized algorithms they had proposed in [14,15] The two algorithms had a worst case message complexity O(N ) Parsa [21] had proposed a new heuristic called distributed constrained multicast algorithm (DCMA) DCMA started first by ....

V. Kompella, J. Pasquale, and G. Polyzos, "Two Distibuted Algorithms for the Constrained Steiner Tree Problem", in Proceedings of the second International conference on Computer Communications and Networking (ICCCN'93), pp 343-349, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC