rfc1333.PPP Link Quality Monitoring

合集下载

RFC文档阅读 1-100

RFC文档阅读 1-100
RFC974_邮件路由与域名系统
RFC975_自治联邦
RFC976 UUCP 邮件互换格式标准
RFC985 Internet 网关要求 - 起草
RFC988 主机扩展用于IP多点传送
RFC文档阅读 1001-1500
RFC1050_RPC远程步骤呼叫协议说明书
RFC1055_在串行线路上传输IP数据报的非标准协议
RFC1134_+PPP协议:关于在点到点链路上进行多协议包传送的建议
RFC1142 OSI IS-IS 域内路由协议
RFC1144_低速串行链路上的TCPIP头部压缩
RFC1145 SNMPv2的管理模型
RFC1155_基于TCPIP网络的管理结构和标记
RFC1166_Internet数字
RFC1288_Finger用户信息协议
RFC1298_基于IPX协议的SNMP
RFC1321_MD5 信息-摘要算
RFC1332_PPP Internet 协议控制协议 (IPCP)
RFC1333_PPP 链接质量监控
RFC1355_网络中心数据库的保密和准确性问题
RFC1365 一种IP地址扩展提议
RFC1690 Internet工程与计划组(IEPG)介绍
RFC1691 康奈尔大学数字图书馆文档体系结构
RFC1696 用SMIv2定义的调制解调器MIB
RFC1713_DNS调试工具
RFC1715_地址分配效率比率H
RFC1723_路由信息协议(版本2)
RFC1724_RIP 版本 2 管理系统库(MIB) 扩展
RFC1370_OSPF适用范围声明
RFC1387_RIP(版本2)协议分析

2022年职业考证-通信工程师-通信运营商集中采购考试全真模拟易错、难点剖析AB卷(带答案)试题号:

2022年职业考证-通信工程师-通信运营商集中采购考试全真模拟易错、难点剖析AB卷(带答案)试题号:

2022年职业考证-通信工程师-通信运营商集中采购考试全真模拟易错、难点剖析AB卷(带答案)一.综合题(共15题)1.案例题EPC核心网的中文及英文全称是什么?【答案】演进的分组核心网络,Evolved Packet Core。

【解析】暂无解析。

2.案例题小区_____吞吐量反映了一定网络负荷和用户分布情况下的基站承载效率,是网络规划重要的容量评价指标。

【答案】平均【解析】暂无解析。

3.多选题请列出所有可支持跨系统移动性的事件()问题1选项A.A.A5B.B.A3C.C.B2D.D.B1【答案】C;D【解析】暂无解析。

4.案例题在TD-LTE移动通信系统中,载波带宽_____MHz时,共有50个RB。

【答案】10【解析】暂无解析。

5.案例题请描述“水面覆盖—法线方向水面拉远测试,在下行业务开启下进行水面拉远”这一测试,需要记录哪些测试数据?输出哪些曲线图?(说出至少5项测试数据,2项曲线图)【答案】1.记录ENB的信息,站高,天线角,下倾角,发射功率;记录断点处UE与ENB的距离。

2.绘制水面覆盖RSRP,SINR,L3吞吐量随距离变化曲线;绘制船只行驶路线的RSRP,SINR覆盖及拉远距离。

【解析】暂无解析。

6.判断题小区_____吞吐量反映了一定网络负荷和用户分布情况下的基站承载效率,是网络规划重要的容量评价指标。

问题1选项A.对B.错【答案】A【解析】暂无解析。

7.案例题移动通信中,大量传播路径的存在产生了多径现象,当无主径时其合成波的幅度服从_____分布,相位服从_____分布,通常把这种现象称为_____衰落。

两个相邻深衰落点之间在空间上的分布近似相隔_____个波长。

通常,在基站侧对抗此种衰落的方法有_____分集、_____分集、_____分集。

【答案】瑞利、均匀、快/瑞利、1/2、频率、时间、空间【解析】暂无解析。

8.判断题LTE下行传输模式中_____是MU-MIMO传输模式:主要用来提高小区的容量。

RFC目录及对照表

RFC目录及对照表

RFC930_Telnet 终端类型选项 RFC932_子网地址分配方案 RFC937_邮局协议( 版本 2) RFC948_IP 数据包通过 IEEE 802.3 网络传输的两种方法 RFC949_FTP 未公开的独特命令 RFC951_引导协议(BOOTP) RFC955_朝向一个处理过程应用的传输服务 RFC962_TCP-4 的最初 RFC968 “这是开动前的黑暗” RFC974_邮件路由与域名系统 RFC975_自治联邦 RFC976 UUCP 邮件互换格式标准 RFC985 Internet 网关要求 - 起草 RFC988 主机扩展用于 IP 多点传送
中文 RFC 文档阅读 101-700
RFC102 主机-主机 协议故障清除委员会的说明 RFC103 中断键的执行 RFC104 连接 191 RFC105 通过 UCSB 进行远程登录和远程输出返回的网络说明书 RFC106 用户/服务器 站点协议的网络主机问卷 RFC107 主机-主机 协议故障清除委员会的说明 RFC108 1971 年 2 月 17-19 日在 Urbana 举行的 NWG 会议的人员列表 RFC124 在 RFC107 中有印刷错误 RFC132 RFC107 的排版错误 RFC148 RFC123 的注释 RFC149 最好的铺设计划 RFC154 风格显示 RFC156 伊利诺斯州站点的状态: 响应 RFC116 RFC179 连接的数字分配 RFC185 NIC 分发手册 RFC188 数据管理会议公告 RFC198 站点证明-林肯实验室 360/67 RFC204_利用报路 RFC218 改变 IMP 状态报告设备 RFC228 澄清 RFC232 网络图形会议延缓 RFC245 预定网络工作组会议 RFC246 网络图形会议 RFC256 IMPSYS 变更通知 RFC276 NIC 过程 RFC285 网络图形 RFC324 RJE 协议会议 RFC335 新界面 - IMP/360 RFC348_放弃过程 RFC404 文件迁移协议的注释 RFC405 给 TIP 用户的第二封信 RFC456 UCSB 的数据重置服务 RFC457_FTP 的服务器与服务器交互 RFC496 IMP/TIP 内存更新时间表(修订版 2) RFC516 丢失消息的检测 RFC591 在 NVT ASCII UCSB 和在线系统之间的实验输入映象 RFC621 “注意圣诞节的时候要把长袜挂在烟囱下面” RFC628 更深的数据语言的设计观念 RFC634 最近的网络图 RFC637 SU-DSL 网络地址的更改

