Xiaomin Chen, M. Chamania, A. Jukan, A. Drummond, N. Fonseca
{"title":"多路径路由对高带宽要求和多域到达的分布式数据密集型应用的好处","authors":"Xiaomin Chen, M. Chamania, A. Jukan, A. Drummond, N. Fonseca","doi":"10.1109/CNSR.2009.26","DOIUrl":null,"url":null,"abstract":"We investigate and quantify the benefits of multipath routing in a wide-area distributed environment which includes inter-domain routing issues. In this context, we discuss two possible multipath routing schemes and focus on the viable solution for distributed data-intensive applications with high bandwidth and delay requirements. The network topology aggregation is extended for end-to-end multipath computation. An ILP-based algorithm and a heuristic algorithm are proposed with multiple constraints, including bandwidth, delay and memory size. Numerical and simulation results show that the proposed multipath routing algorithms are feasible, and especially well-suited for emerging applications with extremely high bandwidth requirements.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"On the Benefits of Multipath Routing for Distributed Data-Intensive Applications with High Bandwidth Requirements and Multidomain Reach\",\"authors\":\"Xiaomin Chen, M. Chamania, A. Jukan, A. Drummond, N. Fonseca\",\"doi\":\"10.1109/CNSR.2009.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate and quantify the benefits of multipath routing in a wide-area distributed environment which includes inter-domain routing issues. In this context, we discuss two possible multipath routing schemes and focus on the viable solution for distributed data-intensive applications with high bandwidth and delay requirements. The network topology aggregation is extended for end-to-end multipath computation. An ILP-based algorithm and a heuristic algorithm are proposed with multiple constraints, including bandwidth, delay and memory size. Numerical and simulation results show that the proposed multipath routing algorithms are feasible, and especially well-suited for emerging applications with extremely high bandwidth requirements.\",\"PeriodicalId\":103090,\"journal\":{\"name\":\"2009 Seventh Annual Communication Networks and Services Research Conference\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Seventh Annual Communication Networks and Services Research Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNSR.2009.26\",\"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 Seventh Annual Communication Networks and Services Research Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2009.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Benefits of Multipath Routing for Distributed Data-Intensive Applications with High Bandwidth Requirements and Multidomain Reach
We investigate and quantify the benefits of multipath routing in a wide-area distributed environment which includes inter-domain routing issues. In this context, we discuss two possible multipath routing schemes and focus on the viable solution for distributed data-intensive applications with high bandwidth and delay requirements. The network topology aggregation is extended for end-to-end multipath computation. An ILP-based algorithm and a heuristic algorithm are proposed with multiple constraints, including bandwidth, delay and memory size. Numerical and simulation results show that the proposed multipath routing algorithms are feasible, and especially well-suited for emerging applications with extremely high bandwidth requirements.