WO2011153909A1 - 一种业务叠加网络的业务路由方法及系统 - Google Patents

一种业务叠加网络的业务路由方法及系统 Download PDF

Info

Publication number
WO2011153909A1
WO2011153909A1 PCT/CN2011/074936 CN2011074936W WO2011153909A1 WO 2011153909 A1 WO2011153909 A1 WO 2011153909A1 CN 2011074936 W CN2011074936 W CN 2011074936W WO 2011153909 A1 WO2011153909 A1 WO 2011153909A1
Authority
WO
WIPO (PCT)
Prior art keywords
service
service routing
entity
routing entity
code
Prior art date
Application number
PCT/CN2011/074936
Other languages
English (en)
French (fr)
Inventor
库塔斯·哇拉朴拉胡
常恒
尼兰石⋅阿莫夫
陈珊
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP11791900.1A priority Critical patent/EP2582098B1/en
Publication of WO2011153909A1 publication Critical patent/WO2011153909A1/zh
Priority to US13/708,809 priority patent/US8780883B2/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/64Routing or path finding of packets in data switching networks using an overlay routing layer
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63Routing a service request depending on the request content or context

Definitions

  • the present invention relates to the field of communications, and in particular, to a service routing method and system for a service overlay network. Background technique
  • a basic service route is generally a service routing entity that receives a service request, and sends a service request to a home service routing entity of the service, and then the home service routing entity forwards the service request to the service provider, thereby completing the service. routing.
  • the home service routing entity of the service may leave the service overlay network.
  • the service request of the service requester cannot be correctly routed to the service provider, and the service route fails.
  • An embodiment of the present invention provides a service routing method and system for a service overlay network, which solves the problem that a service routing entity that receives a service request in the prior art needs to know the service provider's home service routing entity clearly, and thus cannot effectively adapt to the service overlay. This issue of network dynamics.
  • a service routing method for a service overlay network including:
  • Step A The current service routing entity receives the service request, and according to the route code of the home service routing entity of the service, the current service routing entity selects a route code that has the closest relationship with the route code from the service routing table.
  • Corresponding second service routing entity if the second service routing entity is not the current service routing entity itself, the current service routing entity forwards the service request to the second service routing entity, and carries the a route code of the home service routing entity; the second service routing entity is configured as a current service routing entity, and the step A is performed until the second service routing entity selected by the current service routing entity is the current service routing entity.
  • a method for newly joining a service overlay network includes: Step C: A current service routing entity receives a route code of a newly joined service routing entity, and selects a next hop having the closest neighbor relationship with the route code from its own service routing table. Service routing entity;
  • next hop service routing entity If the next hop service routing entity is not the current service routing entity itself, the current service routing entity sends a service routing table update message to the next hop service routing entity, and carries the newly joined service routing entity.
  • Route coding if the route code of the newly joined service routing entity is closer to the route coding of the current service routing entity than the route code of at least one neighbor service routing entity in the service routing table of the current service routing entity, then The current service routing entity performs more on its own service routing table. New, the new hop service routing entity is added; the next hop service routing entity is set as the current service routing entity, and the step C is performed until the next hop service routing entity selected by the current service routing entity is the Current service routing entity itself;
  • next hop service routing entity is the current service routing entity itself
  • the current service routing entity is set as the nearest neighbor service routing entity; the nearest neighbor service routing entity sends its own service routing table to the new Join the service routing entity, and then update the service routing table of the nearest neighbor service routing entity to join the newly joined service routing entity.
  • a method for exiting a service overlay network comprising: an exit service routing entity obtaining, from a first service registration entity corresponding thereto, all service registration information stored in the first service registration entity; Selecting, in the routing table, a nearest neighbor service routing entity having the closest neighboring route coding relationship, sending a service routing entity leaving request to the nearest neighbor service routing entity, and carrying the service registration information; the nearest neighbor service routing entity The service registration information is registered to the second service registration entity corresponding to the service; the nearest neighbor service routing entity deletes the exit service routing entity from the service routing table, and sends the neighbor service routing entity to the service routing table.
  • Send a service routing table update message comprising:
  • a service overlay network system comprising:
  • a service routing entity configured to receive a service request, and select, according to a route code of the home service routing entity of the service, a second service routing entity corresponding to the route code having the closest relationship with the route code from the service routing table. And if the second service routing entity is not the service routing entity itself, the service routing entity forwards the service request to the second service routing entity;
  • the nearest service routing entity when the service routing entity selects the second service route
  • the service routing entity is set as the nearest neighbor service routing entity; used to send a service registration information query request to the service registration entity; receive service registration information returned by the service registration entity; and according to the service registration information
  • the endpoint address of the service provider sending the service request to the service provider;
  • a service registration entity configured to receive a service registration information query request sent by the nearest neighbor service routing entity; and send service registration information to the nearest neighbor service routing entity.
  • a service overlay network system comprising:
  • a service routing entity configured to receive a route code of the newly added service routing entity, and select a next hop service routing entity that has the closest relationship with the route code from the service routing table; if the next hop service routing entity is not The service routing entity itself, the service routing entity sends a service routing table update message to the next hop service routing entity, and carries the route coding code of the newly joined service routing entity;
  • the routing code is closer to the routing code of the service routing entity than the routing code of the at least one neighbor service routing entity in the service routing table of the service routing entity, and the service routing entity updates its own service routing table.
  • the nearest neighbor service routing entity when the next hop service routing entity selected by the service routing entity is itself, the service routing entity is set as the nearest neighbor service routing entity; and is used to send a service to the newly joined service routing entity. Routing the table, and then updating the service routing table of the nearest neighbor service routing entity to join the new joining service routing entity.
  • a service overlay network system comprising: an exit service routing entity, configured to send a service registration information request to a corresponding first service registration entity; and receive all the information sent by the first service registration entity to be saved in the first service registration Entity service registration information; the exit service routing entity selects a nearest neighbor service routing entity having the closest neighboring route coding relationship from its own service routing table, and sends a service routing entity leaving request to the nearest neighbor service routing entity, and Carrying the business registration information;
  • a first service registration entity configured to receive a service registration information request sent by the exit service routing entity; and send, to the exit service routing entity, all service registration information stored in the first service registration entity;
  • a nearest neighbor service routing entity configured to receive a service routing entity leaving request sent by the exit service routing entity; register the service registration information with a second service registration entity corresponding to the second service registration entity; Deleting the exit service routing entity from the service routing table, and sending a service routing table update message to the neighbor service routing entity in the service routing table;
  • a second service registration entity configured to receive the service registration information sent by the nearest neighbor service routing entity, return a registration response to the nearest neighbor service routing entity, and use a neighbor service routing entity to receive the nearest neighbor service
  • the service routing method and system for the service overlay network provided by the embodiment of the present invention, in the self-organizing mode, the service overlay network has good scalability, and the service routing entity can dynamically join or leave the service according to the overall load of the network. Overlay the network.
  • the current service routing entity selects the next hop service routing entity that has the closest relationship with the route code from the service routing table according to the route code of the newly added service routing entity. If the one-hop service routing entity is not the current service routing entity itself, the current service routing entity forwards the route code of the newly added service routing entity to the next hop service routing entity, and the next hop service routing entity continues to be in its own service routing table. Looking for the service routing entity closest to the newly joined service routing entity, so that iteratively iteratively looks up until a service routing entity has the closest neighboring relationship with the routing code of the newly joined service routing entity selected from its own service routing table. The next hop service routing entity is itself. At this time, the service routing entity is the nearest neighbor service routing entity. Then, the nearest neighbor service routing entity and the newly added service routing entity respectively update and set their own service routing table, so as to implement the dynamic force of the service routing entity.
  • the exit service routing entity delegates all service registration information stored in its corresponding service registration entity to the nearest neighbor service routing entity having the closest neighboring route coding relationship, and then, the most The neighboring service routing entity updates the service routing table to implement dynamic exit of the service routing entity.
  • the current service routing entity receives the service request, and selects the second service routing entity having the closest neighbor relationship from the service routing table according to the routing code of the home service routing entity of the service, if the second The service routing entity is not the current service routing entity itself.
  • the current service routing entity forwards the service request carrying the route code of the home service routing entity to the second service routing entity, and the second service routing entity continues to search for the service routing table.
  • the service routing entity closest to the routing code of the home service routing entity so that iteratively iteratively searches until the traffic routing entity has the closest relationship with the routing code of the home service routing entity selected from its own service routing table.
  • the second service routing entity is itself, and the service routing entity is the nearest neighbor service routing entity. Then, the nearest neighbor service routing entity obtains service registration information of the service from its corresponding service registration entity, and sends a service request to the service provider according to the service provider's endpoint address in the service registration information to implement service routing.
  • the service routing entity that receives the service request does not need to explicitly know the service provider's home service routing entity, and may be based on the route allocated for the service routing entity.
  • the coded neighbor relationship performs self-organizing routing to implement routing of service requests in the service overlay network, thereby effectively adapting to the dynamics of the service overlay network.
  • Figure 1 is a schematic diagram of a system architecture of a service overlay network
  • FIG. 2 is a flow chart of a service routing method of a service overlay network according to an embodiment of the present invention
  • FIG. 3 is a flow chart of a method for newly joining a service overlay network according to an embodiment of the present invention
  • FIG. 4 is a flowchart of a method for exiting a service overlay network according to an embodiment of the present invention.
  • FIG. 5 is a schematic flowchart of a method for newly joining a service overlay network according to an embodiment of the present invention
  • FIG. 6 is a schematic flowchart of a service registration process
  • FIG. 7 is a schematic flowchart of a method for exiting a service overlay network according to an embodiment of the present invention
  • FIG. 8 is a schematic flowchart of a service routing method of a service overlay network according to an embodiment of the present invention
  • FIG. 9 is a schematic diagram 1 of a service overlay network according to an embodiment of the present invention
  • FIG. 10 is a service overlay according to another embodiment of the present invention. Schematic diagram of the network
  • FIG. 11 is a schematic structural diagram of a service overlay network according to another embodiment of the present invention.
  • Service Routing Entity 1 The system architecture of the service overlay network is shown in Figure 1. It includes the following main functional modules: Service Routing Entity 1 :
  • the identity of the service routing entity is used to uniquely identify the service routing entity in the service overlay network.
  • the routing code of the service routing entity is used for self-organizing routing based on the coded neighbor relationship.
  • the route coding includes two parts, the former part is the service type code, and the latter part is the node code.
  • the service routing entity's endpoint address is used to establish an underlying physical connection channel with other entities.
  • the service routing entity maintains a service routing table, and the service routing table includes a partial table and a remote table.
  • the neighboring table is composed of a number of neighboring service routing entities that are adjacent to the service routing entity on the route code, including itself and the service routing entity nearest to it; the faraway table is composed of a number of remote service routing entities that are far away from the route code.
  • the service routing table stores the identity, routing code, and endpoint address of these service routing entities.
  • Service routing entities can be assigned business types, which speeds up the self-organizing routing process and optimizes processing for specific business types.
  • Self-organizing management entity 2
  • the service registration entity 3 stores the registration information of the service, including the service address, the endpoint address, and some dynamic information.
  • the service overlay network allocates a service address for routing the service request in the service overlay network.
  • the service address is in the form of Service—ID@SR—ID
  • Service—ID is the identifier of the service
  • SR—ID is the identifier of the home service routing entity of the service.
  • the home service routing entity is allocated by the service overlay network in the service registration process.
  • the source entity of various context information in the business overlay network The service routing method of the service overlay network provided by the embodiment of the present invention is as shown in FIG. 2, and the steps thereof include:
  • the current service routing entity receives the service request, and according to the route code of the home service routing entity of the service, the current service routing entity selects a route code corresponding to the route code that has the closest relationship with the route code from the service routing table.
  • Two service routing entities 5202. If the second service routing entity is not the current service routing entity itself, the current service routing entity forwards the service request to the second service routing entity, and carries the route code of the home service routing entity.
  • the second service routing entity is configured as the current service route.
  • the entity performs step S201 until the second service routing entity selected by the current service routing entity is the current service routing entity itself.
  • the second service routing entity is the current service routing entity itself, the current service routing entity is configured as a nearest neighbor service routing entity, and the nearest neighbor service routing entity obtains service registration information of the service from its corresponding service registration entity, and Based on the endpoint address of the service provider in the service registration information, the nearest neighbor service routing entity sends the service request to the service provider.
  • the current service routing entity receives the service request, and selects the closest relationship from the service routing table according to the routing code of the home service routing entity of the service.
  • the second service routing entity if the second service routing entity is not the current service routing entity itself, the current service routing entity forwards the service request carrying the route code of the home service routing entity to the second service routing entity, the second service The routing entity continues to search for the service routing entity closest to the routing code of the home service routing entity in its own service routing table, and then iteratively iteratively searches until a service routing entity selects a home service route from its own service routing table.
  • the routing code of the entity has the second service routing entity with the closest neighbor relationship, and the service routing entity is the nearest neighbor service routing entity.
  • the nearest neighbor service routing entity obtains service registration information of the service from its corresponding service registration entity, and sends a service request to the service provider according to the service provider's endpoint address in the service registration information to implement service routing. Therefore, in the service routing process, the service routing entity that receives the service request does not need to explicitly know the service provider's home service routing entity, and can perform self-organizing routing based on the route-coded neighbor relationship assigned to the service routing entity to implement the service request.
  • the routing in the service overlay network effectively adapts to the dynamics of the service overlay network.
  • the method for newly joining a service overlay network provided by the embodiment of the present invention is as shown in FIG. 3, and the steps thereof include:
  • the current service routing entity receives the route code of the newly added service routing entity, and selects a next hop service routing entity that has the closest relationship with the route code from the service routing table.
  • the current service routing entity receives the route code of the newly joined service routing entity, it obtains the join guide request from the newly joined service routing entity, and obtains the self-organizing management entity as the new join service route from the self-organizing management entity.
  • the route code is assigned by the entity
  • the current service routing entity is the guiding service routing entity; the newly added service routing entity is the first time to join the service overlay network.
  • the current service routing entity receives the route code of the newly added service routing entity, by receiving the join guide request of the newly joined service routing entity, and obtaining the route code of the newly added service routing entity from the join guide request, the current The service routing entity is also a guiding service routing entity; at this time, the newly added service routing entity is not the first time to join the service overlay network.
  • next hop service routing entity If the next hop service routing entity is not the current service routing entity itself, the current service routing entity sends a service routing table update message to the next hop service routing entity, and carries the route coding code of the newly added service routing entity;
  • the routing code of the service routing entity is closer to the routing code of the current service routing entity than the routing code of the at least one neighbor service routing entity in the service routing table of the current service routing entity, and the current service routing entity updates its own service routing table.
  • the new hop service routing entity is added.
  • the next hop service routing entity is set as the current service routing entity, and step S301 is performed until the next hop service routing entity selected by the current service routing entity is the current service routing entity itself.
  • next hop service routing entity is the current service routing entity itself, the current service routing entity is set as the nearest neighbor service routing entity; the nearest neighbor service routing entity sends its own service routing table to the newly joined service routing entity, and then Update the service routing table of the nearest neighbor service routing entity and join the newly joined service routing entity.
  • the current service routing entity selects a next hop service routing entity that has the closest relationship with the route code from the service routing table according to the route code of the newly joined service routing entity.
  • next hop service routing entity is not the current service routing entity itself, the current service routing entity forwards the route code of the newly added service routing entity to the next hop service routing entity, and the next hop service routing entity continues to In the self-service routing table, the service routing entity that is closest to the routing code of the newly added service routing entity is searched, and then iteratively iteratively searches until a service routing entity selects a new service route from its own service routing table.
  • the routing code of the entity has the next-hop service routing entity with the closest neighbor relationship, and the service routing entity is the nearest neighbor service routing entity. Then, the nearest neighbor service routing entity and the newly joined service routing entity respectively update and set their own service routing table to implement dynamic joining of the service routing entity.
  • the self-organizing route can be performed based on the proximity relationship of the route coding, and the service routing entity receiving the service request does not need to explicitly know the service provider's home service routing entity, thereby effectively adapting to the service.
  • the method for exiting the service overlay network provided by the embodiment of the present invention is as shown in FIG. 4, and the steps thereof include:
  • the exit service routing entity obtains, from the first service registration entity corresponding thereto, all the service registration information stored in the first service registration entity.
  • the exit service routing entity selects a nearest neighbor service routing entity that has the most neighboring route coding relationship from the service routing table, sends a service routing entity leaving request to the nearest neighbor service routing entity, and carries the service registration information.
  • the nearest neighbor service routing entity registers the service registration information to the second service registration entity corresponding to the service.
  • the nearest neighbor service routing entity deletes the exit service route entity from the service routing table, and sends a service routing table update message to the neighbor service routing entity in the service routing table.
  • the exit service routing entity is deleted from the service routing table.
  • the method for exiting the service overlay network provided by the embodiment of the present invention, when the service routing entity exits the service overlay network, the exit service routing entity entrusts all service registration information stored in the service registration entity corresponding thereto to the nearest neighbor route.
  • the nearest neighbor service routing entity of the encoding relationship, and then the nearest neighbor service routing entity updates the service routing table to implement dynamic exit of the exiting service routing entity.
  • the self-organizing route can be performed based on the proximity relationship of the route code, and the service routing entity receiving the service request does not need to explicitly know the service provider's home service routing entity, thereby effectively adapting to the service.
  • the dynamics of overlay networks The service routing method of the service overlay network provided by the embodiment of the present invention assumes that there are currently five service routing entities in the service overlay network. The specific information of these service routing entities is shown in Table 1. For the service type, the service type code of the web application is 604122, the service type code of the video is 538572, and the service type code of the web service is 678942. In this embodiment, because the number of service routing entities is small, only the neighboring table is included in the service routing table. The routing code neighboring relationship is based on the predecessor and successor relationship of the routing code in a circular chain. The neighboring table has three service routing entities, including the service routing entity itself, and the predecessor service routing entity and the successor service routing entity of the service routing entity.
  • Routing entity information table Service routing entity joining process: As shown in Figure 5, hongkongSR is a newly joined service routing entity and requests to join the service overlay network. The specific steps are:
  • hongkongSR is the service routing entity newly added to the service overlay network
  • hongkongSR is the identifier of the service routing entity. Its endpoint address is hongkongSR.abc.com, and its service type is Web monthly service.
  • hongkongSR sends a bootstrap service routing entity allocation request to the self-organizing management entity.
  • the current boot service routing entity list is ⁇ shanghai SR(shanghai SR.abc.com), guangzhouSR(guangzhouSR.abc.co m) ⁇ , wherein the processing load of guangzhouSR is less than shanghaiSR, so the self-organizing management entity selects guangzhouSR as hongkongSR Guide the service routing entity.
  • the self-organizing management entity sends a guiding service routing entity allocation response to hongkongSR, and notifies its selected forwarding service routing entity guangzhouSR of the endpoint address guangzhouSR.abc.com.
  • hongkongSR sends a force-input request to guangzhouSR.
  • the request carries the identifier hongkongSR ⁇ endpoint address hongkongSR.abc.com, and specifies the service type of hongkongSR as a web service.
  • the guangzhouSR performs a related guiding operation, and sends a context request to the context aware entity to request connection performance between the hongkongSR and other service routing entities.
  • the context aware entity returns the requested context information to the guangzhouSR.
  • hongkongSR and shenzhenSR, nanjingSR, shanghaiSR, beijingSR, guangzhouSR network round-trip time is lms, 3ms, 5ms, 2ms, 3ms.
  • S506 and guangzhouSR send a service routing entity join request to the self-organizing management entity, where the request carries the identifier of hongkongSR, the network round-trip time, and indicates that the service type of hongkongSR is a web service.
  • the self-organizing management entity allocates a route code to hongkongSR.
  • the business type of hongkongSR is Web service, and the service type code of Web service is 678942.
  • the service routing entity of the same Web service service type in the service overlay network is beijingSR, guangzhouSR, where beijingSR and hongkongSR have smaller
  • the network round trip time is 2ms.
  • the node code of the beijingSR is 354256723491.
  • the self-organizing management entity assigns hongkongSR a node code that is adjacent to the node code and is not allocated, for example, 454256723491, and the routing code of hongkongSR is 678942454256723491.
  • the self-organizing management entity stores information such as the identity and routing code of hongkongSR. It should be noted that, in this embodiment, the service type of the new service routing entity hongkongSR is specified. If the service type of the new service routing entity is not specified, the self-organizing management entity selects the new service in the service overlay network.
  • the second entity routing entity that meets the specified requirements (for example, the network round-trip time is the shortest), the service type of the second service routing entity is B, the service type code of the route code of the second service routing entity is cb, and the node code is cl.
  • the service type code assigned by the self-organizing management entity to the newly joined service routing entity is cb, and the node code c2 adjacent to the cl and not allocated is allocated, then the service type code of the route code of the newly added service routing entity is cb, the node The code is c2.
  • the self-organizing management entity sends a service routing entity join response to the guangzhouSR, and carries a route code 678942454256723491 allocated for hongkongSR.
  • guangzhouSR sends the initial force-inbound guidance response to hongkongSR, indicating that hongkongSR has successfully joined the service overlay network.
  • the initial join guide response carries the route code 678942454256723491 assigned to hongkongSR.
  • the newly added service routing entity hongkongSR is added to the service overlay network for the first time. If the newly added service routing entity joins the service overlay network again after exiting, it is not the initial join, and the new join service route is added.
  • the entity itself has a route code. In step S503, the route code is sent to the bootstrap service routing entity.
  • the bootstrap service routing entity obtains the route code of the newly added service route entity, it is no longer necessary to request the context from the context aware entity.
  • the information and the routing code are requested from the ad hoc management entity, so S510 is directly executed after step S503 is performed.
  • g LizhouSR's service routing table is ⁇ beijingSR, guangzhouSR, nanjingSR ⁇ , where the routing code of baijingSR is 678942354256723491 and the routing code of hongkongSR is 678942454256723491, then guangzhouSR selects beijingSR as the next hop service routing entity, and sends to beijingSR
  • the service routing table update message is sent, indicating that hongkongSR joins the service overlay network, carrying its identifier hongkongSR, routing code 678942454256723491, and endpoint address hongkongSR.abc.com.
  • hongkongSR's routing code 678942454256723491 is closer to guangzhouSR's routing code 678942677128361745 than beijingSR's routing code 678942677128723745, then hongkongSR becomes guangzhouSR's predecessor service routing entity, and guangzhouSR's service routing table is updated to ⁇ hongkongSR, guangzhouSR, nanjingSR ⁇ .
  • the traffic routing table of S51 1 and beijingSR is ⁇ shanghai SR , beijingSR , guangzhouSR ⁇ , where beijingSR's own routing code 678942354256723491 is closest to the routing code 678942454256723491 of hongkongSR, then it can be determined that beijingSR is the nearest neighbor routing entity of hongkongSR, and beijingSR will itself
  • the service routing table ⁇ shanghaiSR, beijingSR, guangzhouSR ⁇ is sent directly to hongkongSR, and the service routing table update message will no longer be forwarded.
  • hongkongSR's routing code 678942454256723491 is closer to beijingSR's routing code 678942354256723491 than guangzhouSR's routing code 678942677128361745, then hongkongSR becomes beijingSR's successor routing entity, and beijingSR's service routing table is updated to ⁇ shanghaiSR, beijingSR, hongkongSR ⁇ .
  • hongkongSR receives the service routing table of beijingSR ⁇ shanghaiSR, beijingSR, guangzhouSR ⁇ , determines that beijingSR is its predecessor routing entity, and guangzhouSR is its successor routing entity, then set its service routing table to ⁇ beijingSR, hongkongSR, guangzhouSR ⁇ .
  • hongkongSR selects to be the guiding service routing entity, and sends a guiding service routing entity joining request to the self-organizing management entity, where the request carries the hongkongSR endpoint address hongkongSR.abc.com.
  • the newly added service routing entity hongkongSR is added to the service overlay network for the first time, and if the newly added service routing entity is not the initial join and is already the bootstrap service routing entity, the new join service routing entity Sending to the ad hoc management entity is a bootstrap service routing entity update request, and carries the endpoint address of the newly joined service routing entity in the request.
  • the self-organizing management entity adds hongkongSR to the list of guiding service routing entities, and updates the list of guiding service routing entities to ⁇ shanghaiSR ( shanghaiSR.abc.com ) , guangzhouSR ( guangzhouSR.abc.com ) , hongkongSR ( hongkongSR.abc.com ) ⁇ .
  • the ad hoc management entity sends a bootstrap service routing entity join response to hongkongSR.
  • the self-organizing management entity receives the bootstrap service routing entity update request, updates the boot service routing entity list, and sends a guide to the newly joined service routing entity.
  • the service routing entity updates a successful response.
  • the weather forecast service weatherl sends a service registration request to the access service routing entity shanghaiSR, carrying the service identifier weatherl, the service type is Web service, and the endpoint address weatherl.abc.com and other related service registration information.
  • the service routing table of S602 and shanghaiSR is ⁇ shenzhenSR, shanghaiSR, beijingSR ⁇ , and shanghaiSR selects the service routing entity beijingSR which is the same type of Web service service as the home service routing entity of weatherl.
  • the shanghaiSR forwards the service registration request to the beijingSR, carrying the service identification weatherl, the service type Web monthly service, and the endpoint address weatherl.abc.com and other related service registration information.
  • beijingSR is weatherl divided into the business address weatherl @beijingSR, and then the service address and related business registration information is registered to its corresponding business registration entity beijingREG.
  • the beijingREG stores the service registration information, and then notifies the beijingSR service registration success. S605.
  • the beijingSR sends a service registration response to the shanghaiSR, carrying the service address weatherl @beijingSR assigned to the weather pre-service business weatherl.
  • the beijingSR When the beijingSR leaves the service overlay network, it requests all the service registration information stored on the beijingREG to the corresponding service registration entity beijingREG, for example, the service registration information including the weather forecast service weatherl: service identifier weatherl,
  • the service routing table of S703 and beijingSR is ⁇ shanghaiSR , beijingSR , hongkongSR ⁇ , where the routing code of 678 of hongkongSR is 678942454256723491 and the routing code of 678 singer 678942354256723491 is the closest. Therefore, beijingSR sends a service routing entity leaving request to hongkongSR, carrying these service registration information, including The service routing table of Anlagen table of Anlagen table of Anlagen table of BertjingSR ⁇ shanghaiSR , beijingSR , hongkongSR ⁇ .
  • hongkongSR takes over the service registration information, sends a service routing entity to the beijingSR to leave the response, and then theijingSR leaves the service overlay network.
  • hongkongSR registers these business registration information with its corresponding business registration entity hongkongREG, including the business registration information of the weather forecast service weatherl: business identifier weatherl, business address weatherl @beijingSR, business type Web month service, endpoint address weatherl. Abc.com and so on.
  • S706 and hongkongREG store these business registration information, and then notify hongkongSR that the information registration is successful.
  • hongkongSR removes its predecessor service routing entity, beijingSR, from its service routing table ⁇ beijingSR, hongkongSR, guangzhouSR ⁇ , and selects shanghaiSR as the new predecessor routing entity from the business routing table ⁇ shanghaiSR, beijingSR, hongkongSR ⁇ of beijingSR
  • the service routing table is updated to ⁇ shanghaiSR, hongkongSR, guangzhouSR ⁇ , and a service routing table update message is sent to the neighbor service routing entities shanghaiSR and guangzhouSR in the service routing table, indicating that the beijingSR has left the service overlay network and carries the service routing table of the beijingSR.
  • shanghaiSR will take its successor routing entity, beijingSR, from its business path Deleted from the table ⁇ shenzhenSR, shanghaiSR, beijingSR ⁇ , select hongkongSR as the new subsequent service routing entity from the business routing table ⁇ shanghai SR, beijingSR, hongkongSR ⁇ of beijingSR, then the service routing table is updated to ⁇ shenzhenSR, shanghaiSR, hongkongSR ⁇ .
  • the guangzhouSR receives the service routing table update message, and the service routing table ⁇ hongkongSR, guangzhouSR, nanjingSR ⁇ does not include beijingSR, so there is no need to update.
  • Business routing process :
  • the specific steps include:
  • User A sends a weather forecast service request to the access service routing entity nanjingSR to query the weather conditions in Beijing.
  • the service request carries the service address weatherl @beijingSR of the weather forecast service weatherl.
  • the nanjingSR resolves the home service routing entity of the service from the service address weatherl @beijingSR to beijingSR, and requests the routing code of the beijingSR from the self-organizing management entity.
  • the self-organizing management entity queries the routing code of the beijingSR as
  • the service routing table of S804 and nanjingSR is ⁇ guangzhouSR, nanjingSR, shenzhenSR ⁇ , where guangzhouSR's routing code 678942677128361745 is closest to the beijingSR routing code 678942354256723491, then nanjingSR selects guangzhouSR as the second service routing entity, and forwards the weather forecast service request to guangzhouSR. , carrying the logo and routing code of crizo2354256723491.
  • the traffic routing table of S805 and guangzhouSR is ⁇ hongkongSR, guangzhouSR, nanjingSR ⁇ , where hongkongSR's routing code 678942454256723491 is the closest to the beijingSR routing code 678942354256723491, then guangzhouSR selects hongkongSR as the second service routing entity, and forwards the weather to hongkongSR.
  • the forecast service request carries the identification and routing code of crizo2354256723491.
  • the service routing table of S806 and hongkongSR is ⁇ shanghaiSR, hongkongSR, guangzhouSR ⁇ , where hongkongSR's own routing code 678942454256723491 and beijingSR's routing code 678942354256723491 are the closest, you can determine hongkongSR as beijingSR's nearest neighbor routing entity. Therefore, hongkongSR queries the corresponding business registration entity hongkongREG for the business registration information of the service address weatherl @beijingSR.
  • hongkongREG send business address to hongkongSR weatherl @beijingSR business registration information: business identity weatherl, business address weatherl @beijingSR, business type Web month service, endpoint address weatherl .abc.com and so on.
  • the service provider weatherl sends a business response including hong kong weather conditions to hongkongSR. S810.
  • the service response is forwarded along the routing path and finally sent to user A.
  • the service routing method of the service overlay network provided by the embodiment of the present invention has good scalability in the self-organizing mode, and the service routing entity can dynamically join or leave the service overlay network according to the overall load of the network.
  • the current service routing entity selects the next hop service routing entity that has the closest relationship with the route code from the service routing table according to the route code of the newly added service routing entity. If the one-hop service routing entity is not the current service routing entity itself, the current service routing entity forwards the route code of the newly added service routing entity to the next hop service routing entity, and the next hop service routing entity continues to be in its own service routing table.
  • the nearest neighbor service routing entity and the newly joined service routing entity respectively update and set their own service routing table to implement dynamic joining of the service routing entity.
  • the exit service routing entity delegates all service registration information stored in its corresponding service registration entity to the nearest neighbor service routing entity having the closest neighboring route coding relationship, and then, the most The neighboring service routing entity updates the service routing table to implement dynamic exit of the service routing entity.
  • the current service routing entity receives the service request, and selects the second service routing entity having the closest neighbor relationship from the service routing table according to the routing code of the home service routing entity of the service, if the second The service routing entity is not the current service routing entity itself.
  • the current service routing entity forwards the service request carrying the route code of the home service routing entity to the second service routing entity, and the second service routing entity continues to search for the service routing table.
  • the service routing entity closest to the routing code of the home service routing entity so that iteratively iteratively searches until the traffic routing entity has the closest relationship with the routing code of the home service routing entity selected from its own service routing table.
  • the second service routing entity is itself, and the service routing entity is the nearest neighbor service routing entity. Then, the nearest neighbor service routing entity obtains service registration information of the service from its corresponding service registration entity, and sends a service request to the service provider according to the service provider's endpoint address in the service registration information to implement service routing.
  • the service routing entity that receives the service request does not need to explicitly know the service provider's home service routing entity, and may be based on the route allocated for the service routing entity.
  • the coded neighbor relationship performs self-organizing routing to implement routing of service requests in the service overlay network, thereby effectively adapting to the dynamics of the service overlay network.
  • the service overlay network system has a system architecture diagram as shown in FIG. 9, and includes:
  • the service routing entity 1 is configured to receive a service request, and select, according to a routing code of the home service routing entity of the service, a second service routing entity corresponding to the route code having the closest relationship with the route code from the service routing table. If the second service routing entity is not the service routing entity 1 itself, the service routing entity 1 forwards the service request to the second service routing entity.
  • the nearest neighbor service routing entity 11 when the second service routing entity selected by the service routing entity 1 is itself, the service routing entity 1 is set as the nearest neighbor service routing entity 11; and is used to send a service registration information query request to the service registration entity 3 Receiving the service registration information returned by the service registration entity 3; and transmitting the service request to the service provider according to the endpoint address of the service provider in the service registration information.
  • the service registration entity 3 is configured to receive a service registration information query request sent by the nearest neighbor service routing entity 11; and send the service registration information to the nearest neighbor service routing entity 11.
  • system provided in this embodiment further includes: a service requester 5, configured to send a service request to the access service routing entity 12; and receive a service response returned by the access service routing entity 12.
  • the access service routing entity 12 when the service routing entity 1 receives the service request, and receives the service request from the service requester 5, the service routing entity 1 is set as the access service routing entity 12; Sending a request carrying the identity of the home service routing entity; receiving a route code of the home service routing entity returned by the organization management entity 2; according to the route coding, the access service routing entity 12 selects and routes the route code from its own service routing table.
  • the second service routing entity corresponding to the routing code of the nearest neighbor relationship, if the second service routing entity is not the access service routing entity 12 itself, the access service routing entity 12 forwards the service request to the second service routing entity; The service response is forwarded to the service requester 5.
  • the self-organizing management entity 2 is configured to receive a request that is sent by the access service routing entity 12 and that carries the identifier of the home service routing entity, and find a route code of the home service routing entity according to the identifier of the home service routing entity;
  • the access service routing entity 12 sends.
  • the service provider 6 is configured to receive a service request forwarded by the nearest neighbor service routing entity 1; and send a service response to the nearest neighbor service routing entity 11.
  • the current service routing entity receives the service request, and selects the closest neighbor relationship from the service routing table according to the routing code of the home service routing entity of the service.
  • the second service routing entity if the second service routing entity is not the current service routing entity itself, the current service routing entity will carry the route coded service request of the home service routing entity. Forwarding to the second service routing entity, the second service routing entity continues to search for the service routing entity closest to the routing code of the home service routing entity in the service routing table, and then iteratively iteratively searches until a certain service routing entity The second service routing entity having the closest neighbor relationship with the routing code of the home service routing entity selected from its own service routing table is itself, and the service routing entity is the nearest neighbor service routing entity.
  • the nearest neighbor service routing entity obtains service registration information of the service from its corresponding service registration entity, and sends a service request to the service provider according to the service provider's endpoint address in the service registration information to implement service routing. Therefore, in the service routing process, the service routing entity that receives the service request does not need to explicitly know the service provider's home service routing entity, and can perform self-organizing routing based on the route-coded neighbor relationship assigned to the service routing entity to implement the service request.
  • the routing in the service overlay network effectively adapts to the dynamics of the service overlay network. .
  • the service overlay network system provided by another embodiment of the present invention, as shown in FIG. 10, includes:
  • the service routing entity 1 is configured to receive a route code of the newly added service routing entity 13, and select a next hop service routing entity that has the closest relationship with the route code from the service routing table; if the next hop service routing entity is not If the service routing entity 1 itself, the service routing entity 1 sends a service routing table update message to the next hop service routing entity, and carries the route code of the newly added service routing entity 13; The routing code of the at least one neighbor service routing entity in the service routing table of the routing entity 1 is closer to the routing code of the service routing entity 1, and the service routing entity 1 updates its own service routing table and joins the newly joined service routing entity 13.
  • the nearest neighbor service routing entity 14 when the next hop service routing entity selected by the service routing entity 1 is itself, the service routing entity 1 is set to the nearest neighbor service routing entity 14; used to send the service to the newly joined service routing entity 13.
  • the routing table then updates the service routing table of the nearest neighbor service routing entity 14 and joins the newly joined service routing entity 13.
  • the system provided in this embodiment further includes: a new joining service routing entity 13 for sending a guiding service routing entity allocation request to the ad hoc management entity 2; and receiving a guiding service routing entity allocation sent by the self-organizing management entity 2 Response; send a join boot request to the bootstrap service routing entity 15.
  • the self-organizing management entity 2 is configured to receive a guiding service routing entity allocation request sent by the newly joined service routing entity 13; assign a guiding service routing entity to the newly joined service routing entity 13; and send a guiding service routing entity allocation to the newly joined service routing entity 13.
  • the new joining service routing entity 13 is notified to direct the endpoint address of the service routing entity 15; the service routing entity joining request sent by the guiding service routing entity 15 is received; the routing code is assigned to the newly joined service routing entity 13; Send traffic routing entity strength.
  • the service routing entity 15 receives the route code of the newly joined service routing entity 13 received by the service routing entity 1, and obtains the self-organization from the self-organizing management entity 2 by receiving the join guide request of the newly joined service routing entity 13.
  • the service routing entity 1 When the management entity 2 assigns the route code assigned to the newly added service routing entity 13, the service routing entity 1 is set as the bootstrap service routing entity 15; it is used to receive the join guide request sent by the newly joined service routing entity 13; and is sent to the context aware entity 4 Context request; receiving context information sent by the context aware entity 4; sending a service routing entity join request to the ad hoc management entity 2; receiving the service routing entity carrying the route code of the newly joined service routing entity 13 sent by the self-organizing management entity 2 to join the response
  • the bootstrap service routing entity 15 selects a next hop service routing entity having the closest neighbor relationship with the route code from its own service routing table; if the next hop service routing entity is not the bootstrap service routing entity 15 itself, the bootstrap service routing entity 15
  • the next hop service routing entity sends the industry
  • the routing table updates the message and carries the route code of the newly added service routing entity 13; if the route code of the newly added service routing entity 13 is closer to the route code of the at least one neighbor service
  • the context aware entity 4 is configured to receive a context request sent by the bootstrap service routing entity 15; return a context response to the bootstrap service routing entity 15, and notify the guiding service routing entity 15 of the context information of the service overlay network.
  • the service overlay network system provided by the embodiment of the present invention, the current service routing entity selects a next hop service routing entity having the closest relationship with the route code from the service routing table according to the route code of the newly added service routing entity, if If the next hop service routing entity is not the current service routing entity itself, the current service routing entity will join the new service.
  • the routing code of the routing entity is forwarded to the next hop service routing entity, and the next hop service routing entity continues to search for the service routing entity closest to the routing code of the newly joined service routing entity in its own service routing table.
  • a service overlay network system includes:
  • the service routing entity 16 is configured to send a service registration information request to the corresponding first service registration entity 31; receive all service registration information stored in the first service registration entity 31 and sent by the first service registration entity 31; The nearest routing service routing entity 17 having the closest neighboring routing coding relationship is selected in the service routing table, and the service routing entity leaving request is sent to the nearest neighboring service routing entity 17, and the service registration information is carried.
  • the first service registration entity 31 is configured to receive the service registration information request sent by the exit service routing entity 16; and send all the service registration information stored in the first service registration entity 31 to the exit service routing entity 16.
  • the nearest neighbor service routing entity 17 is configured to receive the service routing entity leaving request sent by the exit service routing entity 16; register the service registration information with the second service registration entity 32 corresponding thereto; and delete the exit service from the self service routing table.
  • the routing entity 16 sends a service routing table update message to the neighbor service routing entity 16 in the service routing table.
  • the second service registration entity 32 is configured to receive the service registration information sent by the registered nearest neighbor service routing entity 17, and return the registration response to the nearest neighbor service routing entity 17.
  • the neighbor service routing entity 18 is configured to receive a service routing table update message sent by the nearest neighbor service routing entity 17; if the neighbor service routing entity 18 has a service routing table packet Including the exit service routing entity 16, the neighbor service routing entity 18 deletes the exit service routing entity 16 from its own service routing table.
  • the exit service routing entity entrusts all service registration information stored in its corresponding service registration entity to the nearest neighboring route coding relationship.
  • the nearest neighbor service routing entity updates the service routing table to implement dynamic exit of the exiting service routing entity.
  • the self-organizing route can be performed based on the proximity relationship of the route code, and the service routing entity receiving the service request does not need to explicitly know the service provider's home service routing entity, thereby effectively adapting to the service.
  • the dynamics of overlay networks A person skilled in the art can understand that all or part of the steps of implementing the above method embodiments may be completed by using hardware related to program instructions, and the foregoing program may be stored in a computer readable storage medium, and the program is executed when executed.
  • the foregoing steps include the steps of the foregoing method embodiments; and the foregoing storage medium includes: a medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.

Landscapes

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

Description

一种业务叠加网络的业务路由方法及系统
本申请要求 2010年 06月 09日递交的申请号为 201010200655. 5、 发明名称 为 "一种业务叠加网络的业务路由方法及系统" 的中国专利申请的优先权, 其全部内容通过引用结合在本申请中。 技术领域
本发明涉及通信领域,尤其涉及一种业务叠加网络的业务路由方 法及系统。 背景技术
随着移动通信技术的迅速发展, 未来电信业务必将丰富多样, 呈 现出各种特性和复杂度。数据类业务将取代语音业务成为电信业务的 主流。 业务服务器与第三方应用数量庞大, 业务之间彼此频繁交互和 关联, 形成网状结构。
在产业界, 为适应电信宽带业务的发展趋势, 各大厂商都力推各 自的业务交付平台概念。当前迫切的需要一种技术与框架来规范业务 与业务之间的交互机制, 使业务之间高效地交互, 简化业务的创建和 执行环节, 使业务运营更为便捷。 在现有技术中,基本业务路由一般都是接收业务请求的业务路由 实体将业务请求发送给该业务的归属业务路由实体,再由归属业务路 由实体将业务请求转发至业务提供者, 从而完成业务路由。 在实现上述基本业务路由过程中, 发明人发现: 接收业务请求的 业务路由实体, 必须明确知道业务提供者的归属业务路由实体, 才能 将业务请求路由到业务提供者。 而在自组织的网络组网方式下, 业务 的归属业务路由实体可能会离开业务叠加网络。 如此, 釆用上述现有 业务路由方法,业务请求者的业务请求将会无法正确路由到业务提供 者, 导致业务路由失败。 发明内容 本发明的实施例提供一种业务叠加网络的业务路由方法及系统, 解决了现有技术中接收业务请求的业务路由实体需明确知道业务提 供者的归属业务路由实体,从而无法有效地适应业务叠加网络动态性 的这一问题。
为达到上述目的, 本发明的实施例釆用如下技术方案:
一种业务叠加网络的业务路由方法, 包括:
步骤 A: 当前业务路由实体接收到业务请求, 并根据该业务的归 属业务路由实体的路由编码,所述当前业务路由实体从自身业务路由 表中选择与所述路由编码具有最邻近关系的路由编码所对应的第二 业务路由实体; 若所述第二业务路由实体不是所述当前业务路由实体自身,则所 述当前业务路由实体向所述第二业务路由实体转发所述业务请求,并 携带所述归属业务路由实体的路由编码;所述第二业务路由实体设为 当前业务路由实体, 执行所述步骤 A, 直至所述当前业务路由实体选 择的第二业务路由实体为所述当前业务路由实体自身; 若所述第二业务路由实体是所述当前业务路由实体自身,则所述 当前业务路由实体设为第一最邻近业务路由实体,所述第一最邻近业 务路由实体从其对应的业务注册实体处获得所述业务的业务注册信 息, 并根据所述业务注册信息中业务提供者的端点地址, 所述第一最 邻近业务路由实体将所述业务请求发送到所述业务提供者。 一种新加入业务叠加网络的方法, 包括: 步骤 C: 当前业务路由实体接收到新加入业务路由实体的路由编 码,从自身业务路由表中选择与所述路由编码具有最邻近关系的下一 跳业务路由实体;
若所述下一跳业务路由实体不是所述当前业务路由实体自身,则 所述当前业务路由实体向所述下一跳业务路由实体发送业务路由表 更新消息, 并携带所述新加入业务路由实体的路由编码; 若所述新加 入业务路由实体的路由编码比所述当前业务路由实体的业务路由表 中至少一个邻居业务路由实体的路由编码更邻近所述当前业务路由 实体的路由编码,则所述当前业务路由实体对自身业务路由表进行更 新, 加入所述新加入业务路由实体; 所述下一跳业务路由实体设为当 前业务路由实体, 执行所述步骤 C, 直至所述当前业务路由实体选择 的下一跳业务路由实体为所述当前业务路由实体自身;
若所述下一跳业务路由实体是所述当前业务路由实体自身,则所 述当前业务路由实体设为最邻近业务路由实体;所述最邻近业务路由 实体将自身业务路由表发送给所述新加入业务路由实体,然后更新所 述最邻近业务路由实体自身的业务路由表,加入所述新加入业务路由 实体。
一种退出业务叠加网络的方法, 包括: 退出业务路由实体从它所对应的第一业务注册实体处获得所有 保存在所述第一业务注册实体的业务注册信息; 所述退出业务路由实体从业务路由表中选择与自身具有最邻近 路由编码关系的最邻近业务路由实体,向所述最邻近业务路由实体发 送业务路由实体离开请求, 并携带所述业务注册信息; 所述最邻近业务路由实体将所述业务注册信息注册到它所对应 的第二业务注册实体; 所述最邻近业务路由实体从自身业务路由表中删除所述退出业 务路由实体,向所述业务路由表中的邻居业务路由实体发送业务路由 表更新消息;
所述邻居业务路由实体接收到所述业务路由表更新消息后,若所 述邻居业务路由实体的业务路由表中包括所述退出业务路由实体,则 从所述业务路由表中删除所述退出业务路由实体。 一种业务叠加网络系统, 包括:
业务路由实体, 用于接收业务请求, 并根据该业务的归属业务路 由实体的路由编码,从自身业务路由表中选择与所述路由编码具有最 邻近关系的路由编码所对应的第二业务路由实体,若所述第二业务路 由实体不是所述业务路由实体自身,则所述业务路由实体将所述业务 请求转发给所述第二业务路由实体;
最邻近业务路由实体,当所述业务路由实体选择的第二业务路由 实体是其自身时, 所述业务路由实体设为最邻近业务路由实体; 用于 向业务注册实体发送业务注册信息查询请求;接收所述业务注册实体 返回的业务注册信息;根据所述业务注册信息中业务提供者的端点地 址, 将所述业务请求发送到业务提供者;
业务注册实体,用于接收所述最邻近业务路由实体发送的业务注 册信息查询请求; 向所述最邻近业务路由实体发送业务注册信息。
一种业务叠加网络系统, 包括:
业务路由实体, 用于接收新加入业务路由实体的路由编码, 从自 身业务路由表中选择与所述路由编码具有最邻近关系的下一跳业务 路由实体; 若所述下一跳业务路由实体不是所述业务路由实体自身, 则所述业务路由实体向所述下一跳业务路由实体发送业务路由表更 新消息, 并携带所述新加入业务路由实体的路由编码; 若所述新加入 业务路由实体的路由编码比所述业务路由实体的业务路由表中至少 一个邻居业务路由实体的路由编码更邻近所述业务路由实体的路由 编码, 则所述业务路由实体对自身业务路由表进行更新, 加入所述新 加入业务路由实体;
最邻近业务路由实体,当所述业务路由实体选择的下一跳业务路 由实体是其自身时, 所述业务路由实体设为最邻近业务路由实体; 用 于向所述新加入业务路由实体发送业务路由表,然后更新所述最邻近 业务路由实体自身业务路由表, 加入所述新加入业务路由实体。 一种业务叠加网络系统, 包括: 退出业务路由实体,用于向所对应的第一业务注册实体发送业务 注册信息请求;接收所述第一业务注册实体发送的所有保存在所述第 一业务注册实体的业务注册信息;所述退出业务路由实体从自身业务 路由表中选择与自身具有最邻近路由编码关系的最邻近业务路由实 体, 向所述最邻近业务路由实体发送业务路由实体离开请求, 并携带 所述业务注册信息;
第一业务注册实体,用于接收所述退出业务路由实体发送的业务 注册信息请求;向所述退出业务路由实体发送所有保存在所述第一业 务注册实体的业务注册信息; 最邻近业务路由实体,用于接收所述退出业务路由实体发送的业 务路由实体离开请求;将所述业务注册信息注册到它所对应的第二业 务注册实体;所述最邻近业务路由实体从自身业务路由表中删除所述 退出业务路由实体,向所述业务路由表中的邻居业务路由实体发送业 务路由表更新消息;
第二业务注册实体,用于接收注册所述最邻近业务路由实体发送 的所述业务注册信息; 向所述最邻近业务路由实体返回注册响应; 邻居业务路由实体,用于接收所述最邻近业务路由实体发送的所 述业务路由表更新消息;若所述邻居业务路由实体的业务路由表中包 括所述退出业务路由实体,则所述邻居业务路由实体从自身业务路由 表中删除所述退出业务路由实体。 本发明实施例提供的一种业务叠加网络的业务路由方法及系统, 在自组织方式下, 业务叠加网络具有良好的可扩展性, 根据网络整体 负载量, 业务路由实体可以动态地加入或退出业务叠加网络。
在业务路由实体加入业务叠加网络时,当前业务路由实体根据新 加入业务路由实体的路由编码,从自身业务路由表中选择与该路由编 码具有最邻近关系的下一跳业务路由实体,如果该下一跳业务路由实 体不是当前业务路由实体自身,则当前业务路由实体就将新加入业务 路由实体的路由编码转发给该下一跳业务路由实体,该下一跳业务路 由实体继续在自身业务路由表中寻找与新加入业务路由实体最邻近 的业务路由实体, 如此循环往复迭代查找, 直至某一业务路由实体从 其自身业务路由表中选择的与新加入业务路由实体的路由编码具有 最邻近关系的下一跳业务路由实体是其自身为止,此时该业务路由实 体即为最邻近业务路由实体。 然后, 该最邻近的业务路由实体和新加 入业务路由实体分别更新、 设置自身的业务路由表, 实现业务路由实 体的动态力 0入。
在业务路由实体退出业务叠加网络时,退出业务路由实体将所有 保存在它所对应的业务注册实体的业务注册信息托付给与它具有最 邻近路由编码关系的最邻近业务路由实体, 然后, 该最邻近业务路由 实体更新业务路由表, 实现业务路由实体的动态退出。 在进行业务路由时, 当前业务路由实体接收到业务请求, 根据该 业务的归属业务路由实体的路由编码,从自身业务路由表中选择与其 具有最邻近关系的第二业务路由实体,如果该第二业务路由实体不是 当前业务路由实体自身, 当前业务路由实体就将携带归属业务路由实 体的路由编码的业务请求转发给该第二业务路由实体,该第二业务路 由实体继续在自身业务路由表中寻找与归属业务路由实体的路由编 码最邻近的业务路由实体, 如此循环往复迭代查找, 直至某一业务路 由实体从其自身业务路由表中选择的与归属业务路由实体的路由编 码具有最邻近关系的第二业务路由实体是其自身为止,此时该业务路 由实体即为最邻近业务路由实体。 然后, 该最邻近业务路由实体从其 对应的业务注册实体处获得该业务的业务注册信息,根据业务注册信 息中业务提供者的端点地址, 将业务请求发送到业务提供者, 实现业 务路由。
由此, 本发明实施例提供的业务路由方法及系统, 在业务路由过 程中,接收到业务请求的业务路由实体无需明确知道业务提供者的归 属业务路由实体,可以基于为业务路由实体分配的路由编码的邻近关 系进行自组织路由, 实现业务请求在业务叠加网络中的路由, 从而有 效地适应了业务叠加网络的动态性。 附图说明 为了更清楚地说明本发明实施例或现有技术中的技术方案,下面将对 实施例或现有技术描述中所需要使用的附图作简单地介绍, 显而易见地, 下面描述中的附图仅仅是本发明的一些实施例,对于本领域普通技术人员 来讲, 在不付出创造性劳动的前提下, 还可以根据这些附图获得其他的附 图。
图 1为业务叠加网络的系统架构示意图;
图 2 为本发明实施例提供的业务叠加网络的业务路由方法的流 程框图;
图 3 为本发明实施例提供的新加入业务叠加网络的方法的流程 框图;
图 4 为本发明实施例提供的退出业务叠加网络的方法的流程框 图;
图 5 为本发明实施例提供的新加入业务叠加网络的方法的流程 示意图;
图 6为业务注册过程的流程示意图; 图 7 为本发明实施例提供的退出业务叠加网络的方法的流程示 意图;
图 8 为本发明实施例提供的业务叠加网络的业务路由方法的流 程示意图; 图 9为本发明实施例提供的业务叠加网络的架构示意图一; 图 10 为本发明另一实施例提供的业务叠加网络的架构示意图
图 11 为本发明又一实施例提供的业务叠加网络的架构示意图
具体实施方式 下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进 行清楚、完整地描述,显然,所描述的实施例仅仅是本发明一部分实施例, 而不是全部的实施例。 基于本发明中的实施例, 本领域普通技术人员在没 有做出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的 范围。
业务叠加网络的系统架构如图 1所示, 包括以下主要功能模块: 业务路由实体 1 :
①业务叠加网络中最重要的功能实体, 提供业务交互消息的路由能 力, 参与几乎所有的业务交互, 是业务交互的关键控制点。
②业务路由实体的标识用于在业务叠加网络中唯一标识该业务路由 实体。
③业务路由实体的路由编码用于基于编码的邻近关系进行自组织路 由, 路由编码包括两部分, 前一部分为业务类型码, 后一部分为节点码。
④业务路由实体的端点地址用于与其它实体建立底层物理连接通道。 ⑤业务路由实体维护业务路由表, 业务路由表包含部近表和远离表。 邻近表由若干与该业务路由实体在路由编码上邻近的邻居业务路由实体 组成, 包括其自己以及与其最邻近的业务路由实体; 远离表由若干在路由 编码上远离的远端业务路由实体组成。业务路由表保存这些业务路由实体 的标识, 路由编码, 端点地址。
⑥业务路由实体可以被指定业务类型, 这样能够加快自组织路由过 程, 并针对特定业务类型进行处理优化。
自组织管理实体 2:
①提供业务叠加网络进行自组织的管理和控制能力。其最重要的功能 是为业务路由实体分配路由编码, 处理业务路由实体加入业务叠加网络。 路由编码是自组织业务路由的重要依据。
②基于上下文信息选择进行加入引导的引导业务路由实体。
③保存业务叠加网络中业务路由实体的标识, 路由编码等信息, 对引 导业务路由实体, 还保存其端点地址, 对外提供这些信息的查询。 业务注册实体 3:
①业务注册实体 3保存业务的注册信息, 包括业务地址, 端点地址, 以及一些动态的信息。 其中, 针对业务地址: 业务在注册过程中, 业务叠加网络为其分配业 务地址, 用于对业务请求在业务叠加网络中进行路由。 业务地址形式为 Service— ID@SR— ID, Service— ID为业务的标识, SR— ID为业务的归属业务 路由实体的标识。 归属业务路由实体由业务叠加网络在业务注册过程中分 配。
上下文感知实体 4:
①业务叠加网络中各类上下文信息的来源实体。 本发明实施例提供的业务叠加网络的业务路由方法, 如图 2所示, 其 步骤包括:
S201、 当前业务路由实体接收到业务请求, 并根据该业务的归属业务 路由实体的路由编码, 当前业务路由实体从自身业务路由表中选择与该路 由编码具有最邻近关系的路由编码所对应的第二业务路由实体。 5202、 若第二业务路由实体不是当前业务路由实体自身, 则当前业务 路由实体向第二业务路由实体转发业务请求,并携带归属业务路由实体的 路由编码; 第二业务路由实体设为当前业务路由实体, 执行步骤 S201 , 直至当前业务路由实体选择的第二业务路由实体为该当前业务路由实体 自身。
5203、 若第二业务路由实体是当前业务路由实体自身, 则当前业务路 由实体设为最邻近业务路由实体,该最邻近业务路由实体从其对应的业务 注册实体处获得业务的业务注册信息, 并根据业务注册信息中业务提供者 的端点地址, 最邻近业务路由实体将业务请求发送到业务提供者。 本发明实施例提供的业务路由方法, 在进行业务路由时, 当前业 务路由实体接收到业务请求,根据该业务的归属业务路由实体的路由 编码,从自身业务路由表中选择与其具有最邻近关系的第二业务路由 实体, 如果该第二业务路由实体不是当前业务路由实体自身, 当前业 务路由实体就将携带归属业务路由实体的路由编码的业务请求转发 给该第二业务路由实体,该第二业务路由实体继续在自身业务路由表 中寻找与归属业务路由实体的路由编码最邻近的业务路由实体,如此 循环往复迭代查找,直至某一业务路由实体从其自身业务路由表中选 择的与归属业务路由实体的路由编码具有最邻近关系的第二业务路 由实体是其自身为止, 此时该业务路由实体即为最邻近业务路由实 体。 然后, 该最邻近业务路由实体从其对应的业务注册实体处获得该 业务的业务注册信息, 根据业务注册信息中业务提供者的端点地址, 将业务请求发送到业务提供者, 实现业务路由。 由此, 在业务路由过 程中,接收到业务请求的业务路由实体无需明确知道业务提供者的归 属业务路由实体,可以基于为业务路由实体分配的路由编码的邻近关 系进行自组织路由, 实现业务请求在业务叠加网络中的路由, 从而有 效地适应了业务叠加网络的动态性。 本发明实施例提供的新加入业务叠加网络的方法, 如图 3所示, 其步 骤包括:
S301、 当前业务路由实体接收到新加入业务路由实体的路由编 码,从自身业务路由表中选择与该路由编码具有最邻近关系的下一跳 业务路由实体。 在此,若当前业务路由实体接收到新加入业务路由实体的路由编 码, 是通过接收新加入业务路由实体的加入引导请求, 从自组织管理 实体处获取到该自组织管理实体为新加入业务路由实体分配的路由 编码时, 该当前业务路由实体为引导业务路由实体; 新加入业务路由 实体为初次加入本业务叠加网络。
或者,若当前业务路由实体接收到新加入业务路由实体的路由编 码, 是通过接收新加入业务路由实体的加入引导请求, 从该加入引导 请求中得到新加入业务路由实体的路由编码时,该当前业务路由实体 也为引导业务路由实体;此时新加入业务路由实体为非初次加入本业 务叠加网络。
5302、 若该下一跳业务路由实体不是当前业务路由实体自身, 则 当前业务路由实体向该下一跳业务路由实体发送业务路由表更新消 息, 并携带新加入业务路由实体的路由编码; 若新加入业务路由实体 的路由编码比当前业务路由实体的业务路由表中至少一个邻居业务 路由实体的路由编码更邻近该当前业务路由实体的路由编码,则当前 业务路由实体对自身业务路由表进行更新, 加入新加入业务路由实 体; 该下一跳业务路由实体设为当前业务路由实体, 执行步骤 S301 , 直至当前业务路由实体选择的下一跳业务路由实体为当前业务路由 实体自身。
5303、 若该下一跳业务路由实体是当前业务路由实体自身, 则当 前业务路由实体设为最邻近业务路由实体;该最邻近业务路由实体将 自身业务路由表发送给新加入业务路由实体,然后更新该最邻近业务 路由实体自身的业务路由表, 加入新加入业务路由实体。 本发明实施例提供的新加入业务叠加网络的方法, 当前业务路由实 体根据新加入业务路由实体的路由编码,从自身业务路由表中选择与 该路由编码具有最邻近关系的下一跳业务路由实体,如果该下一跳业 务路由实体不是当前业务路由实体自身,则当前业务路由实体就将新 加入业务路由实体的路由编码转发给该下一跳业务路由实体,该下一 跳业务路由实体继续在自身业务路由表中寻找与新加入业务路由实 体的路由编码最邻近的业务路由实体, 如此循环往复迭代查找, 直至 某一业务路由实体从其自身业务路由表中选择的与新加入业务路由 实体的路由编码具有最邻近关系的下一跳业务路由实体是其自身为 止, 此时该业务路由实体即为最邻近业务路由实体。 然后, 该最邻近 的业务路由实体和新加入业务路由实体分别更新、设置自身的业务路 由表, 实现业务路由实体的动态加入。 针对这样的动态加入, 在业务 路由过程中, 可以基于路由编码的邻近关系进行自组织路由, 接收到 业务请求的业务路由实体无需明确知道业务提供者的归属业务路由 实体, 从而有效地适应了业务叠加网络的动态性。 本发明实施例提供的退出业务叠加网络的方法, 如图 4所示, 其 步骤包括:
S401、退出业务路由实体从它所对应的第一业务注册实体处获得 所有保存在所述第一业务注册实体的业务注册信息。
S402、退出业务路由实体从业务路由表中选择与自身具有最邻近 路由编码关系的最邻近业务路由实体,向该最邻近业务路由实体发送 业务路由实体离开请求, 并携带该业务注册信息。
S403、最邻近业务路由实体将业务注册信息注册到它所对应的第 二业务注册实体。
5404、最邻近业务路由实体从自身业务路由表中删除退出业务路 由实体,向业务路由表中的邻居业务路由实体发送业务路由表更新消 息。
5405、邻居业务路由实体接收到业务路由表更新消息后, 若邻居 业务路由实体的业务路由表中包括该退出业务路由实体,则从业务路 由表中删除该退出业务路由实体。 本发明实施例提供的退出业务叠加网络的方法,在业务路由实体 退出业务叠加网络时,退出业务路由实体将所有保存在它所对应的业 务注册实体的业务注册信息托付给与它具有最邻近路由编码关系的 最邻近业务路由实体,然后,该最邻近业务路由实体更新业务路由表, 实现退出业务路由实体的动态退出。 针对这样的动态退出, 在业务路 由过程中, 可以基于路由编码的邻近关系进行自组织路由, 接收到业 务请求的业务路由实体无需明确知道业务提供者的归属业务路由实 体, 从而有效地适应了业务叠加网络的动态性。 本发明实施例提供的业务叠加网络的业务路由方法, 假设业务叠 加网络中当前具有 5个业务路由实体,这些业务路由实体的具体信息 如表 1所示。 对于业务类型, Web应用的业务类型码为 604122 , 视 频的业务类型码为 538572 , Web服务的业务类型码为 678942。 在本 实施例中,因为业务路由实体数量较少,业务路由表中只包括邻近表。 而路由编码的邻近关系依据将路由编码按照环形链式排列的前趋和 后继关系。 邻近表有 3个业务路由实体, 包括该业务路由实体本身, 以及该业务路由实体的前趋业务路由实体和后继业务路由实体。
Figure imgf000014_0001
表 1、 路由实体信息表 业务路由实体加入过程: 如图 5所示, hongkongSR为新加入业务路由实体, 请求加入业 务叠加网络。 具体步骤为:
S501、 hongkongSR 为新加入业务叠加网络的业务路由实体, hongkongSR 为 该 业务路 由 实 体的 标识 , 其端 点地址为 hongkongSR.abc.com, 其业务类型为 Web月良务。 hongkongSR向自组 织管理实体发送引导业务路由实体分配请求。
S502 、 当 前 引 导 业 务 路 由 实 体 列 表 为 { shanghai SR(shanghai SR.abc.com),guangzhouSR(guangzhouSR.abc.co m)} , 其中 guangzhouSR的处理负荷小于 shanghaiSR, 因此自组织管 理实体选择 guangzhouSR作为 hongkongSR的引导业务路由实体。 自 组织管理实体向 hongkongSR发送引导业务路由实体分配响应, 通知 它 所选择的 引 导业务路由 实体 guangzhouSR 的端点地址 guangzhouSR.abc.com。
5503、 根据 guangzhouSR 的端点地址 guangzhouSR.abc.com , hongkongSR向 guangzhouSR发送力口入引导请求, 请求中携带其标识 hongkongSR ^ 端点地址 hongkongSR.abc.com, 并指定 hongkongSR的 业务类型为 Web服务。
5504、 guangzhouSR执行相关引导操作, 向上下文感知实体发送 上下文请求, 请求 hongkongSR与其它业务路由实体的连接性能。
S505、 上下文感知实体向 guangzhouSR返回所请求的上下文信 息。 例如: hongkongSR 与 shenzhenSR , nanjingSR , shanghaiSR , beijingSR, guangzhouSR的网络往返时间为 lms , 3ms , 5ms , 2ms , 3ms。
S506、 guangzhouSR向自组织管理实体发送业务路由实体加入请 求, 该请求中携带 hongkongSR的标识, 上述网络往返时间, 并指明 hongkongSR的业务类型为 Web服务。
S507、 自 组织管理实体为 hongkongSR 分配路由编码。 hongkongSR 的业务类型为 Web 服务, Web 服务的业务类型码为 678942。 业务叠加网络中同为 Web服务业务类型的业务路由实体为 beijingSR, guangzhouSR, 其中 beijingSR与 hongkongSR具有更小的 网络往返时间 2ms。 beijingSR的节点码为 354256723491。 则自组织 管理实体给 hongkongSR分配与该节点码邻近且未被分配的节点码 , 例 如 454256723491 , 则 hongkongSR 的 路 由 编 码 为 678942454256723491。 自组织管理实体存储 hongkongSR的标识、 路 由编码等信息。 在此需要说明的是, 本实施例中指定了新加入业务路由实体 hongkongSR 的业务类型, 如果未指定新加入业务路由实体的业务类 型,则自组织管理实体选择在业务叠加网络内与新加入业务路由实体 满足规定要求(例如网络往返时间最短)的第二业务路由实体, 第二 业务路由实体的业务类型为 B , 第二业务路由实体的路由编码的业务 类型码为 cb , 节点码为 cl , 则自组织管理实体为新加入业务路由实 体分配的业务类型码为 cb , 分配与 cl邻近且未被分配的节点码 c2 , 那么, 新加入业务路由实体的路由编码的业务类型码为 cb , 节点码 为 c2。 S508、 自组织管理实体向 guangzhouSR发送业务路由实体加入 响应, 并携带为 hongkongSR分配的路由编码 678942454256723491。
5509、 guangzhouSR向 hongkongSR发送初次力口入引导响应, 指 示 hongkongSR成功加入业务叠加网络。 该初次加入引导响应中携带 为 hongkongSR所分配的路由编码 678942454256723491。 在此需要说明的是, 本实施例中新加入业务路由实体 hongkongSR 为初次加入业务叠加网络, 如果新加入业务路由实体为 退出之后再次加入业务叠加网络, 则为非初次加入, 该新加入业务路 由实体自身存有路由编码, 在步骤 S503 中, 会将该路由编码发给引 导业务路由实体,由于引导业务路由实体得到了新加入业务路由实体 的路由编码,所以不再需要向上下文感知实体请求上下文信息和向自 组织管理实体请求路由编码, 因此在执行完步骤 S503 后直接执行 S510。
5510、 g丽 gzhouSR的业务路由表为 { beijingSR, guangzhouSR, nanjingSR} , 其中 beijingSR 的路由编码 678942354256723491 与 hongkongSR 的 路 由 编码 678942454256723491 最邻 近 , 则 guangzhouSR选择 beijingSR为下一跳业务路由实体, 向 beijingSR发 送业务路由表更新消息, 指示 hongkongSR加入业务叠加网络, 携带 其标识 hongkongSR、 路由编码 678942454256723491、 端点地址 hongkongSR.abc.com。 对 于 guangzhouSR 而 言 , hongkongSR 的 路 由 编 码 678942454256723491 比 beijingSR的路由编码 678942354256723491 更邻近 guangzhouSR 自身的路由编码 678942677128361745, 则 hongkongSR成为 guangzhouSR 的前趋业务路由实体, guangzhouSR 的业务路由表更新为 {hongkongSR, guangzhouSR, nanjingSR}。
S51 1 、 beijingSR 的业务路由表为 { shanghai SR , beijingSR , guangzhouSR} , 其中 beijingSR自己的路由编码 678942354256723491 与 hongkongSR的路由编码 678942454256723491 最邻近, 则可以确 定 beijingSR为 hongkongSR的最邻近业务路由实体, beijingSR将自 己的业务路由表 {shanghaiSR , beijingSR, guangzhouSR}直接发送给 hongkongSR, 而业务路由表更新消息将不再被转发。 beijingSR进行 业务路由表更新, hongkongSR 的路由编码 678942454256723491 比 guangzhouSR的路由编码 678942677128361745更邻近 beijingSR的路 由编码 678942354256723491 , 则 hongkongSR成为 beijingSR的后继 业务路由实体, beijingSR 的业务路由表更新为 {shanghaiSR , beijingSR, hongkongSR}。 S512、 hongkongSR接收到 beijingSR的业务路由表 {shanghaiSR, beijingSR, guangzhouSR} , 确定 beijingSR为其前趋业务路由实体, guangzhouSR 为其后继业务路由实体, 则设置其业务路由表为 {beijingSR, hongkongSR , guangzhouSR}。
S513、 hongkongSR选择成为引导业务路由实体, 向自组织管理 实体发送引导业务路由实体加入请求, 请求中携带 hongkongSR的端 点地址 hongkongSR.abc.com。 在此需要说明的是, 在本实施例中, 新加入业务路由实体 hongkongSR 为初次加入业务叠加网络, 如果新加入业务路由实体为 非初次加入并且已经是引导业务路由实体,则新加入业务路由实体向 自组织管理实体发送的是引导业务路由实体更新请求,并在该请求中 携带新加入业务路由实体的端点地址。 S514、 自组织管理实体将 hongkongSR加入到引导业务路由实体 列 表 , 引 导 业 务 路 由 实 体 列 表 更 新 为 {shanghaiSR ( shanghaiSR.abc.com ) , guangzhouSR ( guangzhouSR.abc.com ) , hongkongSR( hongkongSR.abc.com )}。自组织管理实体向 hongkongSR 发送引导业务路由实体加入响应。
同样,如果新加入业务路由实体为非初次加入并且已经是引导业 务路由实体, 则自组织管理实体收到引导业务路由实体更新请求后, 更新引导业务路由实体列表,向新加入业务路由实体发送引导业务路 由实体更新成功响应。
业务注册过程: 如图 6所示, 具体步骤包括:
S601、 天气预报业务 weatherl 向接入业务路由实体 shanghaiSR 发出业务注册请求, 携带业务标识 weatherl , 业务类型为 Web服务, 端点地址 weatherl .abc.com等相关业务注册信息。 S602、 shanghaiSR 的业务路由表为 {shenzhenSR, shanghaiSR, beijingSR} , shanghaiSR从中选择同为 Web服务业务类型的业务路 由实体 beijingSR作为 weatherl的归属业务路由实体。 shanghaiSR向 beijingSR转发业务注册请求,携带业务标识 weatherl ,业务类型 Web 月良务, 端点地址 weatherl .abc.com等相关业务注册信息。
S603、 beijingSR为 weatherl分西己业务地址 weatherl @beijingSR, 然后将该业务地址与相关业务注册信息注册到它所对应的业务注册 实体 beijingREG。
S604、 beijingREG存储这些业务注册信息, 然后通知 beijingSR 业务注册成功。 S605、 beijingSR向 shanghaiSR发送业务注册响应, 携带为天气 预才艮业务 weatherl所分配的业务地址 weatherl @beijingSR。
S606、 shanghaiSR向天气预^艮业务 weatherl 转发该业务注册响
业务路由实体退出过程: 如图 7所示,假设 beijingSR离开业务叠加网络, 具体步骤包括:
S701、 当 beijingSR离开业务叠加网络时, 它向对应的业务注册 实体 beijingREG请求所有保存在 beijingREG上的业务注册信息, 例 如包括天气预报业务 weatherl的业务注册信息: 业务标识 weatherl ,
, 业务类型 Web 服务, 端点地址
Figure imgf000019_0001
S702、 beijingREG发送这些业务注册信息给 beijingSR。
S703、 beijingSR 的业务路由表为 {shanghaiSR , beijingSR , hongkongSR} , 其中 hongkongSR的路由编码 678942454256723491与 beijingSR的路由编码 678942354256723491 最邻近, 因此 beijingSR 向 hongkongSR发出业务路由实体离开请求,携带这些业务注册信息, 还 包括 beijingSR 的 业 务路 由 表 {shanghaiSR , beijingSR , hongkongSR}。
5704、 hongkongSR接管这些业务注册信息, 向 beijingSR发送业 务路由实体离开响应, 随后 beijingSR离开业务叠加网络。
5705、 hongkongSR将这些业务注册信息注册到它所对应的业务 注册实体 hongkongREG, 包括天气预报业务 weatherl 的业务注册信 息: 业务标识 weatherl , 业务地址 weatherl @beijingSR, 业务类型 Web月良务, 端点地址 weatherl .abc.com等。 S706 、 hongkongREG 存储这些业务注册信息, 然后通知 hongkongSR信息注册成功。
S707 , hongkongSR将其前趋业务路由实体 beijingSR从其业务路 由表 {beijingSR , hongkongSR , guangzhouSR}中删除, 从 beijingSR 的业务路由表 {shanghaiSR , beijingSR , hongkongSR} 中 选择 shanghaiSR 为新的前趋业务路由实体, 则业务路由表更新为 {shanghaiSR, hongkongSR, guangzhouSR} , 向其业务路由表中邻居 业务路由实体 shanghaiSR和 guangzhouSR发送业务路由表更新消息, 指示 beijingSR已经离开业务叠加网络,并携带 beijingSR的业务路由 表 {shanghaiSR, beijingSR, hongkongSR}。 S708、 shanghaiSR将其后继业务路由实体 beijingSR从其业务路 由表 {shenzhenSR, shanghaiSR, beijingSR}中删除, 从 beijingSR 的 业务路由表 {shanghai SR, beijingSR, hongkongSR}中选择 hongkongSR 为新的后续业务路由实体, 则业务路由表更新为 {shenzhenSR , shanghaiSR, hongkongSR}。 而 guangzhouSR接收到业务路由表更新 消息, 其业务路由表 {hongkongSR, guangzhouSR, nanjingSR}中不包 括 beijingSR, 因此无需更新。 业务路由过程:
如图 8所示, 具体步骤包括:
S801、用户 A向接入业务路由实体 nanjingSR发送天气预报业务 请求, 查询北京的天气情况, 业务请求中携带天气预报业务 weatherl 的业务地址 weatherl @beijingSR。
S802、 nanjingSR从业务地址 weatherl @beijingSR中解析出业务 的归属业务路由实体为 beijingSR, 向自组织管理实体请求 beijingSR 的路由编码。 S803、 自 组织管理实体查询 beijingSR 的路由编码为
678942354256723491 , 向 nanjingSR 返 回 该 路 由 编 码 678942354256723491。
S804、 nanjingSR 的业务路由表为 {guangzhouSR , nanjingSR , shenzhenSR} , 其中 guangzhouSR 的路由编码 678942677128361745 与 beijingSR的路由编码 678942354256723491最邻近, 则 nanjingSR 选择 guangzhouSR为第二业务路由实体, 向 guangzhouSR转发该天 气预报业 务请求 , 携 带 beijingSR 的 标识 和路 由 编码 678942354256723491。
S805、 guangzhouSR的业务路由表为 {hongkongSR, guangzhouSR, nanjingSR} , 其中 hongkongSR 的路由编码 678942454256723491 与 beijingSR的路由编码 678942354256723491最 4|5近, 则 guangzhouSR 选择 hongkongSR为第二业务路由实体, 向 hongkongSR转发该天气 预 报 业 务 请 求 , 携 带 beijingSR 的 标 识 和 路 由 编 码 678942354256723491。 S806、 hongkongSR的业务路由表为 {shanghaiSR, hongkongSR, guangzhouSR} , 其 中 hongkongSR 自 己 的 路 由 编 码 678942454256723491 与 beijingSR的路由编码 678942354256723491 最邻近, 则可以确定 hongkongSR为 beijingSR的最邻近业务路由实 体。 因此 hongkongSR向它对应的业务注册实体 hongkongREG查询 业务地址 weatherl @beijingSR的业务注册信息。
S807 、 hongkongREG 向 hongkongSR 发 送 业 务 地 址 weatherl @beijingSR的业务注册信息: 业务标识 weatherl、 业务地址 weatherl @beijingSR、业务类型 Web月良务、端点地址 weatherl .abc.com 等。
S808、根据天气预报业务 weatherl的端点地址 weatherl .abc.com, hongkongSR向业务提供者 weatherl发送天气预报业务请求, 查询北 京的天气情况。
S809、业务提供者 weatherl向 hongkongSR发送包括北京的天气 情况的业务响应。 S810、 该业务响应沿路由路径反向转发, 最终被发送到用户 A。 本发明实施例提供的业务叠加网络的业务路由方法,在自组织方 式下, 业务叠加网络具有良好的可扩展性, 根据网络整体负载量, 业 务路由实体可以动态地加入或退出业务叠加网络。
在业务路由实体加入业务叠加网络时,当前业务路由实体根据新 加入业务路由实体的路由编码,从自身业务路由表中选择与该路由编 码具有最邻近关系的下一跳业务路由实体,如果该下一跳业务路由实 体不是当前业务路由实体自身,则当前业务路由实体就将新加入业务 路由实体的路由编码转发给该下一跳业务路由实体,该下一跳业务路 由实体继续在自身业务路由表中寻找与新加入业务路由实体的路由 编码最邻近的业务路由实体, 如此循环往复迭代查找, 直至某一业务 路由实体从其自身业务路由表中选择的与新加入业务路由实体的路 由编码具有最邻近关系的下一跳业务路由实体是其自身为止,此时该 业务路由实体即为最邻近业务路由实体。 然后, 该最邻近的业务路由 实体和新加入业务路由实体分别更新、设置自身的业务路由表, 实现 业务路由实体的动态加入。 在业务路由实体退出业务叠加网络时,退出业务路由实体将所有 保存在它所对应的业务注册实体的业务注册信息托付给与它具有最 邻近路由编码关系的最邻近业务路由实体, 然后, 该最邻近业务路由 实体更新业务路由表, 实现业务路由实体的动态退出。 在进行业务路由时, 当前业务路由实体接收到业务请求, 根据该 业务的归属业务路由实体的路由编码,从自身业务路由表中选择与其 具有最邻近关系的第二业务路由实体,如果该第二业务路由实体不是 当前业务路由实体自身, 当前业务路由实体就将携带归属业务路由实 体的路由编码的业务请求转发给该第二业务路由实体,该第二业务路 由实体继续在自身业务路由表中寻找与归属业务路由实体的路由编 码最邻近的业务路由实体, 如此循环往复迭代查找, 直至某一业务路 由实体从其自身业务路由表中选择的与归属业务路由实体的路由编 码具有最邻近关系的第二业务路由实体是其自身为止,此时该业务路 由实体即为最邻近业务路由实体。 然后, 该最邻近的业务路由实体从 其对应的业务注册实体处获得该业务的业务注册信息,根据业务注册 信息中业务提供者的端点地址, 将业务请求发送到业务提供者, 实现 业务路由。
由此, 本发明实施例提供的业务路由方法及系统, 在业务路由过 程中,接收到业务请求的业务路由实体无需明确知道业务提供者的归 属业务路由实体,可以基于为业务路由实体分配的路由编码的邻近关 系进行自组织路由, 实现业务请求在业务叠加网络中的路由, 从而有 效地适应了业务叠加网络的动态性。
此外, 通过为业务路由实体指定业务类型, 可以加快自组织路由 过程中的路由收敛, 减少路由跳数。 本发明实施例提供的业务叠加网络系统, 其系统架构图如图 9 所示, 包括:
业务路由实体 1 , 用于接收业务请求, 并根据该业务的归属业务 路由实体的路由编码,从自身业务路由表中选择与该路由编码具有最 邻近关系的路由编码所对应的第二业务路由实体,若第二业务路由实 体不是业务路由实体 1 自身,则业务路由实体 1将该业务请求转发给 第二业务路由实体。 最邻近业务路由实体 11 , 当业务路由实体 1 选择的第二业务路 由实体是其自身时, 业务路由实体 1 设为最邻近业务路由实体 11 ; 用于向业务注册实体 3发送业务注册信息查询请求;接收业务注册实 体 3返回的业务注册信息;根据该业务注册信息中业务提供者的端点 地址, 将业务请求发送到业务提供者。 业务注册实体 3 , 用于接收最邻近业务路由实体 11 发送的业务 注册信息查询请求; 向最邻近业务路由实体 11发送业务注册信息。
进一步地, 本实施例提供的系统中, 还包括: 业务请求者 5 , 用于向接入业务路由实体 12发送业务请求; 接 收接入业务路由实体 12返回的业务响应。
接入业务路由实体 12 , 当业务路由实体 1接收业务请求, 是从 业务请求者 5处接收业务请求时,该业务路由实体 1设为接入业务路 由实体 12; 用于向自组织管理实体 2发送携带有归属业务路由实体 的标识的请求;接收自组织管理实体 2返回的归属业务路由实体的路 由编码; 根据该路由编码, 接入业务路由实体 12从自身业务路由表 中选择与该路由编码具有最邻近关系的路由编码所对应的第二业务 路由实体, 若第二业务路由实体不是接入业务路由实体 12 自身, 则 接入业务路由实体 12将该业务请求转发给第二业务路由实体; 向业 务请求者 5转发业务响应。
自组织管理实体 2 , 用于接收接入业务路由实体 12发送的携带 有归属业务路由实体的标识的请求;根据归属业务路由实体的标识查 找该归属业务路由实体的路由编码;将该路由编码向接入业务路由实 体 12发送。 业务提供者 6 , 用于接收最邻近业务路由实体 1 1 转发的业务请 求; 向最邻近业务路由实体 11发送业务响应。 本发明实施例提供的业务叠加网络系统, 在进行业务路由时, 当 前业务路由实体接收到业务请求,根据该业务的归属业务路由实体的 路由编码,从自身业务路由表中选择与其具有最邻近关系的第二业务 路由实体, 如果该第二业务路由实体不是当前业务路由实体自身, 当 前业务路由实体就将携带归属业务路由实体的路由编码的业务请求 转发给该第二业务路由实体,该第二业务路由实体继续在自身业务路 由表中寻找与归属业务路由实体的路由编码最邻近的业务路由实体, 如此循环往复迭代查找,直至某一业务路由实体从其自身业务路由表 中选择的与归属业务路由实体的路由编码具有最邻近关系的第二业 务路由实体是其自身为止,此时该业务路由实体即为最邻近业务路由 实体。 然后, 该最邻近的业务路由实体从其对应的业务注册实体处获 得该业务的业务注册信息,根据业务注册信息中业务提供者的端点地 址, 将业务请求发送到业务提供者, 实现业务路由。 由此, 在业务路 由过程中,接收到业务请求的业务路由实体无需明确知道业务提供者 的归属业务路由实体,可以基于为业务路由实体分配的路由编码的邻 近关系进行自组织路由, 实现业务请求在业务叠加网络中的路由, 从 而有效地适应了业务叠加网络的动态性。 。 本发明另一实施例提供的业务叠加网络系统, 如图 10所示, 包 括:
业务路由实体 1 , 用于接收新加入业务路由实体 13的路由编码, 从自身业务路由表中选择与该路由编码具有最邻近关系的下一跳业 务路由实体; 若该下一跳业务路由实体不是业务路由实体 1 自身, 则 该业务路由实体 1向下一跳业务路由实体发送业务路由表更新消息, 并携带新加入业务路由实体 13 的路由编码; 若新加入业务路由实体 13 的路由编码比业务路由实体 1 的业务路由表中至少一个邻居业务 路由实体的路由编码更邻近该业务路由实体 1的路由编码,则业务路 由实体 1对自身业务路由表进行更新, 加入新加入业务路由实体 13。 最邻近业务路由实体 14 , 当业务路由实体 1 选择的下一跳业务 路由实体是其自身时, 该业务路由实体 1 设为最邻近业务路由实体 14; 用于向新加入业务路由实体 13发送业务路由表, 然后更新最邻 近业务路由实体 14 自身的业务路由表,加入新加入业务路由实体 13。 进一步地, 本实施例提供的系统中, 还包括: 新加入业务路由实体 13 , 用于向自组织管理实体 2发送引导业 务路由实体分配请求;接收自组织管理实体 2发送的引导业务路由实 体分配响应; 向引导业务路由实体 15发送加入引导请求。 自组织管理实体 2 , 用于接收新加入业务路由实体 13发送的引 导业务路由实体分配请求; 为新加入业务路由实体 13分配引导业务 路由实体; 向新加入业务路由实体 13发送引导业务路由实体分配响 应,以通知新加入业务路由实体 13引导业务路由实体 15的端点地址; 接收引导业务路由实体 15发送的业务路由实体加入请求; 为新加入 业务路由实体 13分配路由编码;向引导业务路由实体 15发送业务路 由实体力。入响应。 引导业务路由实体 15 , 当业务路由实体 1接收到的新加入业务 路由实体 13的路由编码,是通过接收新加入业务路由实体 13的加入 引导请求,从自组织管理实体 2处获取到该自组织管理实体 2为新加 入业务路由实体 13分配的路由编码时, 该业务路由实体 1设为引导 业务路由实体 15 ; 用于接收新加入业务路由实体 13发送的加入引导 请求; 向上下文感知实体 4发送上下文请求; 接收上下文感知实体 4 发送的上下文信息; 向自组织管理实体 2 发送业务路由实体加入请 求; 接收自组织管理实体 2发送的携带有新加入业务路由实体 13路 由编码的业务路由实体加入响应; 引导业务路由实体 15从自身业务 路由表中选择与该路由编码具有最邻近关系的下一跳业务路由实体; 若下一跳业务路由实体不是引导业务路由实体 15 自身, 则引导业务 路由实体 15向下一跳业务路由实体发送业务路由表更新消息, 并携 带新加入业务路由实体 13的路由编码;若新加入业务路由实体 13的 路由编码比引导业务路由实体 15的业务路由表中至少一个邻居业务 路由实体的路由编码更邻近引导业务路由实体 15的路由编码, 则引 导业务路由实体 15对自身业务路由表进行更新, 加入新加入业务路 由实体 13。
上下文感知实体 4 , 用于接收引导业务路由实体 15发送的上下 文请求; 向引导业务路由实体 15返回上下文响应, 通知引导业务路 由实体 15本业务叠加网络的上下文信息。 本发明实施例提供的业务叠加网络系统, 当前业务路由实体根据 新加入业务路由实体的路由编码,从自身业务路由表中选择与该路由 编码具有最邻近关系的下一跳业务路由实体,如果该下一跳业务路由 实体不是当前业务路由实体自身,则当前业务路由实体就将新加入业 务路由实体的路由编码转发给该下一跳业务路由实体,该下一跳业务 路由实体继续在自身业务路由表中寻找与新加入业务路由实体的路 由编码最邻近的业务路由实体, 如此循环往复迭代查找, 直至某一业 务路由实体从其自身业务路由表中选择的与新加入业务路由实体的 路由编码具有最邻近关系的下一跳业务路由实体是其自身为止,此时 该业务路由实体即为最邻近业务路由实体。 然后, 该最邻近的业务路 由实体和新加入业务路由实体分别更新、 设置自身的业务路由表, 实 现业务路由实体的动态加入。 针对这样的动态加入, 在业务路由过程 中, 可以基于路由编码的邻近关系进行自组织路由, 接收到业务请求 的业务路由实体无需明确知道业务提供者的归属业务路由实体,从而 有效地适应了业务叠加网络的动态性。 本发明又一实施例提供的业务叠加网络系统, 如图 1 1所示, 包 括:
退出业务路由实体 16 , 用于向所对应的第一业务注册实体 31发 送业务注册信息请求; 接收第一业务注册实体 31发送的所有保存在 所述第一业务注册实体 31 的业务注册信息; 从业务路由表中选择与 自身具有最邻近路由编码关系的最邻近业务路由实体 17 , 向最邻近 业务路由实体 17发送业务路由实体离开请求, 并携带该业务注册信 息。
第一业务注册实体 31 , 用于接收退出业务路由实体 16发送的业 务注册信息请求; 向退出业务路由实体 16发送所有保存在所述第一 业务注册实体 31的业务注册信息。
最邻近业务路由实体 17 , 用于接收退出业务路由实体 16发送的 业务路由实体离开请求;将业务注册信息注册到它所对应的第二业务 注册实体 32; 从自身业务路由表中删除该退出业务路由实体 16 , 向 业务路由表中的邻居业务路由实体 16发送业务路由表更新消息。
第二业务注册实体 32 , 用于接收注册最邻近业务路由实体 17发 送的业务注册信息, 向最邻近业务路由实体 17返回注册响应。 邻居业务路由实体 18 , 用于接收最邻近业务路由实体 17发送的 业务路由表更新消息; 若该邻居业务路由实体 18的业务路由表中包 括退出业务路由实体 16 , 则邻居业务路由实体 18从自身业务路由表 中删除该退出业务路由实体 16。 本发明实施例提供的业务叠加网络系统,在业务路由实体退出业 务叠加网络时,退出业务路由实体将所有保存在它所对应的业务注册 实体的业务注册信息托付给与它具有最邻近路由编码关系的最邻近 业务路由实体, 然后, 该最邻近业务路由实体更新业务路由表, 实现 退出业务路由实体的动态退出。 针对这样的动态退出, 在业务路由过 程中, 可以基于路由编码的邻近关系进行自组织路由, 接收到业务请 求的业务路由实体无需明确知道业务提供者的归属业务路由实体,从 而有效地适应了业务叠加网络的动态性。 本领域普通技术人员可以理解: 实现上述方法实施例的全部或部分步 骤可以通过程序指令相关的硬件来完成, 前述的程序可以存储于一计算机 可读取存储介质中, 该程序在执行时, 执行包括上述方法实施例的步骤; 而前述的存储介质包括: ROM、 RAM, 磁碟或者光盘等各种可以存储程 序代码的介质。
以上所述, 仅为本发明的具体实施方式, 但本发明的保护范围并 不局限于此,任何熟悉本技术领域的技术人员在本发明揭露的技术范 围内, 可轻易想到变化或替换, 都应涵盖在本发明的保护范围之内。 因此, 本发明的保护范围应所述以权利要求的保护范围为准。

