计算机网络课后作业以(中英文对照)
计算机网络英文版习题答案
P63 #5 Consider sending a packet of F bits over a path of Q links. Each link transmits at R bps. The network is lightly loaded so that there are no queuing delays. Propagation delay is negligible.a.Suppose the network is a packet-switched virtual-circuit network. Denote the VC setup time by t s seconds. Suppose the sending layers add a total of h bits of header to the packet. How long does it take to send the file from source to destination?t s+[(F+h)/R]Qb.Suppose the network is a packet-switched datagram network and a connectionless service is used. Now suppose each packet has 2h bits of header. How long does it take to send the packet?[(F+2h)/R]Qc.Finally, suppose that the network is a circuit-switched network. Further suppose that the transmission rate of the circuit between source and destination is R bps. Assuming ts setup time and h bits of header appended to the packet, how long does it take to send the packet?t s+(F+h)/RP64 #6 This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters and suppose that the propagation speed along the link is s meters/sec. Host A sends a packet of size L bits to host B.[a] Express the propagation delay, d prop, in terms of m and s.[b] Determine the transmission time of the packet, d trans, in terms of L and R.[c] Ignoring processing and queueing delays, obtain an expression for the end-to-end delay.[d] Suppose Host A begins to transmit the packets at time t=0. At time t=d trans, where is the last bit of the packet?[e] Suppose d prop is greater than d trans. At time t=d trans, where is the first bit of the packet?[f] Suppose d prop is less than d trans. At time t=d trans, where is the first bit of the packet?[g] Suppose s=2.5 x 108, L=100 bits and R=28kbps. Find the distance m so that d prop = d trans.[a] d prop = m/s[b] d trans = L/R[c] end-to-end delay = d prop + d trans=m/s+L/R[d] The beginning position of the link.[e] On the channel between A and B.[f] On the host B.[g] m/s = L/R = > m = sL/R = > m = 892.86 kmP65 #10 Consider the queueing delay in a router buffer. Suppose that all packets are L bits, the transmission rate is R bps, and that N packets simultaneously arrive at the buffer every LN/R seconds. Find the average queueing delay of a packet (in terms of L, R and N). (Hint: The queueing delay for the first packet is zero; for the second packet L/R; for the third packet 2L/R. The Nth packet has already been transmitted when the second batch of packets arrives.)As the Nth packet has already been transmitted when the next batch of packets arrive, we only need to consider the delay for a single batch of packets.Average delay = Total delay / Number of packetsDelay for 1st packet = 0Delay for 2nd packet = L/RDelay for 3rd packet = 2L/R......Delay for Nth packet = (N-1)L/RTotal delay for N packets = (0 + 1 + 2 ... +(N-1) ) * (L/R)Using the formulas for sum of integer series, this can be written as: Total delay for N packets = (N-1) * (N/2) * (L/R)Therefore, average delay for N packets = ((N-1) * L) / 2RP170 #12 What is the difference between persistent HTTP with pipelining and persistent HTTP without pipelinning? Which of the two is used by HTTP/1.1?For the persistent connection without pipelining, the client issues a new request only when the previous has been received. In this case, the client experiences one RTT in order to request and receive each of the referenced objects.For the persistent connection with pipelining, the client issues a request as soon as it encounters a reference. It is possible for only RTT to be expended for all the referenced objects.P170 #14 Telnet into a Web server and send a multiline request message. Include in the request message theIf-modified-since: header line to force a response message with the 304 Not Modified status code.GET/somedir/exp.html HTTP/1.1Host: Connection: closeUser-agent: Mozilla/4.0If-Modified-Since: Thu, 30 May 2007 12:00:00 GMTAccept-language: frP172 #6 Suppose within your web browser you click on a link to obtain a web page. The IP address for the associated URL is not cached in your local host, so a DNS look-up is necessary to obtain the IP address. Suppose that n DNS servers are visited before your host receives the IP address from DNS; the successive visits incur an RTT (Round Trip Time) of RTT1, ... RTTn. Further suppose that the web page associated with the link contains exactly one object, consisting of a small amount of HTTP text. Let RTT0 denote the RTT between the local host and the remote server containing the object. Assuming zero transmission time of the object, how much time elapses from when the client clicks on the link until the client receives the object? (Hint: read pages 90 .. 93)Time to visit DNS servers and get IP address = RTT1 + RTT2 + ... + RTTnTime to establish TCP connection (SYN and SYNACK) = RTT0Time to send HTTP request and receive reply = RTT0Total time = 2 * RTT0 + (RTT1 + RTT2 + ... + RTTn)P171 #16 Suppose Alice with a Web-based e-mail account (such as Yahoo! Mail or Hotmail) sends a message to Bob, who accesses his mail from his mail server using POP3. Discuss how the message gets from Alice’s host to Bob’s host. Be sure to list the series of application-layer protocols that are used to move the message between the two hosts.The series of application-layer protocols: HTTP、SMTP、POP3Suppose that you send an e-mail message whose only data is a Microsoft Excel attachment. What might the header lines (including MIME lines) look like?From:***********To:***********Subject: helloMIME-Version: 1.0Content-Transfer-Encoding: base64Content-Type: Application/MS-ExcelP286 #5 Suppose host A sends two TCP segments back to back to host B over a TCP connection. The first segment has sequence number 90: the second has sequence number 110.a.How much data is in the first segment?a.20 bytesb.Suppose that the first segment is lost but the second segment arrives at B. In the acknowledgement that host B sends to host A, what will be the acknowledgement number?b.ACK90P291 #27 Consider the following plot of TCP window size as a function of time. (reproduced below for you) Assuming TCP Reno is the protocol experiencing the behavior shown above, answer the following questions. In all cases, you should provide a short discussion justifying your answer.a. Identify the intervals of time when TCP slow start is operating.b. Identify the intervals of time when TCP congestion avoidance is operating.c. After the 16th transmission round, is segment loss detected by a tripleduplicate ACK or by a timeout?d. After the 22nd transmission round, is segment loss detected by a triple duplicate ACK or by a timeout?e. What is the initial value of Threshold at the first transmission round?f. What is the value of Threshold at the 18th transmission round?g. What is the value of Threshold at the 24th transmission round?h. During what transmission round is the 70th segment sent?i. Assuming a packet loss is detected after the 26th round by the receipt of a triple duplicate ACK, what will be the values of the congestion-window size and of Threshold?Solution:a.1-6, 23-26b.6-16, 17-22c.a triple duplicate ACKd.timeoute.32f.21g.13h.7i.4, 4P293 #34 Consider sending an object of size O = 100 Kbytes from server to client. Let S = 536 bytes and RTT = 100 msec. suppose the transport protocol uses static windows with window size W. (See Section 3.7.2)a.For a transmission rate of 28 kbps, determine the minimum possible latency. Determine the minimum window size that achieves this latency.b.Repeat (a) for 100 kbps.tency=28.8s W=2tency=8.2s W=4P405 #8 Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has t he following forwarding table:-----------------------------------------------------Prefix Match Interface-----------------------------------------------------00 001 110 211 3-----------------------------------------------------For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range.6P407 #15 Consider sending a 3000-byte datagram into a link that has a MTU of 500 bytes. Suppose the original datagram is stamped with the identification number 422. How many fragments are generated? What are their characteristics?there are「2980/480」=7 fragments be generatedP408 #22 Consider the network shown in Problem 21 (reproduced below). Using Dijkstra’s algorithm, and showing your work using a table similar to Table 4.3, do the following:a. Compute the shortest path from s to all network nodesSteps D(t),P(t) D(u),P(u)D(v),P(v)D(w),P(w)D(x),P(x)D(y),P(y)D(z),P(z)0 1,s 4,s ∞∞∞∞∞1 3.t 10,t ∞∞5,t 3,t2 4,u 6,u ∞5,t 3,t3 4,u 6,u ∞5,t4 5,v 7,v 5,v5 6,w 5,v6 6,wPlease fill in the following tables using DV algorithm:For the node Z in the graph shown in the 22nd topic (P408), please fill in the following routing table in the router z about the initial distance-vector Destination node Next hop Current shortest distancevalue-DzS —∞T T 2U —∞V —∞W —∞X —∞Y Y 14Z Z 0following rout-ing table in the node z to update this routing tableDestination node Currentdistance-DyDestination node Current distance-DtS 5 S 1 T 4 T 0 U 2 U 2P493 #7 How big is the MAC address space？The IPv4 address space？The IPv6 address space?MAC address: 6 bytes, MAC address space 2^48IPV4 address: 4 bytes, IPV4 address space 2^32IPV6 address: 16 bytes, IPV6 address space 2^128P494 #4 Consider the 4-bit generator, G, shown in Figure 5.8, and suppose the D has the value 10101010. What is the value of R?G=1001, D=10101010, R=101。
(完整版)计算机网络课后作业以及答案(中英文对照)
Chapter11-11.What are two reasons for using layered protocols?(请说出使用分层协议的两个理由)答：通过协议分层可以把设计问题划分成较小的易于处理的片段。
分层意味着某一层的协议的改变不会影响高层或低层的协议。
1-13. What is the principal difference between connectionless communication and connection-oriented communication?(在无连接通信和面向连接的通信两者之间，最主要的区别是什么？)答：主要的区别有两条。
其一：面向连接通信分为三个阶段，第一是建立连接，在此阶段，发出一个建立连接的请求。
只有在连接成功建立之后，才能开始数据传输，这是第二阶段。
接着，当数据传输完毕，必须释放连接。
而无连接通信没有这么多阶段，它直接进行数据传输。
其二：面向连接的通信具有数据的保序性，而无连接的通信不能保证接收数据的顺序与发送数据的顺序一致。
1-20. A system has an n-layer protocol hierarchy. Applications generate messages of length M bytes. At each of the layers, an h-byte header is added. What fraction of the network bandwidth is filled with headers?(一个系统有n层协议的层次结构。
应用程序产生的消息的长度为M字节。
在每一层上需要加上一个h字节的头。
请问，这些头需要占用多少比例的网络带宽)答：hn/(hn+m)*100%1-28. An image is 1024 x 768 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it take to transmit it over a 56-kbps modem channel? Over a 1-Mbps cable modem? Over a 10-Mbps Ethernet? Over 100-Mbps Ethernet?(一幅图像的分辨率为1024 x 768像素，每个像素用3字节来表示。
Computer network中英文对照简介
Computer network计算机网络A computer network is a group of more computers connected to each electronically. This means that the computers can "talk" to each other and that every computer in the network can send information to the others. Usually, this means that the speed of the connection is fast - faster than a normal connection to the Internet.计算机网络是一组多台计算机连接到每个电子。
这意味着计算机可以“讲”给对方，并且每一个在网络上的计算机可以将信息发送到其他。
通常情况下，这意味着连接速度快 - 速度比正常的连接到互联网。
Some basic types of computer networks include:▪ A local area network (often called a LAN) connects two or more computers, and may be called a corporate network in an office or business setting.▪An "internetwork", sometimes called a Wide Area Network (because of the wide distance between networks) connects two or more smaller networks together. The largest internetwork is called the Internet.计算机网络的一些基本类型包括：局域网络（通常被称为一个LAN）连接两个或更多的计算机，并可能被称为一个企业网络，在办公室或业务设置。
计网课后习题答案(英文)
Review Questions第一章1.Which characteristics of a multiterminal system make it different from a computer network?A processing power of multiterminal systems remained fully centralized, whilecomputer networks have a distributed processing power.一个多端系统处理能力仍然完全集中，而计算机网络具有分布式处理能力。
2.When were the first important results achieved in the field of joining computers using long-haul links?In the late 60s在60年代后期3.What is ARPANET?A.A network of supercomputers belonging to military organizations and research institutes in the United StatesB.An international scientific research networkC.The technology of creating WANsA is correct4.When did the first network operating systems appear?In the late 60s60年代后期5.In what order did the events listed here take place?A.The invention of WebB.The development of standard LAN technologiesC.The start of voice transmission in digital form through telephone networksThe invention of World Wide Web互联网的诞生6.Which of the events stimulated LAN development?Appearance of large-scale integrated circuits (LSI devices) resulted in invention of microcomputers which in its turn stimulated a research activity in the area of local computer networks (LANs). The adoption of personal computers was a powerful incentive for the development of LANs.大规模集成电路（LSI器件出现）导致这反过来刺激了研究活动在本地计算机网络（LAN）的微型计算机的发明。
计算机网络中英文互译
DWDM (Deｎｓe WDM) 密 集 波 分 复 用
AＲQ (Autｏmaｔic Rｅpeａt reQｕest) 自 动 请 求 重 发
ATM (Ａsynchronous Ｔransｆeｒ Moｄe) 异 步 传 递 方 式
ATU (Aｃceｓs Tｅrminatioｎ Unit) 接 入 端 接 单 元
ATU-C (Accesｓ Ｔermination Unit Ceｎtraｌ Ofｆicｅ ) 端 局 接 入 端 接 单 元
ＣCIＴT (Cｏnsultatiｖe Commｉｔtee, Intｅrnａtional Tｅlｅgraph and Tｅlｅpｈone）国际电报电话咨询委员会
CCＰ 通信控制处理机
CＤＭ (Cｏde Division Mulｔiplexinｇ) 码 分 复 用
CDMA (Ｃoｄe Ｄivisioｎ Ｍuｌtipｌex Aｃｃｅｓs) 码 分 多 址 ﻫCNNＩC (Neｔwｏｒｋ Information Centeｒ of China) 中 国 互 联 网 络 信 息 中 心
CＡP (Cａｒrierｌｅss Amplituｄe Phaｓe) 无 载 波 振 幅 相 位 调 制 ﻫCATV (Comｍunｉty Antenna TV, CAble ＴV) 有 线 电 视
CＢＲ ( Constant Bit Ｒatｅ ) 恒 定 比 特 率 ﻫCCIR （Ｃｏｎsultatiｖe Ｃommiｔｔｅe，Ｉnternational Rａdio） 国 际 无 线 电 咨 询 委 员 会
计算机网络专业词汇中英对照
《计算机网络》中英文对照Chapter 1End system P28 端系统Modem P29 调制解调器（俗称：猫）Base station P29 基站Communication link P30 通信链路Physical media P30 物理介质Coaxial cable P30 同轴电缆Fiber optics P30 光纤Radio spectrum P30 射频频谱Transmission rate P30 传输速率Packets P30 （数据）包，或分组Routers P30 路由器Link-layer switches P30 链路层交换机Path P30 路径ISP (Internet Service Provider) P30 网络服务提供商TCP (Transmission Control Protocol) P31 传输控制协议IP ( Internet Protocol) P31 网际协议Intranets P31 内网API (Application Programming Interface) P32 应用程序编程接口Network edge P35 网络边缘Access Networks P38 接入网Ethernet P42 以太网Network core P48 网络核心Circuit Switching P50 电路转换Packet Switching 分组交换FDM (frequency-division multiplexing) P50 频分多路复用TDM (time-division multiplexing) P50 时分多路复用Statistical Multiplexing 统计复用Store-and-forward 存储转发Queuing delays P53 排队延迟Transmission delay P60 传输延迟，或发送延迟Propagation delay P60 传播延迟Throughput P59 吞吐量Internet backbone P57 骨干网Delay P59 延迟，或时延Loss P59 丢包Packet-Switched Network P59 分组交换网络Nodal processing delay P60 节点处理延迟End-to-end delay P66 端到端延迟Instantaneous throughput P68 瞬时吞吐量Network interface card P74 网络接口卡（即网卡）Message P75 消息，或报文Segment P75 （报文）段Datagram P75 数据报Frames P75 帧Packet sniffer P82 数据包监听器Protocol Stack 协议栈Peer entities 对等实体Chapter 2 应用层Server farm P110 服务器集群Infrastructure P110 基础设施，或基础架构Self-scalability P111 自扩展性Timing P114 实时性Bandwidth-sensitive applications P115带宽敏感应用Connection-oriented service P117 面向连接的服务Directory service P121 目录服务Base HTML 基本HTML文件Stateless protocol P124 无状态协议RTT (round-trip time ) P126 往返时间Web proxy caches P128 网页代理缓存Status line P130 状态行Out-of-band P141 （频）带外（的）In-band P141 带内（的）User agents P144 用户代理Mail servers P144 邮件服务器Pull protocol P148 拉式协议Push protocol p148 推式协议Host aliasing P158 主机别名Canonical hostname P158 规范主机名Mail server aliasing P158 邮件服务器别名Load distribution P158 负载分配Top-level domain (TLD) servers P161 顶级域名服务器Authoritative DNS servers P161 权威域名服务器Iterative queries P168 迭代查询Resource records (RRs) P165 资源记录Overlay network P179 覆盖网Nonpersistent HTTP 非持久HTTP，或非坚持HTTP Persistent HTTP 持久性HTTP，或坚持的HTTP Peer-to-Peer (P2P) Network 对等网络Socket programming 套接字编程Chapter 3 传输层Multiplexing and demultiplexing P226 复用与分用Unidirectional data transfer P241 单向数据传送Finite-state machine (FSM) P242 有限状态机Positive acknowledgments P243 肯定确认Negative acknowledgments P243 否定确认Countdown timer P250 （倒数）计时器Cumulative acknowledgment P258 累积确认Receive buffer P269 接收缓冲区，或接收缓存Resource-management cells 资源管理单元Source (port number) 源端口号Destination (port number) 目的端口号Checksum 校验与Pipelined protocols 流水线（型）协议Go-back-N 回退NSelective Repeat 选择重传Timeout （定时器）超时Fast Retransmit 快速重传Flow Control 流量控制Three way handshake 三次握手sequence number 序列号（简写为seq）acknowledgement number 确认号（简写为ack；注意与大小的ACK不同）Congestion Control 拥塞控制additive increase, multiplicative decrease 加性增乘性减Slow Start 慢启动congestion-avoidance 拥塞避免fast recovery 快速恢复duplicate (ACK) 冗余（ACK）Random Early Detection 随机早期检测Chapter 4 网络层Forwarding table P338 转发表Virtual-circuit networks P343 虚电路网络Datagram networks P343 数据报网络Signaling message P346 信令报文Content Addressable Memory P354 内容可寻址存储器Crossbar switch P356 纵横开关Active queue management 主动队列管理Head-of-the-line (HOL) 队头Classless interdomain routing (CIDR) P371 无类域间路由Plug-and-play P376 即插即用Anycast P386 任播Interior gateway protocols P414 内部网关协议Routing information Protocol P414 路由信息协议（RIP）Open shortest Path First OSPF P414 开放最短路径优先Area border routers P419 区域边界路由器Sequence-number-controlled flooding P430 序列号控制的洪泛，或带序列号的受控洪泛Reverse path forwarding (RPF) P431 逆向路径转发Rendezvous point P433 汇聚点Longest prefix matching 最长前缀匹配Scheduling 调度Fragmentation 分片，或分段Fragment Offset 报文段偏移量Network Address Translation (NAT) 网络地址转换NAT traversal NAT穿越Multicast 组播，或多播Unicast 单播Tunneling 隧道技术Link-State Routing Algorithm 链路状态路由算法Distance Vector Routing Algorithm 距离向量路由算法Count to Infinity Problem 无穷计数问题Hierarchical Routing 分层路由autonomous systems 自治系统BGP (Border Gateway Protocol) 边界网关协议in-network duplication 网内复制broadcast storm 广播风暴spanning tree 生成树redundant packets 冗余数据包Chapter 5 数据链路层，或链路层Broadcast channels P461 广播信道Trailer fields P464 尾部字段Link access P464 链路接入，或链路访问Network interface card P466 网络接口卡（即网卡）Parity checks P469 奇偶校验Forward error correction (FEC) P471 前向纠错Cyclic Redundancy Check 循环冗余校验Polynomial code P472 多项式码（即CRC码）Multiple access P475 多路接入Random access protocols P477 随机接入协议CSMA/CD P484 带冲突检测的载波侦听多路访问CSMA/CA 带冲突避免的载波侦听多路访问Token passing protocol P487 令牌传递协议ARP P491 地址解析协议Preamble P497 前导（字段）Exponential backoff P502 指数回退，或指数退避Repeater P504 中继器Virtual-channel identifier P520 虚拟信道标识Cell-loss priority P520 信元丢失优先权Label-switched router P524 标签交换路由器Framing （封装）成帧error detection 误差检测，或检错Channel Partitioning 信道分割式（MAC协议）Taking turns MAC protocol 轮流式MAC协议Collision 冲突，或碰撞Time Slot 时隙Slotted ALOHA 时隙ALOHAUnslotted ALOHA 无时隙ALOHA Nonpersistent CSMA 非坚持CSMA1-persistent CSMA 1坚持CSMAp-persistent CSMA p坚持CSMAToken Ring 令牌环(Wireless) LAN （无线）局域网Hub 集线器Collision domain 冲突域Bridge 网桥。
计算机网络中英文对照外文翻译文献
中英文资料外文翻译计算机网络计算机网络，通常简单的被称作是一种网络，是一家集电脑和设备为一体的沟通渠道，便于用户之间的沟通交流和资源共享。
网络可以根据其多种特点来分类。
计算机网络允许资源和信息在互联设备中共享。
一．历史早期的计算机网络通信始于20世纪50年代末，包括军事雷达系统、半自动地面防空系统及其相关的商业航空订票系统、半自动商业研究环境。
1957年俄罗斯向太空发射人造卫星。
十八个月后，美国开始设立高级研究计划局(ARPA)并第一次发射人造卫星。
然后用阿帕网上的另外一台计算机分享了这个信息。
这一切的负责者是美国博士莱德里尔克。
阿帕网于来于自印度，1969年印度将其名字改为因特网。
上世纪60年代，高级研究计划局(ARPA)开始为美国国防部资助并设计高级研究计划局网(阿帕网)。
因特网的发展始于1969年，20世纪60年代起开始在此基础上设计开发，由此，阿帕网演变成现代互联网。
二．目的计算机网络可以被用于各种用途:为通信提供便利:使用网络，人们很容易通过电子邮件、即时信息、聊天室、电话、视频电话和视频会议来进行沟通和交流。
共享硬件:在网络环境下，每台计算机可以获取和使用网络硬件资源，例如打印一份文件可以通过网络打印机。
共享文件：数据和信息: 在网络环境中，授权用户可以访问存储在其他计算机上的网络数据和信息。
提供进入数据和信息共享存储设备的能力是许多网络的一个重要特征。
共享软件:用户可以连接到远程计算机的网络应用程序。
信息保存。
安全保证。
三．网络分类下面的列表显示用于网络分类：3．1连接方式计算机网络可以据硬件和软件技术分为用来连接个人设备的网络，如：光纤、局域网、无线局域网、家用网络设备、电缆通讯和G.hn（有线家庭网络标准）等等。
以太网的定义，它是由IEEE 802标准，并利用各种媒介，使设备之间进行通信的网络。
经常部署的设备包括网络集线器、交换机、网桥、路由器。
无线局域网技术是使用无线设备进行连接的。
计算机网络英文版——提供给学生部分习题答案
计算机⽹络英⽂版——提供给学⽣部分习题答案Solution of Selected Exercises from the End of Chapter ExercisesChapter 1 - Introduction And Overview1.4 To what aspects of networking does data communications refer?Answer:Data communications refers to the study of low-level mechanisms and technologies used to send information acrossa physical communication medium, such as a wire, radio wave, or light beam.1.5 What is packet-switching, and why is packet switching relevant to the Internet?Answer: Packet switching divides data into small blocks, called packets, and includes an identification of the intended recipient in each packet. Packet switching changed networking in a fundamental way, and provided the basis for the modern Internet. Packet switching allows multiple senders to transmit data over a shared network.1.8 What is a communication protocol? Conceptually, what two aspects of communication does a protocol specify? Answer: A communication protocol refer to a specification for network communication.Major aspects of a protocol are syntax (format) and semantics (meaning) of the protocol.1.9 What is a protocol suite, and what is the advantage of a suite?Answer:protocols are designed in complete, cooperative sets called suites or families, instead of creating each protocol in isolation. Each protocol in a suite handles one aspect of communication; together, the protocols in a suite cover all aspects of communication. The entire suite is designed to allow the protocols to work together efficiently. 1.11 List the layers in the TCP/IP model, and give a brief explanation of each.(See Textbook)1.14 Give a brief explain of the layers in the ISO Open System Interconnection model.(See Textbook)Chapter 3 - Internet Applications And Network Programming3.1 What are the two basic communication paradigms used in the Internet?Answer: There are various approaches, but according to textbook, we can specify them as Stream Paradigm and Message Paradigm.3.2 Give six characteristics of Internet stream communication.(See Textbook)3.3 Give six characteristics of Internet message communication.(See Textbook)3.4 If a sender uses the stream paradigm and always sends 1024 bytes at a time, what size blocks can the Internet deliverto a receiver?Answer: stream paradigm does not provide any guarantees for block sizes, so all depends on individual transfer.3.6 What are the three surprising aspects of the Internet’s message delivery semantics?Answer:The Internet’s message delivery has the followi ng undesirable characteristics:* Messages can be lost* Messages can be duplicated* Messages can be delivered out-of-order3.8 When two applications communicate over the Internet, which one is the server?Answer: T he application that waits for some other applications to contact is called server, and the application that contact other one is called client.3.14 What two identifiers are used to specify a particular server?Answer: A particular server is identified by the following identifiers:* An identifier for the computer on which a server runs (IP Address)* An identifier for a particular service on the computer (Port Number)Chapter 4 - Traditional Internet Applications4.1 What details does an application protocol specify?(See Textbook)4.3 What are the two key aspects of application protocols, and what does each include?(See Textbook)4.6 What are the four parts of a URL, and what punctuation is used to separate the parts?Answer: The URL into four components: a protocol, a computer name, a document name, and parameters. The computer name and protocol port are used to form a connection to the server on which the page resides. And the document name and parameters are used to request a specific page.4.7 What are the four HTTP request types, and when is each used?(See Textbook)4.12 When a user requests an FTP directory listing, how many TCP connections are formed? Explain.Answer: FTP uses two types of connections to perform its functionality, namely* A control connection is reserved for commands. Each time the server needs to download or upload a file, the server opens a new connection.* A data connection is used to transfer files.4.16 List the three types of protocols used with email, and describe each.(See Textbook)4.17 What are the characteristics of SMTP?(See Textbook)4.20 What are the two main email access protocols?Answer: Two major email access protocols are:* Post Office Protocol (POP)* Internet Mail Access Protocol (IMAP)Chapter 6- Information Sources and Signals6.4 State and describe the four fundamental characteristics of a sine wave.(See Textbook)6.9 What is the analog bandwidth of a signal?Answer: Analog bandwidth of signal can be defined as to be the difference between the highest and lowest frequencies of the constituent parts (i.e., the highest and lowest frequencies obtained by Fourier analysis)6.11 Suppose an engineer increases the number of possible signal levels from two to four. How many more bits can be sent in the same amount of time? Explain.Answer: The number of levels that can be represented by n bits is given by 2n . So if number of levels changes from 2→4, it means number of bits goes from 1→2612. What is the definition of baud?Answer: Baud is defined as the number of times that a signal can change per second.6.14 What is the bandwidth of a digital signal? Explain.Answer: According to the definition of analog bandwidth, a digital signal has infinite bandwidth because Fourier analysis of a digital signal produces an infinite set of sine waves with frequencies that grow to infinity.6.18 What is the chief advantage of a Differential Manchester Encoding?Answer: The most important property of differential encoding is that the encoding works correctly even if the two wires carrying the signal are accidentally reversed.6.20 If the maximum frequency audible to a human ear is 20,000 Hz, at what rate must the analog signal from a microphone be sampled when converting it to digital?Answer: The sampling rate = 2 × f max, so the signal should be sampled at 2x20,000 = 40,000 HzChapter 7 - Transmission Media7.2 What are the three energy types used when classifying physical media according to energy used?Answer: Three types of energy used when classifying physical media are electrical, electromechanical (radio), and light7.4 What three types of wiring are used to reduce interference form noise?(See Textbook)7.10 List the three forms of optical fiber, and give the general properties of each.(See Textbook)7.21 What is the relationship between bandwidth, signal levels, and data rate?Answer: If a transmission system uses K possible signal levels and has an anal og bandwidth B, Nyquist’s Theorem states that the maximum data rate in bits per second, D, is: D = 2 B log2K7.22 If two signal levels are used, what is the data rate that can be sent over a coaxial cable that has an analog bandwidthof 6.2 MHz?Answer: Using the D= 2 B log2 K relationship, D = 2*6.2*log22 = 2*6.2*1 = 12.4 Mbps7.24 If a system has an input power level of 9000, and an output power level of 3000, what is the difference when expressed in dB?Answer: Decibel is expressed as 10log10(P out/P in) → 10log10(3,000/9,000) = to be determined by reader7.23 If a system has an average power level of 100, an average noise level of 33.33, and a bandwidth of 100 MHz, whatis the effective limit on channel capacity?Answer: Shannon theorem specify the maximum data rate that could be achieved over a transmission system that experiences noise: C = Blog2 (1 + S/N) = 100,000,000 * log2 (1 + 100/33.33) = 100,000,000 * log24 = 200,000,000 = 200 Mbps7.25 If a telephone system can be created with a signal-to-noise ratio of 40 dB and an analog bandwidth of 3000 Hz, how many bits per second could be transmitted?Answer: First we should convert 40 dB to a real number, namely if 40 = 10 log10S/N→S/N = 10,000 , Using the Shannon’s capacity expression C = B log2(1 + S/N) → C = 3,000 log2 (1+ 10,000) = to be determined by readerCh 8 - Reliability And Channel Coding8.1 List and explain the three main sources of transmission errors.(See Textbook)8.3 In a burst error, how is burst length measured?Answer: For a burst error, the burst size, or length, is defined as the number of bits from the start of the corruption to the end of the corruption.8.4 What is a codeword?Answer: We can define the set of all possible messages to be a set of datawords, and define the set of all possible encoded versions to be a set of codewords. So each possible code sequence is considered to be a codeword.8.8 Compute the Hamming distance for the following pairs: (0000, 0001), (0101, 0001), (1111, 1001), and ( 0001, 1110). (See Textbook)8.11 Generate a RAC parity matrix for a (20, 12) coding of the dataword 100011011111.(See Textbook)8.15 Express the two values in the previous exercise as polynomials.Answer:X10+ X7 + X5 + X3 + XX4+ X2+ 1Ch 9 - Transmission Modes9.1 Describe the difference between serial and parallel transmission.Answer: Transmission modes can be divided into two fundamental categories:* Serial: one bit is sent at a time* Parallel: multiple bits are sent at the same time9.2 What are the advantages of parallel transmission? What is the chief disadvantage?Answer: A parallel mode of transmission has two chief advantages:* High speed: Because it can send N bits at the same time, a parallel interface can operate N times faster than an equivalent serial interface.* Match to underlying hardware: Internally, computer and communication hardware uses parallel circuitry.Thus, a parallel interface matches the internal hardware well.The main disadvantage of parallel transmission is number of cables required, for long distance communication, this is an important consideration.9.4 What is the chief characteristic of asynchronous transmission?Answer:Asynchronous transmission can occur at any time, with an arbitrary delay between the transmission of two data items, it allows the physical medium to be idle for an arbitrary time between two transmissions.Chapter 11 - Multiplexing And Demultiplexing11.2 What are the four basic types of multiplexing?(See Textbook)11.4 What is a guard band?Answer: For proper communication without interference, we should choose a set of carrier frequencies with a gap between them known as a guard band. The guard band reduces or eliminates the possible interference between neighboring carrier signals.11.8 Explain how a range of frequencies can be used to increase data rate.Answer:To increase the overall data rate, a sender divides the frequency range of the channel into K carriers, and sends 1 /K of the data over each carrier.11.12 Suppose N users compete using a statistical TDM system, and suppose the underlying physical transport can sendK bits per second. What is the minimum and maximum data rate that an individual user can experience?Answer: If we neglect the overhead generated by statistical TDM, a system will have two possibilities: * Minimum: If all channels have equal data then the rate will be K/N bps* Maximum: If only one channel active and the others are passive, then rate will be K bpsChapter 13 - Local Area Networks: Packets, Frames, And Topologies13.1 What is circuit switching, and what are its chief characteristics?Answer: The term circuit switching refers to a communication mechanism that establishes a path between a sender and receiver with guaranteed isolation from paths used by other pairs of senders and receivers. The circuit switching has the following main characteristics:* Point-to-point communication* Separate steps for circuit creation, use, and termination* Performance equivalent to an isolated physical path13.3 In a packet switching system, how does a sender transfer a large file?Answer: The packet switching system requires a sender to divide each message into blocks of data that are known as packets . The size of a packet varies; each packet switching technology defines a maximum packet size. So, a large file will be divided into smaller pieces and sent.13.5 What are the characteristics of LANs, MANs, and W ANs?Answer: There are lots of details that can be said and discussed for categorization of network types based on geography, few points are highlighted below:* Local Area Network (LAN): Least expensive; spans a single room or a single building* Metropolitan Area Network (MAN) Medium expense; spans a major city or a metroplex* Wide Area Network (WAN) Most expensive; spans sites in multiple cities13.6 Name the two sublayers of Layer 2 protocols defined by IEEE, and give the purpose of each.Answer: The Layer 2 protocols defined by IEEE defines two sub-layers as mentioned below:* Logical Link Control (LLC) Addressing and demultiplexing* Media Access Control (MAC) Access to shared media13.8 What are the four basic LAN topologies?Answer: The four basic LAN topologies are star, ring, mesh and bus.13.10 In a mesh network, how many connections are required among 20 computers?Answer: The expression to calculate number of connections in a mesh network is given by n (n-1)/2. So for 20 computers then number of connections required will be = 20 (20 – 1)/2 =19013.15 Give a definition of the term frame .Answer: In a packet-switched network, each frame corresponds to a packet processed at data link layer.Chapter 14 - The IEEE MAC Sub-Layer14.1 Explain the three basic approaches used to arbitrate access to a shared medium.(See Textbook)14.3 List the three main types of channelization and the characteristics of each.(See Textbook)14.6 What is a token, and how are tokens used to control network access?Answer: A special control message is called a token. In a token passing system, when no station has any packets to send, the token circulates among all stations continuously. When a station captures the token, it sends its data, and when transmission completed, it releases the token.14.8 Expand the acronym CSMA/CD, and explain each part.Answer: The acronym CSMA/CD stands for Carrier Sense Multi-Access with Collision Detection, which means the following: * Carrier Sense: Instead of allowing a station to transmit whenever a packet becomes ready, Ethernet requires each station to monitor the cable to detect whether another transmission is already in progress.* Multiple Access: The system allows multiple users/hosts to make use of a common/shared media* Collision Detection. A collision can occur if two stations wait for a transmission to stop, find the cable idle, and both start transmitting.14.10 Why does CSMA/CD use a random delay? (Hint: think of many identical computers on a network.)Answer: Randomization is used to avoid having multiple stations transmit simultaneously as soon as the cable is idle.That is, the standard specifies a maximum delay, d, and requires each station to choose a random delay less than d after a collision occurs. In most cases, when two stations each choose a random value, the station that chooses the smallest delay willChapter 15 - Wired LAN Technology (Ethernet And 802.3)15.1 How large is the maximum Ethernet frame, including the CRC?Answer: According to Fig. 15.1 a conventional Ethernet frame has the following fields:* Header: 14 bytes (fixed)* Payload: 46-1500 bytes (there is a minimum frame size because of collision detection)* CRC: 4 bytes (fixed)Accordingly an Ethernet frame will be maximum 1518 bytes and minimum 64 bytes15.3 In an 802.3 Ethernet frame, what is the maximum payload size?Answer: The 802.3 Ethernet makes use of 8-bytes of the original/conventional Ethernet for Logical Link Control / Sub-Network Attachment Point (LLC / SNAP) header instead of extending/increasing the header. This is for sake of backward compatibility. So the maximum pay load is reduced from 1500 bytes to 1492 bytes.15.6 How did a computer attach to a Thicknet Ethernet?Answer: Hardware used with Thicknet was divided into two major parts:* Transceiver: A network interface card (NIC) handled the digital aspects of communication, and a separate electronic device called a transceiver connected to the Ethernet cable and handled carrier detection, conversion of bits into appropriate voltages for transmission, and conversion of incoming signals to bits.* AUI: A physical cable known as an Attachment Unit Interface (AUI) connected a transceiver to a NIC in a computer. A transceiver was usually remote from a computer.15.7 How were computers attached to a Thinnet Ethernet?Answer: Thinnet Ethernet (formally named 10Base2) uses a thinner coaxial cable that was more flexible than Thicknet. The wiring scheme differed dramatically from Thicknet. Instead of using AUI connections between a computer and a transceiver, Thinnet integrates a transceiver directly on the NIC, and runs a coaxial cable from one computer to another.15.8 What is an Ethernet hub, and what wiring is used with a hub?Answer: An electronic device that serves as the central interconnection is known as a hub. Hubs were available in a variety of sizes, with the cost proportional to size. The hubs are becoming old-fashioned, and being replaced with switches.15.3 What category of twisted pair wiring is needed for a 10 Mbps network? 100 Mbps? 1000 Mbps?Answer: The three major categories of Ethernet and their wiring is listed below:* 10 Mbps: 10BaseT (Ethernet) Category 5* 100 Mbps: 100BaseT (Ethernet Fast) Category 5E* 1 Gbps: 1000BaseT (Gigabit Ethernet) Category 6Chapter 20 - Internetworking: Concepts, Architecture, and Protocols20.2 Will the Internet be replaced by a single networking technology? Why or why not?Answer: Incompatibilities make it impossible to form a large network merely by interconnecting the wires among networks. The beauty of the Internet is interconnection of wide range of technologies from various manufacturers.Diversity of the products and solutions is a richness instead of limitation as long as they all adopt the same set of protocols.20.3 What are the two reasons an organization does not use a single router to connect all its networks?Answer:An organization seldom uses a single router to connect all of its networks. There are two major reasons: * Because the router must forward each packet, the processor in a given router is insufficient to handle the traffic passing among an arbitrary number of networks.* Redundancy improves internet reliability. To avoid a single point of failure, protocol software continuously monitors internet connections and instructs routers to send traffic along alternative paths when a network or router fails.20.6 In the 5-layer reference model used with the TCP/IP Internet protocols, what is the purpose of each of the five layers?(See 1.11)Chapter 21- IP: Internet Addressing21.3 In the original classful address scheme, was it possible to determine the class of an address from the address itself? Explain.Answer:Yes, since in the classful addressing scheme initial bit(s) gives indication about the class being used.21.7 If an ISP assigned you a /28 address block, how many computers could you assign an address?Answer: When an organization is assigned /28 CIDR address, it means 28 bits out of 32 bits are fixed, so 32-28 = 4 bits available for user space. So number of users 24-2 = 4, since the all 0s and all 1s address are having special use and can’t be assigned to a user.21.8 If an ISP offers a / 17 address block for N dollars per month and a / 16 address block for 1.5 N dollars per month,which has the cheapest cost per computer?Answer: Number of addresses in /17 block 232-17 = 215Price per address: N /215 = N / 215Number of addresses in /16 block 232-16 = 216Price per address: 1.5N /216 = 0.75N/215 So /16 address block will be cheaper in comparison with the price given for /17 block.21.10 Suppose you are an ISP with a / 24 address block. Explain whether you accommodate a request from a customer who needs addresses for 255 computers. (Hint: consider the special addresses.)Answer: For a/24 address block, number of available addresses will be 232-24 = 28 = 256. However, a suffix with all 0s address is reserved for network ID and a suffix with all 1s address is reserved for broadcast address, so number of addresses that can be assigned to computers/hosts will be 256 -2 = 254.21.11 Suppose you are an ISP that owns a / 22 address block. Show the CIDR allocation you would use to allocateaddress blocks to four customers who need addresses for 60 computers each.Answer: The /22 address block can be assigned as follows:ddd.ddd.ddd.00/26ddd.ddd.ddd.01/26ddd.ddd.ddd.10/26ddd.ddd.ddd.11/26Chapter 22- Datagram Forwarding22.1 What are the two basic communication paradigms that designers consider when designing an internet?Answer:* Connection-oriented service * Connectionless service22.2 How does the Internet design accommodate heterogeneous networks that each have their own packet format?Answer: To overcome heterogeneity, the Internet Protocol defines a packet format that is independent of the underlying hardware. The result is a universal, virtual packet that can be transferred across the underlying hardware intact. The Internet packet format is not tied directly to any hardware. The underlying hardware does not understand or recognize an Internet packet.22.5 What is the maximum length of an IP datagram?In the current version of the Internet Protocol (IP version 4), a datagram can contain at most 64 K (65535) octets, including the header.22.7 If a datagram contains one 8-bit data value and no header options, what values will be found in header fields H.LEN and TOTAL LENGTH?Answer: H. LEN indicated header in 32-quantities, since no options, then this value will be 5. The TOTAL LENGTH indicated the number of bytes in a datagram including the header. This means 5x4 bytes + 1 (8-bits) = 21 bytesChapter 23 - Support Protocols And Technologies23.1 When a router uses a forwarding table to look up a next-hop address, the result is an IP address. What must happenbefore the datagram can be sent?Answer: Each router along the path uses the destination IP address in the datagram to select a next-hop address, encapsulates the datagram in a hardware frame, and transmits the frame across one network. A crucial step of the forwarding process requires a translation: forwarding uses IP addresses, and a frame transmitted across a physical network must contain the MAC address of the next hop.23.2 What term is used to describe the mapping between a protocol address and a hardware address?Answer: Translation from a computer’s IP address to an equivalent hardware address is known as address resolution, and an IP address is said to be resolved to the correct MAC address. The TCP/IP protocol being used for this is called Address Resolution Protocol (ARP). Address resolution is local to a network.23.5 How many octets does an ARP message occupy when used with IP and Ethernet addresses?Answer: According to Fig 23.3 an ARP message has 7-lines of each being 32-bit (4 bytes or octets), therefore,number of octets in an ARP can be determined as 7x4 = 28 octets23.10 What types of addresses are used in layers below ARP?Answer:ARP forms a conceptual boundary in the protocol stack; layers above ARP use IP addresses, and layers below ARP use MAC addresses.23.17 What is the chief difference between BOOTP and DHCP?Answer:The main difference is that the BOOTP protocol required manual administration. So before a computer could use BOOTP to obtain an address, a network administrator had to configure a BOOTP server to know the computer’s I P address. Chapter 24 - The Future IP (IPv6)24.3 List the major features of IPv6, and give a short description of each.(See Textbook)24.4 How large is the smallest IPv6 datagram header?Answer: IPv6 datagram header consists of a base header + zero or more extension header. Since, smallest header is being asked, we assume zero extension header and consider IPv6 will have only base header. If we look at IPv6 header format in Fig. 24.3, it shows that 10x4 bytes = 40 bytes.Chapter 26 - TCP: Reliable Transport Service26.2 List the features of TCP.(See Textbook)26.6 When using a sliding window of size N, how many packets can be sent without requiring a single ACK to be received?Answer: If the size of the window is N, then it means a sender can transmit up to N packets without waiting for an ACK, as long as other controls are in place.26.9 What is the chief cause of packet delay and loss in the Internet?Answer: The main cause of packet delay and loss in the Internet is congestion.Chapter 28 - Network Performance (QoS and DiffServ)28.1 List and describe the three primary measures of network performance.(See Textbook)28.2 Give five types of delay along with an explanation of each.(See Textbook)Chapter 30 - Network Security30.1 List the major security problems on the Internet, and give a short description of each.(See Textbook)30.2 Name the technique used in security attacks.(See Textbook)30.8 List and describe the eight basic security techniques.(See Textbook)。
计算机网络中英文互译
计算机网络中英翻译ACK (ACKnowledgement) 确认帧ADSL (Asymmetric Digital Subscriber Line) 非对称数字用户线AN (Access Network ）接入网ANSI (American National Standards Institute) 美国国家标准协会AP (Access Point) 接入点API (Application Programming Interface) 应用编程接口APNIC (Asia Pacific Network Information Center) 亚太网络信息中心ARP （ Address Resolution Protocol ）地址解析协议ARPA (Advanced Research Project Agency)美国国防部远景研究规划局（高级研究计划署）ARQ (Automatic Repeat reQuest) 自动请求重发ATM (Asynchronous Transfer Mode) 异步传递方式ATU (Access Termination Unit) 接入端接单元ATU-C (Access Termination Unit Central Office ）端局接入端接单元ATU-R (Access Termination Unit Remote) 远端接入端接单元AUI (Attachment Unit Interface ）连接接口单元AWT （ Abstract Window Toolkit ）抽象窗口工具箱BECN (Backward Explicit Congestion Notification) 反向显式拥塞通知BER (Basic Encoding Rule) 基本编码规则BGP (Border Gateway Protocol) 边界网关协议BSA (Basic Service Area) 基本服务区BSS (Basic Service Set) 基本服务集BNA 宝来网络体系结构CAC (Connection Admission Control) 连接准许控制CAP (Carrierless Amplitude Phase) 无载波振幅相位调制CATV (Community Antenna TV, CAble TV) 有线电视CBR （ Constant Bit Rate ）恒定比特率CCIR (Consultative Committee，International Radio) 国际无线电咨询委员会CCITT (Consultative Committee, International Telegraph and Telephone)国际电报电话咨询委员会CCP 通信控制处理机CDM (Code Division Multiplexing) 码分复用CDMA (Code Division Multiplex Access) 码分多址CNNIC (Network Information Center of China) 中国互联网络信息中心CRC (Cyclic Redundancy Check) 循环冗余检验CSMA/CD (Carrier Sense Multiple Access ／ Collision Detection)载波监听多点接入/碰撞检测CSU/DSU （ Channel Service Unit/Data Service Unit) 信道服务单元／数据服务单元CTD (Cell Transfer Delay) 信元传送时延DACS (Digital Access and Cross-connect System) 数字交接系统DCA 数据通信体系结构DCE (Data Circuit-terminating Equipment) 数据电路端接设备DE (Discard Eligibility) 丢弃指示DES (Data Encryption Standard) 数据加密标准DHCP (Dynamic Host Configuration Protocol) 动态主机配置协议DLCI (Data Link Connection Identifier) 数据链路连接标识符DMT (Discrete Multi-Tone) 离散多音（调制）DNS (Domain Name System) 域名系统DNA 数据网络系统结构DSL (Digital Subscriber Line) 数字用户线DSLAM (DSL Access Multiplexer) 数字用户线接入复用器DSSS (Direct Sequence Spread Spectrum) 直接序列扩频DTE (Data Terminal Equipment) 数据终端设备DVMRP (Distance Vector Multicast Routing Protocol) 距离向量多播路由选择协议DWDM (Dense WDM) 密集波分复用EGP (External Gateway Protocol) 外部网关协议EIA (Electronic Industries Association ）美国电子工业协会ESP (Encapsulating Security Payload) 封装安全有效载荷ESS 伍 xtended Service Set) 扩展的服务集FCS (Frame Check Sequence) 帧检验序列FDDI (Fiber Distributed Data Interface ）光纤分布式数据接口FDM (Frequency Division Multiplexing) 频分复用FEC (Forwarding Equivalence Class) 转发等价类FEC (Forward Error Correction) 前向纠错FHSS (Frequency Hopping Spread Spectrum) 跳频扩频FIFO （ First In First Out) 先进先出FQ (Fair Queuing) 公平排队FR (Frame Relay) 帧中继FSK (Frequency Shift Keying) 移频键控FTP (File Transfer Protocol ）文件传送协议FTTB (Fiber To The Building) 光纤到大楼FTTC (Fiber To The Curb ）光纤到路边FTTH (Fiber To The Home) 光纤到家FTTD (Fiber To The Desk) 光纤到桌面FTTZ(Fiber To The Zone ）光纤到小区FTTO (Fiber To The Office) 光纤到办公室FTTF (Fiber To The Floor) 光纤到楼层GIF (Graphics Interchange Format) 图形交换格式GII (Global Information Infrastructure) 全球信息基础结构，全球信息基础设施GFC （ Generic Flow Control) 通用流量控制GSM (Group Special Mobile) 群组专用移动通信体制HDLC (High-level Data Link Control) 面向比特的链路控制规程HDSL (High speed DSL) 高速数字用户线HEC (Header Error Control) 首部差错控制HFC (Hybrid Fiber Coax) 光纤同轴混合（网）HTML (HyperText Markup Language) 超文本置标语言HTTP (HyperText Transfer Protocol) 超文本传送协议IAB (Internet Architecture Board) 因特网体系结构委员会IAC （ Interpret As Command ）作为命令解释IAHC (Internet International Ad Hoc Committee ）因特网国际特别委员会ICMP （ Internet Control Message Protocol ）因特网控制报文协议IDEA (International Data Encryption Algorithm) 国际数据加密算法IEEE电气和电子工程师协会IESG (Internet Engineering Steering Group) 因特网工程指导小组IETF (Internet Engineering Task Force) 因特网工程部IFS (Inter Frame Space) 帧间间隔IGMP (Internet Group Management Protocol) 因特网组管理协议IGP (Interior Gateway Protocol) 内部网关协议IM (Instant Messaging) 即时传信IMAP (Internet Message Access Protocol) 因特网报文存取协议IMP （ Interface Message Processor) 接口报文处理机IP (Internet Protocol ）网际协议IR (InfraRed ）红外技术IRTF （ Internet Research Task Force ）因特网研究部ISDN (Integrated Services Digital Network) 综合业务数字网ISO （ International Organization for Standardization ）国际标准化组织ISOC (Internet Society) 因特网协会ISP （ Internet Service Provider) 因特网服务提供者ITU （ International Telecommunication Union ）国际电信联盟ITU-T （ ITU Telecommunication Standardization Sector) 国际电信联盟电信标准化部门JPEG (Joint Photographic Expert Group) 联合图像专家组标准KDC (Key Distribution Center) 密钥分配中心LAN (Local Area Network ）局域网LANE (LAN Emulation ）局域网仿真LAPB (Link Access Procedure Balanced) 链路接入规程（平衡型）LCP (Link Control Protocol) 链路控制协议LDP (Label Distribution Protocol) 标记分配协议LLC (Logical Link Control) 逻辑链路控制LSP (Label Switched Path) 标记交换路径LSR (Label Switching Router) 标记交换路由器MAC (Medium Access Control) 媒体接入控制MAN (Metropolitan Area Network) 城域网MAU (Medium Attachment Unit) 媒体连接单元MBONE (Multicast Backbone On the InterNEt ）多播主干网MBS (Maximum Burst Size ）最大突发长度MCR (Minimum Cell Rate ）最小信元速率 MCU (Multipoint Control Unit)多点控制单元MD (Message Digest) 报文摘要MDI (Medium Dependent Interface ）媒体相关接口MIB (Management Information Base) 管理信息库MIME (Multipurpose Internet Mail Extensions) 通用因特网邮件扩充modem 调制解调器MOTIF (Message Oriented Text Interchange System) 面向报文的电文交换系统MPEG (Motion Picture Experts Group) 活动图像专家组标准MPOA (MultiProtocol Over ATM) 多协议在 ATM 上运行MPLS (MultiProtocol Label Switching) 多协议标记交换MRU (Maximum Receive Unit) 最大接收单元MSS (Maximum Segment Size) 最长报文段MTU (Maximum Transfer Unit) 最大传送单元NAK (Negative AcKnowlegement) 否认帧NAP （ Network Access Point) 网络接入点N.ISDN (Narrowband-ISDN) 窄带综合业务数字网NAT (Network Address Translation ）网络地址转换NAV (Network Al location Vector) 网络分配向量NCP (Network Control Protocol) 网络控制协议NFS (Network File System) 网络文件系统NGI 下一代因特网计划NIA 网络适配器NIC (Network Interface Card) 网络接口卡、网卡NII (National Information Infrastructure) 国家信息基础结构，国家信息基础设施NLRI (Network Layer Reachability Information) 网络层可达性信息NNI (Network-Node Interface) 网络结点接口NSF (National Science Foundation) （美国）国家科学基金会NVT (Network Virtual Terminal ）网络虚拟终端ODBC （Open Database Connection）开放数据库互连OSF （Open Software Fundation ）开放软件基金会OSI （Open System Interconnection ）开放系统互联PBX （Private Branch eXchange ）用户交换机PCM (Pulse Code Modulation ) 脉冲编码调制PCN (Personal Communications Network ) 个人通信网络PCR （Peak Cell Rate ）峰值信元速率PCS 个人通信服务 Personal Communications ServicePDH 准同步数字系列PDA 个人数字助理 Personal Digital AssistantPDN 公用数据网 Public Data NetworkPDU 协议数据单元 Protocol Data UnitPER 分组差错率 packet error ratePIR 分组插入率 packet insertion ratePLCP 物理层会聚协议 Physical Layer Convergence ProtocolPLR 分组丢失率 packet loss ratePMD 物理媒体相关（子层） Physical Medium DependentPPP 点到点协议 Point to Point ProtocolPPTP 点对点隧道协议PRM 协议参考模型 Protocol Reference ModelPRN 分组无线网 Packet Radio NetworkPSN 分组交换节点 Packet Switch NodePSTN 公用电话交换网 Public Switched Telephone NetworkRARP 逆向地址解析协议 Reverse Address Resolution ProtocolRAS 远程访问服务器RFC 请求评注 Request for CommentsRMON 远程网络管理Router 路由器RPC 远程过程调用 Remote Procedure CallRSVP 资源重复利用协议RTP 接收和发送端口RTS 往返样本 Round Trip SampleRTS 剩余时间标签SAP 业务接入点 Service Access PointSAP 服务公告协议 Service Advertising ProtocolSAR 分段和重组(子层) Segmentation and ReassemblySDH 同步数字系列 Synchronous Digital HierarchySDLC 同步数据链路控制(协议) Advanced Data Communication Control Procedure SDTV 标准数字电视SDU 业务数据单元 Service Data UnitSIPP 增强的简单因特网协议 Simple Internet Protocol PlusSLIP 串行线路IP Serial Line Interface ProtocolSMDS 交换式多兆比特数据业务 Switched Multimegabit Data ServicesSMF 单模光纤 Single-mode FiberSMT 站点管理 Station ManagementSMTP 简单邮件传输协议 Simple Mail Transfer ProtocolSNA 系统网络体系结构 System Network ArchitectureSNMP 简单网络管理协议 Simple Network Management ProtocolSNR 信噪比 Signal-Noise ratioSONET 同步光纤网络 Synchronous Optical NetworkSTM 同步传输方式 Synchronous Transfer ModeSTP 屏蔽双绞线 Shielded Twisted PairSTS 同步传输信号 Synchronous Transport SignalSVC 交换虚电路 Switched Virtual CircuitSwitch 交换机TCP 传输控制协议 Transmission Control ProtocolTDM 时分多路复用 Time Division MultiplexingTFTP 单纯文件传输协议 Trivial File Transfer protocolTelnet 远程登录协议TIP 终端接口处理机 Terminal Interface ProcessorTP 双绞线 Twisted PairTSAP 传输层服务访问点 Transport Service Access PointUDP 用户数据报协议 User Datagram ProtocolUSB 通用串行总线 Universal Serial BusUTP 非屏蔽双绞线 Unshielded Twisted PairVAN 增值网 Value Added NetworkVBR 可变比特率 Variable Bit RateVCC 虚信道连接 Virtual Channel ConnectionVLAN 虚拟局域网 Virtual LANVLSI 超大规模集成电路VOD 点播图像 Video on DemandVPC 虚路径连接 Virtual Path ConnectionVPI 虚路径标识 virtual path identifierVPN 虚拟专用网络 Virtual Private NetworkVRML 虚拟现实造型语言 Virtual Reality Modeling Language VTP 虚拟隧道协议WAN 广域网 Wide Area NetworkWDM 波分多路复用 Wavelength Division MultiplexingWWW 万维网 World Wide Web。
计算机网络(第四版)课后习题(英文)+习题答案(中英文)
ANDREW S. TANENBAUM 秒，约533 msec.----- COMPUTER NETWORKS FOURTH EDITION PROBLEM SOLUTIONS 8. A collection of five routers is to be conn ected in a poi nt-to-poi nt sub net.Collected and Modified By Yan Zhe nXing, Mail To: Betwee n each pair of routers, the desig ners may put a high-speed line, aClassify: E aEasy, M ^Middle, H Hard , DaDeleteGree n: Importa nt Red: Master Blue: VI Others:Know Grey:—Unnecessary ----------------------------------------------------------------------------------------------ML V Chapter 1 In troductio nProblems2. An alter native to a LAN is simply a big timeshari ng system with termi nals forall users. Give two adva ntages of a clie nt-server system using a LAN.(M)使用局域网模型可以容易地增加节点。
如果局域网只是一条长的电缆，且不会因个别的失效而崩溃(例如采用镜像服务-------------------------------------------器)的情况下，使用局域网模型会更便宜。
计算机网络中英文互译,DOC
欢迎共阅计算机网络中英翻译ACK(ACKnowledgement)确认帧ADSL(AsymmetricDigitalSubscriberLine)非对称数字用户线AN(AccessNetwork）接入网ANSI(AmericanNationalStandardsInstitute)美国国家标准协会AP(AccessPoint)接入点API(ApplicationProgrammingInterface)应用编程接口APNIC(AsiaPacificNetworkInformationCenter)亚太网络信息中心ARP（AddressResolutionProtocol）地址解析协议AWT（BNACBR（CCPCSMA/CD(CarrierSenseMultipleAccess／CollisionDetection)载波监听多点接入/碰撞检测CSU/DSU（ChannelServiceUnit/DataServiceUnit)信道服务单元／数据服务单元CTD(CellTransferDelay)信元传送时延DACS(DigitalAccessandCross-connectSystem)数字交接系统DCA数据通信体系结构DCE(DataCircuit-terminatingEquipment)数据电路端接设备DE(DiscardEligibility)丢弃指示DES(DataEncryptionStandard)数据加密标准DHCP(DynamicHostConfigurationProtocol)动态主机配置协议DLCI(DataLinkConnectionIdentifier)数据链路连接标识符DMT(DiscreteMulti-Tone)离散多音（调制）DNS(DomainNameSystem)域名系统DNA数据网络系统结构DSL(DigitalSubscriberLine)数字用户线DSLAM(DSLAccessMultiplexer)数字用户线接入复用器DSSS(DirectSequenceSpreadSpectrum)直接序列扩频DTE(DataTerminalEquipment)数据终端设备DVMRP(DistanceVectorMulticastRoutingProtocol)距离向量多播路由选择协议DWDM(DenseWDM)密集波分复用EGP(ExternalGatewayProtocol)外部网关协议EIA(ElectronicIndustriesAssociation）美国电子工业协会ESS伍FCS(FrameFIFO（FR(FrameGFC（HDSL(HighspeedDSL)高速数字用户线HEC(HeaderErrorControl)首部差错控制HFC(HybridFiberCoax)光纤同轴混合（网）HTML(HyperTextMarkupLanguage)超文本置标语言HTTP(HyperTextTransferProtocol)超文本传送协议IAB(InternetArchitectureBoard)因特网体系结构委员会IAC（InterpretAsCommand）作为命令解释IAHC(InternetInternationalAdHocCommittee）因特网国际特别委员会ICMP（InternetControlMessageProtocol）因特网控制报文协议IDEA(InternationalDataEncryptionAlgorithm)国际数据加密算法IEEE电气和电子工程师协会IESG(InternetEngineeringSteeringGroup)因特网工程指导小组IETF(InternetEngineeringTaskForce)因特网工程部IFS(Inter Frame Space)帧间间隔IGMP(InternetGroupManagementProtocol)因特网组管理协议IGP(InteriorGatewayProtocol)内部网关协议IM(InstantMessaging)即时传信IMAP(InternetMessageAccessProtocol)因特网报文存取协议IMP（InterfaceMessageProcessor)接口报文处理机IP(InternetProtocol）网际协议IR(InfraRed）红外技术IRTF（ISO（ISP（ITU（ITU-T（MIB(ManagementInformationBase)管理信息库MIME(MultipurposeInternetMailExtensions)通用因特网邮件扩充modem调制解调器MOTIF(MessageOrientedTextInterchangeSystem)面向报文的电文交换系统MPEG(MotionPictureExpertsGroup)活动图像专家组标准MPOA(MultiProtocolOverATM)多协议在ATM上运行MPLS(MultiProtocolLabelSwitching)多协议标记交换MRU(MaximumReceiveUnit)最大接收单元MSS(MaximumSegmentSize)最长报文段MTU(MaximumTransferUnit)最大传送单元NAK(NegativeAcKnowlegement)否认帧NAP（NetworkAccessPoint)网络接入点N.ISDN(Narrowband-ISDN)窄带综合业务数字网NAT(NetworkAddressTranslation）网络地址转换NAV(NetworkAl location Vector)网络分配向量NCP(NetworkControlProtocol)网络控制协议NFS(NetworkFileSystem)网络文件系统NGI下一代因特网计划NIA网络适配器NIC(NetworkInterfaceCard)网络接口卡、网卡NII(NationalInformationInfrastructure)国家信息基础结构，国家信息基础设施ODBC（OSF（OSI（PBX（PCR（PCSPDHPDAPDNPDUPERPIRPLCPPLRPMDPPPPPTPPRMPRNPSN分组交换节点PacketSwitchNodePSTN公用电话交换网PublicSwitchedTelephoneNetworkRARP逆向地址解析协议ReverseAddressResolutionProtocolRAS远程访问服务器RFC请求评注RequestforCommentsRMON远程网络管理Router路由器RPC远程过程调用RemoteProcedureCallRSVP资源重复利用协议RTP接收和发送端口RTS往返样本RoundTripSampleRTS剩余时间标签SAP业务接入点ServiceAccessPointSAP服务公告协议ServiceAdvertisingProtocolSAR分段和重组(子层)SegmentationandReassemblySDH同步数字系列SynchronousDigitalHierarchySDLC同步数据链路控制(协议)AdvancedDataCommunicationControlProcedure SDTV标准数字电视SDU业务数据单元ServiceDataUnitSIPP增强的简单因特网协议SimpleInternetProtocolPlusSLIP串行线路IPSerialLineInterfaceProtocolSMDSSMFSMTSMTPSNASNMPSNRSONETSTMSTPSTSSVCTCPTDMTFTPVCC虚信道连接VirtualChannelConnectionVLAN虚拟局域网VirtualLANVLSI超大规模集成电路VOD点播图像VideoonDemandVPC虚路径连接VirtualPathConnectionVPI虚路径标识virtualpathidentifierVPN虚拟专用网络VirtualPrivateNetworkVRML虚拟现实造型语言VirtualRealityModelingLanguageVTP虚拟隧道协议WAN广域网WideAreaNetworkWDM波分多路复用WavelengthDivisionMultiplexing WWW万维网WorldWideWeb。
《计算机网络》中英词汇对照表
《计算机网络》中英文对照表Chapter 11.1Internet：因特网Computer network ：计算机网络Host: 主机End system: 终端系统Packet switching: 分组交换Route: 路径Internet service provider (ISP): 因特网服务提供商Protocol: 协议Transmission Control Protocol (TCP)：传输控制协议1.2Client: 客户端Server: 服务器Peer: 对等机Reliable data transfer: 可靠数据传输Flow control: 流量控制Congestion-control: 拥塞控制User Datagram Protocol (UDP): 用户数据报协议1.3Circuit switching: 电路交换/线路交换Packet switching: 分组交换Frequency-division multiplexing (FDM): 频分多路复用Time-division multiplexing (TDM): 时分多路复用Bandwidth: 带宽Time slot: 时隙Frame: 帧Message: 报文:Packet: 分组Store-and-forward: 存储转发Datagram network: 数据报网络Virtual-circuit network: 虚电路网络1.4Router: 路由器Modem: 调制解调器Local area network (LAN): 局域网Ethernet: 以太网Wireless LAN: 无线局域网Guided media: 导向型介质Unguided media: 非导向型介质Twisted-pair copper wire: 双绞线Unshielded twisted pair(UTP): 非屏蔽双绞线Coaxial cable: 同轴电缆Fiber optics: 光线/光缆1.6Nodal processing delay: 结点处理延迟Queuing delay: 排队延迟Transmission delay: 发送延迟Propagation delay: 传播延迟Traffic intensity: 流通强度End-to-end delay: 端到端延迟1.7Layer: 层次Protocol stack: 协议栈Application layer: 应用层Transport layer: 传输层Network layer: 网络层Link layer: 链路层Physical layer: 物理层Encapsulation: 封装Message: 报文Segment: 报文段Datagram: 数据报Frame: 帧Chapter 22.1Client-server architecture: 客户端－服务器体系结构；C/S结构P2P architecture: 对等结构Processes: 进程Socket: 套接字Application programming interface (API): 应用程序编程接口IP address: IP地址Prot number: 端口号Syntax: 语法Semantics: 语义Full-duplex: 全双工Handshaking: 握手Real-time application: 实时应用2.2The World Wide Web: 万维网HyperText Transfer Protocol (HTTP): 超文本传输协议Web page: 网页Object: 对象HyperText Markup Language (HTML): 超文本标记语言URL：统一资源定位符Browser: 浏览器Persistent connection: 持久连接Non-persistent connection: 非持久连接Round-trip time (RTT): 往返时间Without pipelining: 非流水线方式With pipelining: 流水线方式Web cache: web 缓存Proxy server: 代理服务器2.3File Transfer Protocol (FTP): 文件传输协议Control connection: 控制连接Data connection: 数据连接Out-of-band: 带外In-band: 带内2.4Electronic Mail: 电子邮件User agent: 用户代理Mail server: 邮件服务器Simple Mail Transfer Protocol (SMTP): 简单邮件传输协议Mailbox: 邮箱Multipurpose Internet Mail Extensions (MIME): 多用途因特网邮件扩展协议Post Office Protocol (POP): 邮局协议Internet Mail Access Protocol (IMAP): Internet 邮件访问协议2.5Domain Name System (DNS): 域名系统Hostname: 主机名Host aliasing: 主机别名Mail server aliasing: 邮件服务器别名Load distribution: 负载分配Root DNS server: 根DNS服务器Top-Level Domain (TLD) servers: 顶级域DNS服务器Authoritative DNS servers: 授权DNS服务器；权威DNS服务器Local DNS server: 本地DNS服务器Database: 数据库Chapter 33.1Logical communication: 逻辑通讯3.2Multiplexing: 多路复用Demultiplexing: 多路分解Well-known port number: 众所周知的端口号3.3UDP segment: UDP报文段Checksum: 校验和；检查和Wrapped around: 回卷3.4Channel: 通道；信道Positive acknowledgement : 肯定应答Negative acknowledgement: 否定应答ARQ （automatic repeat request）: 自动重传请求Feedback: 反馈Retransmission: 重传Stop-and-wait protocol: 停止－等待协议Duplicate packets: 冗余分组Sequence number: 顺序号Timer: 定时器Alternating-bit protocol: 比特交替协议Utilization: 利用率Go-back-N (GBN): 回退N步Window size: 窗口大小Sliding-window protocol: 滑动窗口协议Cumulative acknowledgement: 累积确认Timeout: 超时Selective Repeat (SR): 选择重传3.5Connection-oriented: 面向连接Point-to-point: 点到点Three-way handshake: 三次握手Maximum segment size (MSS): 最大报文段大小Maximum transmission unit (MTU): 最大传输单元Piggybacked: 捎带Sample RTT: 样本RTTFast retransmit: 快速重传Selective acknowledgement: 选择确认Flow-control: 流量控制Receive window: 接收窗口3.7Congestion control: 拥塞窗口Self-clocking: 自定时的Additive-increase, multiplicative-decrease: 加性增，乘性减Slow star: 慢启动Congestion avoidance: 拥塞避免Threshold: 阈值Fast recovery: 快速恢复Bottleneck: 瓶颈Latency: 延迟Chapter 44.1Forwarding: 转发Routing: 路由Routing algorithm: 路由算法Forwarding table: 转发表Router: 路由器Jitter: 抖动Best-effort service: 尽力而为的服务4.2Virtual-circuit (VC) network: 虚电路网络Datagram network: 数据报网络Prefix: 前缀Longest prefix matching rule: 最长前缀匹配规则4.3Input port: 输入端口Switching fabric: 交换结构Routing processor: 路由处理器Crossbar: 交叉结构4.4Time-to-live (TTL) :生存时间Fragmentation: 分片；片段Dotted-decimal notation: 点分十进制表示法Subnet: 子网Subnet mask: 子网掩码Classless Interdomain Routing (CIDR): 无类别域际路由选择Dynamic Host Configuration Protocol（DHCP）：动态主机配置协议Plug-and-play: 即插即用Network address translation (NA T): 网络地址转换Internet Control Message Protocol (ICMP): 因特网控制报文协议Dual-stack: 双栈Tunneling: 隧道4.5Default router: 默认路由器Graph: 图A global routing algorithm : 全局路由算法A decentralized routing algorithm : 分布式路由算法Static routing algorithm: 静态路由算法Dynamic routing algorithm : 动态路由算法Link-State (LS): 链路状态Distance-Vector(DV): 距离向量Routing table: 路由表Autonomous system (AS): 自治系统Intra-autonomous system routing protocol: 自治系统内路由协议Inter-AS routing protocol: 自治系统间路由协议4.6Interior gateway protocol: 内部网关协议Routing Information Protocol (RIP): 路由信息协议Open Shortest Path First (OSPF): 开放最短路径优先协议Advertisement: 公告Hop: 跳Border Gateway Protocol (BGP): 边界网关协议4.7Broadcast: 广播Multicast: 多播Chapter 55.1Node: 结点Link: 链路Frame: 帧Medium access control (MAC): 介质访问控制Full-duplex: 全双工Half-duplex: 半双工Adapter: 适配器Network interface card (NIC): 网卡Interface: 接口5.2Parity check: 奇偶校验Odd: 奇数Even: 偶数Cyclic redundancy check (CRC): 循环冗余校验Polynomial: 多项式5.3Collide: 冲突Multiple access protocol: 多路访问协议Channel partitioning protocol: 信道划分协议Random access protocol: 随机访问协议Taking-turns protocol: 轮转协议Code division multiple access (CDMA): 码分多址访问Carrier sensing: 载波侦听Collision detection: 冲突检测Polling protocol: 轮询协议Token-passing protocol: 令牌传递协议Token: 令牌Local Area Network (LAN): 局域网Token-ring: 令牌环Fiber distributed data interface (FDDI): 光纤分布式数据接口Metropolitan Area Network (MAN): 城域网5.4Address Resolution Protocol (ARP): 地址解析协议Dynamic Host Configuration Protocol (DHCP): 动态主机配置协议5.5Ethernet: 以太网Preamble: 前导码Manchester encoding: 曼彻斯特编码5.6Hub: 集线器Collision domain: 冲突域Switch: 交换机Filtering: 过滤Forwarding: 转发Switch table: 交换表Self-learning: 自学习Plug-and-play devices: 即插即用设备Cut-through switching: 直通式交换5.7Point-to-point: (PPP): 点到点。
计算机网络技术中英文对照外文翻译文献
中英文资料外文翻译网站建设技术1.介绍网络技术的发展,为今天全球性的信息交流与资在建立源共享和交往提供了更多的途径和可能。
足不出户便可以知晓天下大事,按几下键盘或点几下鼠标可以与远在千里之外的朋友交流,网上通信、网上浏览、网上交互、网上电子商务已成为现代人们生活的一部分。
Internet 时代, 造就了人们新的工作和生活方式,其互联性、开放性和共享信息的模式,打破了传统信息传播方式的重重壁垒,为人们带来了新的机遇。
随着计算机和信息时代的到来,人类社会前进的脚步在逐渐加快。
近几年网页设计发展,快得人目不暇接。
随着网页设计技术的发展,丰富多彩的网页成为网上一道亮丽的风景线。
要想设计美观实用的网页就应该深入掌握网站建设技术。
在建立网站时,我们分析了网站建立的目的、内容、功能、结构,应用了更多的网页设计技术。
2、网站的定义2.1 如何定义网站确定网站的任务和目标,是建设网站所面临的最重要的问题。
为什么人们会来到你的网站? 你有独特的服务吗? 人们第一次到你的网站是为了什么? 他们还会再来吗? 这些问题都是定义网站时必须考虑的问题。
要定义网站,首先,必须对整个网站有一个清晰认识,弄清到底要设计什么、主要的目的与任务、如何对任务进行组织与规划。
其次,保持网站的高品质。
在众多网站的激烈竞争中,高品质的产品是长期竞争的最大优势。
一个优秀的网站应具备：（1）用户访问网站的速度要快；（2）注意反馈与更新。
及时更新网站内容、及时反馈用户的要求；（3）首页设计要合理。
首页给访问者留下的第一印象很重要,设计务必精美,以求产生良好的视觉效果。
2.2 网站的内容和功能在网站的内容方面,就是要做到新、快、全三面。
网站内容的类型包括静态的、动态的、功能的和事物处理的。
确定网站的内容是根据网站的性质决定的,在设计政府网站、商业网站、科普性网站、公司介绍网站、教学交流网站等的内容和风格时各有不同。
我们建立的网站同这些类型的网站性质均不相同。
计算机网络中英文名词对照
计算机⺴⽹网络关键字英⽂文中⽂文对照第⼀一章-协议（Protocol）-⺴⽹网络边缘（Network Edge）-有线⺴⽹网络，⽆无线⺴⽹网络（wired，wireless communication links ）-拨号调制解调器（dial-up Modem）-数字⽤用户线（digit subscriber line，DSL）-电缆调制解调器（cable modem）-混合光纤同轴电缆（hybrid fiber coax，HFC）-双绞线（Twisted Pair）-同轴电缆（Coaxial cable）-光缆（Fiber optic cable）-电路交换（circuit switching）-分组交换（packet switching）-端到端连接（end-to-end connection）-频分多路复⽤用（Frequency-Division Multiplexing，FDM）-时分多路复⽤用（Time-Division Multiplexing，TDM）-统计多路复⽤用（statistical multiplexing）-第⼀一层ISP（tier-1 ISP）-时延（delay）、节点处理时延（nodal processing delay）、排队时延（queuing delay）、传输时延（transmission delay）、传播时延（propagation delay）、节点总时延（total nodal delay）-丢包（package loss）-吞吐量（Troughput）-应⽤用层（application layer）、表⽰示层（presentation）、会话层（session）、传输层（transport layer）、⺴⽹网络层（network layer）、链路层（link layer）、物理层（physical layer）-报⽂文（message）、报⽂文段（segment）、数据报（datagram）、帧（frame）-HTTP——Hyper-Text Transfer Protocol-FTP——File Transfer Protocol-SMTP——Simple Mail Transfer Protocol-DNS——Domain Name Service-TCP——Transmission Control Protocol•⾯面向连接——Connection-Oriented（三次握⼿手）•数据可靠——Reliable data transport•拥塞控制——Congestion Control——抑制发送进程•流量控制——Flow Control•如email（SMTP）、远程终端访问（Telnet）、Web（HTTP）、⽂文件传输（FTP）、流媒体（HTTP、RTP）⺴⽹网络层使⽤用TCP协议-UDP——User Datagram Protocol•不可靠数据传输服务•如流媒体（HTTP、RTP）、因特⺴⽹网电话（SIP、RTP）通常⺴⽹网络层使⽤用UDP-IP——Internet Protocol-⽊木⻢马（Trojan horse）、病毒（Virus）、蠕⾍虫（Worm）、DDoS（Distributed Deny of Service）第⼆二章应⽤用层-客户机-服务器（Client-Server）、P2P-client process ：process that initiates communication-server process：Process that waits to be contacted-套接字（Socket）-传输层协议提供的服务•Reliable data transfer•Throughput•Timing•Security-HTTP•⽆无状态协议（stateless）•⾮非持久连接、短连接（non-persistent connection）•持久连接、⻓长连接（persistent connection）•pull protocol-往返时间（Round-Trip Time，RTT）-Cookie-server agent-SMTP•push protocol-多⽤用途因特⺴⽹网邮件扩展（Multipurpose Internet Mail Extension，MIME）-DNS•运⾏行在UDP上，使⽤用53号端⼝口•规范和别名•负载分配•主机名->IP地址转换-P2P•直接在对等⽅方传输•⾼高度的可拓展能⼒力•使⽤用客户机-服务器模型第三章运输层-逻辑通信（logical communication）-多路复⽤用（transport-layer multiplexing）与多路分解（demultiplexing）-源端⼝口号字段（source port number field）-⺫⽬目的端⼝口号字段（destination port number field）-周知端⼝口号（well-known port number）-Reliability data transport•完全可靠信道上的可靠数据传输 rdt1.0•具有⽐比特差错信道上的可靠数据传输 rdt2.0——stop-wait protocol•具有⽐比特差错的丢包信道上的可靠数据传输 rdt3.0——alternating-bit protocol•流⽔水线可靠数据协议-Go-Back_N——窗⼝口⼤大⼩小最⼤大2^k-1-选择性重传（selection repeat）窗⼝口⼤大⼩小最⼤大2^(k-1)-拥塞控制（congestion control）-流量控制（flow control）-第四章-转发（forwarding）-选路（routing）-虚电路（Virtual-Circuit，VC）⺴⽹网络：仅在⺴⽹网络层提供连接服务的计算机⺴⽹网络，如ATM、帧中继。
计算机网络系统方法(英文版)课后习题及解答
第一章(1.2 1.3节)5.Calculate the total time required to transfer a 1,000-KB file in the following cases, assuming an RTT of 100 ms, a packet size of 1-KB data, and an initial 2 ×RTT of “handshaking” before data is sent.(a) The bandwidth is 1.5 Mbps, and data packets can be sent continuously.(b) The bandwidth is 1.5 Mbps, but after we finish sending each data packetwe must wait one RTT before sending the next.(c) The bandwidth is “infinite,”meaning that we take transmit time to bezero, and up to 20 packets can be sent per RTT.(d) The bandwidth is infinite, and during the first RTT we can send onepacket (21−1), during the second RTT we can send two packets (22−1),during the third we can send four (23−1), and so on. (A justification forsuch an exponential increase will be given in Chapter 6.)7. Consider a point-to-point link 2 km in length. At what bandwidth would propagation delay (at a speed of 2 × 108m/sec) equal transmit delay for 100-byte packets? What about 512-byte packets?13.How “wide” is a bit on a 1-Gbps link? How long is a bit in copper wire, where the speed of propagation is 2.3 × 108 m/s?15.Suppose a 100-Mbps point-to-point link is being set up between Earth and a new lunar colony. The distance from the moon to Earth is approximately 385,000 km, and data travels over the link at the speed of light—3 × 108 m/s.(a) Calculate the minimum RTT for the link.(b) Using the RTT as the delay, calculate the delay × bandwidth product forthe link.(c) What is the significance of he delay × bandwidth product computedin (b)?(d) A camera on the lunar base takes pictures of Earth and saves them in digitalformat to disk. Suppose Mission Control on Earth wishes to download themost current image, which is 25 MB. What is the minimum amount of time that will elapse between when the request for the data goes out andthe transfer is finished?18. Calculate the latency (from first bit sent to last bit received) for the following:(a) A 10-Mbps Ethernet with a single store-and-forward switch in the path,and a packet size of 5,000 bits. Assume that each link introduces a propaga-tion delay of 10 µs, and that the switch begins retransmitting immediatelyafter it has finished receiving the packet.(b) Same as (a) but with three switches.(c) Same as (a) but assume the switch implements “cut-through”switching: itis able to begin retransmitting the packet after the first 200 bits have beenreceived.第二章（除2.7 2.9 节）1.Show the NRZ, Manchester, and NRZI encodings for the bit pattern shown in Figure2.46. Assume that the NRZI signal starts out low.23.Consider an ARQ algorithm running over a 20-km point-to-point fiber link.(a) Compute the propagation delay for this link, assuming that the speed oflight is 2 × 108 m/s in the fiber.(b) Suggest a suitable timeout value for the ARQ algorithm to use.(c) Why might it still be possible for the ARQ algorithm to time out andretransmit a frame, given this timeout value?26.The text suggests that the sliding window protocol can be used to implement flow control. We can imagine doing this by having the receiver delay ACKs, that is, not send the ACK until there is free buffer space to hold the next frame. In doing so, each ACK would simultaneously acknowledge the receipt of the last frame and tell the source that there is now free buffer space available to hold the next frame. Explain why implementing flow control in this way is not a good idea.44.Let A and B be two stations attempting to transmit on an Ethernet. Each has steady queue of frames ready to send; A’s frames will be numbered A 1, A2 , and so on, and B’s similarly. Let T = 51.2 µs be the exponential backoff base unit. SupposeA andB simultaneously attempt to send frame 1, collide, and happen to choose backoff times of 0 × T and 1 × T, respectively, meaning A wins the race and transmits A 1 while B waits. At the end of this transmission, B will attempt to retransmit B1 while A will attempt to transmit A2 . These first attempts will collide, but now A backs off for either 0 × T or 1 × T, while B backs off for time equal to one of 0 × T, . . . , 3 × T.(a) Give the probability that A wins this second backoff race immediately after this firstcollision , that is, A’s first choice of backoff time k × 51.2 is less than B’s.(b) Suppose A wins this second backoff race. A transmits A 3 , and when it isfinished, A and B collide again as A tries to transmit A4 and B tries once more to transmit B1. Give the probability that A wins this third backoff race immediately after the first collision.(c) Give a reasonable lower bound for the probability that A wins all the re- maining backoff races.(d) What then happens to the frame B1?This scenario is known as the Ethernet capture effect.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节）ing 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 first 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 spanning tree algorithm.15. Consider the arrangement of learning bridges shown in Figure 3.35. Assuming all are initially empty, give the forwarding tables for each of the bridges B1–B4 after the following transmissions:■ A sends to C.■ C sends to A.■ D sends to C.Identify ports with the unique neighbor reached directly from that port, thatis, the ports for B1 are to be labeled “A” and “B2.”17.Consider hosts X, Y, Z, W and learning bridges B1, B2, B3, with initially empty forwarding tables, as in Figure 3.36.(a) Suppose X sends to Z. Which bridges learn where X is? Does Y’s networkinterface see this packet?(b) Suppose Z now sends to X. Which bridges learn where Z is? Does Y’s network interface see this packet?(c) Suppose Y now sends to X. Which bridges learn where Y is? Does Z’s net-work interface see this packet?(d) Finally, suppose Z sends to Y. Which bridges learn where Z is? Does W’snetwork interface see this packet?第四章（4.1 4.2 4.3.1 4.3.5 4.5 节）4.Suppose a TCP message that contains 2,048 bytes of data and 20 bytes of TCP header is passed to IP for delivery across two networks of the Internet (i.e., from the source host to a router to the destination host). The first network uses 14-byte headers and has an MTU of 1,024 bytes; the second uses 8-byte headers with an MTU of 512 bytes. Each network’s MTU gives the size of the largest IP datagram that can be carried in a link layer frame. Give the sizes and offsets of the sequence of fragments delivered to the network layer at the destination host. Assume all IP headers are 20 bytes.21.Suppose a router has built up the routing table shown in Table 4.14. The router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3, or R4. Describe what the router does with a packet addressed to each of the following destinations:(a) 128.96.39.10.(b) 128.96.40.12.(c) 128.96.40.151.(d) 192.4.153.17.(e) 192.4.153.90.45.Table 4.16 is a routing table using CIDR. Address bytes are in hexadecimal. The notation “/12” in C4.50.0.0/12 denotes a netmask with 12 leading 1 bits, that is, FF.F0.0.0. Note that the last three entries cover every address and thus serve in lieu of a default route. State to what next hop the following will be delivered.(a) C4.5E.13.87.(b) C4.5E.22.09.(c) C3.41.80.02.(d) 5E.43.91.12.(e) C4.6D.31.2E.(f) C4.6B.31.2E.第五章（5.1 5.2节）10. You are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP). This protocol will run over a 1-Gbps network. The RTT of the network is 140 ms, and the maximum segment lifetime is 60 seconds. How many bits would you include in the AdvertisedWindow and SequenceNum fields of your protocol header?第六章（6.5节）第九章（9.1节）。
计算机网络与技术(双语)课程课堂作业)
Internet turns 35, still a work in progressThirty-five years after computer scientists at UCLA linked two bulky computers using a 15-foot gray cable, testing a new way for exchanging data over networks, what would ultimately become the Internet remains a work in progress. University researchers are experimenting with ways to increase its capacity and speed. Programmers are trying to imbue Web pages with intelligence. And work is underway to re-engineer the network to reduce spam(junk mail,垃圾邮件) and security troubles.All the while threats loom: Critics warn that commercial, legal and political pressures could hinder the types of innovations that made the Internet what it is today. Stephen Crocker and Vinton Cerf were among the graduate students who joined UCLA professor Len Kleinrock in an engineering lab on Sept. 2, 1969, as bits of meaningless test data flowed silently between the two computers. By January, three other "nodes" joined the fledgling(新诞生的) network.Then came e-mail a few years later, a core communications protocol called TCP/IP in the late 70s, the domain name system in the 80s and the World Wide Web - now the second most popular application behind e-mail - in 1990. The Internet expanded beyond its initial military and educational domain into businesses and homes around the world.Today, Crocker continues work on the Internet, designing better tools for collaboration. And as security chairman for the Internet's key oversight body, he is trying to defend the core addressing system from outside threats.He acknowledges the Internet he helped build is far from finished, and changes are in store to meet growing demands for multimedia. Network providers now make only "best efforts" at delivering data packets, and Crocker said better guarantees are needed to prevent the skips and stutters now common with video.Cerf, now at MCI Inc., said he wished he could have designed the Internet with security built-in. Microsoft Corp., Yahoo Inc. and America Online Inc., among others, are currently trying to retrofit the network so e-mail senderscan be authenticated - a way to cut down on junk messages sent using spoofed addresses.Many features being developed today wouldn't have been possible at birth given the slower computing speeds and narrower Internet pipes, or bandwidth, Cerf said.。
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
Chapter11-11.What are two reasons for using layered protocols?(请说出使用分层协议的两个理由)答：通过协议分层可以把设计问题划分成较小的易于处理的片段。
分层意味着某一层的协议的改变不会影响高层或低层的协议。
1-13. What is the principal difference between connectionless communication and connection-oriented communication?(在无连接通信和面向连接的通信两者之间，最主要的区别是什么？)答：主要的区别有两条。
其一：面向连接通信分为三个阶段，第一是建立连接，在此阶段，发出一个建立连接的请求。
只有在连接成功建立之后，才能开始数据传输，这是第二阶段。
接着，当数据传输完毕，必须释放连接。
而无连接通信没有这么多阶段，它直接进行数据传输。
其二：面向连接的通信具有数据的保序性，而无连接的通信不能保证接收数据的顺序与发送数据的顺序一致。
1-20. A system has an n-layer protocol hierarchy. Applications generate messages of length M bytes. At each of the layers, an h-byte header is added. What fraction of the network bandwidth is filled with headers?(一个系统有n层协议的层次结构。
应用程序产生的消息的长度为M字节。
在每一层上需要加上一个h字节的头。
请问，这些头需要占用多少比例的网络带宽)答：hn/(hn+m)*100%1-28. An image is 1024 x 768 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it take to transmit it over a 56-kbps modem channel? Over a 1-Mbps cable modem? Over a 10-Mbps Ethernet? Over 100-Mbps Ethernet?(一幅图像的分辨率为1024 x 768像素，每个像素用3字节来表示。
假设该图像没有被压缩。
请问，通过56kbps的调制解调器信道来传输这幅图像需要多长时间？通过1Mbps的电缆调制解调器呢？通过10Mbps的以太网呢？通过100Mbps的以太网呢?)答：The image is 1024*768*3 bytes or 2359296 bytes.This is 18874368 bit. At 56,000 bits/sec, it takes about 337.042 sec. At 1,000,000 bits/sec, it takes about 18.874 sec. At 10,000,000 bits/sec, it takes about 1.887 sec. At 100,000,000 bits/sec, it takes about 0.189 sec.Chapter22-2. A noiseless 4-kHz channel is sampled every 1 msec. What is the maximum data rate?(一条无噪声4kHz信道按照每1ms一次进行采样，请问最大数据传输率是多少？)答：无噪声信道最大数据传输率公式：最大数据传输率=2Hlog2V b/s。
因此最大数据传输率决定于每次采样所产生的比特数，如果每次采样产生16bits，那么数据传输率可达128kbps；如果每次采样产生1024bits，那么可达8.2Mbps。
注意这是对无噪声信道而言的，实际信道总是有噪声的，其最大数据传输率由香农定律给出。
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，则最大可达到的数据传输率为多少？)答：信噪比为20 dB 即 S/N =100由于 log101≈6.658，由香农定理，该信道2的信道容量为3log(1+100)=19.98kbps。
2又根据乃奎斯特定理，发送二进制信号的3kHz 信道的最大数据传输速率为2*3*log22=6kbps。
所以可以取得的最大数据传输速率为6kbps。
2-5. What signal-to-noise ratio is needed to put a T1 carrier on a 50-kHz line?(在50kHz的线路上使用1T线路需要多大的信噪比？)答：为发送T1 信号，我们需要所以，在50kHz 线路上使用T1 载波需要93dB 的信噪比。
2-34. A signal is transmitted digitally over a 4-kHz noiseless channel with one sample every 125 µsec. How many bits per second are actually sent for each of these encoding methods?(a) CCITT 2.048 Mbps standard.(b) DPCM with a 4-bit relative signal value.(c) Delta modulation.（一个信号在4kHz的无噪声信道上以数字方式进行传输，没125us采样一次。
请问，按照以下的编码方法，每秒钟实际发送多少位？（a）CCITT 2.048Mbps标准。
（b）有4位相对信号值的DPCM。
（c）增量调制。
）答：a．CCITT 2.048Mbps 标准用32 个8 位数据样本组成一个125的基本帧，30 个信道用于传信息，2 个信道用于传控制信号。
在每一个4kHz 信道上发送的数据率就是8*8000=64kbps。
b．差分脉码调制（DPCM）是一种压缩传输信息量的方法，它发送的不是每一次抽样的二进制编码值，而是两次抽样的差值的二进制编码。
现在相对差值是4 位，所以对应每个4kHz 信道实际发送的比特速率为4*8000=32bps。
c．增量调制的基本思想是：当抽样时间间隔s t 很短时，模拟数据在两次抽样之间的变化很小，可以选择一个合适的量化值作为阶距。
把两次抽样的差别近似为不是增加一个就是减少一个。
这样只需用1bit 二进制信息就可以表示一次抽样结果，而不会引入很大误差。
因此，此时对应每个4kHz 信道实际发送的数据速率为1*8000=8kHz。
2-43. Suppose that x bits of user data are to be transmitted over a k-hop path in a packet-switched network as a series of packets, each containing p data bits and h header bits,with x >> p+h.The bit rate of the lines is b bps and the propagation delay is negligible.What value of p minimizes the total delay?(假定x位用户数据将以一系列分组形式，在一个分组交换网络中沿着一条共有k跳的路径向前传播，每个分组包含p位数据和h位的头，这里x>>p+h。
线路的传输率为b bps，传播延迟忽略不计。
请问，什么样的p值使总延迟最小？) 答：所需要的分组总数是x /p，因此总的数据加上头信息交通量为(p+h)*x/p 位。
源端发送这些位需要时间为(p+h)*x/pb中间的路由器重传最后一个分组所花的总时间为(k-1)*(p+h)/ b因此我们得到的总的延迟为对该函数求p 的导数，得到令得到因为p＞0，所以故时能使总的延迟最小。
2-53. A CDMA receiver gets the following chips: (-1 +1 -3 +1 -1 -3 +1 +1). Assuming the chip sequences defined in , which stations transmitted, and which bits did each one send?(一个CDMA接收器得到了下面的时间片：(-1 +1 -3 +1 -1 -3 +1 +1)。
假设时间片序列如图2.45（b）中所定义，请问哪些移动站传输了数据？每个站发送了什么位?)答：Just compute the four normalized inner products:（1+1 3+1 1 3+1+1）d（1 1 1+1+1 1+1+1）/8=1（1+1 3+1 1 3+1+1）d（1 1+1 1+1+1+1 1）/8=1（1+1 3+1 1 3+1+1）d（1+1 1+1+1+1 1 1）/8=0（1+1 3+1 1 3+1+1）d（1+1 1 1 1 1+1 1）/8=1The result is that A and D sent 1 bits, B sent a 0 bit, and C was silent. Chapter33-3.The following data fragment occurs in the middle of a data stream for which the byte-stuffing algorithm described in the text is used: A B ESC C ESC FLAG FLAG D. What is the output after stuffing?(数据片断（A B ESC C ESC FLAG FLAG D）出现在一个数据流的中间，而成帧方式采用的是本章介绍的字节填充算法，请问经过填充之后的输出时什么？) 答：After stuffing, we get A B ESC ESC C ESC ESC ESC FLAG ESC FLAG D.3-15. A bit stream 10011101 is 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方法来传输位流1001101。