CN116319505A - Route distribution method and device - Google Patents
Route distribution method and device Download PDFInfo
- Publication number
- CN116319505A CN116319505A CN202310152454.XA CN202310152454A CN116319505A CN 116319505 A CN116319505 A CN 116319505A CN 202310152454 A CN202310152454 A CN 202310152454A CN 116319505 A CN116319505 A CN 116319505A
- Authority
- CN
- China
- Prior art keywords
- service
- data storage
- storage system
- registration
- resource
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000013500 data storage Methods 0.000 claims abstract description 63
- 230000004083 survival effect Effects 0.000 claims abstract description 33
- 230000004044 response Effects 0.000 abstract description 6
- 230000005540 biological transmission Effects 0.000 abstract description 3
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000002452 interceptive effect Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention relates to a route distribution method and a device, wherein the method comprises the following steps: receiving, by a first data storage system, a first registration for each of a plurality of services; receiving, by the second data storage system, a second registration for each of the plurality of services; according to a call request of a first service, sending a survival list of a second service to the first service through a first data storage system, wherein the second service is the service requested to be called in the call request; and according to the query request of the first service, sending an address with the lowest occupied service resource in the survival list of the second service to the first service through the second data storage system so that the first service can be routed according to the address. The technical scheme provided by the embodiment of the invention provides the on-demand routing method for the deterministic network aiming at the differentiated and deterministic network transmission requirements of the application, and the routing strategy can be generated according to the deterministic requirements of the application flow so as to meet the timely response requirements of the deterministic network application.
Description
Technical Field
The embodiment of the invention relates to the technical field of computer databases, in particular to a route distribution method and device.
Background
With the development of micro-service technology, more and more enterprises split the functions of one software into a plurality of independent services, and call the corresponding functions through a specific protocol. To cope with the high concurrent access pressure, each service is deployed on one or more servers, and thus high demands for network quality and quality of service are also accompanied.
The prior art aims at the problem that in the application flow distribution, the pressure imbalance of each service leads to the prolongation of the response time of a certain service, and the service paralysis is caused when the service response time is serious. In the prior art, a service is registered in a registry, service related information is stored in the registry, when the service requests to call other services, the registry is firstly requested, the registry can randomly return one service, and the pressure condition of a node where the service is located is opaque to the registry, so that when the returned service is called in a high concurrency environment, the pressure of calling the returned service is high, and even the service is not available.
Disclosure of Invention
Based on the above situation in the prior art, an object of an embodiment of the present invention is to provide a routing distribution method and apparatus, which can generate a routing policy according to a deterministic demand of service application traffic, so as to meet a timely response demand of deterministic network applications.
To achieve the above object, according to a first aspect of the present invention, there is provided a route distribution method comprising:
receiving, by a first data storage system, a first registration for each of a plurality of services;
receiving, by the second data storage system, a second registration for each of the plurality of services;
according to a call request of a first service, sending a survival list of a second service to the first service through a first data storage system, wherein the second service is the service requested to be called in the call request;
and according to the query request of the first service, sending an address with the lowest occupied service resource in the survival list of the second service to the first service through the second data storage system so that the first service can be routed according to the address.
Further, the first registration is stored in a key-value manner, including the system IP and service name of the service.
Further, the first data storage system configures a survival time of the key for each service according to the first registration; each service performing the first registration is leased continuously by the heartbeat mode.
Further, the second registration is stored in a table structure, and includes a system IP where the service is located, a service name, a proportional value of the service trade-off resource ratio, and a corresponding relationship thereof.
Further, the service trades off the proportion value of the resource proportion and the corresponding relation thereof, and is obtained by calculating the service according to the occupied memory resource, CPU resource, disk IO resource and connection number.
Further, the sending, according to the call request of the first service, the survival list of the second service to the first service through the first data storage system includes:
inquiring whether the second service requested is down or not through the first data storage system according to the calling request of the first service;
if the service is down, removing the second service of the down from the list;
the surviving list of the second service is sent to the first service through the first data storage system.
Further, the sending, by the second data storage system, the address with the lowest occupied service resource in the survival list of the second service to the first service further includes:
if a plurality of second services occupy the same service resource, a first second service address is selected to be sent to the first service.
According to a second aspect of the present invention, there is provided a route distribution device comprising:
the first registration module is used for receiving a first registration of each service in the plurality of services through the first data storage system;
a second registration module for receiving a second registration of each of the plurality of services via a second data storage system;
the service survival list sending module is used for sending a survival list of a second service to the first service through the first data storage system according to a calling request of the first service, wherein the second service is the service requested to be called in the calling request;
and the routing address sending module is used for sending the address occupying the lowest service resource in the survival list of the second service to the first service through the second data storage system according to the query request of the first service so as to enable the first service to route according to the address.
Further, the first registration is stored in a key-value mode, and comprises a system IP and a service name of the service;
the first data storage system configures the survival time of the key for each service according to the first registration; each service performing the first registration is leased continuously by the heartbeat mode.
Further, the second registration is stored in a table structure mode and comprises a system IP where the service is located, a service name, a proportional value of the balance resource ratio of the service and a corresponding relation thereof;
the service trades the proportion value of the resource proportion and the corresponding relation thereof, and is obtained by calculating the service according to the occupied memory resource, CPU resource, disk IO resource and connection number.
In summary, the embodiment of the invention provides a method and a device for distributing routes, wherein the method comprises the following steps: receiving, by a first data storage system, a first registration for each of a plurality of services; receiving, by the second data storage system, a second registration for each of the plurality of services; according to a call request of a first service, sending a survival list of a second service to the first service through a first data storage system, wherein the second service is the service requested to be called in the call request; and according to the query request of the first service, sending an address with the lowest occupied service resource in the survival list of the second service to the first service through the second data storage system so that the first service can be routed according to the address. The technical scheme provided by the embodiment of the invention provides an on-demand intelligent routing method for deterministic networks aiming at differentiated and deterministic network transmission requirements of applications, and can generate a routing strategy according to the deterministic requirements of application flow so as to meet the timely response requirements of deterministic network applications.
Drawings
FIG. 1 is a flow chart of a route distribution method provided by one embodiment of the present invention;
FIG. 2 is a schematic diagram of interactions in which services are registered through a first data storage system and a second data storage system, respectively, in an embodiment of the present invention;
FIG. 3 is a schematic illustration of the interaction of a service routed through a first data storage system and a second data storage system in an embodiment of the invention;
FIG. 4 is a block diagram of a route distribution device according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The objects, technical solutions and advantages of the present invention will become more apparent by the following detailed description of the present invention with reference to the accompanying drawings. It should be understood that the description is only illustrative and is not intended to limit the scope of the invention. In addition, in the following description, descriptions of well-known structures and techniques are omitted so as not to unnecessarily obscure the present invention.
It is noted that unless otherwise defined, technical or scientific terms used in one or more embodiments of the present invention should be given the ordinary meaning as understood by one of ordinary skill in the art to which this disclosure belongs. The use of the terms "first," "second," and the like in one or more embodiments of the present invention does not denote any order, quantity, or importance, but rather the terms "first," "second," and the like are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect.
The technical scheme of the invention is described in detail below with reference to the accompanying drawings. The embodiment of the invention provides a route distribution method, a flow chart of the route distribution method is shown in fig. 1, the method provided by the embodiment of the invention is carried out under the condition that the total resources of the system where the same service is located are the same, and the method comprises the following steps:
s202, receiving first registration of each service in a plurality of services through a first data storage system. In this embodiment of the invention, the first data storage system, for example, employs an ETCD data storage system, for service registration discovery scenarios. ETCD is a highly consistent distributed key-value cluster storage system that provides a reliable way to store data that needs to be accessed by a distributed system or cluster of machines. ETCD uses the raft protocol to maintain consistency of the states of the various nodes within the cluster. Briefly, the ETCD cluster is a distributed system, and a plurality of nodes communicate with each other to form an overall external service, each node stores complete data, and the data maintained by each node is guaranteed to be consistent through a raft protocol. All services are configured with ETCD addresses according to own configuration files, registration configuration is carried out through the ETCD, each service is registered on the ETCD when started, and the ETCD configures key network survival (TTL) Time for the services. The first registration is stored in a key-value manner and comprises the system IP and service name of the service. Each service instance registered on the ETCD is leased periodically in a heartbeat mode, so that the state monitoring of the service is realized.
S204, receiving second registration of each service in the plurality of services through a second data storage system. In this embodiment of the invention, the second data storage system employs, for example, a MySQL database. The MySQL database is stored in a table structure mode and comprises a system IP where the service is located, a service name, a proportional value of the balance resource ratio of the service and a corresponding relation of the proportional value. The registered service itself calculates occupied system resources, such as occupied memory resources, CPU resources, disk IO resources and connection numbers, so as to obtain a proportional value for weighing the occupied resources of the service, and the proportional value obtained by calculation is uploaded to a MySQL database for storage in real time. And adding the calculated values of the memory resource utilization ratio, the CPU resource utilization ratio and the disk IO resource utilization ratio and the service connection number utilization number, wherein the obtained total number is the proportional value of the balance resource utilization ratio. For example, the memory resource usage ratio is 60%, the memory resource usage ratio is marked as 6 minutes, the CPU resource usage ratio is 30%, the disk IO resource usage ratio is marked as 3 minutes, the disk IO resource usage ratio is 70%, the disk IO resource usage ratio is marked as 7 minutes, the scores are respectively scored according to the number of service connection uses, and finally the scores are added and added to form a sum, the sum is stored in a database, and service with lower total number is routed preferentially.
An interactive schematic diagram of the registration of a service by a first data storage system and a second data storage system, respectively, is shown in fig. 2. As shown in fig. 2, the service a and the service B are illustrated as examples, and the service included in the technical solution of the present invention is not limited to two, but may be plural. The method comprises the steps that when the service A and the service B are started, first registration is carried out on an ETCD data storage system respectively, wherein the first registration comprises a system IP and a service name of the service, and the first registration is stored in the ETCD data storage system in a key-value mode; and performing second registration on the MySQL database, wherein the second registration comprises a system IP where the service is located, a service name, a proportional value of the balance resource ratio of the service and a corresponding relation of the proportional value, and the contents are stored in the MySQL database in a table structure mode.
S206, according to the call request of the first service, sending a survival list of a second service to the first service through the first data storage system, wherein the second service is the service requested to be called in the call request. According to the calling request of the first service, inquiring whether the requested second service is down or not through the first data storage system; if the service is down, removing the second service of the down from the list; the surviving list of the second service is sent to the first service through the first data storage system.
And S208, according to the query request of the first service, sending the address with the lowest occupied service resource in the survival list of the second service to the first service through the second data storage system, wherein if a plurality of second services occupy the same service resource, the first second service address is selected to be sent to the first service, so that the first service is routed according to the address.
An interactive schematic diagram of the routing of a service through a first data storage system and a second data storage system is shown in fig. 3. As shown in fig. 3, the description will be given taking the service a and the service B as examples. When a first service (for example, a service A) is called, according to a call request of the first service (for example, a service B), the position of the second service is firstly queried through an ETCD, the ETCD firstly queries whether the service is down, if the service is down, the ETCD can kick out the down service from the list, and the ETCD returns to the first service to call a second service survival list. And the first service queries the address with the lowest occupation of all second service resources in the second service survival list through the MySQL database according to the second service survival list returned by the ETCD to return to the first service, and if the second service resources occupy the same address, the first second service is preferentially selected to return, and the first service is routed according to the returned address.
An embodiment of the present invention further provides a route distribution device, in which a block diagram of the route distribution device is shown in fig. 4, and the device includes:
a first registration module 401, configured to receive, through a first data storage system, a first registration of each of a plurality of services;
a second registration module 402 for receiving a second registration of each of the plurality of services via a second data storage system;
a service survival list sending module 403, configured to send, according to a call request of a first service, a survival list of a second service to the first service through the first data storage system, where the second service is a service that requests to be called in the call request;
and the routing address sending module 404 is configured to send, according to the query request of the first service, an address occupying the lowest service resource in the survival list of the second service to the first service through the second data storage system, so that the first service routes according to the address.
The specific procedure of each module in the route distribution device provided by the above embodiment of the present invention to realize its function is the same as each step of the route distribution method provided by the above embodiment of the present invention, and thus, a repetitive description thereof will be omitted here.
The embodiment of the invention also provides electronic equipment, and fig. 5 is a schematic structural diagram of the electronic equipment according to the embodiment of the invention. As shown in fig. 5, the electronic device includes: one or more processors 501 and memory 502; and computer program instructions stored in the memory 502, which when executed by the processor 501, cause the processor 4501 to perform the route distribution method of any of the embodiments described above. The processor 501 may be a Central Processing Unit (CPU) or other form of processing unit having data processing and/or instruction execution capabilities and may control other components in the electronic device to perform desired functions.
Memory 502 may include one or more computer program products, which may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. Volatile memory can include, for example, random Access Memory (RAM) and/or cache memory (cache) and the like. The non-volatile memory may include, for example, read Only Memory (ROM), hard disk, flash memory, and the like. One or more computer program instructions may be stored on a computer readable storage medium and the processor 501 may execute the program instructions to implement the steps in the route distribution method and/or other desired functions of the various embodiments of the present invention above.
In some embodiments, the electronic device may further include: an input device 503 and an output device 504, which are interconnected by a bus system and/or other form of connection mechanism (not shown in fig. 5). For example, when the electronic device is a stand-alone device, the input means 503 may be a communication network connector for receiving the acquired input signal from an external, removable device. In addition, the input device 503 may also include, for example, a keyboard, a mouse, a microphone, and the like. The output device 504 may output various information to the outside, and may include, for example, a display, a speaker, a printer, a communication network, a remote output apparatus connected thereto, and the like.
In addition to the methods and apparatus described above, embodiments of the invention may also be a computer program product comprising computer program instructions which, when executed by a processor, cause the processor to perform the steps of the route distribution method of any of the embodiments described above.
The computer program product may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server.
Furthermore, embodiments of the present invention may also be a computer-readable storage medium, having stored thereon computer program instructions, which when executed by a processor, cause the processor to perform steps in a route distribution method of various embodiments of the present invention.
A computer readable storage medium may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may include, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
It should be appreciated that the processor in embodiments of the present invention may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate arrays (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
In summary, the embodiment of the invention relates to a method and a device for distributing routes, wherein the method comprises the following steps: receiving, by a first data storage system, a first registration for each of a plurality of services; receiving, by the second data storage system, a second registration for each of the plurality of services; according to a call request of a first service, sending a survival list of a second service to the first service through a first data storage system, wherein the second service is the service requested to be called in the call request; and according to the query request of the first service, sending an address with the lowest occupied service resource in the survival list of the second service to the first service through the second data storage system so that the first service can be routed according to the address. The technical scheme provided by the embodiment of the invention provides an on-demand intelligent routing method for deterministic networks aiming at differentiated and deterministic network transmission requirements of applications, and can generate a routing strategy according to the deterministic requirements of application flow so as to meet the timely response requirements of deterministic network applications.
It should be understood that the above discussion of any of the embodiments is exemplary only and is not intended to suggest that the scope of the invention (including the claims) is limited to these examples; combinations of features of the above embodiments or in different embodiments are also possible within the spirit of the invention, steps may be implemented in any order and there are many other variations of the different aspects of one or more embodiments of the invention described above which are not provided in detail for the sake of brevity. The above detailed description of the present invention is merely illustrative or explanatory of the principles of the invention and is not necessarily intended to limit the invention. Accordingly, any modification, equivalent replacement, improvement, etc. made without departing from the spirit and scope of the present invention should be included in the scope of the present invention. Furthermore, the appended claims are intended to cover all such changes and modifications that fall within the scope and boundary of the appended claims, or equivalents of such scope and boundary.
Claims (10)
1. A method of route distribution, comprising:
receiving, by a first data storage system, a first registration for each of a plurality of services;
receiving, by the second data storage system, a second registration for each of the plurality of services;
according to a call request of a first service, sending a survival list of a second service to the first service through a first data storage system, wherein the second service is the service requested to be called in the call request;
and according to the query request of the first service, sending an address with the lowest occupied service resource in the survival list of the second service to the first service through the second data storage system so that the first service can be routed according to the address.
2. The method of claim 1, wherein the first registration is stored in a key-value manner, including a system IP and a service name of a service location.
3. The method of claim 2, wherein the first data storage system configures a survival time of a key for each service according to the first registration, and wherein each service performing the first registration is rented by heartbeat.
4. The method of claim 1, wherein the second registration is stored in a table structure, including a system IP where the service is located, a service name, and a ratio value of the service tradeoff resource ratio and a correspondence thereof.
5. The method of claim 4, wherein the proportional value of the service tradeoff resource ratio and the corresponding relationship thereof are calculated by the service according to the memory resources, the CPU resources, the disk IO resources, and the connection number occupied by the service.
6. The method according to any one of claims 1-5, wherein the sending, by the first data storage system, the survival list of the second service to the first service according to the call request of the first service comprises:
inquiring whether the second service requested is down or not through the first data storage system according to the calling request of the first service;
if the service is down, removing the second service of the down from the list;
the surviving list of the second service is sent to the first service through the first data storage system.
7. The method of claim 6, wherein the sending, by the second data storage system, the address of the survival list of the second service that occupies the lowest service resource to the first service further comprises:
if a plurality of second services occupy the same service resource, a first second service address is selected to be sent to the first service.
8. A route distribution device, comprising:
the first registration module is used for receiving a first registration of each service in the plurality of services through the first data storage system;
a second registration module for receiving a second registration of each of the plurality of services via a second data storage system;
the service survival list sending module is used for sending a survival list of a second service to the first service through the first data storage system according to a calling request of the first service, wherein the second service is the service requested to be called in the calling request;
and the routing address sending module is used for sending the address occupying the lowest service resource in the survival list of the second service to the first service through the second data storage system according to the query request of the first service so as to enable the first service to route according to the address.
9. The apparatus of claim 8, wherein the first registration is stored in a key-value manner, including a system IP and a service name of a service location;
the first data storage system configures the survival time of the key for each service according to the first registration; each service performing the first registration is leased continuously by the heartbeat mode.
10. The apparatus of claim 9, wherein the second registration is stored in a table structure, and includes a system IP where the service is located, a service name, a ratio value of the service tradeoff resource ratio, and a correspondence thereof;
the service trades the proportion value of the resource proportion and the corresponding relation thereof, and is obtained by calculating the service according to the occupied memory resource, CPU resource, disk IO resource and connection number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310152454.XA CN116319505A (en) | 2023-02-10 | 2023-02-10 | Route distribution method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310152454.XA CN116319505A (en) | 2023-02-10 | 2023-02-10 | Route distribution method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116319505A true CN116319505A (en) | 2023-06-23 |
Family
ID=86835299
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310152454.XA Pending CN116319505A (en) | 2023-02-10 | 2023-02-10 | Route distribution method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116319505A (en) |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105635191A (en) * | 2014-10-27 | 2016-06-01 | 阿里巴巴集团控股有限公司 | Invocation guiding system and invocation guiding method for service traffic |
| CN108809848A (en) * | 2018-05-28 | 2018-11-13 | 北京奇艺世纪科技有限公司 | Load-balancing method, device, electronic equipment and storage medium |
| CN109618002A (en) * | 2019-01-11 | 2019-04-12 | 武汉斗鱼鱼乐网络科技有限公司 | A kind of micro services gateway optimization method, device and storage medium |
| CN110311900A (en) * | 2019-06-19 | 2019-10-08 | 微梦创科网络科技（中国）有限公司 | A kind of service calling method, device, electronic equipment and storage medium |
| CN110428840A (en) * | 2019-07-19 | 2019-11-08 | 平安科技（深圳）有限公司 | Implementation of load balancing, device and computer equipment in speech recognition system |
| CN110691118A (en) * | 2019-08-30 | 2020-01-14 | 许昌许继软件技术有限公司 | Service selection method and device in micro-service cluster |
| CN110837424A (en) * | 2019-10-15 | 2020-02-25 | 东软集团股份有限公司 | Service instance determining method and device, storage medium and electronic equipment |
| CN111814177A (en) * | 2020-06-28 | 2020-10-23 | 中国建设银行股份有限公司 | Multi-tenant data processing method, device, equipment and system based on micro-service |
| WO2021109640A1 (en) * | 2019-12-06 | 2021-06-10 | 华为技术有限公司 | Registration method and apparatus |
| CN113014673A (en) * | 2021-04-08 | 2021-06-22 | 广州趣丸网络科技有限公司 | Service call optimization method and device |
| CN113760447A (en) * | 2021-01-29 | 2021-12-07 | 北京沃东天骏信息技术有限公司 | Service management method, device, equipment, storage medium and program product |
| CN114385354A (en) * | 2021-12-27 | 2022-04-22 | 安徽百诚慧通科技有限公司 | Weight calculation method, system and medium based on server resource use condition |
| CN114640656A (en) * | 2020-12-01 | 2022-06-17 | 博泰车联网科技(上海)股份有限公司 | Method, apparatus and medium for updating data |
| CN114697231A (en) * | 2020-12-31 | 2022-07-01 | 电科云(北京)科技有限公司 | Gateway-based service discovery and service registration method and device |
| CN114979157A (en) * | 2022-05-17 | 2022-08-30 | 南昌智能新能源汽车研究院 | Load balancing method, system, storage medium and computer based on SOME/IP protocol |
| CN115174660A (en) * | 2022-08-03 | 2022-10-11 | 以萨技术股份有限公司 | Service registration and discovery method, device, electronic equipment and storage medium |
-
2023
- 2023-02-10 CN CN202310152454.XA patent/CN116319505A/en active Pending
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105635191A (en) * | 2014-10-27 | 2016-06-01 | 阿里巴巴集团控股有限公司 | Invocation guiding system and invocation guiding method for service traffic |
| CN108809848A (en) * | 2018-05-28 | 2018-11-13 | 北京奇艺世纪科技有限公司 | Load-balancing method, device, electronic equipment and storage medium |
| CN109618002A (en) * | 2019-01-11 | 2019-04-12 | 武汉斗鱼鱼乐网络科技有限公司 | A kind of micro services gateway optimization method, device and storage medium |
| CN110311900A (en) * | 2019-06-19 | 2019-10-08 | 微梦创科网络科技（中国）有限公司 | A kind of service calling method, device, electronic equipment and storage medium |
| CN110428840A (en) * | 2019-07-19 | 2019-11-08 | 平安科技（深圳）有限公司 | Implementation of load balancing, device and computer equipment in speech recognition system |
| CN110691118A (en) * | 2019-08-30 | 2020-01-14 | 许昌许继软件技术有限公司 | Service selection method and device in micro-service cluster |
| CN110837424A (en) * | 2019-10-15 | 2020-02-25 | 东软集团股份有限公司 | Service instance determining method and device, storage medium and electronic equipment |
| WO2021109640A1 (en) * | 2019-12-06 | 2021-06-10 | 华为技术有限公司 | Registration method and apparatus |
| CN111814177A (en) * | 2020-06-28 | 2020-10-23 | 中国建设银行股份有限公司 | Multi-tenant data processing method, device, equipment and system based on micro-service |
| CN114640656A (en) * | 2020-12-01 | 2022-06-17 | 博泰车联网科技(上海)股份有限公司 | Method, apparatus and medium for updating data |
| CN114697231A (en) * | 2020-12-31 | 2022-07-01 | 电科云(北京)科技有限公司 | Gateway-based service discovery and service registration method and device |
| CN113760447A (en) * | 2021-01-29 | 2021-12-07 | 北京沃东天骏信息技术有限公司 | Service management method, device, equipment, storage medium and program product |
| CN113014673A (en) * | 2021-04-08 | 2021-06-22 | 广州趣丸网络科技有限公司 | Service call optimization method and device |
| CN114385354A (en) * | 2021-12-27 | 2022-04-22 | 安徽百诚慧通科技有限公司 | Weight calculation method, system and medium based on server resource use condition |
| CN114979157A (en) * | 2022-05-17 | 2022-08-30 | 南昌智能新能源汽车研究院 | Load balancing method, system, storage medium and computer based on SOME/IP protocol |
| CN115174660A (en) * | 2022-08-03 | 2022-10-11 | 以萨技术股份有限公司 | Service registration and discovery method, device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109428922B (en) | Subscription and publishing method and server | |
| WO2020253347A1 (en) | Container cluster management method, device and system | |
| CN108510082B (en) | Method and device for processing machine learning model | |
| US9971823B2 (en) | Dynamic replica failure detection and healing | |
| US11637889B2 (en) | Configuration recommendation for a microservice architecture | |
| CN111447103B (en) | Virtual device management system, electronic device, virtual device management method, and medium | |
| JP2020096357A (en) | Dynamic routing using container orchestration service | |
| US10511651B2 (en) | Infinite micro-services architecture | |
| US9749445B2 (en) | System and method for updating service information for across-domain messaging in a transactional middleware machine environment | |
| US20220329651A1 (en) | Apparatus for container orchestration in geographically distributed multi-cloud environment and method using the same | |
| KR102260781B1 (en) | Integration System of Named Data Networking-based Edge Cloud Computing for Internet of Things | |
| CN112711512A (en) | Prometheus monitoring method, device and equipment | |
| CN111510330A (en) | Interface management apparatus, method and storage medium | |
| CN111310230B (en) | Spatial data processing method, device, equipment and medium | |
| CN110837499B (en) | Data access processing method, device, electronic equipment and storage medium | |
| CN116319505A (en) | Route distribution method and device | |
| CN115114042A (en) | Storage data access method and device, electronic equipment and storage medium | |
| CN115048060B (en) | Storage management method and device, electronic equipment and storage medium | |
| WO2023029485A1 (en) | Data processing method and apparatus, computer device, and computer-readable storage medium | |
| CN109582242A (en) | The address of cascade memory array system determines method, apparatus, electronic equipment | |
| CN110753082B (en) | Service calling method and terminal equipment | |
| JP2017123040A (en) | Server device, distribution file system, distribution file system control method, and program | |
| CN112073449B (en) | Kubernetes-based environment switching processing method and equipment | |
| US12086141B1 (en) | Coordination of services using PartiQL queries | |
| US20230409575A1 (en) | Database query processing with database clients |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230623 |