基于域边界间最大流量信息的多域光子网络动态路由算法

Digest of the 9th International Conference on Optical Internet (COIN 2010) Pub Date : 2010-07-11 DOI:10.1109/COIN.2010.5546684

K. Shimada, S. Araki, H. Hasegawa, Ken-ichi Sato

{"title":"基于域边界间最大流量信息的多域光子网络动态路由算法","authors":"K. Shimada, S. Araki, H. Hasegawa, Ken-ichi Sato","doi":"10.1109/COIN.2010.5546684","DOIUrl":null,"url":null,"abstract":"We propose an inter-domain path routing algorithm for multi-domain photonic networks that uses inexact traffic information of each domain. Proposed method almost matches the blocking probability of a method that utilizes all existing path information.","PeriodicalId":388031,"journal":{"name":"Digest of the 9th International Conference on Optical Internet (COIN 2010)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A dynamic routing algorithm for multi-domain photonic networks using maximum flow information between domain boundaries\",\"authors\":\"K. Shimada, S. Araki, H. Hasegawa, Ken-ichi Sato\",\"doi\":\"10.1109/COIN.2010.5546684\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an inter-domain path routing algorithm for multi-domain photonic networks that uses inexact traffic information of each domain. Proposed method almost matches the blocking probability of a method that utilizes all existing path information.\",\"PeriodicalId\":388031,\"journal\":{\"name\":\"Digest of the 9th International Conference on Optical Internet (COIN 2010)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Digest of the 9th International Conference on Optical Internet (COIN 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COIN.2010.5546684\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digest of the 9th International Conference on Optical Internet (COIN 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COIN.2010.5546684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

提出了一种利用各域不精确流量信息的多域光子网络域间路径路由算法。该方法的阻塞概率几乎与利用所有现有路径信息的方法相匹配。

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

查看原文本刊更多论文

A dynamic routing algorithm for multi-domain photonic networks using maximum flow information between domain boundaries

We propose an inter-domain path routing algorithm for multi-domain photonic networks that uses inexact traffic information of each domain. Proposed method almost matches the blocking probability of a method that utilizes all existing path information.

求助全文

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

来源期刊

Digest of the 9th International Conference on Optical Internet (COIN 2010)

自引率

0.00%

发文量