期刊文献+

多纤波分复用链网与环网中的利润极大化问题

Maximizing profits in multifiber WDM chain and ring networks
下载PDF
导出
摘要 考虑多纤波分复用链网与环网中的利润极大化问题,分别给出了多项式时间精确算法和2-近似算法.对于环上各边光纤数目相同的均匀模式,给出了1.582-近似算法.这些结果也适用于有向链网与环网. The problem of the total maximizing profits of accepted requests in multifiber WDM chain and ring networks is considered. A polynomial time exact algorithm to solve the problem for chains and a 2-approximation algorithm for rings are presented. The uniform variant in rings where all edges have the same number of fibers is also considered and a 1.582-approximation algorithm is presented. These results can also be adapted to the directed chains and rings.
出处 《山东大学学报(理学版)》 CAS CSCD 北大核心 2006年第5期7-11,共5页 Journal of Shandong University(Natural Science)
基金 国家自然科学基金资助项目(60373025) 教育部科学技术研究重点项目 天津教委科技发展基金资助项目(20051519)
关键词 近似算法 多纤光网络 波分复用 路由 路染色 approximation algorithms muhifiber optical networks WDM routing path coloring
  • 相关文献

参考文献15

  • 1P E Green.Fiber optic networks[M].New Jersey:Prentice-Hall,1993. 被引量:1
  • 2T Erlebach,A Pagourtzis,K Potika,et al.Resource allocation problems in multifiber WDM tree networks[A].Lecture Notes in Computer Science 2880:Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science[C].Heidelberg:Springer-Berlin,2003.218~229. 被引量:1
  • 3B Beauquier,J C Bermond,L Gargano,et al.Graph problems arising from wavelength-routing in all-optical networks[A].Proceedings of the 2nd Workshop on Optics and Computer Science[C].Geneva,Switzerland:IEEE Press,1997. 被引量:1
  • 4L Gargano,U Vaccaro.Routing in all-optical networks:Algorithmic and graph-theoretic problems[A].I Althofer,N Cai,G Dueck,et al,eds.Numbers,Information and Complexity[C].Amsterdam:Kluwer Academic Publishers,2000.555~578. 被引量:1
  • 5M C Carlisle,E L Lloyd.On the k-coloring of intervals[J].Discrete Applied Mathematics,1995,59:225~235. 被引量:1
  • 6P J Wan,L Liu.Maximal throughput in wavelength-routed optical networks[J].DIMACS Series in Discrete Mathematics and Theoretical Computer Science,1998,46:15~26. 被引量:1
  • 7T Erlebach,K Jansen.Maximizing the number of connections in optical tree networks[A].Lecture Notes in Computer Science 1533:Proceedings of the 9th Annual International Symposium on Algorithms and Computation[C].Heidelberg:Springer-Berlin,1998.179~188. 被引量:1
  • 8C Nomikos,A Pagourtzis,S Zachos.Minimizing request blocking in all-optical rings[A].Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies[C].San Francisco:IEEE Press,2003. 被引量:1
  • 9C H Papadimitriou,K Steiglitz.Combinatorial optimization:algorithms and complexity[M].New Jersey:Prentice-Hall,1982. 被引量:1
  • 10K Potika.Maximizing the number of connections in multifiber WDM chain,ring and star networks[A].Lecture Notes in Computer Science 3462:Proceedings of the Networking 2005[C].Heidelberg:Springer-Berlin,2005.1465~1470. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部