一种主动的网络带宽预留方案

1999 IEEE Second Conference on Open Architectures and Network Programming. Proceedings. OPENARCH '99 (Cat. No.99EX252) Pub Date : 1999-03-26 DOI:10.1109/OPNARC.1999.758434

D. Williams, C. Nguyen, A. Fekete, M. Hitchens, B. Kummerfeld

{"title":"一种主动的网络带宽预留方案","authors":"D. Williams, C. Nguyen, A. Fekete, M. Hitchens, B. Kummerfeld","doi":"10.1109/OPNARC.1999.758434","DOIUrl":null,"url":null,"abstract":"This paper describes a novel scheme for ensuring quality of service in a dynamically extensible active network. Applications can reserve bandwidth on each link, and the node provides the guaranteed amount by manipulating weights in a fair-sharing scheme. The reservations are represented as objects in the soft state at each node of the network. We demonstrate the versatility of this scheme by showing how to design an active protocol that seeks to reserve end-to-end bandwidth even when no single path can provide enough for its needs.","PeriodicalId":421591,"journal":{"name":"1999 IEEE Second Conference on Open Architectures and Network Programming. Proceedings. OPENARCH '99 (Cat. No.99EX252)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"An active network bandwidth reservation scheme\",\"authors\":\"D. Williams, C. Nguyen, A. Fekete, M. Hitchens, B. Kummerfeld\",\"doi\":\"10.1109/OPNARC.1999.758434\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a novel scheme for ensuring quality of service in a dynamically extensible active network. Applications can reserve bandwidth on each link, and the node provides the guaranteed amount by manipulating weights in a fair-sharing scheme. The reservations are represented as objects in the soft state at each node of the network. We demonstrate the versatility of this scheme by showing how to design an active protocol that seeks to reserve end-to-end bandwidth even when no single path can provide enough for its needs.\",\"PeriodicalId\":421591,\"journal\":{\"name\":\"1999 IEEE Second Conference on Open Architectures and Network Programming. Proceedings. OPENARCH '99 (Cat. No.99EX252)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 IEEE Second Conference on Open Architectures and Network Programming. Proceedings. OPENARCH '99 (Cat. No.99EX252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OPNARC.1999.758434\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE Second Conference on Open Architectures and Network Programming. Proceedings. OPENARCH '99 (Cat. No.99EX252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPNARC.1999.758434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

提出了一种保证动态可扩展活动网络服务质量的新方案。应用程序可以在每个链路上预留带宽，节点通过在公平共享方案中操纵权重来提供保证的带宽。保留在网络的每个节点上表示为处于软状态的对象。我们通过展示如何设计一个主动协议来展示该方案的多功能性，该协议寻求保留端到端带宽，即使没有单一路径可以提供足够的带宽。

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

查看原文本刊更多论文

An active network bandwidth reservation scheme

This paper describes a novel scheme for ensuring quality of service in a dynamically extensible active network. Applications can reserve bandwidth on each link, and the node provides the guaranteed amount by manipulating weights in a fair-sharing scheme. The reservations are represented as objects in the soft state at each node of the network. We demonstrate the versatility of this scheme by showing how to design an active protocol that seeks to reserve end-to-end bandwidth even when no single path can provide enough for its needs.

求助全文

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

来源期刊

1999 IEEE Second Conference on Open Architectures and Network Programming. Proceedings. OPENARCH '99 (Cat. No.99EX252)

自引率

0.00%

发文量