區(qū)分服務(wù)網(wǎng)絡(luò)中確保業(yè)務(wù)端到端時(shí)延的接納控制算法研究
Study of Admission Control Algorithms with Deterministic Delay Guarantees in DiffServ Networks
-
摘要: 該文提出了一種對(duì)區(qū)分服務(wù)網(wǎng)絡(luò)中時(shí)延敏感業(yè)務(wù)進(jìn)行接納控制的SACiD(Service Admission Control in DiffServ)算法，它不僅保證用戶業(yè)務(wù)的端到端時(shí)延不超過確定的上界，而且能比較充分利用網(wǎng)絡(luò)資源。仿真結(jié)果表明，SACiD算法可以保證時(shí)延敏感業(yè)務(wù)的服務(wù)質(zhì)量，而且其業(yè)務(wù)接納率和帶寬利用率接近綜合服務(wù)網(wǎng)絡(luò)中接納控制算法的性能，但它的存儲(chǔ)器需求卻遠(yuǎn)小于它們。此外，SACiD算法運(yùn)算簡單，具有與區(qū)分服務(wù)一致的可擴(kuò)展性，可以為區(qū)分服務(wù)網(wǎng)絡(luò)的資源管理提供支持。
-
關(guān)鍵詞:
- 區(qū)分服務(wù); 接納控制; 帶寬分配;SACiD算法
Abstract: An admission control algorithm with deterministic delay guarantees in DiffServ networks, Service Admission Control in DiffServ (SACiD), is developed in this paper. It can not only prevent the end-to-end delay of admitted services from violating the allowed upper bound, but alalo utilize network resources efficiently. Simulation results indicate that the performance of SACiD is close to that of the similar algorithm in IntServ networks with little memory requirement. Due to its simplicity and scalability, SACiD can support resource management in DiffServ networks. -
計(jì)量
- 文章訪問數(shù): 2599
- HTML全文瀏覽量: 103
- PDF下載量: 838
- 被引次數(shù): 0
下載:
