{"title":"基于平均链路负载信息的多域光子网络动态路由算法","authors":"K. Shimada, S. Araki, H. Hasegawa, Ken-ichi Sato","doi":"10.1364/ACP.2009.FG3","DOIUrl":null,"url":null,"abstract":"We propose an inter-domain path routing algorithm for multi-domain photonic networks. The proposed algorithm introduces a step-wise weighting technique and utilizes averaged link load information of each domain and that of a link set between each adjacent domain pair. Numerical experiments demonstrate that the proposed algorithm outperforms a conventional method in terms of blocking probability and matches that achieved without domain segmentation.","PeriodicalId":366119,"journal":{"name":"2009 Asia Communications and Photonics conference and Exhibition (ACP)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dynamic routing algorithm for multi-domain photonic networks using averaged link load information\",\"authors\":\"K. Shimada, S. Araki, H. Hasegawa, Ken-ichi Sato\",\"doi\":\"10.1364/ACP.2009.FG3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an inter-domain path routing algorithm for multi-domain photonic networks. The proposed algorithm introduces a step-wise weighting technique and utilizes averaged link load information of each domain and that of a link set between each adjacent domain pair. Numerical experiments demonstrate that the proposed algorithm outperforms a conventional method in terms of blocking probability and matches that achieved without domain segmentation.\",\"PeriodicalId\":366119,\"journal\":{\"name\":\"2009 Asia Communications and Photonics conference and Exhibition (ACP)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.FG3\",\"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.FG3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A dynamic routing algorithm for multi-domain photonic networks using averaged link load information
We propose an inter-domain path routing algorithm for multi-domain photonic networks. The proposed algorithm introduces a step-wise weighting technique and utilizes averaged link load information of each domain and that of a link set between each adjacent domain pair. Numerical experiments demonstrate that the proposed algorithm outperforms a conventional method in terms of blocking probability and matches that achieved without domain segmentation.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
