⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 rfc911.txt

📁 著名的RFC文档,其中有一些文档是已经翻译成中文的的.
💻 TXT
📖 第 1 页 / 共 4 页
字号:
being switched between the gateway reported by EGP and the assigned gateway.  Asimilar thing occurs when using routes to other nets reached via MILNET/ARPANETgateways.RFC 911                                                                      114. FUTURE ENHANCEMENTS4.1 Multiple Autonomous SystemsThe  present  method  of  acquiring  a  maximum  number of EGP neighbors from atrusted list implies that all the neighbors are in the same AS.  The  intentionis  that  they all be members of the core AS. When updating the routing tables,Updates are treated independently with no distinction made as  to  whether  theadvised  routes  are  internal  or  external  to  the peer's AS.  Also, routingmetrics are compared without reference to the AS of the source.If EGP is to be  conducted  with  additional  AS's  beside  the  core  AS,  allneighbors  on  the  list  would  need  to  be  acquired in order to ensure thatgateways from both AS's were always acquired. This results  in  an  unnecessaryexcess  of  EGP  traffic if redundant neighbors are acquired for reliability. Amore desirable approach would be to have separate lists of trusted EGP gatewaysand the maximum number to be acquire, for each AS. Routing entries  would  needto  have  the  source AS added so that preference could be given to informationreceived from the owning AS (see Section 5.1.2)4.2 Interface MonitoringAt present, interface status is only checked immediately prior to  the  sendingof  an  Update  in response to a Poll.  The interface status could be monitoredmore regularly and an unsolicited Update sent when a change is  detected.  Thisis  one  area where the slow response of EGP polling could be improved. This isof particular interest to networks that may  be  connected  by  dial-in  lines.When such a network dials in, its associated interface will be marked as up butit  will not be able to receive packets until the change has been propagated byEGP. This is one case where the unsolicited  Update  message  would  help,  butthere  is still the delay for other non-core gateways to poll core EGP gatewaysfor the new routing information.This  was  one  case  where  it  was  initially  thought  that  a  kernel   EGPimplementation  might  help.  But  the kernel does not presently pass interfacestatus changes by interrupts so a new facility would need to  be  incorporated.If  this was done it may be just as easy to provide a user level signal when aninterface status changes.4.3 Network Level Status InformationAt present, network level status reports, such as IMP  Destination  Unreachablemessages,  are  not used to detect changes in the reachability of EGP neighborsor other neighbor gateways. This information should  be  used  to  improve  theresponse time to changes.RFC 911                                                                      124.4 Interior Gateway Protocol InterfaceAt  present  any  routing  information that is interior to the AS is static andread from the initialization file. The internal route management functions havebeen written so that it should be reasonably  easy  to  interface  an  IGP  fordynamic  interior  route  updates. This is facilitated by the separation of theexterior and interior routing tables.The outgoing EGP Updates will be correctly prepared from the  interior  routingtable by rt_NRnets() whether or not static or dynamic interior routing is done.Functions  are  also  provided  for  looking  up, adding, changing and deletinginternal routes, i.e. rt_int_lookup(), rt_add(),  rt_change()  and  rt_delete()respectively.The  interaction  of an IGP with the current data structures basically involvesthree functions: updating the interior routing table using a  function  similarto rt_NRupdate(), preparing outgoing interior updates similarly to rt_NRnets(),and timing out interior routes similarly to rt_time().RFC 911                                                                      135. TOPOLOGY ISSUES5.1 Topology Restrictions and Routing Loops5.1.1 BackgroundEGP  is  not  a  routing  algorithm.  it  merely  enables exterior neighbors toexchange routing information which is likely to  to  be  needed  by  a  routingalgorithm.  It does not pass sufficient information to prevent routing loops ifcycles exist in the topology [Rosen 82].Routing loops can occur when two gateways think there are alternate  routes  toreach a third gateway via each other. When the third gateway goes down they endup  pointing  to  each  other  forming a routing loop.  Within the present coresystem, loops are broken by counting to "infinity" (the  internet  diameter  ingateway  hops).  This  (usually)  works  satisfactorily  because GGP propagateschanges fairly quickly as routing updates are sent as soon  as  changes  occur.Also  the  diameter of the internet is quite small (5) and a universal distancemetric, hop count, is used. But this will be changed in the future.With EGP, changes are propagated  slowly.  Although  a  single  unsolicited  NRmessage  can  be  sent,  it  won't  necessarily  be passed straight on to othergateways who must hear about it  indirectly.  Also,  the  distance  metrics  ofdifferent  AS's  are  quite  independent  and  hence  can't be used to count toinfinity.The initial proposal was to prevent routing loops by restricting  the  topologyof  AS's to a tree structure so that there are no multiple routes via alternateAS's.  Multiple routes within the same AS are allowed as  it  is  the  interiorrouting strategies responsibility to control loops.[Mills  84b]  has  noted that even with the tree topology restriction, "we mustassume that transient loops may form within the core system from time  to  timeand  that  this  information  may escape to other systems; however, it would beexpected that these loops would not persist for very long and would  be  brokenin  a  short  time  within the core system itself. Thus a loop between non-coresystems can persist until the first round of Update messages sent to the  othersystems  after  all traces of the loop have been purged from the core system oruntil the reachability information ages out of  the  tables,  whichever  occursfirst".With the initial simple stub EGP systems the tree topology restriction could besatisfied. But for the long term this does not provide sufficient robustness.[Mills  83]  proposed a procedure by which the AS's can dynamically reconfigurethemselves such that the topology restriction is always met, without  the  needfor  a  single  "core" AS.  One AS would own a shared net and its neighbor AS'swould just conduct EGP with the owner. The owner would pass on such informationindirectly as the core system does now. If the  owning  AS  is  defined  to  beclosest  to  the  root  of the tree topology, any haphazard interconnection canRFC 911                                                                      14form  itself  into  an appropriate tree structured routing topology. By routingtopology I mean the topology as advised in routing updates. There may  well  beother  physical  connections  but if they are not advised they will not be usedfor routing. Each AS can conduct EGP with at most one AS that owns one  of  itsshared nets. Any AS that is not conducting EGP over any net owned by another ASis  the  root of a subtree. It may conduct EGP with just one other AS that ownsone of its shared nets. This "attachment" combines  the  two  subtrees  into  asingle  subtree  such  that  the  overall  topology  is still a tree.  Topologyviolations can be determined because two different AS's will report  that  theycan reach the same net.With  such  a  dynamic  tree,  there may be preferred and backup links. In suchcases it is necessary to monitor the failed link so that routing can be changedback to the preferred link when service is restored.Another aspect to consider is the possibility of detecting  routing  loops  andthen  breaking  them. Expiration of the packet time-to-live (TTL) could be usedto do this. If such a loop is suspected a diagnostic packet, such as ICMP echo,could be sent over the suspect route to confirm whether it is a loop. If a loopis detected a special  routing  packet  could  be  sent  over  the  route  thatinstructs  each gateway to delete the route after forwarding the packet on. Theacceptance of new routing information may need to be delayed for  a  hold  downperiod.  This approach would require sensible selection of the initial TTL. Butthis is not done by many hosts.5.1.2 Current PolicyConsidering the general trend to  increased  network  interconnection  and  theavailability of alternative long-haul networks such as ARPANET, WBNET (widebandsatellite  network),  and public data networks the tree topology restriction isgenerally unacceptable. A less restrictive topology is  currently  recommended.The following is taken from [Mills 84b].EGP topological model:   - An  autonomous  system  consists  of  a  set of gateways connected by     networks.  Each gateway in the system must be  reachable  from  every     other  gateway in its system by paths including only gateways in that     system.   - A gateway in a system may run EGP with a gateway in any other  system     as  long  as the path over which EGP itself is run does not include a     gateway in a third system.   - The "core system" is distinguished from the others by the  fact  that     only  it  is  allowed  to  distribute  reachability information about     systems other than itself.   - At least one gateway in every system must have a net in common with a     gateway in the core system.RFC 911                                                                      15   - There  are  no  topological  or  connectivity restrictions other than     those implied above.A gateway  will  use  information  derived  from  its  configuration  (directlyconnected  nets),  the  IGP of its system, called S in the following, (interiornets) and EGP (interior and exterior nets of neighboring systems) to  constructits routing tables. If conflicts with respect to a particular net N occur, theywill be resolved as follows:   - If  N  is  directly connected to the gateway, all IGP and EGP reports     about N are disregarded.   - If N is reported by IGP as  interior  to  S  and  by  EGP  as  either     interior  or  exterior  to  another  system,  the  IGP  report  takes     precedence.   - If N is reported by EGP as interior to one  system  and  exterior  to     another, the interior report takes precedence.   - If  N  is  reported  as  interior by two or more gateways of the same     system using EGP, the reports specifying the smallest hop count  take     precedence.   - In all other cases the latest received report takes precedence.Old information will be aged from the tables.The   interim   model  provides  an  acceptable  degree  of  self-organization.Transient routing loops can occur between systems,  but  these  are  eventuallybroken by old reachability information being aged out of the tables.  Given thefact  that  transient  loops  can occur due to temporary core-system loops, theadditional loops that might occur in the case of local nets homed  to  multiplesystems does not seem to increase the risk significantly.5.2 Present ISI ConfigurationA  simplified  version of the ISI network configuration is shown in Figure 5-1.ISI-Hobgoblin can provide a backup gateway function  to  the  core  ISI-Gatewaybetween  ARPANET and ISI-NET. ISI-Hobgoblin is a VAX 11/750 which runs BerkeleyUnix  4.2.  The  EGP  implementation  described  in  this  report  is  run   onISI-Hobgoblin.ISI-Troll  is part of a split gateway to the University of California at Irvinenetwork (UCI-ICS). The complete logical gateway consists of ISI-Troll, the 9600baud link and UCI-750A [Rose 84]. ISI-Troll runs Berkeley Unix 4.1a  and  hencecannot  run  the  EGP  program.  It  is  therefore  a non-routing gateway.  Theexistence of UCI-ICS net must be advised to the core AS by ISI-Hobgoblin.  Thiscan be done by including an appropriate entry in the EGPINITFILE.Hosts on ISI-NET, including ISI-Troll, have  static  route  entries  indicatingISI-Gateway as the first hop for all networks other than UCI-ICS and ISI-NET.RFC 911                                                                      16          -------------------------------------------------         /                                                 \        /                      ARPANET                      \        \                        10                         /         \                                                 /          -------------------------------------------------             |                    |                    |             |                    |                    |             |                    |                    |      +-------------+      +-------------+      +---------------+      | ISI-PNG11   |      |             |      |               |      | Arpanet     |      | ISI-GATEWAY |      | ISI-HOBGOBLIN |      | Address     |      |             |      |   Vax 11/750  |      | logical     |      |  Core EGP   |      |   Unix 4.2    |      | multiplexer |      |             |      |               |      +-------------+      +-------------+      +---------------+             |                    |                    |             |                    |                    |             |                    |                    |      ---------------          ----------------------------     /               \        /                            \    / 3 Mb/s Ethernet \      /           ISI-NET            \    \     net 10      /      \            128.9             /     \               /        \                            /      ---------------          ----------------------------                                      |                                      |                                      |                               +--------------+                               |  ISI-TROLL   |                               |  Vax 11/750  |                               |  Unix 4.1a   |                               |  Non-routing |                               |      |       |                               |      | 9600  |   ISI-TROLL, UCI-750A                               |      | baud  |   and the link form a

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -