一种多径传输转发迁移算法

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI:10.1109/ISPA.2009.58

L. Han, Jinkuan Wang, Jianhua Tang, P. He

{"title":"一种多径传输转发迁移算法","authors":"L. Han, Jinkuan Wang, Jianhua Tang, P. He","doi":"10.1109/ISPA.2009.58","DOIUrl":null,"url":null,"abstract":"According to the new features of traffic distribution, a novel forwarding migration algorithm (FMA) is proposed. Programmable routers (PR) are used in FMA. One PR sets FMA bit for unbalanced traffic. Another PR forwards related traffic to the FMA link rather than to wait for matching the longest address prefix. Theoretic analysis shows that FMA can reduce the forwarding burden of core router. Simulation proves that FMA obtains a lower transmission delay and packet loss rate.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Forwarding Migration Algorithm for Multipath Transmission\",\"authors\":\"L. Han, Jinkuan Wang, Jianhua Tang, P. He\",\"doi\":\"10.1109/ISPA.2009.58\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"According to the new features of traffic distribution, a novel forwarding migration algorithm (FMA) is proposed. Programmable routers (PR) are used in FMA. One PR sets FMA bit for unbalanced traffic. Another PR forwards related traffic to the FMA link rather than to wait for matching the longest address prefix. Theoretic analysis shows that FMA can reduce the forwarding burden of core router. Simulation proves that FMA obtains a lower transmission delay and packet loss rate.\",\"PeriodicalId\":346815,\"journal\":{\"name\":\"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPA.2009.58\",\"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 IEEE International Symposium on Parallel and Distributed Processing with Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2009.58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

根据流量分布的新特点，提出了一种新的转发迁移算法(FMA)。可编程路由器(PR)用于FMA。一个PR为不平衡流量设置FMA位。另一个PR将相关流量转发到FMA链路，而不是等待匹配最长的地址前缀。理论分析表明，FMA可以减轻核心路由器的转发负担。仿真结果表明，该算法具有较低的传输时延和丢包率。

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

查看原文本刊更多论文

A Forwarding Migration Algorithm for Multipath Transmission

According to the new features of traffic distribution, a novel forwarding migration algorithm (FMA) is proposed. Programmable routers (PR) are used in FMA. One PR sets FMA bit for unbalanced traffic. Another PR forwards related traffic to the FMA link rather than to wait for matching the longest address prefix. Theoretic analysis shows that FMA can reduce the forwarding burden of core router. Simulation proves that FMA obtains a lower transmission delay and packet loss rate.

求助全文

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

来源期刊

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications

自引率

0.00%

发文量