For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Local Allocation of End-to-End Delay Requirement
Yen-Ping CHU E-Hong HWANG Kuan-Cheng LIN Chin-Hsing CHEN
IEICE TRANSACTIONS on Communications
Publication Date: 1999/09/25
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Services
deterministic service, scheduling, local QOS allocation, regulator,
Full Text: PDF>>
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 bound as the end-to-end and local QOS requirement. With (σ, ρ) 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.