面向体积的路由

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI:10.1109/NETWKS.2010.5624920

M. Żotkiewicz, W. Ben-Ameur

{"title":"面向体积的路由","authors":"M. Żotkiewicz, W. Ben-Ameur","doi":"10.1109/NETWKS.2010.5624920","DOIUrl":null,"url":null,"abstract":"Assuming that the traffic matrix belongs to a polytope, we present a new routing paradigm where each traffic demand is routed independently of the other demands. The routing of each demand is a combination of two extreme routing depending on the current volume of the demand. This new routing paradigm is easy to implement in networks and quite efficient in terms of network cost.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Volume oriented routing\",\"authors\":\"M. Żotkiewicz, W. Ben-Ameur\",\"doi\":\"10.1109/NETWKS.2010.5624920\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Assuming that the traffic matrix belongs to a polytope, we present a new routing paradigm where each traffic demand is routed independently of the other demands. The routing of each demand is a combination of two extreme routing depending on the current volume of the demand. This new routing paradigm is easy to implement in networks and quite efficient in terms of network cost.\",\"PeriodicalId\":202408,\"journal\":{\"name\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETWKS.2010.5624920\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2010.5624920","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

假设流量矩阵属于多面体，我们提出了一种新的路由模式，其中每个流量需求都独立于其他需求进行路由。每个需求的路由是两个极端路由的组合，这取决于当前的需求量。这种新的路由范例易于在网络中实现，并且在网络成本方面非常有效。

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

查看原文本刊更多论文

Volume oriented routing

Assuming that the traffic matrix belongs to a polytope, we present a new routing paradigm where each traffic demand is routed independently of the other demands. The routing of each demand is a combination of two extreme routing depending on the current volume of the demand. This new routing paradigm is easy to implement in networks and quite efficient in terms of network cost.

求助全文

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

来源期刊

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)

自引率

0.00%

发文量