数据路径服务网络的分布式路由算法

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI:10.1109/ICCCN.2008.ECP.32

Xin Huang, S. Ganapathy, T. Wolf

{"title":"数据路径服务网络的分布式路由算法","authors":"Xin Huang, S. Ganapathy, T. Wolf","doi":"10.1109/ICCCN.2008.ECP.32","DOIUrl":null,"url":null,"abstract":"Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such \"services\" are typically performed on some nodes along the path of a packet. We present a novel decentralized algorithm that can determine an allocation of services to network nodes. The algorithm can obtain globally optimal solutions for a single service and approximate solutions for two or more services. In our simulation results, we validate the correctness of the algorithm, quantify the quality of the approximations, and compare the results to those of a centralized algorithm. Our results show that the proposed algorithm presents an effective solution to the service placement problem that can be implemented in a realistic network.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Distributed Routing Algorithm for Networks with Data-Path Services\",\"authors\":\"Xin Huang, S. Ganapathy, T. Wolf\",\"doi\":\"10.1109/ICCCN.2008.ECP.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such \\\"services\\\" are typically performed on some nodes along the path of a packet. We present a novel decentralized algorithm that can determine an allocation of services to network nodes. The algorithm can obtain globally optimal solutions for a single service and approximate solutions for two or more services. In our simulation results, we validate the correctness of the algorithm, quantify the quality of the approximations, and compare the results to those of a centralized algorithm. Our results show that the proposed algorithm presents an effective solution to the service placement problem that can be implemented in a realistic network.\",\"PeriodicalId\":314071,\"journal\":{\"name\":\"2008 Proceedings of 17th International Conference on Computer Communications and Networks\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Proceedings of 17th International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2008.ECP.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2008.ECP.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

许多下一代互联网架构在网络的数据路径中提出了先进的分组处理功能。这种“服务”通常在数据包路径上的某些节点上执行。我们提出了一种新的去中心化算法，可以确定网络节点的服务分配。该算法可以得到单个业务的全局最优解和两个或多个业务的近似解。在我们的仿真结果中，我们验证了算法的正确性，量化了近似的质量，并将结果与集中式算法的结果进行了比较。结果表明，该算法有效地解决了实际网络中的服务布局问题。

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

查看原文本刊更多论文

A Distributed Routing Algorithm for Networks with Data-Path Services

Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such "services" are typically performed on some nodes along the path of a packet. We present a novel decentralized algorithm that can determine an allocation of services to network nodes. The algorithm can obtain globally optimal solutions for a single service and approximate solutions for two or more services. In our simulation results, we validate the correctness of the algorithm, quantify the quality of the approximations, and compare the results to those of a centralized algorithm. Our results show that the proposed algorithm presents an effective solution to the service placement problem that can be implemented in a realistic network.

求助全文

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

来源期刊

2008 Proceedings of 17th International Conference on Computer Communications and Networks

自引率

0.00%

发文量