rfc1763.The PPP Banyan Vines Control Protocol (BVCP)

rfc1763.The PPP Banyan Vines Control Protocol (BVCP)

Network Working Group S. Senum Request for Comments: 1763 DigiBoard Category: Standards Track March 1995 The PPP Banyan Vines Control Protocol (BVCP)Status of this MemoThis document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions forimprovements. Please refer to the current edition of the "InternetOfficial Protocol Standards" (STD 1) for the standardization stateand status of this protocol. Distribution of this memo is unlimited. AbstractThe Point-to-Point Protocol (PPP) [1] provides a standard method for transporting multi-protocol datagrams over point-to-point links. PPP defines an extensible Link Control Protocol, and proposes a family of Network Control Protocols for establishing and configuring different network-layer protocols.This document defines the Network Control Protocol for establishingand configuring the Banyan VINES protocol over PPP.Table of Contents1. Introduction (2)1.1 Specification of Requirements (2)1.2 Terminology (3)2. A PPP Network Control Protocol for VINES (3)2.1 Sending VINES Datagrams (4)2.2 General Considerations (4)3. BVCP Configuration Options (5)3.1 BV-NS-RTP-Link-Type (5)3.2 BV-FRP (6)3.3 BV-RTP (7)3.4 BV-Suppress-Broadcast (8)SECURITY CONSIDERATIONS (9)REFERENCES (9)ACKNOWLEDGEMENTS (9)CHAIR’S ADDRESS (10)AUTHOR’S ADDRESS (10)Senum [Page 1]1. IntroductionPPP has three main components:1. A method for encapsulating multi-protocol datagrams.2. A Link Control Protocol (LCP) for establishing, configuring,and testing the data-link connection.3. A family of Network Control Protocols for establishing andconfiguring different network-layer protocols.In order to establish communications over a point-to-point link, each end of the PPP link must first send LCP packets to configure and test the data link. After the link has been established and optionalfacilities have been negotiated as needed by the LCP, PPP must sendBVCP packets to choose and configure the VINES network-layerprotocol. Once BVCP has reached the Opened state, VINES datagramscan be sent over the link.The link will remain configured for communications until explicit LCP or BVCP packets close the link down, or until some external eventoccurs (an inactivity timer expires or network administratorintervention).1.1. Specification of RequirementsIn this document, several words are used to signify the requirements of the specification. These words are often capitalized.MUST This word, or the adjective "required", means that thedefinition is an absolute requirement of the specification. MUST NOT This phrase means that the definition is an absoluteprohibition of the specification.SHOULD This word, or the adjective "recommended", means that there may exist valid reasons in particular circumstances toignore this item, but the full implications must beunderstood and carefully weighed before choosing adifferent course.MAY This word, or the adjective "optional", means that thisitem is one of an allowed set of alternatives. Animplementation which does not include this option MUST beprepared to interoperate with another implementation which does include the option.Senum [Page 2]1.2. TerminologyThis document frequently uses the following terms:datagram The unit of transmission in the network layer (such as IP).A datagram may be encapsulated in one or more packetspassed to the data link layer.frame The unit of transmission at the data link layer. A framemay include a header and/or a trailer, along with somenumber of units of data.packet The basic unit of encapsulation, which is passed across the interface between the network layer and the data linklayer. A packet is usually mapped to a frame; theexceptions are when data link layer fragmentation is being performed, or when multiple packets are incorporated into a single frame.peer The other end of the point-to-point link.silently discardThis means the implementation discards the packet withoutfurther processing. The implementation SHOULD provide the capability of logging the error, including the contents of the silently discarded packet, and SHOULD record the event in a statistics counter.2. A PPP Network Control Protocol for VINESThe Banyan VINES Control Protocol (BVCP) is responsible forconfiguring, enabling, and disabling the VINES protocol modules onboth ends of the point-to-point link. BVCP uses the same packetexchange mechanism as the Link Control Protocol. BVCP packets maynot be exchanged until PPP has reached the Network-Layer Protocolphase. BVCP packets received before this phase is reached should be silently discarded.The Baynan VINES Control Protocol is exactly the same as the LinkControl Protocol [1] with the following exceptions:Frame ModificationsThe packet may utilize any modifications to the basic frame format which have been negotiated during the Link Establishment phase. Senum [Page 3]Data Link Layer Protocol FieldExactly one BVCP packet is encapsulated in the Information fieldof a PPP Data Link Layer frame where the Protocol field indicates type hex 8035 (Banyan VINES Control Protocol).Code fieldOnly Codes 1 through 7 (Configure-Request, Configure-Ack,Configure-Nak, Configure-Reject, Terminate-Request, Terminate-Ack and Code-Reject) are used. Other Codes should be treated asunrecognized and should result in Code-Rejects.TimeoutsBVCP packets may not be exchanged until PPP has reached theNetwork-Layer Protocol phase. An implementation should beprepared to wait for Authentication and Link Quality Determination to finish before timing out waiting for a Configure-Ack or otherresponse. It is suggested that an implementation give up onlyafter user intervention or a configurable amount of time.Configuration Option TypesBVCP has a distinct set of Configuration Options.2.1. Sending VINES DatagramsBefore any VINES datagrams may be communicated, PPP must reach theNetwork-Layer Protocol phase, and the Banyan VINES Control Protocolmust reach the Opened state.Exactly one VINES packet is encapsulated in the Information field of a PPP Data Link Layer frame where the Protocol field indicates typehex 0035 (Banyan VINES datagram). The maximum length of a VINESdatagram transmitted over a PPP link is the same as the maximumlength of the Information field of a PPP data link layer frame.The format of the Information field itself is the same as thatdefined in [2].2.2. General ConsiderationsVINES supports an Address Resolution Protocol, VINES ARP, primarilyused for address assignment. Since this protocol is part of VINESIP, it is fully supported over BVCP. VINES also supports a data-link Echo Protocol (VINES Echo), used to test connectivity to a VINESServer in a LAN environment, which is not supported over BVCP.Senum [Page 4]3. BVCP Configuration OptionsBVCP Configuration Options allow modifications to the standardcharacteristics of the network-layer protocol to be negotiated. If a Configuration Option is not included in a Configure-Request packet,the default value for that Configuration Option is assumed.BVCP uses the same Configuration Option format defined for LCP [1],with a separate set of Options.Up-to-date values of the BVCP Option Type field are specified in the most recent "Assigned Numbers" RFC [3]. Current values are assigned as follows:Value Option1 BV-NS-RTP-Link-Type2 BV-FRP3 BV-RTP4 BV-Suppress-BroadcastNote: A suggestion was made to combine the BV-NS-RTP-Link-Type option and the BV-RTP option into a single option that could negotiate oneof four settings (S-RTP, NS-RTP-LAN, NS-RTP-WAN, NO-RTP). Thissuggestion has been rejected because VINES must already deal with amix of S-RTP and NS-RTP, and that pushing this information down tothe PPP layer is not desirable.3.1. BV-NS-RTP-Link-TypeDescriptionThis Configuration Option provides a way to negotiate the way the Non-Sequenced Routing Update Protocol (NS-RTP) (pre-VINES 5.5,i.e., 4.11 and 5.0) will run on the link. NS-RTP handles updates differently depending on whether the interface is a LAN type or a WAN type. For a LAN type, the full routing table is rebroadcastevery update interval (90 seconds). For a WAN type, the fullrouting table is only transmitted for the first 3 update intervals after the link comes up. After that only changes are transmitted (for 5 update intervals). Note that this has no effect ifSequenced RTP (VINES 5.5) is being used. More information on this can be found in [2].This option negotiates what an implementation is willing toreceive, and is negotiated separately per side of the PPPconnection. The acceptance of this option (by the peer) indicates that the peer will send NS-RTP updates as if the link was a LAN Senum [Page 5]type. The rejection (or absence) of this option indicates thatthe peer will send NS-RTP updates as if the link was a WAN type.By default, NS-RTP updates are sent as if the link was a WAN type.A summary of the BV-NS-RTP-Link-Type Configuration Option format isshown below. The fields are transmitted from left to right.0 10 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Type | Length |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Type1Length23.2. BV-FRPDescriptionThis Configuration Option provides a way to negotiate the use ofVINES Fragmentation Protocol (FRP). This protocol is used toallow fragmentation and reassembly of a VINES packet over thelink. FRP prepends a two octet field to every packet going overthe link that contains a begin and end fragment information and a sequence number. With PPP’s default MRU of 1500, FRP is notnormally needed, and no FRP header would be sent with the VINESpacket. If a MRU of less than 1484 is negotiated, FRP will beneeded to send a full size VINES packet over the link. Moreinformation on this can be found in [2].This option negotiates what an implementation is willing toreceive, and is negotiated separately per side of the PPPconnection. The acceptance of this option (by the peer) indicates that the peer will send VINES packets with a FRP header. Therejection (or absence) of this option indicates that the peer will send VINES packets without a FRP header.By default, VINES packets are sent without a FRP header.Senum [Page 6]The fields are transmitted from left to right.0 10 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Type | Length |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Type2Length23.3. BV-RTPDescriptionThis Configuration Option provides a way to negotiate whether RTP is used over the link. If dial-up lines with static routes arebeing used, the use of RTP may be totally suppressed to conservebandwidth on the link.This option negotiates what an implementation is willing toreceive, and is negotiated separately per side of the PPPconnection. The acceptance of this option (by the peer) indicates that the peer will not send RTP packets. The rejection (orabsence) of this option indicates that the peer will send any RTP packets.By default, RTP packets are sent over the link.Senum [Page 7]The fields are transmitted from left to right.0 10 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Type | Length |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Type3Length23.4. BV-Suppress-BroadcastDescriptionThis Configuration Option provides a way to negotiate the sending of VINES broadcast packets, i.e., packets with a destination VINES network address of all ones. This option only affects VINESpackets that are not of type VINES ARP or VINES RTP. This option can be used by a VINES Client to request that most of thebroadcast packets that would normally be sent to it by a VINESServer be discarded, in order to conserve link bandwidth. Most of the broadcast packets sent by a VINES Server are not useful to aVINES Client.This option negotiates what an implementation is willing toreceive, and is negotiated separately per side of the PPPconnection. The acceptance of this option (by the peer) indicates that the peer MUST NOT send any VINES broadcast packets, otherthan packets of type VINES ARP or VINES RTP. The rejection (orabsence) of this option indicates that the peer will send allVINES broadcast packets.By default, all VINES broadcast packets are sent.Senum [Page 8]A summary of the BV-Suppress-Broadcast Configuration Option format is shown below. The fields are transmitted from left to right.0 10 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Type | Length |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Type4Length2Security ConsiderationsSecurity issues are not discussed in this memo.References[1] Simpson, W., "The Point-to-Point Protocol (PPP)", STD 51, RFC1661, Daydreamer, July 1994.[2] Banyan, "VINES Protocol Definition", June 1993, Order No.003673.[3] Reynolds, J., and J. Postel, "Assigned Numbers", STD 2, RFC 1700, USC/Information Sciences Institute, October 1994. AcknowledgementsSome of the text in this document is taken from previous documentsproduced by the Point-to-Point Protocol Working Group of the Internet Engineering Task Force (IETF).In particular, Bill Simpson provided the boiler-plate used to create this document.Senum [Page 9]Chair’s AddressThe working group can be contacted via the current chair:Fred BakerCisco Systems519 Lado DriveSanta Barbara, California 93111Phone: (805) 681-0115EMail: fred@Author’s AddressQuestions about this memo can also be directed to:Steven J. SenumDigiBoard6400 Flying Cloud DriveEden Prairie, Minnesota 55344Phone: (612) 943-9020EMail: sjs@Senum [Page 10]。

