Wavelength assignment for satisfying maximal number of requests in all-optical networks
Hu, XD; Shuai, TP
刊名ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS
2005
卷号3521页码:320-329
ISSN号0302-9743
英文摘要In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maximal size such that no wavelength constraint on links is violated. While all previous studies on the wavelength assignment problem with the same objective assume the same set of wavelengths available on all links, our work does not make such an assumption. We first prove that this problem is NP-hard even in bus networks, and then propose some approximation algorithms for the problem with guaranteed performance ratios in networks with some special and general topologies.
WOS研究方向Computer Science
语种英语
出版者SPRINGER-VERLAG BERLIN
WOS记录号WOS:000230475100035
内容类型期刊论文
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/2183]  
专题应用数学研究所
通讯作者Hu, XD
作者单位Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Hu, XD,Shuai, TP. Wavelength assignment for satisfying maximal number of requests in all-optical networks[J]. ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS,2005,3521:320-329.
APA Hu, XD,&Shuai, TP.(2005).Wavelength assignment for satisfying maximal number of requests in all-optical networks.ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS,3521,320-329.
MLA Hu, XD,et al."Wavelength assignment for satisfying maximal number of requests in all-optical networks".ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS 3521(2005):320-329.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace