Broadcast Routing Route a packet from a source to all nodes in the network Possible solutions: – Flooding: Each node sends packet on all outgoing links Discard packets received a second time – Spanning Tree Routing: Send packet along a tree that includes all of the nodes in the network
2.1 生灭过程 2.1.1 生灭过程的定义 2.1.2 生灭过程状态概率的微分差分方程 2.1.3 生灭过程的简单应用 2.2 生灭过程的一般平衡解 2.2.1 生灭过程在极限情况下的概率分布 2.2.2 生灭过程平衡状态下的方程 2.2.3 排队系统的状态转移率图 2.2.4 平衡方程的解 2.3 M / M / 1排队系统 2.4 可变到达率的 M / M / 1排队系统 2.5 应答服务系统 M / M / 2.6 具有m 个服务者的系统 M / M / m 2.7 有限存储系统 M / M / 1 / N
Routing Must choose routes for various origin destination pairs (O/D pairs) or for various sessions – Datagram routing: route chosen on a packet by packet basis Using datagram routing is an easy way to split paths – Virtual circuit routing: route chosen a session by session basis