RFC1332_PPP Internet 协议控制协议 (IPCP)

RFC1332_PPP Internet 协议控制协议 (IPCP)

组织:中国互动出版网(/)RFC文档中文翻译计划(/compters/emook/aboutemook.htm)E-mail:ouyang@译者:龙天泳(longty2000)译文发布时间:2001-3-30版权:本中文翻译文档版权归中国互动出版网所有。

可以用于非商业用途自由转载,但必须保留本文档的翻译及版权信息。

Network Working Group G. McGregor Request for Comments: 1332 Merit Obsoletes: RFC 1172 May 1992RFC1332 端对端协议网间协议控制协议(IPCP)(RFC1332 The PPP Internet Protocol Control Protocol (IPCP))本备忘录状态This memo provides information for the Internet community. It doesnot specify an Internet standard of any kind. Distribution of thismemo is unlimited.摘要PPP协议(端对端协议)[ 1 ]提供在点对点链路上面压缩网络层协议信息的标准的方法。

同样,PPP协议定义可扩展的链路控制协议,和为了建立和配置不同的网络层协议的网络控制协议(NCP)族。

本文档定义了为了在PPP协议上面建立和配置网间协议[ 2 ]的NCP,以及协商和使用PPP协议上Van Jacobson TCP/IP报头压缩[ 3 ]的方法。

