1. NCCU Academic Hub
  2. 理學院
  3. 應用數學系
  4. 學位論文
Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/32589
DC FieldValueLanguage
dc.contributor.advisor陸行zh_TW
dc.contributor.advisorLuh,Hsingen_US
dc.contributor.author余文政zh_TW
dc.contributor.authorYu,Wen Chengen_US
dc.creator余文政zh_TW
dc.creatorYu,Wen Chengen_US
dc.date2008en_US
dc.date.accessioned2009-09-17T05:48:20Z-
dc.date.available2009-09-17T05:48:20Z-
dc.date.issued2009-09-17T05:48:20Z-
dc.identifierG0094751012en_US
dc.identifier.urihttps://nccur.lib.nccu.edu.tw/handle/140.119/32589-
dc.description碩士zh_TW
dc.description國立政治大學zh_TW
dc.description應用數學研究所zh_TW
dc.description94751012zh_TW
dc.description97zh_TW
dc.description.abstract參考Yue等論文，我們延續探討在通訊網路中對於非及時Available Bit Rate(ABR)資料與及時Variable Bit Rate(VBR)資料共同使用一條傳輸的等候模型。假設及時VBR資料傳輸較非及時ABR資料傳輸有優先權，我們建立與分析資料在離開過程之模型。本論文研究在非強制性優先權策略下之一般等候模型，藉由ABR資料的等候區域設立檢查點來控制流入量，在離開過程中推導VBR資料與ABR資料的離去時間的數學關係式，以及調查他們的數值模擬的表現。在此數學推導中需要藉MMBP關係，從ABR資料的等候區域觀點製造Markov矩陣算出穩定狀態下的機率分量、生成函數以及閒置時間的函數。結果發現檢查點影響兩者的離去時間並不顯著，但是VBR資料流入的速度卻會造成影響。zh_TW
dc.description.abstractFollowing the work by Yue et al., this thesis considers the departure\nof a multi-traffic network system for a popular communication network\nwhere a transmission link is shared by an Available Bit Rate (ABR)\napplication for non-real time traffic and a Variable Bit Rate (VBR)\napplication for real time traffic. It is assumed that the VBR traffic has\na higher transmission priority than the ABR traffic. In this thesis, we\nestablish a tractable analytical model of departure processes for such a\nsystem. The departure process is characterized by a general queueing\nmodel with a non-preemption policy for which the inter-departure times\nof VBR and ABR are derived, respectively. Since the VBR traffic is only\naffected when ABR is in service, the analysis is given to describe the\ndepartures of ABR, and VBR traffics. Numerical results are conducted\nto illustrate the system performance with input control of ABR traffic.en_US
dc.description.tableofcontentsAbstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . izh_TW
dc.format.extent113670 bytes-
dc.format.extent70522 bytes-
dc.format.extent145635 bytes-
dc.format.extent76067 bytes-
dc.format.extent85075 bytes-
dc.format.extent105875 bytes-
dc.format.extent106987 bytes-
dc.format.extent189280 bytes-
dc.format.extent124736 bytes-
dc.format.extent411920 bytes-
dc.format.extent70696 bytes-
dc.format.extent142837 bytes-
dc.format.extent85818 bytes-
dc.format.extent86222 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.language.isoen_US-
dc.source.urihttp://thesis.lib.nccu.edu.tw/record/#G0094751012en_US
dc.subject非及時資料zh_TW
dc.subject及時資料zh_TW
dc.subject數學推導zh_TW
dc.subject離去過程之間隔時間zh_TW
dc.subjectABRen_US
dc.subjectVBRen_US
dc.subjectperformance evaluationen_US
dc.subjectinterdeparture timeen_US
dc.title具有多重流量控管網路之離開過程zh_TW
dc.titleDeparture Processes of Multi-Traffic Networks with Input Controlen_US
dc.typethesisen
dc.relation.reference[1] W. Yue, D. Yue, H. Zhang and F. Tu, “Performance Analysis and Evaluationzh_TW
dc.relation.referencefor Multi-Traffic Networks Using Priority Based Controlled Available Bitzh_TW
dc.relation.referenceRates,” Proceedings of the First World Congress of the International Federationzh_TW
dc.relation.referencefor Systems Research (IFSR2005), S1-1-1-S3-1-7, 2005.zh_TW
dc.relation.reference[2] W. K. Lai, C. C. Hwang and W. J. Hsiao, “A Proportional Feedback Schemezh_TW
dc.relation.referencefor ATM Networks,” Information Sciences, vol. 110, pp. 237-253, 1998.zh_TW
dc.relation.reference[3] W. Yue, D. Yue, H. Zhang and F. Tu,“Performance Analysis and Evaluationzh_TW
dc.relation.referencefor Multi-Traffic Networks with Priority Control,” Computer Communications,zh_TW
dc.relation.referencedoi:10.1016/j.comcom.2006.12.031, 2007.zh_TW
dc.relation.reference[4] H. Luh, “Derivation of the N-Step Interdeparture Time Distribution in GI/G/1zh_TW
dc.relation.referenceQueueing System,” European Journal of Operational Research, vol. 118, pp.zh_TW
dc.relation.reference194-212, 1999.zh_TW
dc.relation.reference[5] P. Newman, “Traffic Management for ATM Local Area Networks,” IEEE Communicationszh_TW
dc.relation.referenceMagazine, vol. 32, no. 8, pp. 44-50, 1994.zh_TW
dc.relation.reference[6] I. Da˘g, I. Stavr˙akakis, “Evaluation of ABR Traffic Management Under Variouszh_TW
dc.relation.referenceSystem Time Scales,” Computer Networks and ISDN System, vol. 29, pp. 2013-zh_TW
dc.relation.reference2117, 1998.zh_TW
dc.relation.reference[7] D. A. Stanford, “Waiting and Interdeparture Times in Priority Queues withzh_TW
dc.relation.referencePoisson- and General-Arrival Streams,”Operations Research, vol. 45, no. 5, pp.zh_TW
dc.relation.reference725-735, 1997.zh_TW
dc.relation.reference[8] P. Nain, “Interdeparture Times From a Queueing System with Preemptivezh_TW
dc.relation.referenceResume Priority,” Performance Evaluation 4 pp. 93-98, 1984.zh_TW
dc.relation.reference[9] L. Delbrouck, “Interdeparture Times in M=G=1 Queueing Systems with Nonpreemptivezh_TW
dc.relation.referencePriority Discipline,” Operations Research Letter 9 pp. 65-69, 1990.zh_TW
dc.relation.reference[10] D. A. Stanford, “Interdeparture-time Distributions in the Nonpreemptive Priorityzh_TW
dc.relation.referencePiMi=Gi=1 Queue,” Performance Evaluation 12 pp. 43-60, 1991.zh_TW
dc.relation.reference[11] N. K. Singh, S. K. Bose and Y. N. Singh, “An Approach for Performance Analysiszh_TW
dc.relation.referenceof Discrete-Time Finite Capacity Open Queuing Network with Correlatedzh_TW
dc.relation.referenceArrivals.”zh_TW
dc.relation.reference[12] H., Luh, K. H., Tseng, “Characterizing the idle time of a nonexponential serverzh_TW
dc.relation.referencesystem,” Mathematical Methods of Operations Research pp. 379-397, 2004.zh_TW
item.grantfulltextopen-
item.openairetypethesis-
item.fulltextWith Fulltext-
item.languageiso639-1en_US-
item.openairecristypehttp://purl.org/coar/resource_type/c_46ec-
item.cerifentitytypePublications-
Appears in Collections:學位論文
Files in This Item:
File Description SizeFormat
101201.pdf111.01 kBAdobe PDF2View/Open
101202.pdf68.87 kBAdobe PDF2View/Open
101203.pdf142.22 kBAdobe PDF2View/Open
101204.pdf74.28 kBAdobe PDF2View/Open
101205.pdf83.08 kBAdobe PDF2View/Open
101206.pdf103.39 kBAdobe PDF2View/Open
101207.pdf104.48 kBAdobe PDF2View/Open
101208.pdf184.84 kBAdobe PDF2View/Open
101209.pdf121.81 kBAdobe PDF2View/Open
101210.pdf402.27 kBAdobe PDF2View/Open
101211.pdf69.04 kBAdobe PDF2View/Open
101212.pdf139.49 kBAdobe PDF2View/Open
101213.pdf83.81 kBAdobe PDF2View/Open
101214.pdf84.2 kBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check


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