WO2009039747A1 - Procédé, système et équipement pour un maintien de route - Google Patents

Procédé, système et équipement pour un maintien de route Download PDF

Info

Publication number
WO2009039747A1
WO2009039747A1 PCT/CN2008/072244 CN2008072244W WO2009039747A1 WO 2009039747 A1 WO2009039747 A1 WO 2009039747A1 CN 2008072244 W CN2008072244 W CN 2008072244W WO 2009039747 A1 WO2009039747 A1 WO 2009039747A1
Authority
WO
WIPO (PCT)
Prior art keywords
pop
prefix
routing information
super
route
Prior art date
Application number
PCT/CN2008/072244
Other languages
English (en)
French (fr)
Inventor
Xiaohu Xu
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to EP08800756.2A priority Critical patent/EP2222029B1/en
Priority to US12/863,103 priority patent/US20110051738A1/en
Priority to ES08800756.2T priority patent/ES2458317T3/es
Publication of WO2009039747A1 publication Critical patent/WO2009039747A1/zh
Priority to US12/982,733 priority patent/US8065434B2/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/033—Topology update or discovery by updating distance vector protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2212/00—Encapsulation of packets

Definitions

  • Embodiments of the present invention relate to techniques for transmitting data in a communication network, and more particularly to a method, system, and apparatus for maintaining a route. Background technique
  • the route is used to transmit data from the source terminal device in the communication network to the destination terminal device through the router.
  • the router needs to select the best path and exchange the data packet among the routes maintained by itself.
  • the metric is a calculation standard used by the routing algorithm to determine the optimal path to the destination terminal device.
  • the standard can use the shortest path or the minimum path cost to determine the best path.
  • the router In order to select a path after receiving a data packet, the router needs to perform route initialization and maintain a routing table containing path information in the communication network, where the path information varies according to the routing algorithm used.
  • the way to inform the router of the destination terminal device or the next hop router path information is to advertise the path information in the communication network (which can be issued by the router).
  • the router When the router receives the path information, it can try and respond to the received path information.
  • the other router or destination terminal device contacts to establish a routing table for forwarding the data packet for itself.
  • the established routing table includes various information, such as distance information, hop count information of the destination terminal device, and address information of the next hop.
  • the metric is different according to the routing algorithm used.
  • the router uses the metric to select the best path in the routing table to transmit the data packet to the next hop router according to the carried destination address.
  • the destination terminal device such as Metric, determines the best path according to the shortest path. In this case, the router can select the path with the shortest distance to the destination address as the best path according to the distance information in the routing table, and then transmit the data packet to Next hop router or destination terminal device.
  • routers communicate with each other, maintain and update their own routes by exchanging path information, maintain and update their own routes, usually maintain and update all or part of the routing table, and analyze path information from other routers or terminal devices.
  • Establishing a network The topography of the network.
  • the transmission path information between the routers may also use the manner of transmitting the link state broadcast information, and the router notifies the link state of the router that sent the broadcast information, and the link state information is used to establish the completed topology map, so that the router transmits The best path can be determined when the packet is in use.
  • the multi-homing technology refers to a link group that establishes more than one link between the terminal device and the backbone network of the communication network for link survivability or load balancing, and the more than one link group belongs to the same operator or Different operators.
  • Traffic engineering technology is actually a set of tools and methods used by communication networks. Whether the terminal equipment and transmission lines in the communication network are normal or invalid, the best service can be extracted from the set communication network, which can be allocated. Resources are optimized.
  • FIG. 1 is a schematic diagram of a network structure for maintaining a route by using the CRIO technology in the prior art, including a transmission network and an edge network.
  • Different edge networks are connected through a transmission network, where the transmission network includes one or more PoP (Point of Presence) nodes, the edge network includes terminal devices, and the boundary between the transmission network and the edge network includes a border router.
  • PoP Point of Presence
  • the route maintained by the different PoP nodes is the routing information of different super prefixes and the detailed prefix routing information covered by the super prefix route.
  • the routing information of the super prefix maintained by different PoP nodes is advertised in the transmission network, and the super The detailed prefix routing information covered by the prefix route does not need to be advertised.
  • the border routers of the AS and other core routers in the transport network do not need to maintain all the details covered by the super prefix.
  • the routing information is suffixed, and only the super prefix routing needs to be maintained.
  • routing information of the super prefix may also be referred to as aggregate routing information.
  • the detailed prefix routing information covered by the super prefix is the routing information in the edge network associated with the super prefix.
  • the terminal device accesses the transmission network through the border router.
  • the source terminal device sends the data packet to the source border router, and the source border router sends the data according to the stored routing information of the super prefix of the corresponding destination address.
  • the ⁇ node determines the path by maintaining the detailed prefix routing information covered by the super prefix, and establishes a tunnel between the destination border routers, and the data packet is transmitted through the tunnel.
  • the destination edge router forwards the data packet to the destination terminal device according to the routing information stored by itself.
  • the transport network may be the backbone network of the Internet, and the node is a super router or a host.
  • the basic idea of using CRIO technology in the network is: How to reduce the backbone network routing capacity of the Internet.
  • the traffic model of the actual transmission data based on the Internet finds that the data traffic sent to the terminal device corresponding to the address of a few network segments occupies a large amount of bandwidth. Therefore, the terminal devices that transmit less data packets have increased the hop count when transmitting. It is possible to reduce the routing capacity of the backbone network of the Internet.
  • the basic idea is to transform the mesh routing structure of the Internet into a tree routing structure. As shown in Figure 1, in the backbone network of the Internet, only the routing information of the super prefix is advertised through the ⁇ node, and the detailed prefix covered by these super prefixes is The routing information is not distributed in the backbone network of the Internet.
  • the border router of the backbone network of the Internet provides the detailed prefix routing information under the super prefix to the ⁇ node that manages the routing information of the super prefix, and the ⁇ node stores the detailed prefix routing information.
  • the data packet When forwarding a data packet, the data packet is first forwarded to the ⁇ node of the routing information that issues the super prefix, and the ⁇ node saves the detailed coverage of the super prefix.
  • the route information is spoofed, and the corresponding detailed prefix route is found by searching the mapping relationship, and then the tunnel between the border routers corresponding to the detailed prefix route is established by the PoP node according to the detailed prefix route, and the foregoing data packet is forwarded to the border router through the tunnel.
  • the CRIO technology is used to establish and maintain routes in the communication network.
  • the advantages are as follows: Since other routers in the transport network only need to maintain the routing information of the super prefix, and do not need to maintain all the detailed prefix routing information covered by the super prefix, the effective reduction is effective. The number of routes maintained by most routers in the transport network reduces the processing burden and oscillation of the communication network when using BGP to transmit data, which accelerates the convergence of BGP routes.
  • the PoP node Because the data packets to be transmitted in the communication network need to reach the PoP node and then transmit, which increases the number of hops forwarded by the transmitted data packet, and the PoP node needs to forward a large number of destination addresses to the network segment covered by the stored super prefix route.
  • the data packet has high requirements on the forwarding capability of the PoP node. When the number of forwarding packets is too large, the PoP node may be paralyzed. Summary of the invention
  • the embodiment of the invention provides a method for maintaining a route, so as to reduce the traffic of each PoP node to forward a data packet when the CRIO technology is used to implement maintenance routing.
  • the embodiment of the invention further provides a system for maintaining a route, which reduces the traffic of each PoP node to forward a data packet when the CRIO technology is used to implement maintenance routing.
  • the embodiment of the invention further provides an apparatus for maintaining a route, which reduces the traffic of each PoP node to forward a data packet when the CRIO technology is used to implement maintenance routing.
  • a method for maintaining a route is applied to a communication network including a plurality of access point PoP groups, each of which includes one or more PoP nodes, the method comprising:
  • the PoP nodes in the same PoP group advertise the routing information of the same super prefix.
  • the PoP nodes in different PoP groups advertise the routing information of different super prefixes.
  • Each PoP node obtains the detailed prefix routing information covered by the super-prefix issued by itself, and synchronizes with the PoP nodes in the same PoP group. Detailed prefix routing information.
  • a method for maintaining a route comprising:
  • a system for maintaining a route comprising: a plurality of routers and a plurality of PoP nodes, wherein
  • the PoP node is configured to form a different PoP group, and the PoP nodes in the same PoP group advertise the same super prefix routing information.
  • the PoP nodes in different PoP groups advertise different super prefix routes to obtain the published information.
  • the detailed prefix routing information covered by the super prefix is synchronized with the PoP node in a PoP group to synchronize the detailed prefix routing information;
  • the router is configured to receive routing information of a super prefix advertised by a PoP node.
  • a PoP node for maintaining a route comprising:
  • a route maintenance module configured to store routing information of the super prefix
  • a publishing module configured to advertise routing information of a super prefix stored by the routing maintenance module
  • a receiving module configured to receive detailed prefix routing information that is covered by the super prefix issued by the publishing module, and store the received detailed prefix routing information to the routing maintenance module;
  • a synchronization module configured to synchronize the detailed prefix routing information stored by the route maintenance module with other PoP nodes in the same POP group.
  • a border router for maintaining a route comprising:
  • a route maintenance module configured to store an optimal route determined in the routing information of the super prefix
  • a receiving module configured to receive the super prefix routing information advertised by the PoP node, determine an optimal route in the received multiple super prefix routing information, and save the routing to the routing maintenance module
  • the registration module is configured to register the detailed prefix routing information covered by the super prefix route in the route maintenance module with the nearest PoP node that issues the super prefix route.
  • the method, the system and the device provided by the embodiments of the present invention provide multiple access point PoP groups in a transmission network, and one or each PoP group is set to one or The PoP nodes in the same PoP group advertise the routing information of the same super prefix respectively.
  • the PoP nodes in different PoP groups advertise different routing information of the super prefix.
  • the PoP nodes in the same group maintain the routing information of the detailed prefix covered by the same super prefix. In this way, when different data packets are transmitted, load sharing and forwarding can be performed by different PoP nodes in the same group, thereby reducing the traffic of each PoP node to forward data packets when the maintenance route is implemented by using CRI0 technology.
  • FIG. 1 is a schematic diagram of a network structure for maintaining a route by using a CRI0 technology in the prior art
  • FIG. 2 is a schematic diagram of a system for maintaining a route according to an embodiment of the present invention
  • FIG. 3 is a flowchart of a method for maintaining a route according to an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of a maintenance route according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of a PoP node according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of a border router according to an embodiment of the present invention. detailed description
  • PoP groups are set in the transmission network. Groups, one or more PoP nodes are set in each PoP group, and the PoP nodes in the same PoP group advertise the routing information of the same super prefix respectively. The PoP nodes in different PoP groups advertise different super prefix routing information. The PoP node in the same group maintains the routing information of the detailed prefix covered by the same super prefix.
  • PoP nodes in the same PoP group can use the preset rules to synchronize the routing information of the detailed prefix covered by the same super prefix, and the existing technology can be used.
  • the protocol if you use BGP to synchronize, you can also use other protocols.
  • the routing information of the detailed prefix covered by the same super prefix maintained by multiple PoP nodes in the same PoP group may be preset, or may be internal to the edge network connected by the border router and the super prefix
  • the detailed prefix routing information that is covered is registered on the PoP node.
  • multiple PoP nodes in the same PoP group maintain the detailed prefix routing information covered by the same super prefix, that is, set a routing table with a mapping relationship, where the routing table includes a corresponding super prefix.
  • Detailed prefix routing information which includes detailed prefixes, addressable addresses of border routers, and priority and overhead information.
  • the number of multiple PoP nodes in one PoP group that maintains the detailed prefix routing information covered by the same super prefix is determined according to the data traffic of the network and the capability of each PoP node to process data.
  • 2 is a structural diagram of a system for maintaining a route according to an embodiment of the present invention. As shown in the figure, a transport network and an edge network are included, and an edge network is connected to a transport network by using a border router, where the transport network includes multiple PoP groups. Each group includes one or more PoP nodes; In addition, the edge network and the transmission network also contain some ordinary routers. In the figure, for the sake of simplicity, only one PoP group is included, and there are two PoP nodes in the PoP group.
  • the PoP nodes in the same PoP group maintain the routing information of the detailed prefix covered by the same super prefix.
  • the PoP nodes in different PoP groups maintain the routing information of the detailed prefix covered by different super prefixes.
  • the PoP nodes in the same PoP group advertise the routing information of the same super prefix.
  • the PoP nodes in different PoP groups advertise different routing information of the super prefix.
  • the border router receives the routing information of the super prefix advertised by the PoP node and generates a routing table, and registers the detailed prefix routing information inside the connected edge network with the nearest PoP node that advertises the super prefix route that covers the detailed prefix.
  • Different PoP sections in the same PoP group synchronize the detailed prefix routing information that has been registered.
  • the source terminal device When transmitting a data packet, the source terminal device first sends data to the source border router according to the routing information between the edge router and the source border router according to the prior art, and the source border router according to the best matching super prefix.
  • the routing information is sent to the nearest PoP node, and the nearest PoP node determines the route of the destination border router corresponding to the best route matching the destination address by establishing the detailed prefix routing information covered by the super prefix.
  • a tunnel is reached between the destination border routers, and the data packet is sent to the destination border router.
  • the destination border router forwards the data to the destination terminal device according to the routing information stored by the destination end.
  • the process of forwarding the data packet through the routing information maintained by one of the PoP nodes is performed.
  • the technology is the same, so it is not repeated here.
  • the routing information is based on the routing information of the super prefix (specifically, the shortest path or the minimum path cost, etc.) Determining a nearby PoP node in a plurality of PoP nodes that advertise the routing information of the super prefix, and determining that the routing information of the super prefix advertised by the nearest PoP node is an optimal route and storing the internal routing network Detailed prefix routing information covered by the optimal route to the nearest PoP Node registration.
  • the routing information of the super prefix advertised by multiple PoP nodes may be advertised to the border router, or may be advertised to other routers in the transport network, including the core router.
  • the transport network may be the backbone network of the Internet, and the PoP node is a super router or a host.
  • FIG. 3 is a flowchart of a method for maintaining a route according to an embodiment of the present invention, where specific steps are as follows:
  • Step 301 Set a plurality of PoP groups in the communication network, and set one or more PoP nodes in each PoP group, and the PoP nodes in the same PoP group respectively advertise the routing information of the same super prefix;
  • the PoP node issues routing information for different super prefixes.
  • the routing information of the same super prefix advertised by multiple PoP nodes in the same PoP group may be preset.
  • Step 302 The PoP node obtains the detailed prefix routing information covered by the super prefix issued by the PoP node, and synchronizes the detailed prefix routing information between the PoP nodes in the same PoP group.
  • the detailed prefix routing information covered by the obtained super prefix is preset in the PoP node that issues the super prefix, or dynamically registered by the border router in the communication network. Synchronizing the obtained detailed prefix routing information between multiple PoP nodes in the same PoP group may use an existing protocol, such as the BGP protocol.
  • the router when the router detects the change of the detailed prefix routing information in the connected edge network by using the prior art, the router updates the registration to the nearest PoP that advertises the routing information of the super prefix that covers the detailed prefix routing information.
  • the nearest PoP node After the nearest PoP node receives the registration update, it updates the details of its maintenance before The routing information is suffixed, and the routing information update is flooded to other PoP nodes in the PoP group corresponding to the super prefix.
  • the source router receives the data packet carrying the destination address through the source terminal device, and then routes the data packet to the nearest PoP node that advertises the routing information of the super prefix according to the best matching super prefix route.
  • the nearest PoP node establishes a tunnel to the destination border router by maintaining the detailed prefix routing information covered by the super prefix, and sends the data packet to the destination border router, and the destination edge router performs data according to the route stored by the destination end. Forward to the destination terminal device.
  • FIG. 4 it is a schematic structural diagram of a maintenance route provided by an embodiment of the present invention, as shown in the following figure:
  • two PoP nodes are set to maintain the routing information of the same super prefix and the detailed prefix routing information covered by the super prefix. It is assumed that the two PoP nodes are PoP-1 and ⁇ -2, and both PoP nodes are The routing information of the super prefix with the network segment address of 10.0.0.0.0/8 is advertised to the communication network.
  • the network prefix of the edge network A in the communication network is 10.1.0.0/16, and the network prefix of the edge network B is 10.2.0.0/16. .
  • the border router A of the communication network connected to the edge network A registers the detailed prefix routing information of 10.1.0.0/16 on the PoP-1 of the release 10.0.0.0.0/8 which is relatively close to itself, and the boundary of the communication network connected by the edge network B Router B registers the detailed prefix routing information of 10.2.0.0/16 on PoP-2 with release 10.0.0.0.0/8 that is closer to itself.
  • PoP-1 and PoP-2 synchronize the already registered detailed prefix routing information through the existing protocol. After synchronization, the detailed prefix routing information covered by the super prefix exists on both PoP-1 and PoP-2, that is, 10.1.
  • the border router corresponding to 0.0/16 is the border router A
  • the border router corresponding to 10.2.0.0/16 is the border router.
  • the border router When the connection between the border router and the edge network is interrupted, the border router advertises a route deletion message to the nearest PoP node that advertises the super-prefix route that covers the invalid detailed prefix route, and carries the detailed prefix routing information to be deleted.
  • the corresponding detailed prefix routing information is stored, and the detailed prefix routing information is advertised to other PoP nodes in the same PoP group, and other PoP nodes delete correspondingly. That is to say, the detailed prefix routing information covered by the same super prefix maintained by multiple PoP nodes can be updated in real time.
  • This example is used to register routes to multiple PoP nodes. It can also be pre-configured.
  • the border router corresponding to 10.1.0.0/16 on PoP-1 is border router A, and 10.2.0.0/ is configured on PoP-2.
  • the corresponding border router is the border router B, and then the routing information is synchronized between the PoP nodes that are responsible for the routing information of the super prefix 10.0.0.0/8.
  • the process of route establishment and maintenance is completed in the communication network.
  • the data packet can be transmitted through the maintained route.
  • the following specifically describes how to transmit the data.
  • the packet from the edge network A with the destination address of 10.2.2.2 arrives at the border router A along the default route (since there is only one route between the edge network and the border router A, the general setting is As the default route, the border router A forwards the packet to the advertised route along the 10.0.0.0/8 super prefix route according to the best route matched by the destination address carried by the data packet, that is, the route of 10.0.0.0.0/8.
  • the super prefix 10.0.0.8 is the nearest PoP of the routing information, ie PoP-l.
  • PoP-1 searches for the stored routing information to find the best path to the destination address 10.2.2.2 is 10.2.0.0/16, and the corresponding border router is the border router B, then the packet is passed through the detailed prefix routing information to the border router B. After being sent to the border router B, the border router B forwards the data packet to the destination terminal device according to the destination address carried by the data packet and according to the routing information of the edge network B maintained by itself.
  • a packet from the edge network B with a destination address of 10 ⁇ 1.1 (the packet carries the destination address). After reaching the border router B along the default route, the border router B matches the destination address according to the packet.
  • a route that is, a route of 10.0.0.0.0/8, is routed along the route with the super prefix 10.0.0.0/8 to the nearest PoP, that is, PoP-2, that advertises the super prefix 10.0.0.8.
  • the PoP-2 searches for the stored routing information and finds that the best path to the destination address 10.1.1.1 is 10.1.0.0/16, and the corresponding border router is the border router A. Then, the packet is sent to the border through the route to the border router A.
  • the border router A forwards the data packet to the destination terminal device according to the destination address carried by the data packet and according to the routing information of the edge network A maintained by itself.
  • the embodiment of the present invention further provides a PoP node, as shown in FIG. 5, including a publishing module, a receiving module, and a route maintenance module, in order to implement a detailed prefix routing that is covered by the same super-prefix in the same PoP group. And a synchronization module, where the route maintenance module is configured to store routing information of the super prefix;
  • a publishing module configured to advertise routing information of a super prefix stored by the routing maintenance module
  • the receiving module is configured to receive detailed prefix routing information covered by the super prefix that is advertised by itself, and store the received detailed prefix routing information into the route maintenance module;
  • the synchronization module is configured to synchronize the detailed prefix route stored by the route maintenance module with other PoP nodes in the same PoP group.
  • the embodiment of the present invention further provides a border router, as shown in FIG. 6, including a receiving module, a route maintenance module, and a registration module, where
  • a route maintenance module configured to store an optimal route determined in the routing information of the super prefix
  • the receiving module is configured to receive the routing information of the super prefix advertised by the PoP node, determine the optimal route in the multiple routing information of the super prefix, and save the routing to the routing maintenance module.
  • the registration module is configured to register the detailed prefix routing information covered by the super prefix routing information in the routing maintenance module with the nearest PoP node that issues the super prefix routing.
  • multiple PoP groups are deployed in a transport network, and one or more PoP nodes are set in each PoP group, and PoP nodes in the same PoP group maintain the same
  • the nearest PoP node in the group forwards, and the number of hops of the forwarded data packet is reduced compared with the prior art using the CRIO technology, and the packet of the network segment address corresponding to the routing information corresponding to the super prefix is the shortest according to the route.
  • the present invention can be implemented by hardware, or can be implemented by means of software plus necessary general hardware platform, and the technical solution of the present invention. It can be embodied in the form of a software product that can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.), including a number of instructions for making a computer device (may It is a personal computer, a server, or a network device, etc.) that performs the methods described in various embodiments of the present invention.
  • a non-volatile storage medium which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.
  • a computer device may It is a personal computer, a server, or a network device, etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Description