本RFC是国际网工作交流协会的串列点协议工作(IETF)小组的成果。

目录1.介绍 (2)2.端对端协议网络控制协议(NCP)为IP (3)2.1 发送IP数据报 (3)3.IPCP配置可选项 (3)3.1 IP-地址(IP-Addresses) (4)3.2 IP-压缩协议 (4)3.3 IP-地址(IP-Address) (5)4.VAN JACOBSON TCP/IP报头压缩 (5)4.1 配置可选项格式 (5)附录A.IPCP推荐的可选项 (6)安全考虑 (6)参考 (6)1.介绍PPP协议有3个主要的部分:1.串行的链路上压缩数据报的方法。

学习网络常用的RFC文档的名称

学习网络常用的RFC文档的名称

学习网络常用的RFC文档的名称双语RFC --RFC中英文对照版rfc1050中文版-远程过程调用协议规范rfc1055中文版-在串行线路上传输IP数据报的非标准协议rfc1057中文版-RFC:远程过程调用协议说明第二版rfc1058中文版-路由信息协议(Routing Information Protocol)rfc1073中文版-RFC1073 Telnet窗口尺寸选项rfc1075中文版-远距离矢量多播选路协议rfc1088中文版-在NetBIOS网络上传输IP数据报的标准rfc1090中文版-SMTP在X.25上rfc1091中文版-TELNET终端类型选项rfc1094中文版-RFC1094 网络文件系统协议rfc1096中文版-Telnet X显示定位选项rfc1097中文版-Telnet潜意识-信息选项rfc1112中文版-主机扩展用于IP多点传送rfc1113中文版-Internet电子邮件保密增强:Part1-消息编码和鉴别过程rfc1132中文版-802.2分组在IPX网络上传输的标准rfc1144中文版-低速串行链路上的TCP/IP头部压缩rfc1155中文版-基于TCP/IP网络的管理结构和标记rfc1191中文版-RFC1191 路径MTU发现rfc1332中文版-RFC1332 端对端协议网间协议控制协议(IPCP)rfc1333中文版-PPP 链路质量监控rfc1334中文版-PPP 身份验证协议rfc1387中文版-RIP(版本2)协议分析rfc1388中文版-RIP协议版本2rfc1433中文版-直接ARPrfc1445中文版-SNMPv2的管理模型rfc1582中文版-扩展RIP以支持按需链路rfc1618中文版-ISDN上的PPP(点对点)协议rfc1661中文版-RFC1661 PPP协议rfc1723中文版-路由信息协议(版本2)rfc1738中文版-统一资源定位器(URL)rfc1769中文版-简单网络时间协议( SNTP)rfc1771中文版-边界网关协议版本4(BGP-4)rfc1827中文版-IP封装安全载荷(ESP)rfc1883中文版-Internet协议,版本6(IPv6)说明书rfc1939中文版-POP3协议rfc1945中文版-超文本传输协议 -- HTTP/1.0rfc1994中文版-PPP挑战握手认证协议(CHAP)rfc1997中文版-RFC1997 BGP团体属性rfc2002中文版-IP移动性支持rfc204中文版-利用报路rfc2105中文版-Cisco 系统的标签交换体系结构纵览rfc2281中文版-Cisco热备份路由协议()rfc2283中文版-BGP-4的多协议扩展rfc2326中文版-实时流协议(RTSP)rfc2328中文版-OSPF版本2rfc2516中文版-在以太网上传输PPP的方法(PPPoE)rfc2526中文版-IPv6保留的子网任意传送地址rfc2547中文版-BGP/MPLS VPNsrfc2616中文版-超文本传输协议——HTTP/1.1rfc2702中文版-基于MPLS的流量工程要求rfc2706中文版-RFC2706—电子商务域名标准rfc2756中文版-超文本缓存协议(HTCP/0.0)rfc2764中文版-IP VPN的框架体系rfc2773中文版-使用KEA和SKIPJACK加密rfc2774中文版-HTTP扩展框架rfc2781中文版-UTF-16, 一种ISO 10646的编码方式rfc2784中文版-通用路由封装rfc2793中文版-用于文本交谈的RTP负载rfc2796中文版-BGP路由反射rfc2917中文版-核心 MPLSIP VPN 体系结构rfc2918中文版-BGP-4(边界网关协议)的路由刷新功能rfc2923中文版-TCP的路径MTU发现问题rfc3003中文版-Audio/mpeg 媒体类型rfc3005中文版-IETF 讨论列表许可证rfc3007中文版-安全的域名系统动态更新rfc3018中文版-统一内存空间协议规范rfc3022中文版-传统IP网络地址转换(传统NAT)rfc3032中文版-RFC3032 MPLS标记栈编码rfc3033中文版-用于Internet协议的信息域和协议标识符在Q.2941类属标识符和Q.2957 User-to-user信令中的分配rfc3034中文版-标签转换在帧中继网络说明书中的使用rfc3037中文版-RFC3037 标记分配协议的适用范围(RFC3037 LDP Applicability)rfc3058中文版-IDEA加密算法在CMS上的使用rfc3059中文版-服务定位协议的属性列表扩展rfc3061中文版-对象标识符的一种URN姓名空间rfc3062中文版-LDAP口令修改扩展操作rfc3063中文版-MPLS(多协议标签交换)环路预防机制rfc3066中文版-语言鉴定标签rfc3067中文版-事件对象描述和转换格式要求rfc3069中文版-VLAN聚合实现IP地址有效分配rfc3070中文版-基于帧中继的第二层隧道协议rfc3072中文版-结构化数据交换格式rfc3074中文版-DHCP 负载平衡算法rfc3078中文版-RFC3078微软点到点加密(MPPE)协议rfc3081中文版-将区块扩展交换协议(BEEP)核心映射到传输控制协议(TCP)rfc3083中文版-遵循DOCSIS的Cable Modem和CMTS的PBI 的管理信息数据库rfc3085中文版-新闻型标记语言(NewsML)资源的URN名字空间rfc3090中文版-域名系统在区域状况下的安全扩展声明rfc3091中文版-Pi数字生成协议rfc3093中文版-防火墙增强协议rfc3550中文版-RTP:实时应用程序传输协议rfc457中文版-TIPUGrfc697中文版-FTP的CWD命令rfc698中文版-TELNET扩展ASCII选项rfc775中文版-面向目录的 FTP 命令rfc779中文版-TELNET的SEND-LOCATION选项rfc792中文版-RFC792- Internet控制信息协议(ICMP)rfc821中文版-RFC821 简单邮件传输协议(SMTP)rfc826中文版-以太网地址转换协议或转换网络协议地址为48比特以太网地址用于在以太网硬件上传输rfc854中文版-TELNET协议规范rfc855中文版-TELNET选项规范rfc856中文版-RFC856 TELNET二进制传输rfc857中文版-RFC 857 TELNET ECHO选项rfc858中文版-RFC 858 TELNET SUPPRESS GO AHEAD选项rfc859中文版-RFC 859 TELNET的STATUS选项rfc860中文版-RFC 860 TELNET TIMING MARK选项rfc861中文版-RFC 861 TELNET扩展选项-LISTrfc862中文版-RFC 862 Echo 协议rfc868中文版-RFC868 时间协议rfc894中文版-IP 数据包通过以太网网络传输标准rfc903中文版-反向地址转换协议rfc930中文版-Telnet终端类型选项(RFC930——T elnet Terminal Type Option)rfc932中文版-子网地址分配方案rfc937中文版-邮局协议 (版本2)rfc948中文版-IP数据报通过IEEE802.3网络传输的两种方法rfc949中文版-FTP 未公开的独特命令rfc951中文版-引导协议(BOOTP)rfc962中文版-TCP-4 的最初rfc974中文版-邮件路由与域名系统rfc975中文版-自治联邦。