Claims

权利要求书
1、 一种业务叠加网络的业务路由方法, 其特征在于, 包括: 步骤 A: 当前业务路由实体接收到业务请求, 并根据该业务的归 属业务路由实体的路由编码,所述当前业务路由实体从自身业务路由 表中选择与所述路由编码具有最邻近关系的路由编码所对应的第二 业务路由实体;
若所述第二业务路由实体不是所述当前业务路由实体自身,则所 述当前业务路由实体向所述第二业务路由实体转发所述业务请求,并 携带所述归属业务路由实体的路由编码;所述第二业务路由实体设为 当前业务路由实体, 执行所述步骤 A, 直至所述当前业务路由实体选 择的第二业务路由实体为所述当前业务路由实体自身;
若所述第二业务路由实体是所述当前业务路由实体自身,则所述 当前业务路由实体设为第一最邻近业务路由实体,所述第一最邻近业 务路由实体从其对应的业务注册实体处获得所述业务的业务注册信 息, 并根据所述业务注册信息中业务提供者的端点地址, 所述第一最 邻近业务路由实体将所述业务请求发送到所述业务提供者。
2、 根据权利要求 1所述的方法, 其特征在于, 在所述第一最邻 近业务路由实体将所述业务请求发送到所述业务提供者之后,所述方 法还包括:
所述业务提供者向所述第一最邻近业务路由实体发送业务响应; 所述业务响应经由所述第一最邻近业务路由实体转发,并最终转 发到业务请求者。
3、 根据权利要求 1所述的方法, 其特征在于,
所述业务请求中携带有业务地址, 所述业务地址包括业务的标 识、 归属业务路由实体的标识。
4、 根据权利要求 3所述的方法, 其特征在于,
若所述当前业务路由实体接收到业务请求,是从业务请求者处接 收到业务请求, 则所述当前业务路由实体设为接入业务路由实体; 所 述接入业务路由实体接收到所述业务请求后,从所述业务请求携带的 所述业务地址中解析出所述归属业务路由实体的标识,将所述归属业 务路由实体的标识发送给自组织管理实体,以从所述自组织管理实体 处获取所述归属业务路由实体的路由编码。
5、 根据权利要求 4所述的方法, 其特征在于, 所述业务请求者 选择与所请求业务具有相同业务类型的业务路由实体为接入业务路 由实体。
6、 根据权利要求 1所述的方法, 其特征在于, 所述路由编码包 括业务类型码和节点码。
7、 根据权利要求 6所述的方法, 其特征在于, 在所述步骤 A中, 所述当前业务路由实体从自身业务路由表中选择业务类型码与所述 归属业务路由实体的业务类型码相同,节点码与所述归属业务路由实 体的节点码最邻近的业务路由实体为所述第二业务路由实体。
8、 根据权利要求 1所述的方法, 其特征在于, 在所述当前业务 路由实体接收到业务请求之前, 所述方法还包括:
步骤 B: 中间业务路由实体接收到新加入业务路由实体的路由编 码,从自身业务路由表中选择与所述路由编码具有最邻近关系的下一 跳业务路由实体;
若所述下一跳业务路由实体不是所述中间业务路由实体自身,则 所述中间业务路由实体向所述下一跳业务路由实体发送业务路由表 更新消息, 并携带所述新加入业务路由实体的路由编码; 若所述新加 入业务路由实体的路由编码比所述中间业务路由实体的业务路由表 中至少一个邻居业务路由实体的路由编码更邻近所述中间业务路由 实体的路由编码,则所述中间业务路由实体对自身业务路由表进行更 新, 加入所述新加入业务路由实体; 所述下一跳业务路由实体设为中 间业务路由实体, 执行所述步骤 B , 直至所述中间业务路由实体选择 的下一跳业务路由实体为所述中间业务路由实体自身;
若所述下一跳业务路由实体是所述中间业务路由实体自身,则所 述中间业务路由实体设为第二最邻近业务路由实体,所述第二最邻近 业务路由实体将自身业务路由表发送给所述新加入业务路由实体,然 后更新所述第二最邻近业务路由实体自身的业务路由表,加入所述新 加入业务路由实体。
9、 根据权利要求 1所述的方法, 其特征在于, 在所述当前业务 路由实体接收到业务请求之前, 所述方法还包括:
退出业务路由实体从它所对应的第一业务注册实体处获得所有 保存在所述第一业务注册实体的业务注册信息; 所述退出业务路由实体从业务路由表中选择与自身具有最邻近 路由编码关系的第三最邻近业务路由实体,向所述第三最邻近业务路 由实体发送业务路由实体离开请求, 并携带所述业务注册信息; 所述第三最邻近业务路由实体将所述业务注册信息注册到它所 对应的第二业务注册实体;
所述第三最邻近业务路由实体从自身业务路由表中删除所述退 出业务路由实体,向所述业务路由表中的邻居业务路由实体发送业务 路由表更新消息;
所述邻居业务路由实体接收到所述业务路由表更新消息后,若所 述邻居业务路由实体的业务路由表中包括所述退出业务路由实体,则 从所述业务路由表中删除所述退出业务路由实体。
10、 一种新加入业务叠加网络的方法, 其特征在于, 包括: 步骤 C: 当前业务路由实体接收到新加入业务路由实体的路由编 码,从自身业务路由表中选择与所述路由编码具有最邻近关系的下一 跳业务路由实体;
若所述下一跳业务路由实体不是所述当前业务路由实体自身,则 所述当前业务路由实体向所述下一跳业务路由实体发送业务路由表 更新消息, 并携带所述新加入业务路由实体的路由编码; 若所述新加 入业务路由实体的路由编码比所述当前业务路由实体的业务路由表 中至少一个邻居业务路由实体的路由编码更邻近所述当前业务路由 实体的路由编码,则所述当前业务路由实体对自身业务路由表进行更 新, 加入所述新加入业务路由实体; 所述下一跳业务路由实体设为当 前业务路由实体, 执行所述步骤 C, 直至所述当前业务路由实体选择 的下一跳业务路由实体为所述当前业务路由实体自身;
若所述下一跳业务路由实体是所述当前业务路由实体自身,则所 述当前业务路由实体设为最邻近业务路由实体;所述最邻近业务路由 实体将自身业务路由表发送给所述新加入业务路由实体,然后更新所 述最邻近业务路由实体自身的业务路由表,加入所述新加入业务路由 实体。
11、 根据权利要求 10所述的方法, 其特征在于,
若所述当前业务路由实体接收到新加入业务路由实体的路由编 码, 是通过接收所述新加入业务路由实体的加入引导请求, 从自组织 管理实体处获取到所述自组织管理实体为所述新加入业务路由实体 分配的路由编码时, 则所述当前业务路由实体设为引导业务路由实 体; 所述新力口入业务路由实体为初次加入本业务叠加网。
12、 根据权利要求 10所述的方法, 其特征在于,
若所述当前业务路由实体接收到新加入业务路由实体的路由编 码, 是通过接收所述新加入业务路由实体的加入引导请求, 从所述引 导请求中得到所述新加入业务路由实体的路由编码时,则所述当前业 务路由实体设为引导业务路由实体;所述新加入业务路由实体为非初 次加入本业务叠加网。
13、 根据权利要求 11或 12所述的方法, 其特征在于, 所述引导 业务路由实体接收新加入业务路由实体发送的加入引导请求之前,所 述方法还包括:
所述新加入业务路由实体向自组织管理实体发送引导业务路由 实体分配请求;
所述自组织管理实体接收到所述引导业务路由实体分配请求后, 为所述新加入业务路由实体分配引导业务路由实体,并向所述新加入 业务路由实体返回引导业务路由实体分配响应,通知所述新加入业务 路由实体所述引导业务路由实体的端点地址。
14、 根据权利要求 11或 12所述的方法, 其特征在于, 所述加入 引导请求包括: 所述新加入业务路由实体的标识, 或进一步包括所述 新加入业务路由实体的业务类型。
15、 根据权利要求 11所述的方法, 其特征在于,
所述引导业务路由实体接收所述新加入业务路由实体的加入引 导请求,从自组织管理实体处获取到所述自组织管理实体为所述新加 入业务路由实体分配的路由编码, 包括:
所述引导业务路由实体接收所述新加入业务路由实体发送的加 入引导请求;
所述引导业务路由实体向上下文感知实体请求上下文信息; 所述上下文感知实体向所述引导业务路由实体返回所请求的上 下文信息;
所述引导业务路由实体接收到所述上下文感知实体发送的所述 上下文信息后, 向所述自组织管理实体发送业务路由实体加入请求, 并携带所述新加入业务路由实体的标识、 所述上下文信息, 或进一步 包括所述新加入业务路由实体的业务类型;
所述自组织管理实体为所述新加入业务路由实体分配路由编码, 所述路由编码包括: 业务类型码和节点码;
所述自组织管理实体向所述引导业务路由实体发送业务路由实 体加入响应, 并携带所述路由编码。
16、 根据权利要求 15所述的方法, 其特征在于, 所述自组织管 理实体为所述新加入业务路由实体分配路由编码, 包括:
若指定了所述新加入业务路由实体的业务类型,其业务类型码为 ca, 则在本业务叠加网络内具有相同业务类型的业务路由实体中, 所 述自组织管理实体选择与所述新加入业务路由实体满足规定要求的 第二业务路由实体, 所述第二业务路由实体的路由编码的节点码为 cl , 则给所述新加入业务路由实体分配与 cl 邻近且未被分配的节点 码 c2 , 所述新加入业务路由实体的路由编码的业务类型码为 ca, 节 点码为 c2 ; 若所述业务叠加网络中无相同业务类型的业务路由实体, 则所述自组织管理实体随机分配节点码 c , 所述新加入业务路由实体 的路由编码的业务类型码为 ca, 节点码为 c;
若未指定所述新加入业务路由实体的业务类型,则所述自组织管 理实体选择在所述业务叠加网络内与所述新加入业务路由实体满足 规定要求的第二业务路由实体,所述第二业务路由实体的业务类型为 B , 所述第二业务路由实体的路由编码的业务类型码为 cb , 节点码为 cl , 则为所述新加入业务路由实体分配的业务类型码为 cb , 分配与所 述 cl邻近且未被分配的节点码 c2 , 所述新加入业务路由实体的路由 编码的业务类型码为 cb , 节点码为 c2。
17、 根据权利要求 15所述的方法, 其特征在于,
所述引导业务路由实体接收到所述自组织管理实体发送的携带 有所述路由编码的所述业务路由实体加入响应后,向所述新加入业务 路由实体发送携带有所述路由编码的初次加入引导响应,指示所述新 加入业务路由实体加入所述业务叠加网络。
18、 根据权利要求 1 1所述的方法, 其特征在于, 所述方法还包 括:
所述新加入业务路由实体接收到所述最邻近业务路由实体发送 的业务路由表后, 设置所述新加入业务路由实体自身的业务路由表; 所述新加入业务路由实体向所述自组织管理实体发送引导业务 路由实体加入请求;
所述自组织管理实体向所述新加入业务路由实体返回引导业务 路由实体加入响应。
19、 根据权利要求 12所述的方法, 其特征在于, 所述方法还包 括:
所述新加入业务路由实体接收到所述最邻近业务路由实体发送 的业务路由表后, 设置所述新加入业务路由实体自身的业务路由表; 所述新加入业务路由实体向所述自组织管理实体发送引导业务 路由实体更新请求;
所述自组织管理实体向所述新加入业务路由实体返回引导业务 路由实体更新响应。
20、 一种退出业务叠加网络的方法, 其特征在于, 包括: 退出业务路由实体从它所对应的第一业务注册实体处获得所有 保存在所述第一业务注册实体的业务注册信息;
所述退出业务路由实体从业务路由表中选择与自身具有最邻近 路由编码关系的最邻近业务路由实体,向所述最邻近业务路由实体发 送业务路由实体离开请求, 并携带所述业务注册信息;
所述最邻近业务路由实体将所述业务注册信息注册到它所对应 的第二业务注册实体;
所述最邻近业务路由实体从自身业务路由表中删除所述退出业 务路由实体,向所述业务路由表中的邻居业务路由实体发送业务路由 表更新消息;
所述邻居业务路由实体接收到所述业务路由表更新消息后,若所 述邻居业务路由实体的业务路由表中包括所述退出业务路由实体,则 从所述业务路由表中删除所述退出业务路由实体。
21、 一种业务叠加网络系统, 其特征在于, 包括:
业务路由实体, 用于接收业务请求, 并根据该业务的归属业务路 由实体的路由编码,从自身业务路由表中选择与所述路由编码具有最 邻近关系的路由编码所对应的第二业务路由实体,若所述第二业务路 由实体不是所述业务路由实体自身,则所述业务路由实体将所述业务 请求转发给所述第二业务路由实体;
最邻近业务路由实体,当所述业务路由实体选择的第二业务路由 实体是其自身时, 所述业务路由实体设为最邻近业务路由实体; 用于 向业务注册实体发送业务注册信息查询请求;接收所述业务注册实体 返回的业务注册信息;根据所述业务注册信息中业务提供者的端点地 址, 将所述业务请求发送到业务提供者;
业务注册实体,用于接收所述最邻近业务路由实体发送的业务注 册信息查询请求; 向所述最邻近业务路由实体发送业务注册信息。
22、 根据权利要求 21所述的业务叠加网络系统, 其特征在于, 所述系统还包括:
业务请求者, 用于向接入业务路由实体发送业务请求; 接收所述 接入业务路由实体返回的业务响应;
接入业务路由实体, 当所述业务路由实体接收业务请求, 是从所 述业务请求者处接收业务请求时,所述业务路由实体设为接入业务路 由实体;用于向自组织管理实体发送携带有归属业务路由实体的标识 的请求;接收所述自组织管理实体返回的所述归属业务路由实体的路 由编码; 根据所述路由编码, 所述接入业务路由实体从自身业务路由 表中选择与所述路由编码具有最邻近关系的路由编码所对应的第二 业务路由实体,若所述第二业务路由实体不是所述接入业务路由实体 自身,则所述接入业务路由实体将所述业务请求转发给所述第二业务 路由实体; 向所述业务请求者转发业务响应;
自组织管理实体,用于接收所述接入业务路由实体发送的携带有 归属业务路由实体的标识的请求;根据所述归属业务路由实体的标识 查找所述归属业务路由实体的路由编码;将所述路由编码向所述接入 业务路由实体发送;
业务提供者, 用于接收所述最邻近业务路由实体转发的业务请 求; 向所述最邻近业务路由实体发送业务响应。
23、 一种业务叠加网络系统, 其特征在于, 包括:
业务路由实体, 用于接收新加入业务路由实体的路由编码, 从自 身业务路由表中选择与所述路由编码具有最邻近关系的下一跳业务 路由实体; 若所述下一跳业务路由实体不是所述业务路由实体自身, 则所述业务路由实体向所述下一跳业务路由实体发送业务路由表更 新消息, 并携带所述新加入业务路由实体的路由编码; 若所述新加入 业务路由实体的路由编码比所述业务路由实体的业务路由表中至少 一个邻居业务路由实体的路由编码更邻近所述业务路由实体的路由 编码, 则所述业务路由实体对自身业务路由表进行更新, 加入所述新 加入业务路由实体;
最邻近业务路由实体,当所述业务路由实体选择的下一跳业务路 由实体是其自身时, 所述业务路由实体设为最邻近业务路由实体; 用 于向所述新加入业务路由实体发送业务路由表,然后更新所述最邻近 业务路由实体自身的业务路由表, 加入所述新加入业务路由实体。
24、 根据权利要求 23所述的业务叠加网络系统, 其特征在于, 所述系统还包括:
新加入业务路由实体,用于向自组织管理实体发送引导业务路由 实体分配请求;接收所述自组织管理实体发送的引导业务路由实体分 配响应; 向引导业务路由实体发送加入引导请求;
自组织管理实体,用于接收所述新加入业务路由实体发送的引导 业务路由实体分配请求;为所述新加入业务路由实体分配引导业务路 由实体; 向所述新加入业务路由实体发送引导业务路由实体分配响 应,以通知所述新加入业务路由实体所述引导业务路由实体的端点地 址; 接收引导业务路由实体发送的业务路由实体加入请求; 为所述新 加入业务路由实体分配路由编码;向所述引导业务路由实体发送业务 路由实体加入响应;
引导业务路由实体,当所述业务路由实体接收到的新加入业务路 由实体的路由编码,是通过接收所述新加入业务路由实体的加入引导 请求,从所述自组织管理实体处获取到所述自组织管理实体为所述新 加入业务路由实体分配的路由编码时,所述业务路由实体设为引导业 务路由实体; 用于接收所述新加入业务路由实体发送的加入引导请 求; 向上下文感知实体发送上下文请求; 接收所述上下文感知实体发 送的上下文信息; 向所述自组织管理实体发送业务路由实体加入请 求;接收所述自组织管理实体发送的携带有所述新加入业务路由实体 路由编码的业务路由实体加入响应;所述引导业务路由实体从自身业 务路由表中选择与所述路由编码具有最邻近关系的下一跳业务路由 实体; 若所述下一跳业务路由实体不是所述引导业务路由实体自身, 则所述引导业务路由实体向所述下一跳业务路由实体发送业务路由 表更新消息, 并携带所述新加入业务路由实体的路由编码; 若所述新 加入业务路由实体的路由编码比所述引导业务路由实体的业务路由 表中至少一个邻居业务路由实体的路由编码更邻近所述引导业务路 由实体的路由编码,则所述引导业务路由实体对自身业务路由表进行 更新, 加入所述新加入业务路由实体;
上下文感知实体,用于接收所述引导业务路由实体发送的上下文 请求; 向所述引导业务路由实体返回上下文响应, 通知所述引导业务 路由实体本业务叠加网络的上下文信息。
25、 一种业务叠加网络系统, 其特征在于, 包括:
退出业务路由实体,用于向所对应的第一业务注册实体发送业务 注册信息请求;接收所述第一业务注册实体发送的所有保存在所述第 一业务注册实体的业务注册信息;所述退出业务路由实体从自身业务 路由表中选择与自身具有最邻近路由编码关系的最邻近业务路由实 体, 向所述最邻近业务路由实体发送业务路由实体离开请求, 并携带 所述业务注册信息;
第一业务注册实体,用于接收所述退出业务路由实体发送的业务 注册信息请求;向所述退出业务路由实体发送所有保存在所述第一业 务注册实体的业务注册信息;
最邻近业务路由实体,用于接收所述退出业务路由实体发送的业 务路由实体离开请求;将所述业务注册信息注册到它所对应的第二业 务注册实体;所述最邻近业务路由实体从自身业务路由表中删除所述 退出业务路由实体,向所述业务路由表中的邻居业务路由实体发送业 务路由表更新消息;
第二业务注册实体,用于接收注册所述最邻近业务路由实体发送 的所述业务注册信息; 向所述最邻近业务路由实体返回注册响应; 邻居业务路由实体,用于接收所述最邻近业务路由实体发送的所 述业务路由表更新消息;若所述邻居业务路由实体的业务路由表中包 括所述退出业务路由实体,则所述邻居业务路由实体从自身业务路由 表中删除所述退出业务路由实体。
PCT/CN2011/074936 2010-06-09 2011-05-31 一种业务叠加网络的业务路由方法及系统 WO2011153909A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP11791900.1A EP2582098B1 (en) 2010-06-09 2011-05-31 Service routing method and system in service overlay network
US13/708,809 US8780883B2 (en) 2010-06-09 2012-12-07 Service routing method and system on service overlay network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010200655.5A CN102136990B (zh) 2010-06-09 2010-06-09 一种业务叠加网络的业务路由方法及系统
CN201010200655.5 2010-06-09

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US13/708,809 Continuation US8780883B2 (en) 2010-06-09 2012-12-07 Service routing method and system on service overlay network

