Please use this identifier to cite or link to this item:
標題: Local allocation of end-to-end delay requirement
作者: Chu, Y.P.
Hwang, E.H.
Lin, K.C.
Chen, C.H.
關鍵字: deterministic service;scheduling;local QOS allocation;regulator;networks
Project: Ieice Transactions on Communications
期刊/報告no:: Ieice Transactions on Communications, Volume E82B, Issue 9, Page(s) 1380-1387.
A typical user is concerned only with the quality of service of a network on an end-to-end basis. Therefore, how end-to-end requirements are mapped into the local switching node requirements and maximum network utilization is a function of network internal design. In this paper, we address the problem of QOS allocation. We derived an optimal QOS allocation policy and decided the maximum utilization bound in a deterministic traffic model. We adopted the worst case delay hound as the end-to-end and local QOS requirement. With (sigma,rho) traffic model, we derived a formula for delay bound and the number of connections. We found that with the delay bound as the QOS metric, there is a significant difference in the performance of allocation policies. We also developed an evaluation strategy to analyze allocation policies. The numerical results for two simple network topologies: tandem network model and uneven traffic load model, compare the equal allocation policy with the optimal allocation policy and show the correctness and efficiency of QOS allocation policy.
ISSN: 0916-8516
Appears in Collections:資訊管理學系

Show full item record

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.