{"title":"基于流量预测的光路动态路由算法","authors":"Keita Obara, H. Hasegawa, Ken-ichi Sato","doi":"10.1117/12.803105","DOIUrl":null,"url":null,"abstract":"We propose a dynamic path allocation algorithm that considers all paths in the network simultaneously over a given time period. Numerical experiments demonstrate that the algorithm substantially reduces the blocking probability for path establishment.","PeriodicalId":179447,"journal":{"name":"SPIE/OSA/IEEE Asia Communications and Photonics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optical path dynamic routing algorithm based on traffic prediction\",\"authors\":\"Keita Obara, H. Hasegawa, Ken-ichi Sato\",\"doi\":\"10.1117/12.803105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a dynamic path allocation algorithm that considers all paths in the network simultaneously over a given time period. Numerical experiments demonstrate that the algorithm substantially reduces the blocking probability for path establishment.\",\"PeriodicalId\":179447,\"journal\":{\"name\":\"SPIE/OSA/IEEE Asia Communications and Photonics\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SPIE/OSA/IEEE Asia Communications and Photonics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.803105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SPIE/OSA/IEEE Asia Communications and Photonics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.803105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optical path dynamic routing algorithm based on traffic prediction
We propose a dynamic path allocation algorithm that considers all paths in the network simultaneously over a given time period. Numerical experiments demonstrate that the algorithm substantially reduces the blocking probability for path establishment.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
