基于彩色多图模型的WDM网络路由与波长分配算法

2009 Asia Communications and Photonics conference and Exhibition (ACP) Pub Date : 2010-02-02 DOI:10.1364/acp.2009.wl75

Qiwu Wu, Jianping Wang, Xianwei Zhou, Ling-zhi Jiang, YuHong Deng

{"title":"基于彩色多图模型的WDM网络路由与波长分配算法","authors":"Qiwu Wu, Jianping Wang, Xianwei Zhou, Ling-zhi Jiang, YuHong Deng","doi":"10.1364/acp.2009.wl75","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a polynomial time algorithm with complexity O(N2) is also proposed to develop an integrated dynamic routing and wavelength assignment, where N is the number of nodes in a WDM network.","PeriodicalId":366119,"journal":{"name":"2009 Asia Communications and Photonics conference and Exhibition (ACP)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A novel routing and wavelength assignment algorithm based on colored multigraph model in WDM networks\",\"authors\":\"Qiwu Wu, Jianping Wang, Xianwei Zhou, Ling-zhi Jiang, YuHong Deng\",\"doi\":\"10.1364/acp.2009.wl75\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a polynomial time algorithm with complexity O(N2) is also proposed to develop an integrated dynamic routing and wavelength assignment, where N is the number of nodes in a WDM network.\",\"PeriodicalId\":366119,\"journal\":{\"name\":\"2009 Asia Communications and Photonics conference and Exhibition (ACP)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Asia Communications and Photonics conference and Exhibition (ACP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1364/acp.2009.wl75\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Asia Communications and Photonics conference and Exhibition (ACP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/acp.2009.wl75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文提出了暂时可用波长的彩色多图模型。在此彩色多图模型的基础上，提出了复杂度为O(N2)的多项式时间算法，实现了WDM网络的动态路由和波长分配的集成，其中N为WDM网络的节点数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A novel routing and wavelength assignment algorithm based on colored multigraph model in WDM networks

In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a polynomial time algorithm with complexity O(N2) is also proposed to develop an integrated dynamic routing and wavelength assignment, where N is the number of nodes in a WDM network.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 Asia Communications and Photonics conference and Exhibition (ACP)

自引率

0.00%

发文量