Publications (1)

Publication Number Publication Date
WO2011153909A1 true WO2011153909A1 (zh) 2011-12-15

Family

ID=44296650

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/074936 WO2011153909A1 (zh) 2010-06-09 2011-05-31 一种业务叠加网络的业务路由方法及系统

Country Status (4)

Country Link
US (1) US8780883B2 (zh)
EP (1) EP2582098B1 (zh)
CN (1) CN102136990B (zh)
WO (1) WO2011153909A1 (zh)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9078144B2 (en) 2012-05-02 2015-07-07 Nokia Solutions And Networks Oy Signature enabler for multi-vendor SON coordination
CN104079482B (zh) * 2013-03-26 2017-06-27 华为技术有限公司 一种选择路由路径的方法及装置
WO2014186963A1 (zh) * 2013-05-23 2014-11-27 华为技术有限公司 业务路由系统、设备和方法
CN104243302B (zh) 2013-06-20 2018-03-16 华为技术有限公司 业务路由报文处理方法、装置及网络系统
CN104254129B (zh) * 2013-06-25 2019-01-25 中兴通讯股份有限公司 临近业务发现的资源配置方法及装置
CN104954413B (zh) * 2014-03-31 2018-07-13 阿里巴巴集团控股有限公司 提供互联网应用服务的方法、系统、用户端设备及服务端
CN110324165B (zh) * 2018-03-30 2021-05-11 华为技术有限公司 网络设备的管理方法、装置及系统
CN109474665B (zh) * 2018-09-30 2021-08-06 咪咕文化科技有限公司 一种信息处理方法、装置和计算机存储介质
CN112165431B (zh) * 2020-06-09 2022-04-12 上海金融期货信息技术有限公司 一种低延时微服务路由管理系统

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080075084A1 (en) * 2006-09-21 2008-03-27 Hyo-Hyun Choi Selecting routing protocol in network
CN101179501A (zh) * 2007-12-12 2008-05-14 北京航空航天大学 一种移动ad hoc网络按需类路由的局部路由发现方法
CN101409905A (zh) * 2007-10-08 2009-04-15 北京邮电大学 一种基于任播方式的移动多跳分组无线网络路由方法

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7246148B1 (en) * 1995-09-29 2007-07-17 Cisco Technology, Inc. Enhanced network services using a subnetwork of communicating processors
US8204082B2 (en) * 2000-06-23 2012-06-19 Cloudshield Technologies, Inc. Transparent provisioning of services over a network
WO2002087172A1 (en) 2001-04-20 2002-10-31 Motorola, Inc. Protocol and structure for self-organizing network
GB0317372D0 (en) * 2003-07-25 2003-08-27 Royal Holloway University Of L Routing protocol for ad hoc networks
CN1331331C (zh) * 2004-04-27 2007-08-08 国家数字交换系统工程技术研究中心 自组织网络的实现方法
CN101686173A (zh) 2008-09-27 2010-03-31 华为技术有限公司 一种业务协商方法、系统和设备

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080075084A1 (en) * 2006-09-21 2008-03-27 Hyo-Hyun Choi Selecting routing protocol in network
CN101409905A (zh) * 2007-10-08 2009-04-15 北京邮电大学 一种基于任播方式的移动多跳分组无线网络路由方法
CN101179501A (zh) * 2007-12-12 2008-05-14 北京航空航天大学 一种移动ad hoc网络按需类路由的局部路由发现方法

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
CN102136990A (zh) 2011-07-27
EP2582098B1 (en) 2015-09-09
CN102136990B (zh) 2013-11-06
EP2582098A4 (en) 2013-06-12
US20130094504A1 (en) 2013-04-18
EP2582098A1 (en) 2013-04-17
US8780883B2 (en) 2014-07-15

