https://scholars.lib.ntu.edu.tw/handle/123456789/121524| DC Field | Value | Language |
|---|---|---|
| dc.contributor | 蔡志宏 | en |
| dc.contributor | 臺灣大學：電信工程學研究所 | zh_TW |
| dc.contributor.author | 駱怡榮 | zh |
| dc.contributor.author | Lo, Yi-jung | en |
| dc.creator | 駱怡榮 | zh |
| dc.creator | Lo, Yi-jung | en |
| dc.date | 2004 | en |
| dc.date.accessioned | 2007-11-27T10:56:42Z | - |
| dc.date.accessioned | 2018-07-05T03:38:04Z | - |
| dc.date.available | 2007-11-27T10:56:42Z | - |
| dc.date.available | 2018-07-05T03:38:04Z | - |
| dc.date.issued | 2004 | - |
| dc.identifier | en-US | en |
| dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/58624 | - |
| dc.description.abstract | en | |
| dc.description.abstract | As Internet grows rapidly and bandwidth increases, ISP or CDN operators are able to provide high-data-rate applications for more and more customers. But owing to the drawbacks of the original Internet best effort design, such network will often be in chaos if we do not employ any QoS mechanism. CAC (call admission control) is one of QoS mechanisms and it maintains performance by limiting system utilization. However, the most conventional CAC algorithms are utilizatoin-based and measurement-based CAC algorithm, both have become important research topics. Among the research work, most of them wants to increase system utilization but not to degrade the quality of service. In this thesis, we propose a call admission control algorithm, which handles longlive and short-live dlows differently. Under such mechanism, we show that not only one can guarantee the quality of each flow, but it is also possible to improve the system utilization. Finally, we employ simulation to valide the effectiveness of this CAC algorithm to support streaming media services. | en |
| dc.description.tableofcontents | Contents Abstract i 1 Introduction 1 1.1 A Brief Review of Call Admission Control Algorithms . . . . . . . . . 1 1.2 Long-lived and Short-lived Flows . . . . . . . . . . . . . . . . . . . . 3 2 System Models 5 2.1 Traffic Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Queueing Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.3 The Setting of Parameters . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Shaped Service Curves . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4.1 Fast Start . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.4.2 Bursty Arrival . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3 Performance Analysis 15 3.1 Time-to-Play . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2 End-to-end Delay . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.2.1 The Maximum Tolerable Delay . . . . . . . . . . . . . . . . . 21 3.2.2 Delay Bounds of Long-lived Flows . . . . . . . . . . . . . . . 24 3.2.3 Delay Bounds of Short-lived Flows . . . . . . . . . . . . . . . 27 3.3 LS Call Admission Control Algorithm . . . . . . . . . . . . . . . . . . 29 4 Simulation Results of Call Admission Control Algorithms 33 4.1 Simulation Environments . . . . . . . . . . . . . . . . . . . . . . . . . 33 4.1.1 Parameters of Flows and Shapers . . . . . . . . . . . . . . . . 33 4.1.2 Traffic Pattern and the Arrival Pattern of Requests . . . . . . . . 34 iii iv 4.2 Numerical Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 4.2.1 Time-to-Play . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 4.2.2 End-to-end Delay . . . . . . . . . . . . . . . . . . . . . . . . . 36 4.2.3 System Utilization . . . . . . . . . . . . . . . . . . . . . . . . 39 5 Conclusions 43 5.1 Implementation Issues . . . . . . . . . . . . . . . . . . . . . . . . . . 43 5.2 Conclusions and Future Work . . . . . . . . . . . . . . . . . . . . . . . 44 | en |
| dc.format.extent | 624449 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language | en-US | en |
| dc.language.iso | en_US | - |
| dc.subject | 允入控制 | en |
| dc.subject | 長短封包流 | en |
| dc.subject | Call Admission Control | en |
| dc.title | 支援長短封包流之允入控制演算法 | zh |
| dc.title | A Call Admission Control Algorithm for Long-lived and Short-lived Flows | en |
| dc.type | thesis | en |
| dc.identifier.uri.fulltext | http://ntur.lib.ntu.edu.tw/bitstream/246246/58624/1/ntu-93-R91942028-1.pdf | - |
| dc.relation.reference | Bibliography [1] D. Clark R. Braden and S. Shenker, “Integrated services in the internet architecture: an overview,” IETF RFC 1633, June 1994. [2] M. Carlson E. Davies Z. Wang S. Blake, D. Black and W. Weiss, “An architecture for differentiated service,” IETF RFC 2475, Dec. 1998. [3] D. Grossman, “New terminology and clarifications for diffserv,” IETF RFC 3260, Apr. 2002. [4] S. Keshav A. Demers and S. Shenkar, “Analysis and simulation of a fair queueing algorithm,” Internet. Res. and Exper., vol. 1, 1990. [5] S. Floyd and V. Jacobson, “Link-sharing and resource management models for packet networks,” IEEE/ACM Transactions on Networking, vol. 3, no. 4, pp. 365– 386, Aug. 1995. [6] D. Hoffman, “Implementation report on the lbl/ucl/sun cbq kernel,” Toronto IETF, July 1994. [7] S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Transactions on Networking, vol. 1, no. 4, pp. 397 – 413, Aug. 1993. [8] J. Postel, “Transmission control protocol,” IETF RFC 793, Sept. 1981. [9] M. Grossglauser and D.N.C Tse, “A time-scale decomposition approach to measurement-based admission control,” IEEE/ACM Transactions on Networking, vol. 11, no. 4, pp. 550–563, Aug. 2003. 47 48 [10] S. Valaee and B. Li, “Distributed call admission control for ad hoc networks,” in Proceedings of the 56th IEEE Vehicular Technology Conference, Sept. 2002, vol. 2, pp. 1244–1248. [11] A. K. Parekh and R.G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks: the single-node case,” IEEE/ACM Transactions on Networking, vol. 1, no. 3, pp. 344–357, June 1993. [12] K. Lee, “Performance bounds in communication networks with variable-rate links,” in ACM SIGCOMM Proceedings of the Conference on Applications, Technologies, Architectures, And Protocols for Computer Communication, Oct. 1995, vol. 25, pp. 126–136. [13] M. Li and Z. Tsai, “A traffic shaper for supporting cbr and vbr services in atm networks,” Performance Evaluation, pp. 243–264, Jan. 2000. [14] W.-J. Hsu and Z. Tsai, “A call admission control algorithm based on stochastic performance bound for wireless networks,” in the 3rd IEEE Pacific Rim Conference on Multimedia 2002, Dec. 2002. [15] A. Rao H. Schulzrinne and R. Lanphier, “Real time streaming protocol (rtsp),” IETF RFC 2326, Apr. 1998. [16] Microsoft Windows Digital Media Division, “An introduction to windows media services 9 series,” Microsoft Corporation, Sept. 2002. [17] R.A. Malaney and G. Rogers, “Network calculus and service curve scheduling in heterogeneous networks,” in Proceedings of IEEE International Conference on Networks 1999, Sept. 1999, pp. 250–254. [18] J-Y. Le Boudec and P. Thiran, “A short tutorial on network calculus. i. fundamental bounds in communication networks,” in Proceedings of IEEE ISCAS 2000, May 2000, pp. 93–96. [19] J-Y. Le Boudec and P. Thiran, “A short tutorial on network calculus. ii. minplus system theory applied to communication networks,” in Proceedings of IEEE ISCAS 2000, May 2000, pp. 365–368. 49 [20] D. Bertsekas and R. Gallager, Data Networks, Englewood Cliffs, NJ: Prentice Hall, 2 edition, 1992. | en |
| item.openairetype | thesis | - |
| item.languageiso639-1 | en_US | - |
| item.fulltext | with fulltext | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
| item.grantfulltext | open | - |
| item.cerifentitytype | Publications | - |
| Appears in Collections: | 電信工程學研究所 | |
| File | Description | Size | Format | |
|---|---|---|---|---|
| ntu-93-R91942028-1.pdf | 23.31 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.