Multi-Objective Optimization Multicast Routing for Forwarding State Scalability
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [10]
  • |
  • Related [20]
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    The approach is to include forwarding state scalability as one of the optimal objective when constructing new multicast trees. This multi-objective optimization approach can be applied to many existing multicast state reduction methods. In this paper, the approach is illustrated by applying it to aggregated multicast (AM) and dynamic tunnel multicast (DTM). Both AM and DTM routing problems are formulated as multi- objective optimization problems, and both heuristic and genetic algorithms are proposed for solving them. Based on the experimental results, the approach can further improve the forwarding state scalability of both approaches by reducing the number of aggregated trees required by the AM method, and by increasing the number of non-branching nodes for the DTM method.

    Reference
    [1]Tian JN,Neufeld G.Forwarding state reduction for sparse mode multicast communication.In:Proc.of the IEEE INFOCOM.1998.
    [2]Stoica I,Eugene Ng T,Zhang H.Reunite:A recursive unicast approach to multicast.In:Proc.of the IEEE INFOCOM.2000.
    [3]Thaler D,Handley M.On the aggregatability of multicast forwarding state.In:Proc.of the IEEE INFOCOM.2000.
    [4]Boudani A,Cousin B.A new approach to construct multicast trees in MPLS networks.In:Proc.of the IEEE ISCC.2002.
    [5]Radoslavov PI,Govindan R,Estrin D.Exploiting the bandwidth-memory tradeoff in multicast state aggregation.Technical Report,USC,1999.99-697.
    [6]Cui JH,Maggiorini D,Kim JY,Boussetta K,Gerla M.A protocol to improve the state scalability of source specific multicast.In:Proc.of the IEEE Globecom.2002.
    [7]Eppstein D.Finding the k shortest paths.SIAM Journal on Computing,1999,28(2):652-673.
    [8]Garey T,Johnson D.Computers and Intractability-A Guide to the Theory of NP-Completeness.New York:Freeman,1979.
    [9]Deb K,Pratap A,Agarwal S,Meyarivan T.A fast and elitist multi-objective genetic algorithm:NSGA-II.IEEE Trans.on Computation,2002,6(2):182-197.
    [10]Waxman BM.Routing of multipoint connections.IEEE Journal Selected Areas in Communications,1988,6(9):1617-1622.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

胡光岷,CHANG Rocky.可扩展的多目标最优化多播路由.软件学报,2008,19(6):1546-1554

Copy
Share
Article Metrics
  • Abstract:4123
  • PDF: 5357
  • HTML: 0
  • Cited by: 0
History
  • Received:October 03,2004
  • Revised:April 27,2006
You are the first2032800Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063