Similar Documents

Publication Publication Date Title
WO2011153909A1 (zh) 一种业务叠加网络的业务路由方法及系统
US10284466B2 (en) Service processing method, device, and system
EP2541848B1 (en) Service routing method and service network
JP4078079B2 (ja) モバイルネットワーク内で一定のサービス品質でルート確立する方法
KR101560601B1 (ko) Stun을 사용하여 생성된 세션의 정책 서비스 시스템 아키텍처
CN105340244A (zh) 基于来自暂态准则的上下文的动态内容分发网络选择
Santhi et al. A survey of QoS routing protocols for mobile ad hoc networks
EP1925123A1 (en) Controlled temporary mobile network
EP3249864A1 (en) Routing state and/or policy information processing method and apparatus
WO2010139115A1 (zh) 多个汇聚节点共同处理移动组播源组播业务的方法及装置
TW201116099A (en) Methods and apparatus for forming, maintaining and/or using overlapping networks
Wang et al. Anycast-based content-centric MANET
WO2023155669A1 (zh) 用户平面功能的选择方法及设备
US20130073741A1 (en) Ospf nsr with delayed neighbor synchronization
WO2014183657A1 (zh) 一种确定下一跳、发布路由信息的方法和装置
US20080130664A1 (en) Method and apparatus for establishing multipath in heterogeneous interface environment
CN110881006B (zh) 发送报文的方法、网络设备及计算机存储介质
Narayana Rao et al. Way-point multicast routing framework for improving QoS in hybrid wireless mesh networks
Azgin et al. On-demand mobility support with anchor chains in Information Centric Networks
WO2011026355A1 (zh) 节点接入家乡代理的方法、家乡代理集群系统及业务路由器
WO2009012703A1 (fr) Procédé, système et routeur de transmission basés sur le protocole de routage inter-domaine (bgp)
CN115426308B (zh) 一种多标识网络下的链路状态路由方法
Bellaj et al. On-demand Geographic Forwarding for producer mobility support in Named Data Networking
KR101556031B1 (ko) 네트워크 상에 제어 기능이 분산된 이동성 지원 방법 및 시스템
KR100939526B1 (ko) 애드혹 네트워크를 위한 효율적인 sip 등록방법 및 이를 위한 게이트웨이 노드

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: 11791900

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: 2011791900

Country of ref document: EP