维护路由的方法、 系统及装置
技术领域
本发明实施例涉及在通信网络中传输数据的技术，特别涉及一种 维护路由的方法、 系统及装置。 背景技术
路由用于将数据从通信网络中的源终端设备通过路由器传输到 目的终端设备， 在传输数据包时， 路由器需要在自身维护的路由中选 择最佳路径和进行数据包交换。 其中， Metric是路由算法用以确定到 达目的终端设备最佳路径的计算标准，如标准可以釆用路径最短或路 径开销最小确定最佳路径。路由器为了在接收到数据包后能够选择路 径， 需要进行路由初始化并维护通信网络中包含路径信息的路由表， 其中路径信息根据所使用的路由算法的不同而不同。对路由器告知目 的终端设备或下一跳路由器路径信息的方式是将路径信息在通信网 络中进行发布 （可以由路由器发布）， 当路由器接收到路径信息后， 就可以根据接收到的路径信息尝试与其他路由器或目的终端设备进 行联系， 从而为自身建立用于转发数据包的路由表。 其中， 所建立的 路由表包括多种信息， 如距离信息、 到达目的终端设备的跳数信息和 下一跳的地址信息等。 同样地， Metric根据所用的路由算法不同而不 同， 当路由器接收到携带目的地址的数据后， 根据所携带的目的地址 釆用 Metric在路由表中选择最佳路径将数据包传输给下一跳路由器 或目的终端设备，如 Metric釆用的根据路径最短确定最佳路径，这时， 路由器就可以根据路由表中的距离信息选择到达目的地址距离最短 的路径作为最佳路径后，将数据包传输给下一跳的路由器或目的终端 设备。
这样， 路由器就彼此进行通信， 通过交换路径信息维护和更新其 自身的路由，维护和更新其自身的路由通常维护和更新包含全部或部 分的路由表，通过分析来自其他路由器或终端设备的路径信息建立网 络拓朴图。在路由器之间传输路径信息还可以釆用发送链接状态广播 信息的方式， 路由器通知其他发送了该广播信息的路由器的链接状 态， 该链接状态信息用于建立完成的拓朴图， 使路由器在传输数据包 时可以确定最佳路径。
在通信网络中部署路由时， 会釆用多归属 （Multi-homing )技术 和流量工程（Traffic Engineering )技术。 其中， 多归属技术是指为了 链接生存性或负载平衡，在终端设备和通信网络的骨干网络之间建立 多于一条链路的链路群，该多于一条的链路群属于同一运营商或不同 运营商。 流量工程技术实际上是通信网络所釆用的一套工具和方法， 无论通信网络中的终端设备和传输线路正常还是失效，都能从设置的 通信网络中提取最佳服务， 其可以对已分配的资源进行优化。 随着基 于多归属技术的通信网络的建立以及流量工程技术在通信网络中的 广泛部署， 在一个通信网络中的路由数量增长迅速， 由此带来的是： 一方面由于需要路由器设置更大容量存储路由表而导致的成本上升， 另一方面由于路由器维护的路由数目多而导致路由器的路由收敛变 得緩慢， 即对数据进行路由处理的速度变得緩慢， 从而最终导致通信 网络的数据传输的反应速度变慢， 影响整个通信网络的工作效率。
为了解决以上问题， 在通信网络中提出了核心路由器聚合覆盖 ( Core-Router Integrated Overlay, CRIO )技术， 图 1为现有技术釆用 CRIO技术维护路由的网络结构示意图， 包括传输网络和边缘网络、 不同的边缘网络通过传输网络相连接， 其中， 传输网络包括一个或多 个 PoP ( Point of Presence, 接入点）节点、 边缘网络包括终端设备， 传输网络和边缘网络的交界处包括边界路由器。 在图中， 为了简便起 见， 所示为一个 PoP节点。
其中，不同 PoP节点维护的路由为不同的超级前缀的路由信息以 及该超级前缀路由所覆盖的详细前缀路由信息，不同 PoP节点将维护 的超级前缀的路由信息在传输网络中进行发布 ,而该超级前缀路由所 覆盖的详细前缀路由信息不需要发布， AS的边界路由器和传输网络 中的其他核心路由器就不需要维护该超级前缀所覆盖的所有详细前 缀路由信息 , 而只需要维护该超级前缀路由即可。
在这里， 超级前缀的路由信息也可以称为聚合路由信息。
在这里，超级前缀所覆盖的详细前缀路由信息为与该超级前缀相 关的边缘网络中的路由信息。
终端设备通过边界路由器接入到传输网络中， 在传输数据包时， 源终端设备将数据包发送到源端边界路由器上，源端边界路由器根据 存储的对应目的地址的超级前缀的路由信息将数据发送到维护该超 级前缀的路由信息的 ΡοΡ节点上， 该 ΡοΡ节点通过维护的该超级前 缀所覆盖的详细前缀路由信息确定路径，建立到目的端边界路由器之 间的隧道， 通过该隧道将数据包转发给目的端边界路由器， 目的端边 界路由器根据自身存储的路由信息将数据包转发到目的终端设备上。
在实际应用中， 传输网络可以是因特网的骨干网络， ΡοΡ节点为 超级路由器或主机。
在网络中釆用 CRIO技术的基本思路为： 如何减小因特网的骨干 网络路由容量。基于因特网的实际传输数据的流量模型发现， 发送到 对应少数网段地址的终端设备的数据流量占据了大量的带宽， 因此， 对那些传输数据包流量较小的终端设备在传输时增加跳数以减小因 特网的骨干网的路由容量是可以实施的。基本实现思路是将因特网的 网状路由结构变换为树型路由结构， 如图 1所示， 在因特网的骨干网 络中只通过 ΡοΡ节点发布超级前缀的路由信息，而这些超级前缀下覆 盖的详细前缀路由信息不在因特网的骨干网络中发布，因特网的骨干 网络的边界路由器将这些超级前缀下的详细前缀路由信息提供给管 辖该超级前缀的路由信息的 ΡοΡ节点， ΡοΡ节点存储该详细前缀路由 信息。
这样，因特网的骨干网络中的其他路由器或设备只需要维护超级 前缀的路由信息即可， 不再需要分别维护大量的路由信息， 这样因特 网的骨干网络路由容量就减小了。
在转发数据包时，数据包首先被转发到这些发布超级前缀的路由 信息的 ΡοΡ节点上， 该 ΡοΡ节点保存了该超级前缀所覆盖的详细前 缀路由信息 , 通过查找该映射关系找到对应的详细前缀路由 , 然后根 据详细前缀路由建立经过 PoP 节点到该详细前缀路由对应的边界路 由器之间的隧道， 通过隧道将上述数据包转发到边界路由器。
釆用 CRIO技术在通信网络中建立和维护路由， 优点为： 由于传 输网络中的其他路由器只需要维护超级前缀的路由信息，而不需要维 护该超级前缀覆盖的所有详细前缀路由信息，所以有效减少传输网络 中的大多数路由器所维护的路由数量， 减少通信网络釆用 BGP在传 输数据时的处理负担和振荡， 加快了 BGP路由的收敛。
在实现本发明的过程中， 发明人发现现有技术至少存在以下问 题：
因为通信网络中要传输的数据包都需要到达 PoP 节点再进行中 转传输，这样增加了所传输数据包转发的跳数，此外 PoP节点需要转 发大量目的地址为所存储超级前缀路由所覆盖网段的数据包，对 PoP 节点转发能力提出了很高要求， 当转发数据包数量太多时， 可能会导 致 PoP节点的瘫痪。 发明内容
本发明实施例提供一种维护路由的方法， 以实现在釆用 CRIO技 术实现维护路由的情况下， 减少每个 PoP节点转发数据包的流量。
本发明实施例还提供一种维护路由的系统， 该系统在釆用 CRIO 技术实现维护路由的情况下， 减少每个 PoP节点转发数据包的流量。
本发明实施例还提供一种维护路由的装置， 该装置在釆用 CRIO 技术实现维护路由的情况下， 减少每个 PoP节点转发数据包的流量。
根据上述目的， 本发明实施例的技术方案是这样实现的：
一种维护路由的方法， 其特征在于， 所述方法应用于包括多个接 入点 PoP群组， 每个 PoP群组包含一个或多个 PoP节点的通信网络 中， 所述方法包括：
同一 PoP群组内的 PoP节点发布同一超级前缀的路由信息； 不同 PoP群组内的 PoP节点发布不同的超级前缀的路由信息； 每个 PoP 节点获取自己发布的超级前缀所覆盖的详细前缀路由 信息， 与所属同一 PoP群组内的 PoP节点之间同步所述详细前缀路 由信息。
一种维护路由的方法， 其特征在于， 该方法包括：
接收 PoP节点发布的超级前缀路由信息并生成路由表，在路由表 中记录发布该超级前缀路由信息的 PoP节点的地址，将所连接边缘网 络内部的详细前缀路由信息向发布覆盖所述详细前缀的超级前缀路 由的就近 PoP节点注册。
一种维护路由的系统， 其特征在于， 该系统包括： 多个路由器和 多个 PoP节点， 其中，
所述 PoP节点， 用于组成不同的 PoP群组， 同一 PoP群组内的 PoP节点发布同一超级前缀的路由信息，不同 PoP群组内的 PoP节点 发布不同的超级前缀路由，获取自己所发布的超级前缀所覆盖的详细 前缀路由信息， 与所属一 PoP群组内的 PoP节点之间同步所述详细 前缀路由信息；
所述路由器， 用于接收 PoP节点发布的超级前缀的路由信息。 一种维护路由的 PoP节点， 其特征在于， 包括：
路由维护模块， 用于存储超级前缀的路由信息；
发布模块，用于发布所述路由维护模块存储的超级前缀的路由信 息；
接收模块，用于接收发布模块所发布的所述超级前缀所覆盖的详 细前缀路由信息，并将接收到的所述详细前缀路由信息存储到所述路 由维护模块；
同步模块，用于将所述路由维护模块存储的所述详细前缀路由信 息与同一 POP群组内的其他 PoP节点同步。
一种维护路由的边界路由器， 其特征在于， 包括：
路由维护模块， 用于存储超级前缀的路由信息中确定的最优路 由； 接收模块， 用于接收 PoP节点发布的超级前缀路由信息，在接收 到的多个相同所述超级前缀路由信息中确定最优路由并保存到所述 路由维护模块；
注册模块，用于将所述路由维护模块中的被超级前缀路由所覆盖 的详细前缀路由信息向发布该超级前缀路由的就近 PoP节点注册。
与现有技术相比， 本发明实施例具有以下优点： 本发明实施例提 供的方法、 系统及装置， 在传输网络中设置多个接入点 PoP群组， 每 个 PoP群组内设置一个或多个 PoP节点， 同一 PoP群组内的 PoP节 点分别发布同一超级前缀的路由信息； 不同 PoP群组内的 PoP节点 发布不同的超级前缀的路由信息。同一群组内的 PoP节点维护同一个 超级前缀所覆盖的详细前缀的路由信息。这样，在传输不同数据包时， 就可以由这同一群组内的不同 PoP节点进行负载分担转发，从而在釆 用 CRI0技术实现维护路由的情况下，减少每个 PoP节点转发数据包 的流量。 附图说明
图 1为现有技术釆用 CRI0技术维护路由的网络结构示意图； 图 2为本发明实施例提供的维护路由的系统示意图；
图 3为本发明实施例提供的维护路由的方法流程图；
图 4为本发明实施例提供的维护路由的结构示意图；
图 5为本发明实施例提供的 PoP节点结构示意图；
图 6为本发明实施例提供的边界路由器结构示意图。 具体实施方式
为使本发明的目的、技术方案和优点更加清楚， 下面结合附图对 本发明实施例作进一步的详细描述。 本发明实施例为了解决在釆用 CRIO 技术实现维护路由的情况 下， 减少 PoP节点转发数据的流量， 在传输网络中设置多个 PoP群 组， 每个 PoP群组内设置一个或多个 PoP节点， 同一 PoP群组内的 PoP节点分别发布同一超级前缀的路由信息； 不同 PoP群组内的 PoP 节点发布不同的超级前缀的路由信息。同一群组内的 PoP节点维护同 一个超级前缀所覆盖的详细前缀的路由信息。 这样， 在传输不同数据 包时，就可以由这同一群组内的不同 PoP节点进行负载分担转发，从 而减小每个 PoP节点转发数据包的流量。 在本发明实施例中， 同一个 PoP群组内的多个 PoP节点定时或 釆用设定的规则来同步所维护的同一个超级前缀所覆盖的详细前缀 的路由信息， 可以釆用现有技术中的协议进行， 如釆用 BGP来进行 同步， 也可以釆用其他协议进行。 同一个 PoP群组内的多个 PoP节 点维护的同一个超级前缀所覆盖的详细前缀的路由信息可以是预先 设置的，也可以是由边界路由器将所连接的边缘网络内部的且被该超 级前缀所覆盖的详细前缀路由信息到 PoP节点上注册的。 在本发明实施例中， 同一个 PoP群组内的多个 PoP节点维护同 一个超级前缀所覆盖的详细前缀路由信息，即设置具有映射关系的路 由表， 其中， 该路由表包括对应该超级前缀的详细前缀路由信息， 该 详细前缀路由信息包括详细前缀，边界路由器可路由的地址以及优先 级和开销等信息。 在本发明实施例中，维护同一个超级前缀所覆盖的详细前缀路由 信息的一个 PoP群组内的多个 PoP节点的数目是根据该网络的数据 流量以及各个 PoP节点处理数据的能力确定的。 图 2为本发明实施例提供的维护路由的系统结构图， 如图所示： 包括传输网络和边缘网络、边缘网络通过边界路由器与传输网络相连 接， 其中， 传输网络包括多个 PoP群组， 每个群组内包括一个或多 PoP节点；。 此外边缘网络和传输网络也包含一些普通的路由器。 在图中， 为了简便起见， 只包括一个 PoP群组， 该 PoP群组内 有两个 PoP节点。 其中， 同一 PoP群组内的 PoP节点分别维护同一超级前缀所覆 盖的详细前缀的路由信息； 不同 PoP群组内的 PoP节点维护不同的 超级前缀所覆盖的详细前缀的路由信息。 同一 PoP群组内的 PoP节点分别发布同一超级前缀的路由信息； 不同 PoP群组内的 PoP节点发布不同的超级前缀的路由信息。 边界路由器接收到 PoP 节点所发布的超级前缀的路由信息并生 成路由表，将所连接边缘网络内部的详细前缀路由信息向发布覆盖该 详细前缀的超级前缀路由的就近 PoP节点注册。 同一 PoP群组中不 同的 PoP节同步已经注册的详细前缀路由信息。 在传输数据包时，源终端设备先按照现有技术在边缘网络中根据 与源端边界路由器之间的路由信息将数据发送到源端边界路由器上， 源端边界路由器根据最佳匹配的超级前缀的路由信息将数据包发送 到就近 PoP节点上， 该就近 PoP节点通过维护的该超级前缀所覆盖 的详细前缀路由信息确定该目的地址匹配的最佳路由所对应的目的 端边界路由器的路由， 建立到达目的端边界路由器之间的隧道， 将该 数据包发送到该目的端边界路由器上，该目的端边界路由器根据自身 存储的路由信息将数据转发到目的终端设备上。 在本发明实施例中， 当一个 PoP群组内的多个 PoP节点维护了 同一个超级前缀所覆盖的详细前缀路由信息，后续通过其中一个 PoP 节点所维护的路由信息转发数据包的过程和现有技术相同，所以这里 不再累述。 在本发明实施例中 ,边界路由器需要在接收到一个 PoP群组内的 多个 PoP节点分别发布的超级前缀的路由信息后，根据超级前缀的路 由信息（具体为路径最短或路径开销最小等）在多个发布该超级前缀 的路由信息的多个 PoP节点中确定就近 PoP节点，且确定该就近 PoP 节点发布的超级前缀的路由信息为最优路由并存储后，将所连接边缘 网络内部的且被该最优路由所覆盖的详细前缀路由信息向就近 PoP 节点注册。 在本发明实施例中，多个 PoP节点发布的超级前缀的路由信息可 以发布给边界路由器， 也可以发布给传输网络中的其他路由器， 包括 核心路由器等。 在实际应用中， 传输网络可以是因特网的骨干网络， PoP节点为 超级路由器或主机。 图 3为本发明实施例提供的维护路由的方法流程图，其具体步骤 为：
步骤 301、 在通信网络中设置多个 PoP群组， 每个 PoP群组内设 置一个或多个 PoP节点， 同一 PoP群组内的 PoP节点分别发布同一 超级前缀的路由信息； 不同 PoP群组内的 PoP节点发布不同的超级 前缀的路由信息。 同一个 PoP群组内的多个 PoP节点所发布的同一超级前缀的路 由信息可以是预先设置的。 步骤 302、 PoP节点分别获取自己所发布的超级前缀所覆盖的详 细前缀路由信息， 在同一 PoP群组内的 PoP节点之间同步详细前缀 路由信息。 获取的超级前缀所覆盖的详细前缀路由信息是在发布该超级前 缀的 PoP节点中预先设置，或是由通信网络中的边界路由器动态注册 得到的。 将获取到的详细前缀路由信息在同一个 PoP群组内的多个 PoP 节点之间同步可以釆用现有的协议， 如 BGP协议。 在本发明实施例中， 当路由器釆用现有技术检测到所连接边缘网 络内部的详细前缀路由信息发生改变，向发布覆盖该详细前缀路由信 息的超级前缀的路由信息的就近 PoP进行注册更新； 该就近的 PoP节点接收到注册更新之后，更新自身维护的详细前 缀路由信息， 向该超级前缀对应的 PoP群组内的其他的 PoP节点扩 散该路由信息更新。 当要传输数据包时，源端的边界路由器通过源终端设备接收到携 带目的地址的数据包后，根据最佳匹配的超级前缀路由将该数据包路 由到发布该超级前缀的路由信息的就近 PoP节点， 该就近 PoP节点 通过维护的该超级前缀所覆盖的详细前缀路由信息建立到达目的端 边界路由器的隧道， 将该数据包发送到目的端边界路由器上， 目的端 边界路由器根据自身存储的路由将数据转发到目的终端设备上。
下面， 举一个具体实施例说明本发明实施例， 如图 4所示， 为本 发明实施例提供的维护路由的结构示意图， 如图所示：
在通信网络中设置两个 PoP 节点维护同一个超级前缀的路由信 息以及该超级前缀所覆盖的详细前缀路由信息，假设这两个 PoP节点 为 PoP- 1和 ΡοΡ-2 , 这两个 PoP节点都向通信网络中发布网段地址为 10.0.0.0/8的超级前缀的路由信息， 通信网络中的边缘网络 A的网络 前缀为 10.1.0.0/16, 边缘网络 B的网络前缀为 10.2.0.0/16。 边缘网络 A连接的通信网络的边界路由器 A将 10.1.0.0/16的详细前缀路由信 息注册到离自身比较近的发布 10.0.0.0/8的 PoP-1上， 边缘网络 B连 接的通信网络的边界路由器 B将 10.2.0.0/16的详细前缀路由信息注 册到离自身比较近的发布 10.0.0.0/8的 PoP-2上。 PoP-1和 PoP-2通过 现有的协议将已经注册的详细前缀路由信息进行同步， 同步之后在 PoP-1和 PoP-2上都存在该超级前缀所覆盖的详细前缀路由信息， 即 10.1.0.0/16对应的边界路由器为边界路由器 A, 10.2.0.0/16对应的边 界路由器为边界路由器^
当边界路由器和边缘网络的连接中断时，边界路由器向发布覆盖 该无效详细前缀路由的超级前缀路由的就近 PoP 节点发布路由删除 消息， 携带要删除的详细前缀路由信息， PoP节点接收到后则删除存 储的相应的详细前缀路由信息， 同时向同一 PoP群组内的其他 PoP 节点通告该详细前缀路由信息无效， 其他 PoP节点进行相应地删除。 也就是说，多个 PoP节点维护的同一个超级前缀所覆盖的详细前缀路 由信息可以实时更新。
该示例为到多个 PoP 节点注册路由的方式， 当然也可以预先配 置，比如在 PoP-1上配置 10.1.0.0/16对应的边界路由器为边界路由器 A, 在 PoP-2上配置 10.2.0.0/16对应的边界路由器为边界路由器 B, 之后负责超级前缀 10.0.0.0/8的路由信息发布的 PoP节点之间进行路 由信息同步。
这样， 在该通信网络中就完成了路由建立且维护的过程， 这时， 就可以通过维护的路由传输数据包了， 以下具体说明如何传输数据。
来自边缘网络 A的目的地址为 10.2.2.2的数据包（该数据包携 带有目的地址） 沿着缺省路由到达边界路由器 A后 （由于边缘网络 和边界路由器 A之间只有一条路由， 所以一般设置为缺省路由）， 边 界路由器 A根据该数据包携带的目的地址所匹配的最佳路由， 即 10.0.0.0/8的路由， 将该数据包沿着 10.0.0.0/8超级前缀路由转发到发 布超级前缀 10.0.0.8路由信息的就近 PoP, 即 PoP-l。 PoP- 1查找存储 的路由信息查找到达该目的地址 10.2.2.2的最佳路径为 10.2.0.0/16, 对应的边界路由器为边界路由器 B,则通过到边界路由器 B的详细前 缀路由信息将数据包发送到边界路由器 B后， 边界路由器 B根据数 据包携带的目的地址， 且根据自身维护的边缘网络 B 的路由信息， 将数据包转发给目的终端设备。
来自边缘网络 B的目的地址为 10丄 1.1的数据包（该数据包携带 有目的地址） 沿着缺省路由到达边界路由器 B后， 边界路由器 B根 据该数据包携带的目的地址所匹配的最佳路由，即 10.0.0.0/8的路由， 将该数据包沿着超级前缀 10.0.0.0/8的路由到达发布超级前缀 10.0.0.8 路由信息的就近 PoP,即 PoP-2。 PoP-2查找存储的路由信息找到到达 该目的地址 10.1.1.1的最佳路径为 10.1.0.0/16, 对应的边界路由器为 边界路由器 A, 则通过到边界路由器 A的路由将数据包发送到边界 路由器 A后， 边界路由器 A根据数据包携带的目的地址， 且根据自 身维护的边缘网络 A的路由信息， 将数据包转发给目的终端设备。 为了实现同一 PoP群组的多个 PoP节点维护同一个超级前缀所 覆盖的详细前缀路由， 本发明实施例还提供一种 PoP 节点， 如图 5 所示， 包括发布模块、 接收模块、 路由维护模块和同步模块， 其中， 路由维护模块， 用于存储超级前缀的路由信息；
发布模块，用于发布路由维护模块存储的一个超级前缀的路由信 息；
接收模块，用于接收自己所发布的超级前缀所覆盖的详细前缀路 由信息， 并将接收到的详细前缀路由信息存储到路由维护模块；
同步模块， 用于将路由维护模块存储的详细前缀路由与同一 PoP 群组内的其他 PoP节点同步。 本发明实施例还提供一种边界路由器， 如图 6所示， 包括接收模 块、 路由维护模块以及注册模块， 其中，
路由维护模块， 用于存储超级前缀的路由信息中确定的最优路 由；
接收模块， 用于接收 PoP节点发布的超级前缀的路由信息，在超 级前缀的多个路由信息中确定最优路由并保存到路由维护模块；
注册模块，用于将路由维护模块中的被超级前缀路由信息所覆盖 的详细前缀路由信息向发布该超级前缀路由的就近 PoP节点注册。
从本发明实施例提供的方法及系统可以看出，在传输网络中部署 多个 PoP群组，每个 PoP群组内设置一个或多个 PoP节点， 同一 PoP 群组内的 PoP 节点分别维护同一超级前缀的路由信息以及该超级前 缀所覆盖的详细前缀信息； 不同 PoP群组内的 PoP节点维护不同的 超级前缀的路由信息以及不同超级前缀所覆盖的详细前缀信息，数据 包就可以通过 PoP群组内的就近 PoP节点进行转发， 转发数据包的 跳数比现有技术釆用 CRIO技术实现维护路由减少了， 同时达到某个 对应超级前缀的路由信息的网段地址的数据包根据路由的最短路径 或路径开销最小等原则， 到发布该超级前缀的路由信息的就近 PoP 节点进行转发的目的，从而达到运用同一超级前缀的路由信息的数据 包转发在不同的 PoP节点之间进行负载分担。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解 到本发明可以通过硬件实现，也可以可借助软件加必要的通用硬件平 台的方式来实现基于这样的理解，本发明的技术方案可以以软件产品 的形式体现出来， 该软件产品可以存储在一个非易失性存储介质（可 以是 CD-ROM, U盘， 移动硬盘等） 中， 包括若干指令用以使得一 台计算机设备（可以是个人计算机， 服务器， 或者网络设备等）执行 本发明各个实施例所述的方法。
总之， 以上所述仅为本发明的较佳实施例而已， 并非用于限定本 发明的保护范围。 凡在本发明的精神和原则之内， 所作的任何修改、 等同替换、 改进等， 均应包含在本发明的保护范围之内。

Claims

权利要求
1、 一种维护路由的方法， 其特征在于， 所述方法应用于包括多 个接入点 PoP群组， 每个 PoP群组包含一个或多个 PoP节点的通信 网络中， 所述方法包括：
同一 PoP群组内的 PoP节点发布同一超级前缀的路由信息； 不同 PoP群组内的 PoP节点发布不同的超级前缀的路由信息； 每个 PoP 节点获取自己发布的超级前缀所覆盖的详细前缀路由 信息， 与所属同一 PoP群组内的 PoP节点之间同步所述详细前缀路 由信息。
2、 如权利要求 1所述的方法， 其特征在于， 所述 PoP节点所发 布的所述超级前缀的路由信息是预先设置的。
3、 如权利要求 1所述的方法， 其特征在于， 所述获取的超级前 缀所覆盖的详细前缀路由信息是在发布所述超级前缀的 PoP 节点预 先设置， 或由通信网络中的边界路由器动态注册得到的。
4、 如权利要求 3所述的方法， 其特征在于， 所述由通信网络中 的边界路由器动态注册超级前缀所覆盖的详细前缀路由信息的过程 为：
边界路由器接收 PoP 节点发布的超级前缀路由信息并生成路由 表， 在路由表中记录发布所述超级前缀路由信息的 PoP节点的地址， 所述边界路由器将所连接边缘网络内部的详细前缀路由信息向发布 覆盖所述详细前缀的超级前缀路由的就近 PoP节点注册。
5、 如权利要求 4所述的方法， 其特征在于， 所述详细前缀路由 信息包含所属详细前缀，边界路由器可路由的地址以及优先级和开销 信息。
6、 如权利要求 4所述的方法， 其特征在于， 该方法进一步包括 转发数据包的过程：
将数据包根据匹配的超级前缀路由信息逐跳转发到发布所述超 级前缀路由信息的就近 PoP节点， 所述就近 PoP节点查找路由表中 与所述数据包的目的 IP地址最佳匹配的路由， 确定该最佳路由对应 的边界路由器的地址，将该数据包通过隧道方式发送到该边界路由器 上。
7、 如权利要求 1或 4所述的方法， 其特征在于， 该方法还包括： 边界路由器所连接边缘网络内部的详细前缀路由信息发生改变 时，边界路由器向发布覆盖所述详细前缀路由信息的超级前缀的路由 信息的就近 PoP节点进行注册更新；
所述就近 PoP节点接收到注册更新之后，更新自身维护的详细前 缀路由信息， 向所述超级前缀对应的 PoP群组内的其他的 PoP节点 扩散该路由信息更新。
8、 如权利要求 1所述的方法， 其特征在于， 所述同一 PoP群组 内的 PoP节点之间釆用边界网关协议 BGP同步。
9、 一种维护路由的方法， 其特征在于， 该方法包括：
接收 PoP节点发布的超级前缀路由信息并生成路由表，在路由表 中记录发布该超级前缀路由信息的 PoP节点的地址，将所连接边缘网 络内部的详细前缀路由信息向发布覆盖所述详细前缀的超级前缀路 由的就近 PoP节点注册。
10、 如权利要求 9所述的方法， 其特征在于， 该方法还包括： 当所连接边缘网络内部的详细前缀路由信息发生改变时，向发布 覆盖该详细前缀路由信息的超级前缀的路由信息的就近 PoP进行注 册更新。
11、 一种维护路由的系统， 其特征在于， 该系统包括： 多个路由 器和多个 PoP节点， 其中，
所述 PoP节点， 用于组成不同的 PoP群组， 同一 PoP群组内的 PoP节点发布同一超级前缀的路由信息，不同 PoP群组内的 PoP节点 发布不同的超级前缀路由，获取自己所发布的超级前缀所覆盖的详细 前缀路由信息， 与所属一 PoP群组内的 PoP节点之间同步所述详细 前缀路由信息；
所述路由器， 用于接收 PoP节点发布的超级前缀的路由信息。
12、 如权利要求 11所述的系统， 其特征在于， 所述多个路由器 包括边界路由器， 所述多个 PoP节点包括边界路由器的就近 PoP节 点， 其中，
所述就近 PoP节点，还用于根据所述边界路由器的请求对被自己 所发布的超级前缀所覆盖的详细前缀路由信息进行注册；
所述边界路由器，还用于保存接收到的超级前缀的路由信息并生 成路由表，将所连接边缘网络内部的详细前缀路由信息向发布覆盖所 述详细前缀的超级前缀路由的所述就近 PoP节点注册。
13、 一种维护路由的 PoP节点， 其特征在于， 包括：
路由维护模块， 用于存储超级前缀的路由信息；
发布模块，用于发布所述路由维护模块存储的超级前缀的路由信 息；
接收模块，用于接收发布模块所发布的所述超级前缀所覆盖的详 细前缀路由信息，并将接收到的所述详细前缀路由信息存储到所述路 由维护模块；
同步模块，用于将所述路由维护模块存储的所述详细前缀路由信 息与同一 POP群组内的其他 PoP节点同步。
14、 一种维护路由的边界路由器， 其特征在于， 包括： 路由维护模块， 用于存储超级前缀的路由信息中确定的最优路 由；
接收模块， 用于接收 PoP节点发布的超级前缀路由信息，在接收 到的多个相同所述超级前缀路由信息中确定最优路由并保存到所述 路由维护模块；
注册模块，用于将所述路由维护模块中的被超级前缀路由所覆盖 的详细前缀路由信息向发布该超级前缀路由的就近 PoP节点注册。
PCT/CN2008/072244 2007-09-17 2008-09-02 Procédé, système et équipement pour un maintien de route WO2009039747A1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP08800756.2A EP2222029B1 (en) 2007-09-17 2008-09-02 Method and system for route maintaining
US12/863,103 US20110051738A1 (en) 2007-09-17 2008-09-02 Method, system and device for maintaining routes
ES08800756.2T ES2458317T3 (es) 2007-09-17 2008-09-02 Método y sistema para un mantenimiento de ruta
US12/982,733 US8065434B2 (en) 2007-09-17 2010-12-30 Method and device for maintaining routes

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2007101545068A CN101394341B (zh) 2007-09-17 2007-09-17 维护路由的方法、系统及装置
CN200710154506.8 2007-09-17

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US86310310A Continuation 2007-09-17 2010-07-23

Publications (1)

Publication Number Publication Date
WO2009039747A1 true WO2009039747A1 (fr) 2009-04-02

Family

ID=40494424

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/072244 WO2009039747A1 (fr) 2007-09-17 2008-09-02 Procédé, système et équipement pour un maintien de route

Country Status (5)

Country Link
US (2) US20110051738A1 (zh)
EP (1) EP2222029B1 (zh)
CN (1) CN101394341B (zh)
ES (1) ES2458317T3 (zh)
WO (1) WO2009039747A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102045233A (zh) * 2009-10-22 2011-05-04 杭州华三通信技术有限公司 一种网络通信中控制报文转发的方法和设备
CN102045249B (zh) * 2009-10-22 2012-08-08 杭州华三通信技术有限公司 一种网络通信中报文的转发方法和设备

Families Citing this family (67)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7991910B2 (en) 2008-11-17 2011-08-02 Amazon Technologies, Inc. Updating routing information based on client location
US8028090B2 (en) 2008-11-17 2011-09-27 Amazon Technologies, Inc. Request routing utilizing client location information
US8606996B2 (en) 2008-03-31 2013-12-10 Amazon Technologies, Inc. Cache optimization
US8321568B2 (en) 2008-03-31 2012-11-27 Amazon Technologies, Inc. Content management
US8601090B1 (en) 2008-03-31 2013-12-03 Amazon Technologies, Inc. Network resource identification
US8447831B1 (en) 2008-03-31 2013-05-21 Amazon Technologies, Inc. Incentive driven content delivery
US7962597B2 (en) 2008-03-31 2011-06-14 Amazon Technologies, Inc. Request routing based on class
US7970820B1 (en) 2008-03-31 2011-06-28 Amazon Technologies, Inc. Locality based content distribution
US9912740B2 (en) 2008-06-30 2018-03-06 Amazon Technologies, Inc. Latency measurement in resource requests
US9407681B1 (en) 2010-09-28 2016-08-02 Amazon Technologies, Inc. Latency measurement in resource requests
US8122098B1 (en) 2008-11-17 2012-02-21 Amazon Technologies, Inc. Managing content delivery network service providers by a content broker
US8073940B1 (en) 2008-11-17 2011-12-06 Amazon Technologies, Inc. Managing content delivery network service providers
US8688837B1 (en) 2009-03-27 2014-04-01 Amazon Technologies, Inc. Dynamically translating resource identifiers for request routing using popularity information
US8756341B1 (en) 2009-03-27 2014-06-17 Amazon Technologies, Inc. Request routing utilizing popularity information
US8412823B1 (en) 2009-03-27 2013-04-02 Amazon Technologies, Inc. Managing tracking information entries in resource cache components
US8782236B1 (en) 2009-06-16 2014-07-15 Amazon Technologies, Inc. Managing resources using resource expiration data
US8397073B1 (en) 2009-09-04 2013-03-12 Amazon Technologies, Inc. Managing secure content in a content delivery network
US8433771B1 (en) 2009-10-02 2013-04-30 Amazon Technologies, Inc. Distribution network with forward resource propagation
US9495338B1 (en) 2010-01-28 2016-11-15 Amazon Technologies, Inc. Content distribution network
US8468247B1 (en) 2010-09-28 2013-06-18 Amazon Technologies, Inc. Point of presence management in request routing
US9712484B1 (en) 2010-09-28 2017-07-18 Amazon Technologies, Inc. Managing request routing information utilizing client identifiers
US10958501B1 (en) 2010-09-28 2021-03-23 Amazon Technologies, Inc. Request routing information based on client IP groupings
US9003035B1 (en) 2010-09-28 2015-04-07 Amazon Technologies, Inc. Point of presence management in request routing
US10097398B1 (en) 2010-09-28 2018-10-09 Amazon Technologies, Inc. Point of presence management in request routing
US8452874B2 (en) 2010-11-22 2013-05-28 Amazon Technologies, Inc. Request routing processing
CN102137002B (zh) * 2010-12-01 2013-10-09 华为技术有限公司 边际网关协议负载分担的方法和装置
US10467042B1 (en) 2011-04-27 2019-11-05 Amazon Technologies, Inc. Optimized deployment based upon customer locality
WO2011144042A2 (zh) * 2011-05-19 2011-11-24 华为技术有限公司 路由信息的下发方法和边界设备
US20130197955A1 (en) * 2012-01-31 2013-08-01 Fisher-Rosemount Systems, Inc. Apparatus and method for establishing maintenance routes within a process control system
US10623408B1 (en) 2012-04-02 2020-04-14 Amazon Technologies, Inc. Context sensitive object management
US9154551B1 (en) 2012-06-11 2015-10-06 Amazon Technologies, Inc. Processing DNS queries to identify pre-processing information
US9323577B2 (en) 2012-09-20 2016-04-26 Amazon Technologies, Inc. Automated profiling of resource usage
US10205698B1 (en) 2012-12-19 2019-02-12 Amazon Technologies, Inc. Source-dependent address resolution
US9294391B1 (en) 2013-06-04 2016-03-22 Amazon Technologies, Inc. Managing network computing components utilizing request routing
CN104135438B (zh) * 2014-07-08 2017-10-17 清华大学 报文携带路由信息的可扩展路由方法
US9882814B2 (en) * 2014-09-25 2018-01-30 Intel Corporation Technologies for bridging between coarse-grained and fine-grained load balancing
US10033627B1 (en) 2014-12-18 2018-07-24 Amazon Technologies, Inc. Routing mode and point-of-presence selection service
US10097448B1 (en) 2014-12-18 2018-10-09 Amazon Technologies, Inc. Routing mode and point-of-presence selection service
US10091096B1 (en) 2014-12-18 2018-10-02 Amazon Technologies, Inc. Routing mode and point-of-presence selection service
US10225326B1 (en) 2015-03-23 2019-03-05 Amazon Technologies, Inc. Point of presence based data uploading
US9819567B1 (en) 2015-03-30 2017-11-14 Amazon Technologies, Inc. Traffic surge management for points of presence
US9832141B1 (en) 2015-05-13 2017-11-28 Amazon Technologies, Inc. Routing based request correlation
US10097566B1 (en) 2015-07-31 2018-10-09 Amazon Technologies, Inc. Identifying targets of network attacks
US9774619B1 (en) 2015-09-24 2017-09-26 Amazon Technologies, Inc. Mitigating network attacks
US10270878B1 (en) 2015-11-10 2019-04-23 Amazon Technologies, Inc. Routing for origin-facing points of presence
US10257307B1 (en) 2015-12-11 2019-04-09 Amazon Technologies, Inc. Reserved cache space in content delivery networks
US10049051B1 (en) 2015-12-11 2018-08-14 Amazon Technologies, Inc. Reserved cache space in content delivery networks
US10348639B2 (en) 2015-12-18 2019-07-09 Amazon Technologies, Inc. Use of virtual endpoints to improve data transmission rates
US10075551B1 (en) 2016-06-06 2018-09-11 Amazon Technologies, Inc. Request management for hierarchical cache
US10110694B1 (en) 2016-06-29 2018-10-23 Amazon Technologies, Inc. Adaptive transfer rate for retrieving content from a server
US9992086B1 (en) 2016-08-23 2018-06-05 Amazon Technologies, Inc. External health checking of virtual private cloud network environments
US10033691B1 (en) 2016-08-24 2018-07-24 Amazon Technologies, Inc. Adaptive resolution of domain name requests in virtual private cloud network environments
US10469513B2 (en) 2016-10-05 2019-11-05 Amazon Technologies, Inc. Encrypted network addresses
US10831549B1 (en) 2016-12-27 2020-11-10 Amazon Technologies, Inc. Multi-region request-driven code execution system
US10372499B1 (en) 2016-12-27 2019-08-06 Amazon Technologies, Inc. Efficient region selection system for executing request-driven code
US10938884B1 (en) 2017-01-30 2021-03-02 Amazon Technologies, Inc. Origin server cloaking using virtual private cloud network environments
US10503613B1 (en) 2017-04-21 2019-12-10 Amazon Technologies, Inc. Efficient serving of resources during server unavailability
US11075987B1 (en) 2017-06-12 2021-07-27 Amazon Technologies, Inc. Load estimating content delivery network
US10447648B2 (en) 2017-06-19 2019-10-15 Amazon Technologies, Inc. Assignment of a POP to a DNS resolver based on volume of communications over a link between client devices and the POP
US10742593B1 (en) 2017-09-25 2020-08-11 Amazon Technologies, Inc. Hybrid content request routing system
EP3745659A4 (en) 2018-02-13 2020-12-09 Huawei Technologies Co., Ltd. METHOD AND DEVICE FOR GUIDING ROUTING
US10592578B1 (en) 2018-03-07 2020-03-17 Amazon Technologies, Inc. Predictive content push-enabled content delivery network
CN109104370B (zh) * 2018-07-06 2021-03-02 烽火通信科技股份有限公司 一种前缀列表实时刷新方法及系统
US10862852B1 (en) 2018-11-16 2020-12-08 Amazon Technologies, Inc. Resolution of domain name requests in heterogeneous network environments
US11025747B1 (en) 2018-12-12 2021-06-01 Amazon Technologies, Inc. Content request pattern-based routing system
CN111162954B (zh) * 2020-01-22 2021-07-09 厦门网宿有限公司 一种路径规划方法、系统及中央服务器
CN111614557B (zh) * 2020-04-02 2021-09-24 深圳创维－Rgb电子有限公司 Mesh网络的数据传输方法、装置、网关及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1235450A (zh) * 1998-05-13 1999-11-17 西门子公司 利用通信网络内部的未利用的和/或小负荷的通信路由进行通信连接的方法
US20030169747A1 (en) * 2002-03-01 2003-09-11 Yang Wang Resource allocation in virtual routers
US20050048962A1 (en) * 2003-09-02 2005-03-03 Watson Wan Communications point-of-presence
US20050201302A1 (en) * 2000-06-14 2005-09-15 Wiltel Communications Group, Inc. Internet route deaggregation and route selection preferencing

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6829654B1 (en) * 2000-06-23 2004-12-07 Cloudshield Technologies, Inc. Apparatus and method for virtual edge placement of web sites
US20040003070A1 (en) * 2002-06-26 2004-01-01 Clarus Systems, Inc. Centrally controlled end-to-end service quality monitoring system and method in a distributed environment
US7305464B2 (en) * 2002-09-03 2007-12-04 End Ii End Communications, Inc. Systems and methods for broadband network optimization
JP2004335624A (ja) * 2003-05-06 2004-11-25 Hitachi Ltd 半導体モジュール
US20080089347A1 (en) * 2003-08-29 2008-04-17 End Ii End Communications Inc. Systems and methods for broadband network optimization
US8285578B2 (en) * 2004-01-21 2012-10-09 Hewlett-Packard Development Company, L.P. Managing information technology (IT) infrastructure of an enterprise using a centralized logistics and management (CLAM) tool
US7978611B2 (en) * 2005-09-06 2011-07-12 At&T Intellectual Property I, L.P. Systems and methods to determine network routes based on transmission medium length
US7522603B2 (en) * 2006-03-14 2009-04-21 Cisco Technology, Inc. Technique for efficiently routing IP traffic on CE-CE paths across a provider network
US7778165B2 (en) * 2007-11-08 2010-08-17 University Of Washington Information plane for determining performance metrics of paths between arbitrary end-hosts on the internet
US7796607B2 (en) * 2008-05-30 2010-09-14 At&T Intellectual Property I, L.P. Scalable multiprotocol label switching based virtual private networks and methods to implement the same

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1235450A (zh) * 1998-05-13 1999-11-17 西门子公司 利用通信网络内部的未利用的和/或小负荷的通信路由进行通信连接的方法
US20050201302A1 (en) * 2000-06-14 2005-09-15 Wiltel Communications Group, Inc. Internet route deaggregation and route selection preferencing
US20030169747A1 (en) * 2002-03-01 2003-09-11 Yang Wang Resource allocation in virtual routers
US20050048962A1 (en) * 2003-09-02 2005-03-03 Watson Wan Communications point-of-presence

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2222029A4 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102045233A (zh) * 2009-10-22 2011-05-04 杭州华三通信技术有限公司 一种网络通信中控制报文转发的方法和设备
CN102045249B (zh) * 2009-10-22 2012-08-08 杭州华三通信技术有限公司 一种网络通信中报文的转发方法和设备

Also Published As

Publication number Publication date
US20110085554A1 (en) 2011-04-14
EP2222029A4 (en) 2011-04-06
CN101394341B (zh) 2011-08-03
US20110051738A1 (en) 2011-03-03
US8065434B2 (en) 2011-11-22
ES2458317T3 (es) 2014-04-30
CN101394341A (zh) 2009-03-25
EP2222029A1 (en) 2010-08-25
EP2222029B1 (en) 2014-02-12

Similar Documents

Publication Publication Date Title
WO2009039747A1 (fr) Procédé, système et équipement pour un maintien de route
US8942238B2 (en) Apparatus and method for establishing tunnels between nodes in a communication network
EP3412010B1 (en) Overloading address space for improved routing, diagnostics, and content-relay network
EP2372977B1 (en) Method of providing data communication to a vehicle
US20130238802A1 (en) System and Apparatus for Distributed Mobility Management Based Network Layer Virtual Machine Mobility Protocol
JP5231657B2 (ja) オーバーラップしているネットワークを形成、維持および／または使用する方法および装置
JP2007532058A (ja) 無線マルチホップアドホックネットワークにおけるアドレス解決マッピングのための方法、通信デバイスおよびシステム
WO2009036678A1 (fr) Procédé, dispositif et système de réseau pour acheminer un message
WO2009006817A1 (fr) Procédé et appareil de transfert d'informations
WO2009074077A1 (fr) Méthode de réalisation de services anycast, méthode d'envoi de demandes anycast, et routeur anycast
US20240214301A1 (en) Packet processing method and related apparatus
Jin et al. MANET for Disaster Relief based on NDN
WO2022142932A1 (zh) 一种路由处理方法、相关装置以及网络系统
WO2009121265A1 (zh) 一种多归属多地址空间网络中实现流量工程的方法和设备
WO2013083037A1 (zh) 更新报文的处理方法及系统、映射服务器和移动节点
JP4357310B2 (ja) 複数のネットワークに同時接続する通信方法および通信装置
JP4369882B2 (ja) ルーティング方法、および、ネットワークシステム
WO2009033398A1 (fr) Système de réseau mobile à espace d'adresses multiples, routeur et procédé de transmission de données
JP5464360B2 (ja) 移動体通信における改良された端末情報管理方式及び通信方式を実現するメッシュ型ネットワーク及び基地局
JP2007129516A (ja) 経路探索装置
JP2005006264A (ja) モバイルｉｐネットワークシステム
WO2013182108A1 (zh) 哈希映射平面的映射信息注册和查找方法、设备及系统
JP2004080268A (ja) 動的再構成光網における経路情報交換方法およびこれを用いる経路情報交換システム
KR20090065835A (ko) 분산형 네트워크에서의 데이터 전송 방법

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08800756

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2008800756

Country of ref document: EP