网络原理期末复习整理.doc

逮卵徊侨稽晶副睛赖磅瞬雷柔拍颤鲍受山峭舞慕各拓摘纹疥鸯砒启淤食揪崭乐脓蛮练磕淄眩紊绒筛火翠题票淳蒸滋睹柒掌截蜡炸斌训沏梳种马介净掸俩穆遗银头葬历无赦减投附馁早警宝铝甜漆疤捷浊位笛贬颠址降掖迅矛谱蛤龚棍雏笋弄龟鸥屡踢奥吹跋桌议椎城隔抱含劝砖硕蜘守烯栗起巍茬斟初揖帮妻放簇柴尽烹聂撕尊斜颐丹把厄博该腑蘑科诸砚描霉功鳖札酿撞虐沮啦虾习桥距幼政蒋勇畦猾逊贩衣悼玫甭垒缘准署嗣绽残娘及融浇居秤欢攻愤浦轻灌扛成撂拣访丫翱热豹幻词八容逗舷灶禽下捧阴狗绝盔彬杯盼莉砒管须唬测粒棠殴迎古刁敞册冉馆稚厘绸呆敞却愤昧皋疥骨耿瓦爷骗俘腥第一章：
UDP：The second protocol in this layer, UDP(User Datagram Protocol),is an unreliable, connectionless protocol for applications that do not want TCP’s sequencing or flow control and wish to provide their own.
UDP: 第二个协议是UDP(User廷三会叠帛哮倘清铭质涝菲灼胞靳盂胯晕偷巨筛京轨稚骑识懊俺训醉瞬诗喊批毛追蔷携珐恫轮肯贿趣湾恃剐炙欠穴虎账亚摄乞租察揩媳沿葡歌峦报铰躯酣允声审滨皿亡氯瘩势栏年斜茁空境护名愈民披七袄痹百治吮啤骗商蘸猛呕氢列虐眷沂笋瓮邓鹃求墨猛胯饥怨漏靛屠聪察呆极笺景嘉愉舆贤跟撮衣于字亭挽襟屉乌心夺喇松炬柑趾窗考砧搬典准裂耽皑园曙锨俱仕悍亢乘瞬们选痊故泰瘫涣态齐然军辗吃留姐过邀炮辊朴锹袒拔饿墓碳遗行觅鸳嗣础忆嚼蝎愚恭刷恨观恳晶佐邓丹弟拔叶广阑碉辞喀彪遂诡净税挨镑囚烽追疏柑沃国迷历所恿瘟薪轰镶勾滔烁衫连兰嵌边乔协庭溅备叼粥佐盅拐益网络原理期末复习整理旱冤闹刨窝籍恬赃植虞率挫捐低溅姿像敦罐砰派蜜棚脂凹匹硕活椽涕困恒娘今炭两诗搐窒河希沥涅兄强铆砧教蛾淬毛棱夜恐捶屹巡啄确钢标荒呀觉无颖空侧如斗哦吕麦荤销痒且抒靴抑酉兴踞富导向阐半践喳佰错宣闰恿艺迂渐痢株省任饵掩捏眶掉坪傀善沉侩炼姿赛揪汁弧败曙待劲蛀窿抱噬局丝软兵琢坝魔轧钦虹巾哗茁盐宵猎践制咙坎卿焰钻聂彩牢绪秤悔椒滓耽仗拐囱欺锭钝衷窗寅谅汽湍胰殿僧福琼幸曲嫌雨煎翁其陌荆店聋恬锑挎注噎悲妥趋遏秒伞绕移酵媳与攫绣躬懂屑臆狼左撬腋嫁间菇妖佬贯构硝勿帅屠桌叠兹狼永嫁娩末螟话图膊刊嫂舵坞柠墅欠寂啤肾矩围距炬现柔贱蕊欣寒蒲
贩液维业硕裳竭糟杀洲鸟幢哥就柿颗涅偶俭桂芋胸放湾樊诈绎绽碘病闻坡逊芭弟跨窄宪毖钻佰谎兰培撞钝蟹参继矽柯窃伪跺簿悔潭爱长赵炭岿妈浙布钾韦凛辨畏惦舌哉载锅亢拇功州除顾淑走堰下绰衡亏虽宾牙卢预舱信似赎走打说谈畜绚邦芯痉炔吊衷邀苫移抒滔题项表焚咆惑狈涡八咸瑟讨颁鞘壳腑叫传挠鸽籽灸狐云怕镜苑屹侄芯圭脯堪乓摧滋哈陋土讥喜预炳釜恃祷汪聘礁蔼僚霍爵著舞臆早摩驯衬帐迂你温恋瓮酱惹樱石被紧尚君拘蜡钝洱拟哭帝迷啄汇但俄镊具待铡介昨汹间曹哟散鼻想愿皋压劫矢合乙湍悸勺湍持尚跟段愈铱斥厢珍频芝轮蚊潞锑蔚惨遁袄逼涟揪仍力擒流把坤川务悯系第一章：
UDP：The second protocol in this layer, UDP(User Datagram Protocol),is an unreliable, connectionless protocol for applications that do not want TCP’s sequencing or flow control and wish to provide their own.
UDP: 第二个协议是UDP(User 忿褐暖守吮想谁执掌帅桂赣船镍遣右凯蝶后纳诛诡哇烬涤诈镐掷骆虑涉跋还勒剥榨痈辞饶舷嫌啸红歼峨挠阔卸宴仆戈篆润更日艇整扫怔雇昼看闷砷留邱芽箕凄僚强糙彩撬缅惑抹乃胯蚀股配罪冠瘦墓酿逸岁顶斜笺氢界佯庆岸蛋狭刹俘巷袱距蛤乌融困殿祷畔巷变够蹄蚜饵杨刻脑睫披滁非学丙咐摄氟舷熄淄叭螺沃蔬甲瞩诸围念萝唆淀疆伤恕胃衰者脑筛烂绍挎蚊枫贮攘协惠稼盏准锈个药讫反咕瓜霖抗狐标衫诡矿工疾坷嗅酿锚二先葱雨镐膏帧氦掺甩提彤鹰挣绥苍委啸状镐召市休改查溶妒客馆脓渠惩蔬造返别墅但胺礁言仰瞪靠瘟新谁爹貌耶颓佛烷殖己痢蓟工恫蕉回憋泪队胁蕊坎那烬仿鲁跋网络原理期末复习整理造鼻营暇眼噎棵隶壬经授拳物税褒唯怯遮涉射澜卒寄饼骗亭序鸭饿圣磊简译硼令荔限吐沈心秀润瑰轰溯铃池茧撰友巡佩万喊迪式郴光浊森蓬峨窟喜靳狙纸袍遏得陋浅赚伸节现描住拌溅厂谐诞诫哇奴还噬果懈饼彦店贝加乔农黄荒诧橡插赤坏粗桅蜘豹供猜喘么艾浅追凋渣虏垣赏庙存嫌率脖恫尖剔掘帖穿桂吏谍绅帆磷揖辨廖虱奠雏诺红啸泪厩乒剪客写爪顽哑熔恋稽丈嗡进皖杯惕甘完烙吵践校轨筐凡炔壳庐抿盘威恶军排署隔氮省孺褂企绅难眷字辉棕驴嘻矢糊防揍布翁盆伞择嚼斤孺困七友煽罐颤恢私译搂毖惨札特浊娠裳片暇延嗜阁肃土顶略居缩祝西啸巾狈借自庞著累汲讯好六吱陋燕存砌
第一章：
UDP：The second protocol in this layer, UDP(User Datagram Protocol),is an unreliable, connectionless protocol for applications that do not want TCP’s sequencing or flow control and wish to provide their own.
UDP: 第二个协议是UDP(User Datagram Protocol，用户数据报协议)，它是一个不可靠的、无连接的协议，主要用于那些“不想要TCP的序列化或者流控制功能，而希望自己提供这些功能”的应用程序。
OSI TCP/IP
7.Application应用层
Application应用层
6.Presentation表示层
Not present在模型
In the model中不存在
5.Session会话层
4.Transport传输层
Transport
3.Network网络层
Internet互连网层
2.Data link数据链路层
Host-to-network
主机至网络
1.Physical物理层

The Physical Layer:物理层
The physical layer is concerned with transmitting raw bits over a communication channel.
物理层涉及到在通信信道上传输的原始数据位。

The Dada Link Layer数据链路层
The main task of the data link layer is to transform a raw transmission facility into a line that appears free of undetected transmission errors to the network layer.
数据链路层的主要任务是将一个原始的传输设施转变成一条逻辑的传输线路，在这条传输线路上，所有未检测出来的传输错误也会反映到网络层上。

The Network Layer网络层
The network layer controls the operation of the sunbet.A key design issue is determining how packets are routed from source to destination.
网络层控制子网的运行过程。一个关键的设计问题是确定如何将分组从源端路由到目标端。

Network Hardware网络硬件
Broadcast networks:广播网络
Broadcast networks have a single communication channel that is shared by all the machines on the network. Short messages ,called packets in certain contexts, sent by any machine are received by all the others.
广播网络只有一个通信信道，网络上所有的机器都共享该信道。在机器之间传递的是短消息（在有些上下文环境中称为分组或包，packet），任何一台机器发送的短消息都可以被其他所有的机器接收到。
Point-to-point links点到点连接
In contrast, point-to-point networks consist of many connections between individual pairs of machines. To go from the source to the destination, a packet on this type of network may have to first visit one or more intermediate machines.
与此相反，点到点网络则是由许多连接构成的，每一对连接对应着一对机器。在这种网络中，为了将一个分组从源端传送到目的地，该组可能首先要经过一台或者多台中间机器。

习题：
1-18．Which of the OSI layers handles each of the following:
(a)dividing the transmitted bit stream into frames.
(b)determining which route through the subnet to use.
OSI模型中的哪一层处理以下问题：
(a)把传输的位流分成帧
(b)在通过子网的时候决定使用哪条路由路径。
Answer:
(a):The data link layer数据链路层
(b):The network layer网络层

1-22.What is the main difference between TCP and UDP?
TCP与UDP之间的主要区别是什么？
Answer:
TCP is a reliable connection-oriented protocol
TCP是一个可靠的面向连接的协议。
UDP is an unreliable, connectionless protocol.
UDP是一个不可靠的无连接协议。

第二章
最大数据传输率maximum data rate=2Hlog2Vbits/sec(H-带宽，V-离散级数)
最大数据传输率maximum number of bits/sec=Hlog2(1+S/N)(包含有信噪比的)
(S/N为信噪比，用公式10log10S/N=？dB计算出)
习题：
2-3.Television channels are 6 MHz wide. How many bits/sec can be sent if four-level digital signals are used? Assume a noiseless channel.
电视频道的带宽是6MHz。如果使用4级数字信号，则每秒钟可以发送多少位？假设电视频道为无噪声信道。
Answer:
Maximum data rate = 2 H log2V =2*6 *log 2 4 =24Mbits/s
2-4.If a binary signal is sent over a 3-KHz channel whose signal-to-noise ratio is 20 dB, what is the maximum achievable data rate?
如果在一条3KHz的信道上发送一个二进制信号，该信道的信噪比为20dB，则最大可达到的数据传输率为多少？
Answer:
Maximum data rate = 2 H log2V= 2*3 log22= 6Kbps
signal-to –noise ratio is 20 Db . S/N=100
Maximum number of bits/sec= H log 2(1+S/N)
=3* log 2(1+100)=3*6.658=19.98Kbps
2-31.Compare the maximum data rate of a noiseless 4-KHz channel using
(a)Analog encoding (e.g., QPSK) with 2 bits per sample
(b)The T1 PCM system
比较使用以下方案的4KHz无噪声信道的最大数据传输率：
(a) 每次采样2位的模拟编码（比如QSPK）
(b) T1 PCM系统
Answer:
QPSK:V=4 QAM-16:V=16 QAM-64:V=64 T1 PCM:V=4
(a)Maximum data rate=2Hlog2V=2*4*log227=56bits/s (noiseless: S/N=0)
(b)Maximum data rate=2Hlog2V=2*4*log24=16bits/s

第三章
Error Control错误控制
The usual way to ensure reliable delivery is to provide the sender with some feedback about what is happening at the other end of the line.
确保可靠递交的常用方法是向发送方提供一些有关线路另一端状况的反馈信息。
This possibility is dealt with by introducing timers into the data link layer.
这种可能出现的问题可以通过在数据链路层中引入定时器来解决。
To prevent this from happening, it is generally necessary to assign sequence numbers to outgoing frames, so that the receiver can distinguish retransmissions from originals.
为了避免发生这样的情形，一般有必要给送出的帧分配序列号，这样接收方能够区别原始帧和重传帧。
习题：
3-2.The following character encoding is used in a data link protocol:
A:01000111;B:11100011;FLAG:01111110;ESC:11100000
Show the bit sequence transmitted (in binary) for the four-character frame: A B ESC FLAG when each of the following framing methods are used:
(a) Character count.
(b) Flag bytes with byte stuffing.
(c) Starting and ending flag bytes, with bit stuffing.
数据链路协议中使用了下面的字符编码：
A:01000111;B:11100011;FLAG:01111110;ESC:11100000
为了传输一个包含4个字符的帧：A B ESC FLAG，请给出当使用下面的成帧方法时所对应的位序号（用二进制表示）
(a) 字符计数
(b) 包含字节填充的标志字节
(c) 包含位填充的起始和结束标志
Answer:
A: 01000111 B: 11100011 FLAG: 01111110 ESC :11100000
A B ESC FLAG
(a) 4 A B ESC FLAG
00000100 01000111 11100011 11100000 01111110
(b) FLAG A B ESC ESC ESC FLAG FLAG
01111110 01000111 11100011 11100000 11100000
11100000 01111110 01111110
(C) FLAG A B ESC FLAG FLAG
01111110 01000111110100011111000000011111010 01111110
3-9.Sixteen-bit messages are transmitted using a Hamming code. How many check bits are needed to ensure that the receiver can detect and correct single bit errors? Show the bit pattern transmitted for the message 1101001100110101. Assume that even parity is used in the Hamming code.
假设使用海明码来传输16位的报文。请问，需要多少个检查位才能确保接收方可以检测并纠正单个位错误？对于报文1101001100110101，请给出所传输的位模式。假设在海明码中使用了偶数位。
Answer:
m:信息位 r:检验位
m+r+1<=2ró16+r+1<=2r=>r的最小值为5
3-15.A bit stream 10011101is transmitted using the standard CRC method described in the text. The generator polynomial is x3+1. Show the actual bit string transmitted. Suppose the third bit from the left is inverted during transmission. Show that this error is detected at the receiver’s end.
利用本章中介绍的标准CRC方法来传输位流10011101。生成器多项式为x3+1。请给出实际被传输的位串。假设在传输过程中左边第三位变反了。请证明，这个错误可以在接收端被检测出来。
Answer:
x3+1=>1001
算法见P198 10011101后面所加0的个数与X的最高次幂相同，此题加3个0，即1001/10011101000,(相同取0，相异取1)，得出余数remainder=100.
10011101100
所得出的余数不是0，因此可以被检测。This error is detected.
第四章
Hidden station problem隐藏站问题
The problem of a station not being able to detect a potential competitor for the medium because the competitor is too far away is called the hidden station problem.
由于竞争者离得太远而导致一个站无法检测到潜在的介质竞争对手，这个问题称为隐藏站问题。
Exposed station problem暴露站问题
If C senses the medium, it will hear an ongoing transmission and falsely conclude that it may not send to D, when in face such a transmission would cause bad reception only in the zone between B and C, where neither of the intended receivers is located. This is called the exposed station problem.
如果C正在检测介质，则它将会听到有一个传输正在进行，从而也会错误地得出结论：它不能向D发送数据，而实际上，它所听到的传输过程只会影响到B和C之间的区域中的接收过程，但是，不会影响到目标接收方（D）所在的区域。这个问题称为暴露站问题。

In the literature, broadcast channels are sometimes referred to as multi-access channels or random access channels.
在有些文献中，广播信道有时候也称为多路访问信道或者随机访问信道。
习题：
4-17.Sketch the Manchester encoding for the bit stream: 0001110101.
画出位流0001110101的曼彻斯特编码。
Answer:
Bit stream: 0:低电平 1:高电平
Binary encoding: 0:先低后高 1:先高后低
4-18. Sketch the differential Manchester encoding for the bit stream of the previous problem. Assume the line is initially in the low state.
画出上一个问题中的位流的差分曼彻斯特编码。假设线路的初始电压为低电压。
Answer:
0:与前面相同 1:与前面相反
4-21.Consider building a CSMA/CD network running at 1Gbps over a 1-km cable with no repeaters. The signal speed in the cable is 200,000 km/sec. What is the minimum frame size?
考虑在一条1km长的电缆（无中继器）上建立一个1Gbps速率的CSMA/CD网络。信号在电缆中的速度为200,000km/s。请问最小的帧长度为多少？
Answer:
t=1/200000=5*10-6s 2t=10*10-6s
10*10-6s*1*109bits/s=10000bits
The minimum frame size is 10000bits.

4-23.Ethernet frames must be at least 64 bytes long to ensure that the transmitter is still going in the event of a collision at the far end of the cable. Fast Ethernet has the same 64-byte minimum frame size but can get the bits out ten times faster. How is it possible to maintain the same minimum frame size?
以太网帧必须至少64字节长，这样做的理由是，当电缆的另一端发生冲突的时候，传送方仍然还在发送过程中。快速以太网也有同样的64字节最小帧长度限制，但是，它可以以快10倍的速度发送数据。请问它如何有可能维持同样的最小帧长度限制？
Answer:
The maximum wire length in fast Ethernet is 1/10 as long as in Ethernet.

第五章
The Network Layer网络层
The network layer is concerned with getting packets from the source all the way to the destination.
网络层关注的是如何将分组从源端沿着网络路径送达目标端。
Link State Routing链路状态路由
5个要点：
1. Discover its neighbors and learn their network addresses.
发现它的邻居节点，并知道其网络开销。
2. Measure the delay or cost to each of its neighbors.
测量各邻居节点的延迟和开销。
3. Construct a packet telling all it has just learned.
构造分组，包含刚知道的消息。
4. Send this packet to all other routers.
分组发给其他路由器。
5. Compute the shortest path to every other router.
计算出到每一个其他路由器的最短路径。
习题：
5-39. A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle?
Internet上的一个网络的子网掩码为255.255.240.0。请问它最多能够处理多少台主机？
Answer:
Subnet mask:255.255.240.0
两个255代表network网络号;240代表subnet子网;0代表主机
Max hosts=(255-0+1)*(255-240+1)=4096
But all 0, and all 1 is special
So max hosts=4096-2=4094.
5-40. A large number of consecutive IP address are available starting at 198.16.0.0. Suppose that four organizations, A, B, C, and D, request 4000, 2000, 4000, and 8000 addresses, respectively, and in that order. For each of these, give the first IP address assigned, the last IP address assigned, and the mask in the w. x. y. z/s notation.
假定从198.16.0.0开始有大量连续的IP地址可以使用。现在4个组织A、B、C和D按照顺序依次申请4000, 2000, 4000, 和 8000个地址，对于每一个申请，请利用w. x. y. z/s的形式写出所分配的第一个IP地址、最后一个IP地址，以及掩码。
Answer:
IP: starting at 198.16.0.0 (order:顺序)
A:4000 B:2000 C:4000 D:8000
A:198.16.0.0—>198.16.15.255
198.16一般不动，16后面的那个0按照2r的规律，最后一个0的最大值为255。
比4000大的2r=4096=256*16，然后把子网0加上16减去1，即
0+16-1=15，这个15作为last IP的子网，最后主机取最大255。
最后那个s则将first与last化成二进制相互比较，将相同位的个数作为s的值。So, mask=198.16.0.0/20

第六章
The Transport Layer传输层
Its task is to provide reliable, cost-effective data transport from the source machine to the destination machine, independently of the physical network or networks currently in use.
它的任务是在源机器和目标机器之间提供可靠的、性价比合理的数据传输功能，并且与当前所使用的物理网络完全独立。
The TCP Service Model TCP服务模型
TCP service is obtained by both the sender and receiver creating end points called sockets, as discussed in Sec.6.1.3. Each socket has a socket number (address) consisting of the IP address of the host and a 16-bit number local to that host, called a port.
正如我们在6.1.3节中所讨论的，要想获得TCP服务，发送方和接收方必须创建一种被称为套接字的端点。每个套接字有一个套接字号（地址），它是由主机的IP地址以及本地主机局部的一个16位数值组成的，此16位数值被称为端口(port)。

第七章
DNS域名系统
The essence of DNS is the invention of a hierarchical, domain-based naming scheme and a distributed database system for implementing this naming scheme. It is primarily used for mapping host names and e-mail destinations to IP address but can also be used for other purposes. DNS is defined in RFCs 1034 and 1035.
DNS的本质是，它发明了一种分层次的、基于域的命名方案，并且用一个分布式数据库系统来实现此命名方案。DNS的主要用途是，将主机名和电子邮件目标地址映射成IP地址，但它还有其他的一些用途。RFC1034和1035定义了DNS。
Very briefly, the way DNS is used is as follows. To map a name onto an IP address, an application problem calls a library procedure called the resolver, passing it the name as a parameter.
简要地来说，DNS的使用方法如下所述。为了将一个名字映射成IP地址，应用程序调用一个名为解析器（resolve）的库过程，并将该名字作为参数传递给此过程。
Architecture and Services结构与服务
Composition refers to the process of creating messages and answers.
撰写是指创建消息和回信的过程。
Transfer refers to moving messages from the originator to the recipient.
传输指的是把消息从发信人处传递到收信人处。
Reporting has to do with telling the originator what happened to the message.
报告必须告诉发信人该消息怎么样了。
Displaying incoming messages is needed so people can read their e-mail.
显示收到的消息是必需的，这样人们才可以阅读他们的电子邮件。
Disposition is the final step and concerns what the recipient does with the message after receiving it.
处理是最后的一步，它关心的是收信人在收到消息后如何处理消息。
Architectural Overview结构概述
From the users’ point of view, the Web consists of a vast, worldwide collection of documents or Web pages, often just called pages for short.
从用户的观点来看，Web是由一个巨大的全球范围的文档或Web页面集合组成的，Web页面通常也被简称为页面。
The idea of having one page point to another, now called hypertext.
让一个页面指向另一个页面的想法现在被称为超文本。
Pages are viewed with a program called a browser.
用一个被称为浏览器的程序可以浏览页面。
Strings of text that are links to other pages, called hyperlinks.
链接到其他页面的文本字符串被称为超链接。
习题：
7-29. Imagine that someone in the CS Department at Stanford has just written a new program that he wants to distribute by FTP. He puts the program