ImageVerifierCode 换一换
你正在下载:

排队论.ppt

[预览]
格式:PPT , 页数:68 ,大小:2.09MB ,
资源ID:5753144      下载积分:20 金币
快捷下载
登录下载
邮箱/手机:
温馨提示:
快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。 如填写123,账号就是123,密码也是123。
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝    微信支付   
验证码:   换一换

加入VIP,免费下载
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【https://www.docduoduo.com/d-5753144.html】到电脑端继续下载(重复下载不扣费)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录   QQ登录   微博登录 

下载须知

1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。
2: 试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
3: 文件的所有权益归上传用户所有。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 本站仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

版权提示 | 免责声明

本文(排队论.ppt)为本站会员(dreamzhangning)主动上传,道客多多仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知道客多多(发送邮件至docduoduo@163.com或直接QQ联系客服),我们立即给予删除!

排队论.ppt

1、排队论,引言 排队论在通信网络中的应用,1. Telecommunication system,Telecommunication system from the traffic point of view:Ideas:the system serves the incoming trafficthe traffic is generated by the users of the system,Interesting questions,Given the system and incoming traffic,what is the quality of service experienc

2、ed by the user?Given the incoming traffic and required quality of service,how should the system be dimensioned? Given the system and required quality of service,what is the maximum traffic load?,General purpose,Determine relationships between the following three factors:quality of servicetraffic loa

3、dsystem capacity,Example,Telephone call traffic = telephone calls by everybody system = telephone network quality of service = probability that the phone rings at the destination,Relationships between the three factors,Qualitatively, the relationships are as follows:,To describe the relationships qu

4、antitatively, mathematical models are needed,Teletraffic models,Teletraffic models are stochastic (= probabilistic) systems themselves are usually deterministic, but traffic is typically stochastic “you never know, who calls you and when”It follows that the variables in these models are random varia

5、bles, e.g. number of ongoing calls number of packets in a bufferRandom variable is described by its distribution, e.g. probability that there are n ongoing calls probability that there are n packets in the bufferStochastic process describes the temporal development of a random variable,Difference be

6、tween the real system and the model,Typically, the model describes just one part or property of the real system under consideration and even from one point of view the description is not very accurate but rather approximative Thus, caution is needed when conclusions are drawn,Practical goals,Network

7、 planning dimensioning optimization performance analysis Network management and control efficient operation fault recovery traffic management routing accounting,2. Teletraffic models,Two phases in modelling: modelling of the incoming traffic traffic model modelling of the system itself system model

8、Two types of system models: loss systems waiting/queueing systems These models can be combined to create models for whole telecommunication networks loss network models queueing network models Next we will present a simple teletraffic model describing a single resource,Simple teletraffic model,Custo

9、mers arrive at rate (customers per time unit) 1/ = average inter-arrival timeCustomers are served by n parallel serversWhen busy, a server serves at rate (customers per time unit) 1/ = average service time of a customerThere are m waiting placesIt is assumed that blocked customers (arriving in a ful

10、l system) are lost,Pure loss system,Pure waiting system,Mixed system,Infinite system,Littles formula,Consider a system where new customers arrive at rate Assume stability: Every now and then, the system is empty Consequence: Customers depart from the system at rate Let N =average number of customers

11、 in the system T =average time of customers spends in the system Littles formula: N= T,3 Classical model for telephone traffic,Loss models have traditionally been used to describe (circuit-switched) telephone networks Pioneering work made by Danish mathematician A.K. Erlang (1878-1929) Consider a li

12、nk between two telephone exchanges traffic consists of the ongoing telephone calls on the link Erlang modelled this as a pure loss system (m = 0),Traffic process,Traffic intensity,Example,Characteristic traffic,Blocking,Call rates,Traffic streams,Teletraffic analysis,Erlangs blocking formula,Example

13、,Required capacity vs. traffic,Required quality of service vs. traffic,Required quality of service vs. capacity,4 Classical model for data traffic,Traffic process,Traffic load,Example,Teletraffic analysis,Waiting time formula for an M/M/1 queue,Example,Required link speed vs. arrival rate,Required q

14、uality of service vs. arrival rate,Required quality of service vs. link speed,5 Telecommunication network,Shared medium as an access network,Example: Why networks? (1),Example: Why networks? (2),Example: Why networks? (3),Example: Why networks? (4),Network level: switching and routing,Switching mode

15、s,Routing methods in telephone networks,Queueing network model,Link level: multiplexing and concentration,Transmission: multiplexing,Teletraffic model for a statistical multiplexer,Teletraffic model for a concentrator,Multiple access techniques used in mobile telephone networks,Teletraffic modelling

16、 of various multiple access techniques,Multiple access techniques in computer LANs,Random Access,Analysis of ALOHA,Analysis of Slotted ALOHA,课程介绍,教材: 任何一本排队论及相关的书籍 图书馆内相关书籍: 排队论 陆传赉编著 北京邮电学院出版社, 1994.5 排队论及其在计算机通信中的应用 盛友招 编著 北京邮电大学出版社, 1998 排队论与随机服务系统 (美)华兴编著上海翻译出版公司, 1987 排队论基础及应用 孟玉珂编著 同济大学出版, 1989. Queueing systems: Vol.1.theory. Kleinrock,L, N.Y. : John Wiley & Sons , 1975. Queueing Systems Vol 2 Computer Applications Kleinrock,L, N.Y. : John Wiley & Sons , 1975.,联系方式电话: 87556711Email:,

本站链接:文库   一言   我酷   合作


客服QQ:2549714901微博号:道客多多官方知乎号:道客多多

经营许可证编号: 粤ICP备2021046453号世界地图

道客多多©版权所有2020-2025营业执照举报