Computer Network Homework2’s hard question

2. What is the signal which is used to modulate the original signal?

A. analog signal

B. digital signal

C. carrier signal

D. base signal

(2 points)

Answer:

C

Explanation:

original signal指最原始的想要被传给别人的信号

5.In which of the following fibers,light rays follow sinusoidal paths along the fibers?

A.Single-mode fiber

B.step-index multimode fiber

C.graded-index multimode fiber

Answer:

C

7.Which of the following UTP(unshielded twisted pair) is most suitable for 1000Mbps network?

A.cat3

B.cat 4

C.cat 5

D.cat6

Answer:

D

8. Which of the following is the function of data link layer?

A.transfering original bit stream

B.transfering data between processes

C.routing

D.transfer data in a physical network

Answer:

D

11. If the selective repeat protocol (sliding window) is used, how much is the timeout set to at least?

A. somewhat more than 4 times RTT

B. somewhat more than 2 times RTT

C. somewhat more than RTT

D. somewhat less than RTT

Answer:

B

Explanation:

收到错序帧返回NAK,发送要重传的帧返回确认帧,超时时间要大于这两个来回的时间以防止超时重传。

13. For the PPP protocol, what protocol is applied to get IP address?

A. LCP

B. IPCP

C. IPXCP

D. CHAP

(2 points)

Answer:

B

Suppose the sequence numbers can be reused in a Seletive Repeat protocol, the sending window size is SWS and the receiving window size is RWS, how many sequence numbers are required at least? Please explain it.

Answer:

SWS+RWS  (未批改)

Explanation:

因为如果发送方发送了新的(未收到确认)SWS帧,接收方收到后依次上传给上层协议并发送确认帧,此时接收窗口必须移到新的RWS个序号,否则,发送方重新发送的帧会落在接收窗口内被错误接收。这样的话重发的SWS个帧的序号与接收窗口的序号必须不同,因为至少需要SWS+RWS个序号。

4. If a stop-and-wait protocol is used on a 10Mbps point-to-point link,the maximum length of a frame is 4000 bytes, the link length is 2000km (propagation speed is 200000km/s),how much is the maximum utilization of bandwidth(maximum throughput/bandwidth)?

Answer:
13.8%

Explanation:
throughput=包长/(发送时间+RTT)
= 4000bytes/(4000bytes/10Mbps
+ 2*2000km/200000km/s)
=4000*8bits/(3.2ms+20ms)
=32/23.2Mbps
=1.38Mbps
(因为ACK很短,这里忽略了ACK的发送时间)
util=1.38/10=13.8%

5. If the sliding window protocol is applied to the above question and the sending window size is equal to 5, how much is the maximum utilization of bandwidth?

Answer:
69%

Explanation:
throughput=包长/(发送时间+RTT)
= 5*4000bytes/(5*4000bytes/10Mbps
+ 2*2000km/200000km/s)
=5*4000*8bits/(5*3.2ms+20ms)
=5*32/36 Mbps
=4.44Mbps
(因为ACK很短,这里忽略了ACK的发送时间)
util=4.44/10=44.4%
=======
上面有错。因为流水方式,当发送窗口满了时收到每帧的确认都会立即发出一个新的帧,所以,每个回合应该只考虑一帧的发送时间。5*4000*8bits/(3.2ms+20ms)=6.9
util=6.9/10=69%

8. In PPP protocol, which protocol will be used to determine whether the authentication step is needed?

Answer:
LCP

1. For a stop-and-wait protocol, how many sequence numbers are required at least? Please explain it.

Answer:
2个或者1比特。(未批改)

Explanation:
正常情况是不需要序号的。出错的情况有三种:(1)数据帧丢失(2)确认帧丢失(3)确认帧在超时时间之后返回。如果没有序号,(2)(3)会出现重复接收,(3)还会出现错误确认。用2个序号就可以防止这些错误出现。

5. With the Selective Repeat (SR) protocol, the receiver must send an ACK (it can delay some time or combine serveral ACKs) when receiveing an Data Frame any time, true or false?  Please explain it.

Answer:
TRUE (未批改)

Explanation:
一个帧落在接收窗口之内当然要发送确认帧,以防止前面的确认丢失。即使一个帧落在接收窗口之外也必须发送确认帧,因为会出现RWS的确认帧全部丢失的情况,以后重发的帧都会落在接收窗口之外。

