Exact Admission Control in Networks with Bounded Delay Services.pdf

下载文档

7
0
约5.74万字
约 28页
2017-04-13 发布于江苏
举报
版权申诉
保障服务

Exact Admission Control in Networks with Bounded Delay Services.pdf

1、本文档共28页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

Exact Admission Control in Networks with Bounded Delay Services

Exact Admission Control for Networks with Bounded Delay Services Jorg Liebeherr y Dallas E. Wrege y Domenico Ferrari yy yDepartment of Computer Science University of Virginia Charlottesville, VA 22903 yyUniversity of California at Berkeley and International Computer Science Institute 1947 Center St., Suite 600 Berkeley, CA 94704-1105 Abstract To support the requirements for the transmission of continuous media, such as audio and video, multiservice packet switching networks must provide service guarantees to connections, including guarantees on throughput, network delays, and network delay variations. For the most demanding applications, the network must oer a service which can provide deterministic guarantees for the maximum delay of packets from all connections, referred to as bounded delay service. The admission control functions in a network with a bounded delay service must have available schedulability conditions that detect violations of delay guarantees in a network switch. In this study, exact schedulability conditions are presented for packet switches which transmit packets based on an Earliest-Deadline-First (EDF) or a Static-Priority (SP) algorithm. The schedulability conditions are given in terms of a general trac model, making the conditions applicable to a large class of trac specications. A comparison of the new schedulability conditions with existing, less accurate, conditions show the eciency gain obtained by using exact conditions. Examples are presented that show how the selection of a particular trac specication and a schedulability condition impact the eciency of a bounded delay service. Key Words: Multiservice Networks, Real-time Networks, Bounded Delay Service, Multiplexing, Quality of Service, Packet Scheduling, Admission Control, Static-Priority, Earliest-Deadline-First. This work is supported in part by the National Science Foundation under Grant No. NCR-9309224. 1 Introduction Recent technology trends have dramatically advance