多链路速度网络拓扑设计

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200550

Pao-Chi Chang, P. Kermani, A. Kershenbaum

{"title":"多链路速度网络拓扑设计","authors":"Pao-Chi Chang, P. Kermani, A. Kershenbaum","doi":"10.1109/PCCC.1992.200550","DOIUrl":null,"url":null,"abstract":"The authors consider the problem of selecting a link topology and sizing the link given a point-to-point traffic matrix and a cost matrix. Different speed links are permitted in the topology. An algorithm is presented for the solution to this problem, and its performance, both in terms of running time and the quality of the networks produced, is compared with that of an algorithm which only considers a single speed link. The new algorithm shows significant improvement, reducing cost by as much as 6% while increasing running time by only a constant factor.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Multi-link-speed network topology design\",\"authors\":\"Pao-Chi Chang, P. Kermani, A. Kershenbaum\",\"doi\":\"10.1109/PCCC.1992.200550\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors consider the problem of selecting a link topology and sizing the link given a point-to-point traffic matrix and a cost matrix. Different speed links are permitted in the topology. An algorithm is presented for the solution to this problem, and its performance, both in terms of running time and the quality of the networks produced, is compared with that of an algorithm which only considers a single speed link. The new algorithm shows significant improvement, reducing cost by as much as 6% while increasing running time by only a constant factor.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200550\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在给定点到点流量矩阵和代价矩阵的情况下，考虑了链路拓扑选择和链路大小的问题。该拓扑允许不同速度的链路。提出了一种解决该问题的算法，并将其性能与仅考虑单个速度链路的算法在运行时间和生成的网络质量方面进行了比较。新算法显示出显著的改进，降低了高达6%的成本，而运行时间仅增加了一个常数因子。

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

查看原文本刊更多论文

Multi-link-speed network topology design

The authors consider the problem of selecting a link topology and sizing the link given a point-to-point traffic matrix and a cost matrix. Different speed links are permitted in the topology. An algorithm is presented for the solution to this problem, and its performance, both in terms of running time and the quality of the networks produced, is compared with that of an algorithm which only considers a single speed link. The new algorithm shows significant improvement, reducing cost by as much as 6% while increasing running time by only a constant factor.<>

求助全文

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

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量