2022年职业考证-通信工程师-通信运营商集中采购考试全真模拟易错、难点剖析AB卷(带答案)试题号:

2022年职业考证-通信工程师-通信运营商集中采购考试全真模拟易错、难点剖析AB卷(带答案)试题号:

2022年职业考证-通信工程师-通信运营商集中采购考试全真模拟易错、难点剖析AB卷(带答案)一.综合题(共15题)1.案例题请列举解调、译码LTE PDSCH数据信道时DCI中需要携带的信息,至少3种?【答案】资源分配位置,调制方式,HARQ process Number,RV版本,新数据指示【解析】暂无解析。

2.案例题列举LTE/EPC网络与现有3GPP的2G和3G的网络融合的两种解决方案。

【答案】1.基于Gn接口的SGSN方案,又名遵从R8以前规范的SGSN;(3分) 2.基于S3,S4接口的SGSN方案,又名遵从R8规范的SGSN。

(3分)【解析】暂无解析。

3.案例题通常情况下,TD-LTE网络区域覆盖概率规划目标定为_____%区域满足定义的最小接收电平门限。

【答案】95【解析】暂无解析。

4.案例题什么是PCI?【答案】LTE的物理小区标识(PCI)是用于区分不同小区的信号,保证在相关小区覆盖范围内同一频点上没有相同的物理小区标识。

【解析】暂无解析。

5. 案例题下行DL-SCH处理包括哪些步骤?【答案】CRC->信道编码->HARQ处理->加扰->调制->层映射->预编码->资源块映射【解析】暂无解析。

6.案例题P-SS与S-SS在小区搜索流程当中的作用分别是什么?【答案】UE捕获P-SS之后,可以获知: 1.小区中心频点的频率 2.小区在物理组内的标识 3.半帧同步UE捕获S-SS之后,可以获知: 1.帧同步 2.物理小区组的的识别【解析】暂无解析。

7.案例题列出天线的其中四项主要电气参数?【答案】天线增益,频带宽度,极化方向,波瓣角宽度,前后比,最大输入功率,驻波比,三阶互调,天线口隔离度【解析】暂无解析。

8.案例题平滑升级的TDL基站,可以继承原3G相应站点的_____,例如邻区关系、切换基本参数等。

【答案】参数规划【解析】暂无解析。

9.多选题请列出所有可支持跨系统移动性的事件()问题1选项A.A.A5B.B.A3C.C.B2D.D.B1【答案】C;D【解析】暂无解析。

PPP协议规范

PPP协议规范

P P P协议规范1 介绍PPP是为在同等单元之间传输数据包这样的简单的链路而设计的。

这种链路提供全双工操作,并按照顺序传递数据包。

(人们)有意让PPP为基于各种主机、网桥和路由器的简单连接提供一种共通的解决方案。

封装:PPP封装提供了不同网络层协议同时通过统一链路的多路技术。

精心的设计PPP封装,使其保有对常用支持硬件的兼容性。

当使用默认的类HDLC帧(HDLC-like framing)时,仅需要8个额外的字节,就可以形成封装。

在带宽需要付费时,封装和帧可以减少到2或4个字节。

为了支持高速的执行,默认的封装只使用简单的字段,多路分解只需要对其中的一个字段进行检验。

默认的头和信息字段落在32-bit边界上,尾字节可以被填补到任意的边界。

链路控制协议(LCP):为了在一个很宽广的环境内能足够方便的使用,PPP提供了LCP。

LCP用于就封装格式选项自动的达成一致,处理数据包大小的变化,探测looped-back链路和其他普通的配置错误,以及终止链路。

提供的其他可选设备有:对链路中同等单元标识的认证,和当链路功能正常或链路失败时的决定。

网络控制协议:点对点连接可能和当前的一族网络协议产生许多问题。

例如,基于电路交换的点对点连接(比如拨号模式服务),分配和管理IP地址,即使在LAN环境中,也非常困难。

这些问题由一族网络控制协议(NCP)来处理,每一个协议管理着各自的网络层协议的特殊需求。

配置:有意使PPP链路很容易配置。

通过设计,标准的默认值处理全部的配置。

执行者可以对默认配置进行改进,它被自动的通知给其同等单元而无需操作员的干涉。

最终,操作员可以明确的为链路设定选项,以便其正常工作。

2 PPP封装PPP封装用于消除多协议datagrams的歧义。

封装需要帧同步以确定封装的开始和结束。

提供帧同步的方法在参考文档中。

PPP封装的概要如下所示。

字段的传输从左到右。

协议字段:协议字段由一个或两个字节组成。

它的值标识着压缩在packet的信息字段里的datagram。

  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