Computer Network Homework2’s hard question的更多相关文章

  1. Computer Network Homework3’ s hard question

    Computer Network Homework3’ s hard question 1. Which kind of protocol does CSMA belong to? A. Random ...

  2. codeforces GYM 100114 J. Computer Network 无相图缩点+树的直径

    题目链接: http://codeforces.com/gym/100114 Description The computer network of “Plunder & Flee Inc.” ...

  3. codeforces GYM 100114 J. Computer Network tarjan 树的直径 缩点

    J. Computer Network Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100114 Des ...

  4. SGU 149. Computer Network( 树形dp )

    题目大意:给N个点,求每个点的与其他点距离最大值 很经典的树形dp...很久前就想写来着...看了陈老师的code才会的...mx[x][0], mx[x][1]分别表示x点子树里最长的2个距离, d ...

  5. (中等) CF 555E Case of Computer Network,双连通+树。

    Andrewid the Android is a galaxy-known detective. Now he is preparing a defense against a possible a ...

  6. [J]computer network tarjan边双联通分量+树的直径

    https://odzkskevi.qnssl.com/b660f16d70db1969261cd8b11235ec99?v=1537580031 [2012-2013 ACM Central Reg ...

  7. [Codeforces 555E]Case of Computer Network(Tarjan求边-双连通分量+树上差分)

    [Codeforces 555E]Case of Computer Network(Tarjan求边-双连通分量+树上差分) 题面 给出一个无向图,以及q条有向路径.问是否存在一种给边定向的方案,使得 ...

  8. Sgu149 Computer Network

    Sgu149 Computer Network 题目描述 给你一棵N(N<=10000)个节点的树,求每个点到其他点的最大距离. 不难想到一个节点到其他点的最大距离为:max(以它为根的子树的最 ...

  9. computer network layers architecture (TCP/IP)

    computer network layers architecture (TCP/IP) 计算机网络分层架构 TCP/IP 协议簇 OSI 模型(7 层) TCP/IP (4 层) Applicat ...

随机推荐

  1. Oracle DBA 学习总结

    对于学习Oracle 数据库,应该先要了解Oracle 的框架.它有物理结构(由控制文件.数据文件.重做日志文件.参数文件.归档文件.密码文件组成) ,逻辑结构(表空间.段.区.块),内存分配( SG ...

  2. Chrome OS 更新新版本可让Linux访问USB连接的Android设备

    谷歌再次为Chrome OS带来了重大版本更新,使版本号达到了75.本次更新的一大亮点就是允许在Chrome OS上运行的Linux能够识别通过USB方式连接的Android设备,能够让用户使用Lin ...

  3. Arch Linux 安装rust

    Arch Linux 安装rust 0. 参考 Rust Toolchain 反向代理使用帮助 1. 安装 安装rustup和toolchain yaourt -S rustup rustup ins ...

  4. 一次NaN引发的npe

    # 先上代码 import com.alibaba.fastjson.JSON; import com.alibaba.fastjson.JSONObject; public class QQ { p ...

  5. [HDU 3521] [最小割] Being a Hero

    题意: 在一个有向图中,有n个点,m条边$n \le 1000 \And \And  m \le 100000$ 每条边有一个破坏的花费,有些点可以被选择并获得对应的金币. 假设一个可以选的点是$x$ ...

  6. 【CF750E】New Year and Old Subsequence

    题目大意:给定一个长度为 N 的字符串,定义一个字串是"好的",当且仅当字串中含有一个 "2017" 的子序列,且不含有 "2016" 的子 ...

  7. 绑定与非绑定方法及反射,isinstance和issubclass内置函数

    目录 绑定方法与非绑定方法 1.绑定方法 2.非绑定方法(staticmethod) isinstance和issubclass 内置函数 1.isinstance 2.issubclass 反射(面 ...

  8. 字符串类QString

    采用Unicode编码,所以一个QChar占用两个字节使用隐式共享技术来节省内存和减少不必要的数据拷贝跨平台使用,不用考虑字符串的平台兼容性QString直接支持字符串和数字之间的相互转换QStrin ...

  9. centos7安装bower遇到的问题

    Bower依赖node, npm和git. 安装nodejs遇到 Error: Package: 1:nodejs-6.11.1-1.el7.x86_64 (epel) Requires: libht ...

  10. 【C#-读取XML文件】XMLReader读取XML文档

    使用   XmlReader.Create("文件路径")   加载xml文件 XmlReader使用流的方式来读取. //使用XMLReader读取XML数据 XmlReader ...