完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLai, YCen_US
dc.contributor.authorLin, YDen_US
dc.date.accessioned2014-12-08T15:27:29Z-
dc.date.available2014-12-08T15:27:29Z-
dc.date.issued1997en_US
dc.identifier.isbn0-8186-8186-1en_US
dc.identifier.urihttp://hdl.handle.net/11536/19747-
dc.description.abstractThe paper presents a performance analysis of a rate-based congestion control mechanism. The switching capacity of the buffer is finite to reflect real conditions. Using a differential equation approach, we get the closed-form equations of cell loss probability and utilization. Numerical results are given to show that our analysis is correct. In rate-based control, the important issue is how to determine congestion occurrence and congestion relief. The most common method is to set two thresholds of queue length, a high threshold and a low threshold. The values of these two thresholds seriously influence the system performance. Hence, me present the concept of best area to determine how to set the high and low thresholds to guarantee good performance, i.e., cell loss probability is zero and utilization is one, if it is possible. When good performance is not achieved due to too many connections or too large propagation delay, some rules are also given to prevent unnecessary cell-loss and under-utilization.en_US
dc.language.isoen_USen_US
dc.titlePerformance analysis of rate-based congestion control scheme and choice of high and low thresholdsen_US
dc.typeProceedings Paperen_US
dc.identifier.journalSIXTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGSen_US
dc.citation.spage70en_US
dc.citation.epage75en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1997BJ71K00010-
顯示於類別:會議論文