Distributed Dual Ascent Algorithm for Steiner Problems in Networks

Abstract. Steiner Problems in undirected or directed graphs are often used tomodel multicast routing problems. The directed case being particularly suitableto situations where most of the trafic has a single source. Sequential Steinerheuristics are not convenient in that context, since one can not assume that acentral node has complete information about the topology and the state of alarge wide area network. This work presents a distributed version of the DualAscent Heuristic proposed by Wong, known for its remarkable good practicalresults, lower and upper bounds, in both undirected and directed Steiner prob-lems. The distributed Dual Ascent has worst case complexities of O ( |V| 2 ) timeand O ( |T|.|V| 2 ) messages. Experimental results are also presented, showingthe eficiency of the proposed algorithm. 1. Introduction Several emerging network applications, like teleconferencing or video on demand, requirethe transmission of large amounts of data among a small subset of the nodes. This is called

[1]  Anujan Varma,et al.  Distributed algorithms for multicast path setup in data networks , 1996, TNET.

[2]  Gorazd Kandus,et al.  Steiner Tree Based Distributed Multicast Routing in Networks , 2001 .

[3]  Renato F. Werneck,et al.  On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs , 2002, ALENEX.

[4]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[5]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[6]  Gurdip Singh,et al.  A Distributed Protocol for Constructing Multicast Trees , 1998, OPODIS.

[7]  Stefan Voß,et al.  Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

[8]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[9]  Gen-Huey Chen,et al.  The steiner problem in distributed computing systems , 1993, Inf. Sci..

[10]  Renato F. Werneck,et al.  Dual Heuristics on the Exact Solution of Large Steiner Problems , 2001, Electron. Notes Discret. Math..

[11]  Gorazd Kandus,et al.  A note on distributed multicast routing in point-to-point networks , 2001, Comput. Oper. Res..

[12]  Siavash Vahdati Daneshmand,et al.  Improved algorithms for the Steiner problem in networks , 2001, Discret. Appl. Math..

[13]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[14]  T. Koch,et al.  SteinLib: An Updated Library on Steiner Tree Problems in Graphs , 2001 .

[15]  Panos M. Pardalos,et al.  A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..

[16]  Joze Rugelj,et al.  Distributed multicast routing in point-to-point networks , 1997, Comput. Oper. Res..

[17]  Abhishek P. Patil,et al.  Resource Allocation Using Multiple Edge-Sharing Multicast Trees , 2008, IEEE Transactions on Vehicular Technology.