QoS技术基础-chpt3.ppt

  1. 1、本文档共84页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
QoS技术基础-chpt3

Traffic Characteristics The Problem; Packet Voice Modeling; CBR model; Two-state model; Fluid-flow model; MMPP model; Video Traffic Characteristics and Modeling; Video traffic characterization; Packet video modeling; AR model; Fluid flow model; MMPP model; More Practical Model; Leaky bucket model; Token bucket model; Model used in ISPN; The Problem Traffic models play a significant role in the design and engineering of IP networks: Configuration of networks; Network QoS; Performance evaluation; Related issues; It is required to develop rather sophisticated traffic models to carry out accurate design, engineering and performance evaluation. CBR Model for Voice Without silence suppression, digitized voice (compressed or uncompressed) can be simply modeled as a bits stream with constant rate (i.e. the number of bits per second = constant); In this context, packetized voice stream can be roughly viewed as having constant packets rate: Fixed packet size; The number of packets per second = constant; CBR Model for Voice (cont’d) The multiplexing problem A simple multiplexing model CBR Model for Voice (cont’d) As for the multiplexing model, the followings need to be worked out: The buffer size, B; The average waiting time, E(W); The utilization ratio: To keep the system stable, the utilization level needs to be less than 1; Worst case analysis of the required buffer size: The buffer size of (N-1) packets, not including the one in service, will suffice to handle the case; Zero blocking probability; The survivor function of delay* (the length of time spent in the queue waiting for service) CBR Model for Voice (cont’d) As for nD/D/1 system, the F(x): Not in a simple and straightforward form; For details, refer to the following article: Eckberg, Jr., A. E., “The Single Server Queue with Periodic Arrival Process and Deterministic Service Times,” IEEE Trans. On Communications, COM-27, 3(March 1979):556-562. Example and comparison: N = 5; r = 59808 cells/sec; C = 312500 cells/s

文档评论(0)

jgx3536 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档