spContent=Theory of Communication Networks is one of the core courses of Information and Communication Engineering. It mainly introduce basic theories of the features of network traffic, the topology of network structure, and the reliability of network. This course is provided by the teaching and research team of Theory of Communication Networks in Beijing University of Posts and Telecommunications. We will provide the basic theories and performance analysis method of communication networks.
通信网理论基础是信息与通信工程学科的核心课程，其目的在于讨论通信网中的网内业务特征，通信网络的拓扑结构，以及网络可靠性等基础理论。本课程由北京邮电大学的通信网理论基础教学团队的成员完成，我们将用精炼的语言、严谨的推理和丰富的多媒体资源，多维度展现通信网络的基础理论和性能分析方法。
Theory of Communication Networks is one of the core courses of Information and Communication Engineering. It mainly introduce basic theories of the features of network traffic, the topology of network structure, and the reliability of network. This course is provided by the teaching and research team of Theory of Communication Networks in Beijing University of Posts and Telecommunications. We will provide the basic theories and performance analysis method of communication networks.
通信网理论基础是信息与通信工程学科的核心课程，其目的在于讨论通信网中的网内业务特征，通信网络的拓扑结构，以及网络可靠性等基础理论。本课程由北京邮电大学的通信网理论基础教学团队的成员完成，我们将用精炼的语言、严谨的推理和丰富的多媒体资源，多维度展现通信网络的基础理论和性能分析方法。
—— 课程团队
课程概述
This course treats some of the theoretical problems involved in communication networks, such as the computation and analysis models of Poisson process, M/M/1, M/M/s(s) and M/M/s queue system and the network flows. After having a good knowledge of the basic mathematical models, students will learn the concept of communication networks, study the performance analysis algorithms of networks, and master the analysis tools for the topology and reliability of communication networks. There are also some experiments about basic method of performance analysis of communication networks to improve the students' capability of simulation and evaluation.
课程大纲
The Poisson Process 泊松过程
1.1 The Poisson Process-1 泊松过程-1
1.2 The Poisson Process-2 泊松过程-2
1.3 The Exponential with Parameter 负指数分布
1.4 Interarrival Times 到达时间间隔
M/M/1 Queueing System M/M/1排队系统
2.1 M/M/1 Queueing System M/M/1 排队系统
2.2 Little’s Formula Little公式
2.3 M/M/1/L Queueing System M/M/1/L 排队系统
2.4 Erlang Delay System Erlang等待制系统
2.5 Analysis of Erlang Delay System Erlang等待制系统分析
2.6 Combined Delay and Loss System 混合制系统
M/M/s(s) Queueing System M/M/s(s)排队系统
3.1 Elements of Queueing Model 排队模型
3.2 M/M/s(s) Queueing Model M/M/s(s)排队模型
3.3 State transition diagram 状态转移图
3.4 Erlang B Formula Erlang B 公式
M/G/1 Queueing System M/G/1排队系统
4.1 Expected Values 数学期望值
4.2 Probability Generating Function 概率生成函数
4.3 Mean Waiting Time 平均等待时间
Local Area Networks 局域网
5.1 Introduction to Local Area Networks 局域网简介
5.2 Channel Access Techniques 信道接入技术
5.3 Random Access Methods 随机接入方法
5.4 Central Control Access Methods 集中式接入方法
Graph Theory 图论
6.1 A Brief Introduction 简介
6.2 Basic concepts 基本概念
6.3 Network Representations 网络表示方式
6.4 Graph search algorithms 搜索算法概论
6.5 Breadth first search 广度优先查找
6.6 Depth first search 深度优先查找
6.7 Algorithm Analysis 算法分析
6.8 Graph Sorting algorithms 图的排序
6.9 Dijkstra’s Algorithm D算法
6.10 Floyd–Warshall Algorithm F算法
6.11 Floyd–Warshall Algorithm Problem F算法习题
6.12 Minimum Spanning Tree 最小支撑树
6.13 Maximum Flows 最大流
6.14 The minimum cost flow problem 最小费用流
6.15 Algorithms Overviews 算法小结
Network Reliability 网络可靠性
7.1 Network reliability Definitions and Motivations 网络可靠性的定义
7.2 Probabilistic Models 概率模型
7.3 Reliability of Complex system 复杂系统可靠性
7.4 Static Reliability 确定性可靠性
展开全部
预备知识
证书要求
为积极响应国家低碳环保政策， 2021年秋季学期开始，中国大学MOOC平台将取消纸质版的认证证书，仅提供电子版的认证证书服务，证书申请方式和流程不变。
电子版认证证书支持查询验证，可通过扫描证书上的二维码进行有效性查询，或者访问 https://www.icourse163.org/verify，通过证书编号进行查询。学生可在“个人中心-证书-查看证书”页面自行下载、打印电子版认证证书。
完成课程教学内容学习和考核，成绩达到课程考核标准的学生（每门课程的考核标准不同，详见课程内的评分标准），具备申请认证证书资格，可在证书申请开放期间（以申请页面显示的时间为准），完成在线付费申请。
认证证书申请注意事项：
1. 根据国家相关法律法规要求，认证证书申请时要求进行实名认证，请保证所提交的实名认证信息真实完整有效。
2. 完成实名认证并支付后，系统将自动生成并发送电子版认证证书。电子版认证证书生成后不支持退费。
参考资料
1) Performance Analysis of Telecommunications and Local Area Networks, Wah Chun Chan, Kluwer Academic Publishers, 2000
2) Introduction to Queueing Theory, Robert B Cooper, Elsevier North Hooland, 1981
3) Network Flows, Theory Algorithms and Applications, Ravindra K.Ahuja, Thomas L. Magnanti, James B. Orlin.
浙公网安备 33010802012594号
