发布时间 : 星期五 文章计算机网络系统方法(英文版)课后习题及解答更新完毕开始阅读80fc960a0740be1e640e9a03
48. Repeat the previous exercise, now with the assumption that Ethernet is p -persistent with p = 0.33 (that is, a waiting station transmits immediately with probability p when the line goes idle, and otherwise defers one 51.2-μs slot time and repeats the process). Your timeline should meet criterion (1) of the previous problem, but in lieu of criterion (2), you should show at least one collision and at least one run of four deferrals on an idle line. Again, note that many solutions are possible.
第三章
（3.1 3.2节）
1.Using the example network given in Figure 3.30, give the virtual circuit tables for all the switches after each of the following connections is established. Assume that the sequence of connections is cumulative, that is, the ?rst connection is still up when the second connection is established, and so on. Also assume that the VCI assignment always picks the lowest unused VCI on each link, starting with 0.
(a) Host A connects to host B.
(b) Host C connects to host G.
(c) Host E connects to host I.
(d) Host D connects to host B.
(e) Host F connects to host J.
(f) Host H connects to host A.
3.For the network given in Figure 3.31, give the datagram forwarding table for each node. The links are labeled with relative costs; your tables should forward each packet via the lowest-cost path to its destination.
5. Consider the virtual circuit switches in Figure 3.33. Table 3.6 lists, for each switch, what port, VCI (or VCI, interface) pairs are connected to other. Connections are bidirectional. List all endpoint-to-endpoint connections.
13. Given the extended LAN shown in Figure 3.34, indicate which ports are not selected by the