完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChu, Y. P.
dc.contributor.authorChiang, W. C.
dc.contributor.authorLee, C. L.
dc.date.accessioned2009-08-23T04:46:31Z
dc.date.accessioned2020-05-29T06:19:17Z-
dc.date.available2009-08-23T04:46:31Z
dc.date.available2020-05-29T06:19:17Z-
dc.date.issued2006-10-16T03:37:43Z
dc.date.submitted2001-12-20
dc.identifier.urihttp://dspace.fcu.edu.tw/handle/2377/1440-
dc.description.abstractMany multimedia applications, including audio and video, require quality of service( QOS) guarantees from network. A typical user is only concerned with the QOS requirements on end -to-end basis and does not care about the local switching node QOS. In this paper, we propose a general framework to map the end-to-end QOS requirement into the local switching node QOS requirements. Most of recent research efforts only focus on worst-case end-to-end delay bound but pay no attention to the problem of distributing the end-to-end delay bound to local switch node. Therefore, we focus on the local switching node QOS requirement and design a novel QOS requirement allocation scheme to get better performance. Using the number of maximum supportable connections as the performance index, we derive an optimal delay allocation( OPT) policy. In addition, we also design an analysis model to evaluate the proposed allocation scheme and equal allocation ( EQ) scheme, which apply to the switching nodes along the flow’ s path with the Rate -controlled scheduling architecture, including a traffic shaper and a fair queueing scheduler.
dc.description.sponsorship中國文化大學,台北市
dc.format.extent10p.
dc.format.extent117363 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2001 NCS會議
dc.subject.otherHigh Speed Networks
dc.titleCall Admission and End-to-end delay Allocation for Fair Queueing Networks
分類:2001年 NCS 全國計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ncs002001000112.pdf114.61 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。