Optimal Allocation of Network Resource in IntServ
-
摘要: 为了提高网络接纳控制中的资源预留效率,基于网络演算理论,研究了IETF(因特网工程任务组)推荐的IntServ QoS协商和资源预留的实现方法及其存在的问题.基于给定到达曲线、最大延迟和缓冲区大小约束条件,提出了2种新的网络资源优化分配方法,导出了不同情况下需要预留的速率和缓冲区长度的计算公式.研究结果表明,所提出的资源优化分配方法通过引入分段线性的服务曲线,可以有效节约资源,提高网络利用率.Abstract: To improve the effectiveness of resource reservation in network admission control,the implementation method and problem of QoS(quality of service) negotiation and resource reservation of IntServ(integrated services) recommended by IETF(Internet Engineering Task Force) were investigated based on the network calculus theory.Under the conditions of the given arrival curve,maximum delay and buffer size,two new optimal allocation schemes for network resources in IntServ were proposed.The formulas of calculating the desired rate and buffer size for these schemes were derived.The research results show that the proposed schemes can save network resources effectively and raise network utilization through the introduction of a piecewise linear service curve.
点击查看大图
计量
- 文章访问数: 1511
- HTML全文浏览量: 63
- PDF下载量: 444
- 被引次数: 0