Network Working Group W. Simpson Request for Comments: 1333 Daydreamer May 1992PPP Link Quality MonitoringStatus of this MemoThis RFC specifies an IAB standards track protocol for the Internetcommunity, and requests discussion and suggestions for improvements. Please refer to the current edition of the "IAB Official ProtocolStandards" for the standardization state and status of this protocol. Distribution of this memo is unlimited.AbstractThe Point-to-Point Protocol (PPP) [1] provides a standard method ofencapsulating Network Layer protocol information over point-to-point links. PPP also defines an extensible Link Control Protocol, whichallows negotiation of a Quality Protocol for continuous monitoring of the viability of the link.This document defines a protocol for generating Link-Quality-Reports. This RFC is a product of the Point-to-Point Protocol Working Group of the Internet Engineering Task Force (IETF). Comments on this memoshould be submitted to the ietf-ppp@ mailing list.Simpson [Page i]Table of Contents1. Introduction (1)2. Link Quality Monitoring (2)2.1 Design Motivation (2)2.2 Counters (2)2.3 Counting Packets and Octets (4)2.4 Processes (4)2.5 Configuration Option Format (6)2.6 Packet Format (8)2.7 Transmission of Reports (12)2.8 Calculations (12)2.9 Failure Detection (13)2.10 Policy Suggestions (14)SECURITY CONSIDERATIONS (14)REFERENCES (14)ACKNOWLEDGEMENTS (14)CHAIR’S ADDRESS (15)AUTHOR’S ADDRESS (15)Simpson [Page ii]1. IntroductionPPP has three main components:1. A method for encapsulating datagrams over serial links.2. A Link Control Protocol (LCP) for establishing, configuring,and testing the data-link connection.3. A family of Network Control Protocols (NCPs) for establishingand configuring different network-layer protocols.In order to establish communications over a point-to-point link, each end of the PPP link must first send LCP packets to configure the data link during the Establishment phase. During the Authentication andNetwork-Layer Protocol phases, the link may be tested to determine if quality is sufficient for operation. This testing is completelyoptional.If an implementation desires that the peer use some specific linkquality monitoring protocol, then it MUST negotiate the use of thatprotocol using the Quality-Protocol Configuration Option during Link Establishment phase.The negotiation mechanism is independent in each direction. However, if the peer agrees to send Quality-Protocol packets, it MUSTcorrectly process such packets on reception, even if it does notrequest such packets or implement a monitoring policy.Simpson [Page 1]2. Link Quality MonitoringData communications links are rarely perfect. Packets can be dropped or corrupted for various reasons (line noise, equipment failure,buffer overruns, etc.). Sometimes, it is desirable to determinewhen, and how often, the link is dropping data. Routers, forexample, may want to temporarily allow another route to takeprecedence. An implementation may also have the option ofdisconnecting and switching to an alternate link. The process ofdetermining data loss is called "Link Quality Monitoring".2.1. Design MotivationThere are many different ways to measure link quality, and even more ways to react to it. Rather than specifying a single scheme, LinkQuality Monitoring is divided into a "mechanism" and a "policy". PPP fully specifies the "mechanism" for Link Quality Monitoring bydefining the Link-Quality-Report (LQR) packet and specifying aprocedure for its use. PPP does NOT specify a Link QualityMonitoring "policy" -- how to judge link quality or what to do whenit is inadequate. That is left as an implementation decision, andcan be different at each end of the link. Implementations areallowed, and even encouraged, to experiment with various link quality policies. The Link Quality Monitoring mechanism specificationinsures that two implementations with different policies maycommunicate and interoperate.To allow flexible policies to be implemented, the PPP Link QualityMonitoring mechanism measures data loss in units of packets, octets, and Link-Quality-Reports. Each measurement is made separately foreach half of the link, both inbound and outbound. All measurementsare communicated to both ends of the link so that each end of thelink can implement its own link quality policy for both its outbound and inbound links.Finally, the Link Quality Monitoring protocol is designed to beimplementable on many different kinds of systems. Although it may be common to implement PPP (and especially Link Quality Monitoring) as a single software process, multi-process implementations with hardware support are also envisioned. The PPP Link Quality Monitoringmechanism provides for this by careful definition of the Link-Quality-Report packet format, and by specifying reference points for all data transmission and reception measurements.2.2. CountersEach Link Quality Monitoring implementation maintains counts of thenumber of packets and octets transmitted and successfully received, Simpson [Page 2]and periodically transmits this information to its peer in a Link-Quality-Report packet.These counters are similar to sequence numbers; they are constantlyincreasing to give a "relative" indication of the number of packetsand octets communicated across the outbound link. By comparing thevalues in successive Link-Quality-Reports, an LQR receiver cancompute the "delta" number of packets and octets successfullycommunicated across the link. Comparing these absolute numbers then gives an indication of a link’s quality. Relative numbers, ratherthan absolute, are transmitted because they greatly simplify linksynchronization.The Link-Quality-Report uses the Interface counters defined by SNMPMIB-II [2]. These counters are not initialized to any particularvalue when the LCP enters the Establishment phase.In addition, the Link-Quality-Report requires the implementation ofthe following three unsigned, monotonically increasing counters which conform to the type and size requirements for SNMP MIB Counters [3]. OutLQRsOutLQRs is a 32-bit counter which increases by one for eachtranmitted Link-Quality-Report packet. This counter MUST be setto zero when the LCP enters the Establishment phase, and MUST NOT be reset until the LCP leaves the Termination phase. This counter is incremented before it is inserted into the LQR packet.InLQRsInLQRs is a 32-bit counter which increases by one for eachreceived Link-Quality-Report packet. This counter MUST be set to zero when the LCP enters the Establishment phase, and MUST NOT be reset until the LCP leaves the Termination phase. This counter is incremented before it is inserted (in an implementation dependent fashion) into the LQR packet.InGoodOctetsInGoodOctets is a 32-bit counter which increases by the number of octets in each successfully received Data Link Layer packet.Unlike the MIB ifInOctets, octets for frames which are counted in ifInDiscards and ifInErrors MUST NOT be counted. This counter MAY be set to any initial value when the LCP enters the Establishment phase, but MUST NOT be reset until the LCP leaves the Termination phase.Simpson [Page 3]2.3. Counting Packets and OctetsThe intent of the counters is to provide an indication of the amount of information passing over the link, rather than an actualmeasurement of the total bandwidth used. This specification isdesigned to yield the same count in various circumstances, such aswhen a separate device provides the framing and escaping mechanismsinvisibly to the implementation, or a synchronous-to-asynchronousconverter in the link changes between mechanisms.All octets which are included in the FCS calculation MUST be counted, including the packet header, the information field, and any padding. The FCS octets MUST also be counted, and one flag octet per frameMUST be counted. All other octets (such as additional flagsequences, and escape bits or octets) MUST NOT be counted.When inserting the packet and octet counts in the LQR, the countsMUST include the expected values for the LQR itself.2.4. ProcessesThe PPP Link Quality Monitoring mechanism is described using a"logical process" model. As shown below, there are five logicalprocesses duplicated at each end of the duplex link.+---------+ +-------+ +----+ Outbound| |-->| Mux |-->| Tx |=========>| Link- | +-------+ +----+| Manager || | +-------+ +----+ Inbound| |<--| Demux |<--| Rx |<=========+---------+ +-------+ +----+Link-ManagerThe Link-Manager process transmits and receives Link-Quality-Reports, and implements the desired link quality policy. LQRpackets are transmitted at a constant rate, which is negotiated by the LCP Quality-Protocol Configuration Option.MuxThe Mux process multiplexes packets from the various protocols(e.g., LCP, IP, XNS, etc.) into a single, sequential, andprioritized stream of packets. Link-Quality-Report packets MUSTbe given the highest possible priority to insure that link quality information is communicated in a timely manner.Simpson [Page 4]TxThe Tx process maintains the MIB counters ifOutUniPackets andifOutOctets, and the internal counter OutLQRs, which are used tomeasure the amount of data which is transmitted on the outboundlink. When Tx processes a Link-Quality-Report packet, it inserts the values of these counters into the corresponding PeerOut...fields of the packet. The Tx process MUST follow the Mux process so that packets are counted in the order transmitted to the link. RxThe Rx process maintains the MIB counters ifInUniPackets,ifInDiscards, ifInErrors and IfInOctets, and the internal counters InLQRs and InGoodOctets, which are used to measure the amount ofdata which is received by the inbound link. When Rx processes aLink-Quality-Report packet, it inserts the values of thesecounters into the corresponding SaveIn... fields of the packet (in an implementation dependent manner).DemuxThe Demux process demultiplexes packets for the various protocols. The Demux process MUST follow the Rx process so that packets arecounted in the order received from the link.Simpson [Page 5]2.5. Configuration Option FormatDescriptionImplementations MUST be prepared to receive the Quality-ProtocolConfiguration Option for the Link-Quality-Report. However,negotiation is not required. Negotiation is only necessary whenthe implementation wishes to ensure that the peer transmits Link- Quality-Reports as opposed to some other Quality-Protocol, or else to prevent the peer from maintaining its own timer, or else toestablish a maximum time between transmissions of Link-Quality-Reports.A summary of the Quality-Protocol Configuration Option format tonegotiate the Link-Quality-Report is shown below. The fields aretransmitted from left to right.0 1 2 30 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Type | Length | Quality-Protocol |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Reporting-Period |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Type4Length8Quality-Protocolc025 (hex) for Link-Quality-ReportReporting-PeriodThe Reporting-Period field is four octets and indicates themaximum time in hundredths of seconds between transmission ofpackets. The peer MAY transmit packets at a faster rate than that which was negotiated.A value of zero indicates that the peer does not need to maintain a timer. Instead, the peer generates a LQR immediately uponreceiving a LQR. A value of zero MUST be Nak’d by the peer with Simpson [Page 6]an appropriate non-zero value when that peer has sent or will send a Configure-Request packet containing the Quality-ProtocolConfiguration Option for the Link-Quality-Report with a zeroReporting-Period.Simpson [Page 7]2.6. Packet FormatExactly one Link-Quality-Report packet is encapsulated in theInformation field of PPP Data Link Layer frames where the protocolfield indicates type hex c025 (Link-Quality-Report). A summary ofthe LQR packet format is shown below. The names of the fields arerelative to the packet receiver, since it is the receiver whorequested the packet in the Configuration Option. The fields aretransmitted from left to right.0 1 2 30 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| Magic-Number |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| LastOutLQRs |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| LastOutPackets |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| LastOutOctets |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| PeerInLQRs |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| PeerInPackets |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| PeerInDiscards |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| PeerInErrors |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| PeerInOctets |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| PeerOutLQRs |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| PeerOutPackets |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| PeerOutOctets |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+The following fields are not actually transmitted over the inboundlink. Rather, they are logically appended (in an implementationdependent manner) to the packet by the implementation’s Rx process.+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| SaveInLQRs |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| SaveInPackets |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| SaveInDiscards | Simpson [Page 8]+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| SaveInErrors |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+| SaveInOctets |+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Magic-NumberThe Magic-Number field is four octets and aids in detecting links which are in the looped-back condition. Unless modified by aConfiguration Option, the Magic-Number MUST be transmitted as zero and MUST be ignored on reception. If Magic-Numbers have beennegotiated, incoming LQR packets SHOULD be checked to ensure that the local end is not seeing its own Magic-Number and thus alooped-back link. See the Magic-Number Configuration Option forfurther explanation.LastOutLQRsThe LastOutLQRs field is four octets, and is copied from the most recently received PeerOutLQRs on transmission.LastOutPacketsThe LastOutPackets field is four octets, and is copied from themost recently received PeerOutPackets on transmission.LastOutOctetsThe LastOutOctets field is four octets, and is copied from themost recently received PeerOutOctets on transmission.PeerInLQRsThe PeerInLQRs field is four octets, and is copied from the mostrecently received SaveInLQRs on transmission.Whenever the PeerInLQRs field is discovered to be zero, theLastOut... fields are indeterminate, and the PeerIn... fieldscontain the initial values for the peer.PeerInPacketsThe PeerInPackets field is four octets, and is copied from themost recently received SaveInPackets on transmission.Simpson [Page 9]PeerInDiscardsThe PeerInDiscards field is four octets, and is copied from themost recently received SaveInDiscards on transmission.PeerInErrorsThe PeerInErrors field is four octets, and is copied from the most recently received SaveInErrors on transmission.PeerInOctetsThe PeerInOctets field is four octets, and is copied from the most recently received SaveInOctets on transmission.PeerOutLQRsThe PeerOutLQRs field is four octets, and is copied from OutLQRson transmission. This number MUST include this LQR.PeerOutPacketsThe PeerOutPackets field is four octets, and is copied from thecurrent MIB ifOutUniPackets and ifOutNUniPackets on transmission. This number MUST include this LQR.PeerOutOctetsThe PeerOutOctets field is four octets, and is copied from thecurrent MIB ifOutOctets on transmission. This number MUST include this LQR.SaveInLQRsThe SaveInLQRs field is four octets, and is copied from InLQRs on reception. This number MUST include this LQR.SaveInPacketsThe SaveInPackets field is four octets, and is copied from thecurrent MIB ifInUniPackets and ifInNUniPackets on reception. This number MUST include this LQR.SaveInDiscardsThe SaveInDiscards field is four octets, and is copied from thecurrent MIB ifInDiscards on reception. This number MUST includethis LQR.Simpson [Page 10]SaveInErrorsThe SaveInErrors field is four octets, and is copied from thecurrent MIB ifInErrors on reception. This number MUST includethis LQR.SaveInOctetsThe SaveInOctets field is four octets, and is copied from thecurrent InGoodOctets on reception. This number MUST include this LQR.Note that InGoodOctets is not the same as the MIB ifInOctetscounter, as InGoodOctets does not include octets for packets which are discards or errors.Simpson [Page 11]2.7. Transmission of ReportsWhen the PPP Link Control Protocol has reached the Opened state, the Link Quality Monitoring process MAY commence sending Link-Quality-Reports. If a Protocol-Reject is received specifying a LQR packet,the LQM process MUST cease sending LQRs.Usually, the LQR is transmitted when the LQR timer for the linkexpires. If no LQR timer is used, a LQR is generated upon receipt of an incoming LQR. The negotiation process ensures that at least oneside of the link is using a LQR timer.In addition, a LQR is generated whenever two successive LQRs arereceived which have the same PeerInLQRs value. This may indicatethat a LQR has been missed, or that the implementation is sending at a significantly slower rate than the peer, or that the peer hasaccelerated LQR generation to better quantify errors on the link.Whenever a LQR is sent, the LQR timer MUST be restarted.2.8. CalculationsEach time a Link-Quality-Report packet is received from the inboundlink, the Link-Manager can compare the associated fields. The fields of the previous LQR can be subtracted from the current LQR values to obtain an absolute "delta", which allows comparision of the changesseen by each end of the link.If the received PeerInLQRs field is zero, the LastOut... fields areindeterminate, and the PeerIn... fields contain the initial valuesfor the peer. No calculations using these fields can be performed at this time.Implementation Note:The following counters wrap to zero when their maximum value isreached. Care must be taken to ensure that correct "delta"calculations are performed at that time.The LastOutLQRs field may be directly compared with the PeerInLQRsfield to determine how many outbound LQRs have been lost.The LastOutLQRs field may be directly compared with the OutLQRscounter to determine how many outbound LQRs are still in thepipeline.The change in PeerInPackets may be compared with the change inLastOutPackets to determine the number of lost packets over the Simpson [Page 12]outgoing link.The change in PeerInOctets may be compared with the change inLastOutOctets to determine the number of lost octets over theoutgoing link.The change in SaveInPackets may be compared with the change inPeerOutPackets to determine the number of lost packets over theincoming link.The change in SaveInOctets may be compared with the change inPeerOutOctets to determine the number of lost octets over theincoming link.The change in the PeerInDiscards and PeerInErrors fields may be used to determine whether packet loss is due to congestion in the peerrather than physical link failure.2.9. Failure DetectionWhen the link is operating well in both directions of the link, theLQR is superfluous. The maximum time interval for transmitting LQRs SHOULD be chosen to minimally interfere with active traffic.When there is a measurable loss of data in either direction, if theoverall throughput is adequate, conditions are not severe enough towarrant dropping the link. Sending LQRs faster will gain nothing,except to measure peaks in the loss rate. The time interval MUST be chosen to be long enough to have a good smoothing effect on the data, while short enough to ensure fast enough response to completefailure.When the link is good incoming, but very bad outgoing, incoming LQRs indicate a high loss on the outgoing side of the link. Sending LQRs faster won’t help, because they are probably lost on the way to thepeer.When the link is good outgoing, but very bad incoming, incoming LRQs will be frequently lost. In this case, LQRs SHOULD be sent at afaster rate. This primarily relies on the peer to make an informedpolicy decision. The peer will also send LQRs in response (due tothe duplicate PeerInLQRs field), and some of those LQRs maysuccessfully arrive.When a LQR does not arrive within the time expected, or the LQRreceived indicates that the links are truly bad, at least oneadditional LQR SHOULD be sent. An algorithmic decision requires atleast 2 round trip intervals. The loss rate could be transient, due Simpson [Page 13]to a heavily loaded link, or a lost outgoing LQR.2.10. Policy SuggestionsLink-Quality-Report packets provide a mechanism to determine the link quality, but it is up to each implementation to decide when the link is usable. It is recommended that this policy implement some amount of hysteresis so that the link does not bounce up and down. Onepolicy is to use a K out of N algorithm. In such an algorithm, there must be K successes out of the last N periods for the link to beconsidered of good quality.Procedures for recovery from poor quality links are unspecified andmay vary from implementation to implementation. A suggested approach is to immediately close all other Network-Layer protocols (i.e.,cause IPCP to transmit a Terminate-Request), but to continuetransmitting Link-Quality-Reports. Once the link quality againreaches an acceptable level, Network-Layer protocols can bereconfigured.Security ConsiderationsSecurity issues are not discussed in this memo.References[1] Simpson, W., "The Point-to-Point Protocol", RFC 1331, May 1992.[2] McCloghrie, K., and M. Rose, "Management Information Base forNetwork Management of TCP/IP-based internets: MIB-II", RFC1213, March 1991.[3] Rose, M., and K. McCloghrie, "Structure and Identification ofManagement Information for TCP/IP-based Internets", RFC 1155,May 1990.AcknowledgmentsSome of the text in this document is taken from RFC 1172, by DrewPerkins of Carnegie Mellon University, and by Russ Hobby of theUniversity of California at Davis.Special thanks to Craig Fox (Network Systems), and Karl Fox (Morning Star Technologies), for design suggestions based on implementationexperience.Simpson [Page 14]Chair’s AddressThe working group can be contacted via the current chair:Brian LloydLloyd & Associates3420 Sudbury RoadCameron Park, California 95682Phone: (916) 676-1147EMail: brian@Author’s AddressQuestions about this memo can also be directed to:William Allen SimpsonDaydreamerComputer Systems Consulting ServicesP O Box 6205East Lansing, MI 48826-6025EMail: bsimpson@Simpson [Page 15]。

相关文档
最新文档