English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 4334/7631
造訪人次 : 3193555      線上人數 : 37
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.hust.edu.tw/dspace/handle/310993100/191

題名: The Evaluation of Allocation For End-to-end Quality of service Requirement
作者: E. H. Hwang
J. T. Wang
C. L. Lee
T. F. Chu
貢獻者: Department of Management Information Systems
關鍵詞: guaranteed service
scheduling
local QOS allocation
traffic shaper
日期: 2000-09
上傳時間: 2008-08-18T03:09:42Z
摘要: In this paper, we focus on the problem of translating a global QOS (quality of service) requirement into a set of local QOS requirement. Applications with guaranteed service would like to acquire an end-to-end delay bound from the network.
In the literature, most researches only attempt to solve the worse case delay bound suffered by a connection passed through a series of switching nodes. Simply, they equally allocate the excess delay or reserve the same bandwidth in each switch along the path. However, if the network can apply a tighter delay bound than the applications want, and the excess delay amount can be adequately distributed into the local switches along the path, applications can get the best possible performance.. It motivates us to propose a novel local QOS requirement allocation scheme to get better performance which is abbreviated by the supportable connection number. We proposed an analysis model to evaluate the allocation scheme in a series of switching nodes with the rate-controlled scheduling architecture, including a traffic shaper and a nonpreemptive earliest-deadline-first scheduler. With the number of maximum allowable connections as the performance index, we derived an optimal delay allocation policy. The numerical results have shown the importance of allocation policy and the factors that affect the performance index.
關聯: 修平學報 1, 243-264
顯示於類別:[資訊管理系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
01-17端點服務品質需求分配之評估.pdf964KbAdobe PDF3665檢視/開啟

在HUSTIR中所有的資料項目都受到原著作權保護.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