Resource reservation and packet scheduling for prioritized delay-bounded multicast

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI:10.1109/ICON.2000.875811

L. Lin, M. Liu, Lih-Chyau Wuu

{"title":"Resource reservation and packet scheduling for prioritized delay-bounded multicast","authors":"L. Lin, M. Liu, Lih-Chyau Wuu","doi":"10.1109/ICON.2000.875811","DOIUrl":null,"url":null,"abstract":"A resource reservation algorithm and a packet scheduling algorithm for the prioritized delay-bounded problem are presented. The basic notion is to employ RSVP reservation messages to establish the multicast tree and reserve bandwidth en route. Routing RSVP messages with the assistance of the priority and delay information provided by receivers is intended to optimize the resource utilization of the network. As the tree gradually builds up, the latest departure time at each node is estimated using the delay associated with the reserved bandwidth. The latest departure time is used to compute the timestamp for packets that arrives at the node, which is in turn used by the the scheduling algorithm for scheduling the packets. Fairness is achieved by monitoring the bandwidth shared after each packet is sent out, instead of tracking fairness before a packet can be served. This approach abstains from sorting the backlogged connections and hence reduces to constant scheduling time complexity.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"182 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2000.875811","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

A resource reservation algorithm and a packet scheduling algorithm for the prioritized delay-bounded problem are presented. The basic notion is to employ RSVP reservation messages to establish the multicast tree and reserve bandwidth en route. Routing RSVP messages with the assistance of the priority and delay information provided by receivers is intended to optimize the resource utilization of the network. As the tree gradually builds up, the latest departure time at each node is estimated using the delay associated with the reserved bandwidth. The latest departure time is used to compute the timestamp for packets that arrives at the node, which is in turn used by the the scheduling algorithm for scheduling the packets. Fairness is achieved by monitoring the bandwidth shared after each packet is sent out, instead of tracking fairness before a packet can be served. This approach abstains from sorting the backlogged connections and hence reduces to constant scheduling time complexity.

查看原文本刊更多论文

优先延迟边界组播的资源预留和分组调度

针对优先延迟有界问题，提出了一种资源预留算法和一种分组调度算法。其基本思想是利用RSVP预留消息建立组播树，并在路由中预留带宽。在接收方提供的优先级和延迟信息的帮助下路由RSVP消息是为了优化网络的资源利用。随着树的逐渐建立，使用与保留带宽相关的延迟估计每个节点的最新出发时间。最后出发时间用于计算到达节点的数据包的时间戳，然后调度算法使用该时间戳来调度数据包。公平性是通过监控每个数据包发送后共享的带宽来实现的，而不是在数据包可以服务之前跟踪公平性。这种方法避免了对积压的连接进行排序，从而降低了调度时间的复杂性。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium

自引率

0.00%

发文量