一种高效的虚拟路径带宽分配优化算法

17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003. Pub Date : 2003-03-27 DOI:10.1109/AINA.2003.1192926

Maosong Luo, Wu Ye, Shengye Huang, Suili Feng, Zhaonan Li

{"title":"一种高效的虚拟路径带宽分配优化算法","authors":"Maosong Luo, Wu Ye, Shengye Huang, Suili Feng, Zhaonan Li","doi":"10.1109/AINA.2003.1192926","DOIUrl":null,"url":null,"abstract":"This article presents an efficient optimal algorithm for virtual path (VP) bandwidth allocation in telecommunication networks. Given the network topology, link capacity, routes of VP offered traffic and the condition that only one shortest VP could be chosen for each source-destination pair (single-VP), the algorithm is able to optimize the allocation of the bandwidth of VP in order to minimize the highest call blocking probability (CBP) of all the source-destination pairs. Based on the results obtained from the test-bed networks, we compare the performance of the algorithm with that of another classical optimal algorithm - \"bisection algorithm\" - and conclude that the former is more efficient under the condition of single-VP.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"35 37","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient optimal algorithm for virtual path bandwidth allocation\",\"authors\":\"Maosong Luo, Wu Ye, Shengye Huang, Suili Feng, Zhaonan Li\",\"doi\":\"10.1109/AINA.2003.1192926\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article presents an efficient optimal algorithm for virtual path (VP) bandwidth allocation in telecommunication networks. Given the network topology, link capacity, routes of VP offered traffic and the condition that only one shortest VP could be chosen for each source-destination pair (single-VP), the algorithm is able to optimize the allocation of the bandwidth of VP in order to minimize the highest call blocking probability (CBP) of all the source-destination pairs. Based on the results obtained from the test-bed networks, we compare the performance of the algorithm with that of another classical optimal algorithm - \\\"bisection algorithm\\\" - and conclude that the former is more efficient under the condition of single-VP.\",\"PeriodicalId\":382765,\"journal\":{\"name\":\"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.\",\"volume\":\"35 37\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2003.1192926\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2003.1192926","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种有效的电信网络虚拟路径(VP)带宽分配优化算法。在给定网络拓扑结构、链路容量、VP提供流量的路由以及每个源-目的对只能选择一个最短的VP (single-VP)的条件下，该算法能够优化VP的带宽分配，使所有源-目的对的最高呼叫阻塞概率(CBP)最小化。基于测试网络的结果，我们将该算法与另一种经典优化算法“二分法”的性能进行了比较，得出了二分法在单vp条件下效率更高的结论。

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

查看原文本刊更多论文

An efficient optimal algorithm for virtual path bandwidth allocation

This article presents an efficient optimal algorithm for virtual path (VP) bandwidth allocation in telecommunication networks. Given the network topology, link capacity, routes of VP offered traffic and the condition that only one shortest VP could be chosen for each source-destination pair (single-VP), the algorithm is able to optimize the allocation of the bandwidth of VP in order to minimize the highest call blocking probability (CBP) of all the source-destination pairs. Based on the results obtained from the test-bed networks, we compare the performance of the algorithm with that of another classical optimal algorithm - "bisection algorithm" - and conclude that the former is more efficient under the condition of single-VP.

求助全文

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

来源期刊

17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.

自引率

0.00%

发文量