Skip navigation
  • 中文
  • English

DSpace CRIS

  • DSpace logo
  • Home
  • Organizations
  • Researchers
  • Research Outputs
  • Explore by
    • Organizations
    • Researchers
    • Research Outputs
  • Academic & Publications
  • Sign in
  • 中文
  • English
  1. NTU Scholars
  2. 電機資訊學院
  3. 電信工程學研究所
Please use this identifier to cite or link to this item: https://scholars.lib.ntu.edu.tw/handle/123456789/121524
DC FieldValueLanguage
dc.contributor蔡志宏en
dc.contributor臺灣大學:電信工程學研究所zh_TW
dc.contributor.author駱怡榮zh
dc.contributor.authorLo, Yi-jungen
dc.creator駱怡榮zh
dc.creatorLo, Yi-jungen
dc.date2004en
dc.date.accessioned2007-11-27T10:56:42Z-
dc.date.accessioned2018-07-05T03:38:04Z-
dc.date.available2007-11-27T10:56:42Z-
dc.date.available2018-07-05T03:38:04Z-
dc.date.issued2004-
dc.identifieren-USen
dc.identifier.urihttp://ntur.lib.ntu.edu.tw//handle/246246/58624-
dc.description.abstracten
dc.description.abstractAs 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.tableofcontentsContents 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 . . . . . . . . . . . . . . . . . . . . . . . 44en
dc.format.extent624449 bytes-
dc.format.mimetypeapplication/pdf-
dc.languageen-USen
dc.language.isoen_US-
dc.subject允入控制en
dc.subject長短封包流en
dc.subjectCall Admission Controlen
dc.title支援長短封包流之允入控制演算法zh
dc.titleA Call Admission Control Algorithm for Long-lived and Short-lived Flowsen
dc.typethesisen
dc.identifier.uri.fulltexthttp://ntur.lib.ntu.edu.tw/bitstream/246246/58624/1/ntu-93-R91942028-1.pdf-
dc.relation.referenceBibliography [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.openairetypethesis-
item.languageiso639-1en_US-
item.fulltextwith fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_46ec-
item.grantfulltextopen-
item.cerifentitytypePublications-
Appears in Collections:電信工程學研究所
Files in This Item:
File Description SizeFormat
ntu-93-R91942028-1.pdf23.31 kBAdobe PDFView/Open
Show simple item record

Page view(s)

12
checked on Apr 22, 2022

Download(s) 5

6
checked on Apr 22, 2022

Google ScholarTM

Check

Related Items in TAIR


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Sherpa Romeo網站查詢,以確認出版單位之版權政策。
    Please use Sherpa Romeo to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)
Build with DSpace-CRIS - Extension maintained and optimized by Logo 4SCIENCE Feedback