面向连接网络的预先带宽调度算法的评估

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008) Pub Date : 2008-05-07 DOI:10.1109/I-SPAN.2008.34

Eun-Sung Jung, Yan Li, S. Ranka, S. Sahni

{"title":"面向连接网络的预先带宽调度算法的评估","authors":"Eun-Sung Jung, Yan Li, S. Ranka, S. Sahni","doi":"10.1109/I-SPAN.2008.34","DOIUrl":null,"url":null,"abstract":"Several bandwidth management systems have been developed to reserve, in advance, dedicated connections for high-performance applications. We describe the in-advance reservation capabilities of these systems as well as the bandwidth scheduling and path computation algorithms used. An analytical and experimental evaluation of these algorithms also is provided. Our experiments indicate that for the fixed-slot problem, the minimum-hop feasible path algorithm proposed by us in [8] maximizes network utilization for large networks while the dynamic adaptive feasible path algorithm proposed in this paper does this for small networks.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks\",\"authors\":\"Eun-Sung Jung, Yan Li, S. Ranka, S. Sahni\",\"doi\":\"10.1109/I-SPAN.2008.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several bandwidth management systems have been developed to reserve, in advance, dedicated connections for high-performance applications. We describe the in-advance reservation capabilities of these systems as well as the bandwidth scheduling and path computation algorithms used. An analytical and experimental evaluation of these algorithms also is provided. Our experiments indicate that for the fixed-slot problem, the minimum-hop feasible path algorithm proposed by us in [8] maximizes network utilization for large networks while the dynamic adaptive feasible path algorithm proposed in this paper does this for small networks.\",\"PeriodicalId\":305776,\"journal\":{\"name\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I-SPAN.2008.34\",\"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 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SPAN.2008.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 23

摘要

已经开发了几个带宽管理系统，以便提前为高性能应用程序预留专用连接。我们描述了这些系统的预先预留能力以及所使用的带宽调度和路径计算算法。本文还对这些算法进行了分析和实验评价。我们的实验表明，对于固定槽问题，我们在[8]中提出的最小跳可行路径算法对于大型网络实现了网络利用率的最大化，而本文提出的动态自适应可行路径算法对于小型网络实现了网络利用率的最大化。

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

查看原文本刊更多论文

An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks

Several bandwidth management systems have been developed to reserve, in advance, dedicated connections for high-performance applications. We describe the in-advance reservation capabilities of these systems as well as the bandwidth scheduling and path computation algorithms used. An analytical and experimental evaluation of these algorithms also is provided. Our experiments indicate that for the fixed-slot problem, the minimum-hop feasible path algorithm proposed by us in [8] maximizes network utilization for large networks while the dynamic adaptive feasible path algorithm proposed in this paper does this for small networks.

求助全文

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

来源期刊

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)

自引率

0.00%

发文量