CN102201995A - Combination service system and method for realizing network load optimization - Google Patents
Combination service system and method for realizing network load optimization Download PDFInfo
- Publication number
- CN102201995A CN102201995A CN2011101485383A CN201110148538A CN102201995A CN 102201995 A CN102201995 A CN 102201995A CN 2011101485383 A CN2011101485383 A CN 2011101485383A CN 201110148538 A CN201110148538 A CN 201110148538A CN 102201995 A CN102201995 A CN 102201995A
- Authority
- CN
- China
- Prior art keywords
- service
- atomic
- node
- parameter
- list server
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Provided is a combination service system for realizing a network load optimization. The system comprises a gateway, a directory server, a service node and a service coverage network, etc, wherein the directory server is composed of a message parse module, a service directory module, a service selection module and a message sending module. The invention also provides a combination service method for realizing a network load optimization. The method comprises that the service node carries out the registration or logout of an atom service at the directory server and regularly sends the QoS (Quality of Service) update information of the atom service provided and the network information of the local service coverage network to the directory server; the directory server calculates an optimal service combination path based on the combination service request of a user and constructs a corresponding combination service execution path and the atom service is executed by the service node in order based on the sequence on the path. According to the system and method provided in the invention, requirements on service quality aspect such as price, reliability and timelag from the user towards the combination service can be satisfied and the network load can be equalized, thereby improving the service quality of the total network and the service experience of the user.
Description
Technical field
The present invention relates to a kind of composite services system and method for realizing that network payload is optimized, belong to areas of information technology, particularly belong to multimedia communication technology field based on the internet.
Background technology
Development along with information technology, especially technique of internet and development of telecom technology, the intelligent business that more and more has the multimedia feature emerges, these intelligent business are many than simple voice communication service or short message service complexity often, so be otherwise known as complex services or composite services.Composite services are generally combined by some basic services, and these basic services are called as atomic service.Composite services can be regarded a service chaining that is made of atomic service as, are collectively referred to as " service combinatorial path " in the present invention.Under the condition of market competition, can provide by different service providers with a kind of atomic service, be deployed on the different network-node servers, have QoS parameter QoS such as different prices, reliability, service time-delay, the network bandwidth.Propose some composite services for the user, realize that the service combinatorial path of the composite services that this is concrete just has a lot of bars, when composite services become complicated, when the selectable scope of atomic service becomes big, serve the sharply expansion of bar number of combinatorial path.Under the requirement of satisfying the preconditions such as price, reliability and service time-delay of user to composite services, how from the service combinatorial path of enormous amount, select the service combinatorial path of an optimum or suboptimum, make the load ratio of network optimize a technical barrier that becomes the solution of present telecommunication service development urgent need.
Summary of the invention
In view of this, the purpose of this invention is to provide a kind of composite services system and method for realizing that network payload is optimized, under the requirement of satisfying the preconditions such as price, reliability and service time-delay of user, guarantee the load equalization and the optimization of network composite services.
In order to achieve the above object, the present invention proposes a kind of composite services system that realizes that network payload is optimized, this system includes but not limited to:
Gateway, reception user's composite services solicited message is carried out necessary format conversion to service request information, sends to LIST SERVER then; After composite services carry out to finish, gateway received the composite services execution result that service node returns, execution result is carried out necessary format conversion after, send to the user;
LIST SERVER receives and stores the log-on message of atomic service that service node provides, and LIST SERVER is divided into different atomic service set according to the function of atomic service, classifies and stores and management; Receive and the service quality QoS lastest imformation of storage atomic service that service node provides and the network information at service coverage of living in place; Receive user's composite services requirement that gateway sends over,, produce service combination set of paths at first according to the functional requirement of user's composite services; According to the non-functional requirement of user's composite services, from service combination set of paths, select optimum service combinatorial path then, optimum service combinatorial path is sent to the service node that first atomic service is provided in this path;
Service node provides atomic service, registers the atomic service that it provides to LIST SERVER, and log-on message comprises the function information and the non-functional information of atomic service; According to the cycle of setting, regularly send the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place to LIST SERVER; Receive the optimal service combinatorial path that LIST SERVER and/or other service nodes send over, carry out the wherein current atomic service that is required, after being finished, execution result and optimal service combinatorial path are transmitted to the next service node of appointment in the optimal service combinatorial path;
Service coverage is connected into service coverage by the nerve of a covering link between gateway, LIST SERVER, the service node, provides composite services to the user; Wherein said nerve of a covering link be meant connect between gateway and the LIST SERVER, the logical links between LIST SERVER and the service node, between service node and the service node, between gateway and the service node, actual corresponding the one or more actual physical link of each bar nerve of a covering link;
LIST SERVER of the present invention comprises:
Message resolution module receives the composite services request message from gateway, is transmitted to the services selection module after resolving; Reception is from the message of service node, send to the service catalogue module after resolving, include but not limited to: the nerve of a covering network information that the service quality QoS updating message that atomic service registration that service node sends or logout message, service node regularly send, service node regularly send from the message of service node;
The service catalogue module, the service information table of the atomic service that the stores service node is provided, the service information table canned data includes but not limited to: the function of the title of atomic service, the ID that the service node of atomic service is provided, atomic service, the qos parameter of atomic service; The qos parameter of atomic service includes but not limited to the price of atomic service, the maximum delay of atomic service, the reliability of atomic service; The network information table of stores service nerve of a covering, the network information table canned data includes but not limited to: the ID of the ID of service node, nerve of a covering link, service node always calculate the total bandwidth and the current bandwidth of ability and current computing capability, nerve of a covering link;
The services selection module, the solicited message of user's composite services that the reception message resolution module sends over, service information table that stores in the inquiry service catalogue module and network information table, according to functional requirement in the composite services solicited message and non-functional requirement, calculate the optimal service combinatorial path that obtains to satisfy this composite services request, and this optimal service combinatorial path is sent to message transmission module;
Message transmission module receives the information from service catalogue module and services selection module, is configured to send to gateway or service node after the message according to the form of setting;
The present invention also provides a kind of composite services method that realizes that network payload is optimized, and this method comprises following operating procedure:
(1) service node carries out the registration or the cancellation of atomic service to LIST SERVER, and according to the cycle of setting, regularly sends the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place to LIST SERVER; LIST SERVER is divided into different atomic service set according to the function of atomic service, classifies and stores and management;
(2) gateway receives user's composite services request, carry out corresponding format conversion after, request message is sent to LIST SERVER;
(3) LIST SERVER calculates and obtains an optimal service combinatorial path according to user's composite services solicited message, at last this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
(4) each service node is carried out corresponding atomic service successively according to named order in the optimal service combinatorial path;
(5) after all atomic service all are finished, execution result is sent to gateway by the service node of carrying out last atomic service;
(6) after gateway carries out corresponding format conversion to the execution result of composite services, send to the user;
The content of operation of described step (1) specifically comprises:
(11) service node carries out the registration operation of atomic service to LIST SERVER, can realize that the concrete form of service registry SR message header is by increase service registry SR message header in the registration REGISTER of initial session protocol SIP message:
SR：service_name
；description
；service_node_id
；input
；output
；cost
；delay
；reliability
Wherein service_name is the atomic service name, description is the functional descriptions of atomic service, service_node_id is service node ID number that atomic service is provided, input is an input parameter, output is atomic service output result, cost is the price of atomic service, and delay is the service time-delay of atomic service, and reliability is the reliability of atomic service; After succeeding in registration, LIST SERVER for this atomic service distribute one atomic service ID number;
(12) service node carries out the cancellation operation of atomic service to LIST SERVER, can realize that the concrete form that the SU message header is nullified in service is by increase service cancellation SU message header in the NOTIFY of initial session protocol SIP:
SU：service_id
；service_node_id
；status＝stop
Wherein service_id is atomic service ID number, and service_node_id is service node ID number that atomic service is provided, and status is the atomic service state, and stop is the service of nullifying, and LIST SERVER is deleted it.
(13) the service quality QoS lastest imformation of the atomic service that provides regularly is provided to LIST SERVER service node, can realize that the concrete form that service quality QoS upgrades the QU message header is by in the NOTIFY of initial session protocol SIP, increasing service quality QoS renewal QU message header:
QU：service_name
；cost
；delay
；reliability
Wherein service_name is the atomic service name, and cost is the price of atomic service, and delay is the service time-delay of atomic service, and reliability is the reliability of atomic service.
(14) service node regularly sends the network information at service coverage of living in place to LIST SERVER, can realize that the concrete form of network information NI message header is by increase network information NI message header in the NOTIFY of initial session protocol SIP:
NI：service_node_id
；CPU
；BW
Wherein service_node_id is service node ID number that atomic service is provided, and CPU is the CPU usage of this service node, and BW is the nerve of a covering link occupancy of this service node.
Described step (3) further comprises the steps:
(31) message resolution module of LIST SERVER is transmitted to user's composite services solicited message the services selection module of LIST SERVER;
(32) the services selection module of LIST SERVER is according to the functional requirement of user's composite services, and service information table that stores in the inquiry service catalogue module and network information table produce service combination set of paths;
(33) for ease of computation optimization, the services selection module of LIST SERVER is carried out service quality QoS parameter conversion process of equal value respectively to serial structure, parallel organization, choice structure, loop structure in the service combinatorial path, serial structure, parallel organization, choice structure, loop structure are changed into cellular construction with equivalent service quality Q oS parameter, thereby all the service combinatorial paths in the service combination set of paths that is produced all are converted to unified serial service combinatorial path, constitute a serial service combination set of paths; Described service quality QoS parameter includes but not limited to service price, service time-delay, service reliability, service node CPU usage and nerve of a covering link bandwidth occupancy;
(34) target of optimizing according to the network payload of setting, the services selection module of LIST SERVER is passed through computation optimization, from described serial service combination set of paths, pick out an optimal service combinatorial path, then this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
The services selection module of LIST SERVER to the concrete grammar that serial structure, parallel organization, choice structure, loop structure in the service combinatorial path carry out service quality QoS conversion process of equal value respectively is in the described step (33):
(331) for serial structure, the equivalent service price parameter that converts to behind the cellular construction is the price sum of selected atom service in the former serial structure; The equivalent service delay parameter is the time-delay sum of selected atom service in the former serial structure; The equivalent service dependability parameter is that selected atom reliability of service parameter is long-pending in the former serial structure; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former serial structure; The nerve of a covering link bandwidth occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former serial structure;
(332) for parallel organization, the equivalent service price parameter that converts to behind the cellular construction is the price sum of selected atom service in the former parallel organization; The equivalent service delay parameter is the maximum delay value in the selected atom service in the former parallel organization; The equivalent service dependability parameter is that selected atom reliability of service parameter is long-pending in the former parallel organization; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former parallel organization; The nerve of a covering link bandwidth occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former parallel organization;
(333) for choice structure, the equivalent service price parameter that converts to behind the cellular construction is the price of selected atom service in the former choice structure; The equivalent service delay parameter is the time-delay of selected atom service in the former choice structure; The equivalent service dependability parameter is a selected atom reliability of service parameter in the former choice structure; The CPU usage parameter of equal value of cellular construction is the CPU usage that the service node of selected atom service is provided in the former choice structure; The nerve of a covering link occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link occupancy that the service node of selected atom service is provided in the former choice structure;
(334) for loop structure, be provided with N circulation, N is the natural number greater than 1, convert equivalent service price parameter behind the cellular construction to and be once circulate in the former loop structure selected atom service the price sum N doubly; The equivalent service delay parameter be once circulate in the former loop structure selected atom service the time-delay sum N doubly; The equivalent service dependability parameter is that the selected atom reliability of service parameter that once circulates in the former loop structure is long-pending; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former loop structure; The nerve of a covering link occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former loop structure;
The network payload optimization aim particular content of setting in the described step (34) is:
Under the requirement of satisfying price, time-delay and the reliability of user to composite services, the CPU usage of equal value of optimal service combinatorial path and the weighted average of nerve of a covering link occupancy of equal value are minimum or inferior little; The CPU usage of equal value of described optimal service combinatorial path is meant the maximum of the CPU usage of equal value of the cellular construction that constitutes the optimal service combinatorial path, and the nerve of a covering link occupancy of equal value of described optimal service combinatorial path is meant the maximum of the nerve of a covering link occupancy of equal value of the cellular construction that constitutes the optimal service combinatorial path; The price of equal value of optimal service combinatorial path otherwise greater than the price of the composite services that the user proposed, the price of equal value of described optimal service combinatorial path is meant the price sum of equal value of the cellular construction that constitutes the optimal service combinatorial path; The equivalence of optimal service combinatorial path time-delay otherwise greater than the time-delay of the composite services that the user proposed, the equivalence time-delay of described optimal service combinatorial path is meant the equivalence time-delay sum of the cellular construction that constitutes the optimal service combinatorial path; The reliability of equal value of optimal service combinatorial path otherwise less than the reliability of the composite services that the user proposed, the reliability of equal value of described optimal service combinatorial path is meant that the reliability of equal value of the cellular construction that constitutes the optimal service combinatorial path is long-pending;
Foregoing optimal service combinatorial path is when carrying out, and LIST SERVER can construct combination service execution path according to the optimal service combinatorial path, then this combination service execution path is sent to the service node that first atomic service is provided in this path.
Described LIST SERVER according to the concrete grammar in optimal service combinatorial path tectonic association service execution path is: combination service execution path is made of serial structure, parallel organization and loop structure; Serial structure adopts ID number of atomic service that "+" character carries out order to connect successively according to carrying out in proper order; Parallel organization adopts “ ﹠amp; " character connects ID number of the atomic service of execution arranged side by side; Loop structure adopts " N * (atomic service ID) " or " N * (serial structure) " or " N * (parallel organization) " to represent, wherein N is a natural number, the number of times of expression circulation, N * (atomic service ID) expression is carried out N time certain atomic service circulation, N * (serial structure) expression is to serial structure circulation execution N time, and N * (parallel organization) expression circulates to parallel organization and carries out N time;
Beneficial effect of the present invention be to guarantee the user to composite services in the requirement aspect the service quality such as price, reliability, time-delay, can make the network payload equalize trendization again, thereby improve the service quality of network in general, improve user service experience.
Description of drawings
Fig. 1 is the schematic diagram that the present invention realizes service coverage in the composite services system that network payload optimizes.
Fig. 2 is the structural representation that the present invention realizes LIST SERVER in the composite services system that network payload optimizes.
Fig. 3 is the flow diagram that the present invention realizes the composite services method that network payload is optimized.
Fig. 4 is the schematic diagram that the present invention serves serial structure in the combinatorial path.
Fig. 5 is the schematic diagram that the present invention serves parallel organization in the combinatorial path.
Fig. 6 is the schematic diagram that the present invention serves choice structure in the combinatorial path.
Fig. 7 is the schematic diagram that the present invention serves loop structure in the combinatorial path.
Fig. 8 is the atomic service decomposing schematic representation of concrete composite services.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
Referring to Fig. 1, introduce the composite services system that the present invention realizes that network payload is optimized, this system includes but not limited to:
Gateway, reception user's composite services solicited message is carried out necessary format conversion to service request information, sends to LIST SERVER then; After composite services carry out to finish, gateway received the composite services execution result that service node returns, execution result is carried out necessary format conversion after, send to the user;
LIST SERVER receives and stores the log-on message of atomic service that service node provides, and receives and the service quality QoS lastest imformation of storage atomic service that service node provides and the network information at service coverage of living in place; Receive user's composite services requirement that gateway sends over,, produce service combination set of paths at first according to the functional requirement of user's composite services; According to the non-functional requirement of user's composite services, from service combination set of paths, select optimum service combinatorial path then, optimum service combinatorial path is sent to the service node that first atomic service is provided in this path;
Service node provides atomic service, registers the atomic service that it provides to LIST SERVER, and log-on message comprises the function information and the non-functional information of atomic service; According to the cycle of setting, regularly send the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place to LIST SERVER; Receive the optimal service combinatorial path that LIST SERVER and/or other service nodes send over, carry out the wherein current atomic service that is required, after being finished, execution result and optimal service combinatorial path are transmitted to the next service node of appointment in the optimal service combinatorial path;
Service coverage is connected into service coverage by the nerve of a covering link between gateway, LIST SERVER, the service node, provides composite services to the user; Wherein said nerve of a covering link be meant connect between gateway and the LIST SERVER, the logical links between LIST SERVER and the service node, between service node and the service node, between gateway and the service node, actual corresponding the one or more actual physical link of each bar nerve of a covering link;
Referring to Fig. 2, introduce the LIST SERVER in the composite services system that the present invention realizes that network payload optimizes, this LIST SERVER comprises as lower module:
Message resolution module receives the composite services request message from gateway, is transmitted to the services selection module after resolving; Reception is from the message of service node, send to the service catalogue module after resolving, include but not limited to: the nerve of a covering network information that the service quality QoS updating message that atomic service registration that service node sends or logout message, service node regularly send, service node regularly send from the message of service node;
The service catalogue module, the service information table of the atomic service that the stores service node is provided, the service information table canned data includes but not limited to: the function of the title of atomic service, the ID that the service node of atomic service is provided, atomic service, the qos parameter of atomic service; The qos parameter of atomic service includes but not limited to the price of atomic service, the maximum delay of atomic service, the reliability of atomic service; The network information table of stores service nerve of a covering, the network information table canned data includes but not limited to: the ID of the ID of service node, nerve of a covering link, service node always calculate the total bandwidth and the current bandwidth of ability and current computing capability, nerve of a covering link; Described service node always calculates ability and current computing capability can be represented with total calculating ability and the current occupancy of service node CPU;
The services selection module, the solicited message of user's composite services that the reception message resolution module sends over, service information table that stores in the inquiry service catalogue module and network information table, according to functional requirement in the composite services solicited message and non-functional requirement, calculate the optimal service combinatorial path that obtains to satisfy this composite services request, and this optimal service combinatorial path is sent to message transmission module;
Message transmission module receives the information from service catalogue module and services selection module, is configured to send to gateway or service node after the message according to the form of setting;
Referring to Fig. 3, introduce the composite services method that the present invention realizes that network payload is optimized, this method comprises following operating procedure:
(1) service node carries out the registration or the cancellation of atomic service to LIST SERVER, and according to the cycle of setting, regularly sends the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place to LIST SERVER; LIST SERVER is divided into different atomic service set according to the function of atomic service, classifies and stores and management;
(2) gateway receives user's composite services request, carry out corresponding format conversion after, request message is sent to LIST SERVER;
(3) LIST SERVER calculates and obtains an optimal service combinatorial path according to user's composite services solicited message, at last this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
(4) each service node is carried out corresponding atomic service successively according to named order in the optimal service combinatorial path;
(5) after all atomic service all are finished, execution result is sent to gateway by the service node of carrying out last atomic service;
(6) after gateway carries out corresponding format conversion to the execution result of composite services, send to the user;
The content of operation of described step (1) specifically comprises:
(11) service node carries out the registration operation of atomic service to LIST SERVER, can realize that the concrete form of service registry SR message header is by increase service registry SR message header in the registration REGISTER of initial session protocol SIP message:
SR：service_name
；description
；service_node_id
；input
；output
；cost
；delay
；reliability
Wherein service_name is the atomic service name, description is the functional descriptions of atomic service, service_node_id is service node ID number that atomic service is provided, input is an input parameter, output is atomic service output result, cost is the price of atomic service, and delay is the service time-delay of atomic service, and reliability is the reliability of atomic service; After succeeding in registration, LIST SERVER for this atomic service distribute one atomic service ID number;
(12) service node carries out the cancellation operation of atomic service to LIST SERVER, can realize that the concrete form that the SU message header is nullified in service is by increase service cancellation SU message header in the NOTIFY of initial session protocol SIP:
SU：service_id
；service_node_id
；status＝stop
Wherein service_name is atomic service ID number, and service_node_id is service node ID number that atomic service is provided, and status is the atomic service state, and stop is the service of nullifying, and LIST SERVER is deleted it.
(13) the service quality QoS lastest imformation of the atomic service that provides regularly is provided to LIST SERVER service node, can realize that the concrete form that service quality QoS upgrades the QU message header is by in the NOTIFY of initial session protocol SIP, increasing service quality QoS renewal QU message header:
QU：service_id
；cost
；delay
；reliability
Wherein service_id is atomic service ID number, and cost is the price of atomic service, and delay is the service time-delay of atomic service, and reliability is the reliability of atomic service.
(14) service node regularly sends the network information at service coverage of living in place to LIST SERVER, can realize that the concrete form of network information NI message header is by increase network information NI message header in the NOTIFY of initial session protocol SIP:
NI：service_node_id
；CPU
；BW
Wherein service_node_id is service node ID number that atomic service is provided, and CPU is the CPU usage of this service node, and BW is the nerve of a covering link occupancy of this service node.
Above-mentioned step (3) further comprises the steps:
(31) message resolution module of LIST SERVER is transmitted to user's composite services solicited message the services selection module of LIST SERVER;
(32) the services selection module of LIST SERVER is according to the functional requirement of user's composite services, and service information table that stores in the inquiry service catalogue module and network information table produce service combination set of paths;
(33) for ease of computation optimization, the services selection module of LIST SERVER is carried out service quality QoS parameter conversion process of equal value respectively to serial structure, parallel organization, choice structure, loop structure in the service combinatorial path, serial structure, parallel organization, choice structure, loop structure are changed into cellular construction with equivalent service quality Q oS parameter, thereby all the service combinatorial paths in the service combination set of paths that is produced all are converted to unified serial service combinatorial path, constitute a serial service combination set of paths; Described service quality QoS parameter includes but not limited to service price, service time-delay, service reliability, service node CPU usage and nerve of a covering link bandwidth occupancy;
(34) target of optimizing according to the network payload of setting, the services selection module of LIST SERVER is passed through computation optimization, from described serial service combination set of paths, pick out an optimal service combinatorial path, then this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
The services selection module of LIST SERVER to the concrete grammar that serial structure, parallel organization, choice structure, loop structure in the service combinatorial path carry out service quality QoS conversion process of equal value respectively is in the above-mentioned steps (33):
(331) for serial structure, the equivalent service price parameter that converts to behind the cellular construction is the price sum of selected atom service in the former serial structure; The equivalent service delay parameter is the time-delay sum of selected atom service in the former serial structure; The equivalent service dependability parameter is that selected atom reliability of service parameter is long-pending in the former serial structure; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former serial structure; The nerve of a covering link bandwidth occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former serial structure;
Referring to Fig. 4, the serial structure shown in the figure is made up of two atomic service, is provided by service node 1 and 2 respectively, concrete parameter is: the price of atomic service 1 is a divalent lattice unit, and time-delay is 1 timer, and reliability is 0.9, CPU usage is 0.3, and the input link bandwidth usage is 0.5; The price of atomic service 2 is 1 unit of value, and time-delay is 3 timers, and reliability is 0.8, and CPU usage is 0.4, and the input link bandwidth usage is 0.7, and the output link bandwidth usage is 0.3.Its equivalent parameter is after converting cellular construction to: price is 3 unit of values, and time-delay is 4 timers, and reliability is 0.72, and CPU usage is 0.4, and bandwidth usage is 0.7.In actual applications, the unit of value can come to select according to the actual needs, as the RMB branch; Timer also can come to select according to the actual needs, as millisecond.
(332) for parallel organization, the equivalent service price parameter that converts to behind the cellular construction is the price sum of selected atom service in the former parallel organization; The equivalent service delay parameter is the maximum delay value in the selected atom service in the former parallel organization; The equivalent service dependability parameter is that selected atom reliability of service parameter is long-pending in the former parallel organization; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former parallel organization; The nerve of a covering link bandwidth occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former parallel organization;
Referring to Fig. 5, parallel organization shown in the figure is made up of two atomic service, provide by service node 1 and 2 respectively, concrete parameter is: the price of atomic service 1 is a divalent lattice unit, time-delay is 1 timer, and reliability is 0.9, and CPU usage is 0.3, the input link bandwidth usage is 0.5, and the output link bandwidth usage is 0.1; The price of atomic service 2 is 1 unit of value, and time-delay is 3 timers, and reliability is 0.8, and CPU usage is 0.4, and the input link bandwidth usage is 0.7, and the output link bandwidth usage is 0.3.Its equivalent parameter is after converting cellular construction to: price is 3 unit of values, and time-delay is 3 timers, and reliability is 0.72, and CPU usage is 0.4, and bandwidth usage is 0.7.In actual applications, the unit of value can come to select according to the actual needs, as the RMB branch; Timer also can come to select according to the actual needs, as millisecond.
(333) for choice structure, the equivalent service price parameter that converts to behind the cellular construction is the price of selected atom service in the former choice structure; The equivalent service delay parameter is the time-delay of selected atom service in the former choice structure; The equivalent service dependability parameter is a selected atom reliability of service parameter in the former choice structure; The CPU usage parameter of equal value of cellular construction is the CPU usage that the service node of selected atom service is provided in the former choice structure; The nerve of a covering link occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link occupancy that the service node of selected atom service is provided in the former choice structure;
Referring to Fig. 6, choice structure shown in the figure is made up of two atomic service, provide by service node 1 and 2 respectively, concrete parameter is: the price of atomic service 1 is a divalent lattice unit, time-delay is 1 timer, and reliability is 0.9, and CPU usage is 0.3, the input link bandwidth usage is 0.5, and the output link bandwidth usage is 0.1; The price of atomic service 2 is 1 unit of value, and time-delay is 3 timers, and reliability is 0.8, and CPU usage is 0.4, and the input link bandwidth usage is 0.7, and the output link bandwidth usage is 0.3.If select atomic service 1, then convert cellular construction to after its equivalent parameter be: price is a divalent lattice unit, and time-delay is 1 timer, and reliability is 0.9, and CPU usage is 0.3, and bandwidth usage is 0.5; If select atomic service 2, then convert cellular construction to after its equivalent parameter be: price is 1, and time-delay is 3, and reliability is 0.8, and CPU usage is 0.4, and bandwidth usage is 0.7.In actual applications, the unit of value can come to select according to the actual needs, as the RMB branch; Timer also can come to select according to the actual needs, as millisecond.
(334) for loop structure, be provided with N circulation, N is the natural number greater than 1, convert equivalent service price parameter behind the cellular construction to and be once circulate in the former loop structure selected atom service the price sum N doubly; The equivalent service delay parameter be once circulate in the former loop structure selected atom service the time-delay sum N doubly; The equivalent service dependability parameter is that the selected atom reliability of service parameter that once circulates in the former loop structure is long-pending; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former loop structure; The nerve of a covering link occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former loop structure;
Referring to Fig. 7, the loop structure shown in the figure is made up of two atomic service, is provided by service node 1 and 2 respectively, and cycle-index is 2.Concrete parameter is: the price of atomic service 1 is a divalent lattice unit, and time-delay is 1 timer, and reliability is 0.9, and CPU usage is 0.3, and the input link bandwidth usage is 0.5; The price of atomic service 2 is 1 unit of value, and time-delay is 3 timers, and reliability is 0.8, and CPU usage is 0.4, and the input link bandwidth usage is 0.7, and the output link bandwidth usage is 0.3, and service 2 is 0.8 to the link bandwidth occupancy of service 1.Its equivalent parameter is after converting cellular construction to: price is 6 unit of values, and time-delay is 8 timers, and reliability is 0.72, and CPU usage is 0.4, and bandwidth usage is 0.8.In actual applications, the unit of value can come to select according to the actual needs, as the RMB branch; Timer also can come to select according to the actual needs, as millisecond.
The input nerve of a covering link of service node recited above is meant that the service node that an atomic service is provided points to the nerve of a covering link of this service node; The output nerve of a covering link of service node is meant that this service node points to the nerve of a covering link of the service node that next atomic service is provided;
Above the network payload optimization aim particular content set in the described step (34) be:
Under the requirement of satisfying price, time-delay and the reliability of user to composite services, the CPU usage of equal value of optimal service combinatorial path and the weighted average of nerve of a covering link occupancy of equal value are minimum or inferior little; The CPU usage of equal value of described optimal service combinatorial path is meant the maximum of the CPU usage of equal value of the cellular construction that constitutes the optimal service combinatorial path, and the nerve of a covering link occupancy of equal value of described optimal service combinatorial path is meant the maximum of the nerve of a covering link occupancy of equal value of the cellular construction that constitutes the optimal service combinatorial path; The price of equal value of optimal service combinatorial path otherwise greater than the price of the composite services that the user proposed, the price of equal value of described optimal service combinatorial path is meant the price sum of equal value of the cellular construction that constitutes the optimal service combinatorial path; The equivalence of optimal service combinatorial path time-delay otherwise greater than the time-delay of the composite services that the user proposed, the equivalence time-delay of described optimal service combinatorial path is meant the equivalence time-delay sum of the cellular construction that constitutes the optimal service combinatorial path; The reliability of equal value of optimal service combinatorial path otherwise less than the reliability of the composite services that the user proposed, the reliability of equal value of described optimal service combinatorial path is meant that the reliability of equal value of the cellular construction that constitutes the optimal service combinatorial path is long-pending;
Foregoing optimal service combinatorial path is when carrying out, and LIST SERVER can construct combination service execution path according to the optimal service combinatorial path, then this combination service execution path is sent to the service node that first atomic service is provided in this path.
Described LIST SERVER according to the concrete grammar in optimal service combinatorial path tectonic association service execution path is: combination service execution path is made of serial structure, parallel organization and loop structure; Serial structure adopts ID number of atomic service that "+" character carries out order to connect successively according to carrying out in proper order; Parallel organization adopts “ ﹠amp; " character connects ID number of the atomic service of execution arranged side by side; Loop structure adopts " N * (atomic service ID) " or " N * (serial structure) " or " N * (parallel organization) " to represent, wherein N is a natural number, the number of times of expression circulation, N * (atomic service ID) expression is carried out N time certain atomic service circulation, N * (serial structure) expression is to serial structure circulation execution N time, and N * (parallel organization) expression circulates to parallel organization and carries out N time;
The composite service example: the user makes a phone call to be scheduled to hotel and restaurant by mobile phone, and the execution result of composite service turns back on user's the mobile phone by short message mode.Referring to Fig. 8, composite services hereto, LIST SERVER is decomposed into following four atomic service to it according to its professional function: promptly language and characters conversion atomic service, search the hotel atomic service, search the service atom in restaurant, literal be sent to the atomic service of designated mobile phone.
In actual implementation process, atomic service corresponding to certain function, may have a plurality of service nodes provides, thereby LIST SERVER has the atomic service more than to the identical atomic service composed atom set of service of function inside each atomic service set.In this example, the situations such as function of atomic service set, atomic service and the atomic service that relates to are as described in Table 1:
Table 1
| The atomic service set | The atomic service functional description | Atomic service ID |
| SS 1 | The language and characters conversion | S 1I 1、S 1I 2 |
| SS 2 | Predetermined hotel | S 2I 1、S 2I 2 |
| SS 3 | Predetermined restaurant | S 3I 1 |
| SS 4 | Specify literal to be sent to mobile phone | S 4I 1、S 4I 2 |
That is: atomic service S
1I
1And S
1I
2At atomic service S set S
1In, its function is the language and characters conversion; Atomic service S
2I
1And S
2I
2At atomic service S set S
2In, its function is to subscribe the hotel; Atomic service S
3I
1At atomic service S set S
3In, its function is to subscribe the restaurant; Atomic service S
4I
1, S
4I
2At atomic service S set S
4In, its function is that the designated tone literal is sent to mobile phone;
The parameter of above-mentioned each atomic service is as described in table 2 and the table 3:
Table 2
| Atomic service ID | Price | Time delay | Reliability | CPU usage | Place service node ID |
| S 1I 1 | 1 | 3 | 0.9 | 0.1 | SN1 |
| S 1I 2 | 2 | 2 | 0.9 | 0.4 | SN2 |
| S 2I 1 | 2 | 2 | 0.8 | 0.5 | SN3 |
| S 2I 2 | 1 | 3 | 0.8 | 0.2 | SN4 |
| S 3I 1 | 3 | 1 | 0.9 | 0.3 | SN5 |
| S 4I 1 | 2 | 2 | 0.9 | 0.3 | SN6 |
| S 4I 2 | 1 | 3 | 0.6 | 0.4 | SN7 |
Table 3
| The nerve of a covering link | Bandwidth usage |
| LIST SERVER-SN1 | 0.2 |
| LIST SERVER-SN2 | 0.4 |
| SN1-SN3 | 0.5 |
| SN1-SN4 | 0.3 |
| SN1-SN5 | 0.2 |
| SN2-SN3 | 0.5 |
| SN2-SN4 | 0.3 |
| SN2-SN5 | 0.2 |
| SN3-SN6 | 0.1 |
| SN3-SN7 | 0.1 |
| SN4-SN6 | 0.3 |
| SN4-SN7 | 0.3 |
| SN5-SN6 | 0.3 |
| SN5-SN7 | 0.3 |
| The SN6-gateway | 0.6 |
| The SN7-gateway | 0.1 |
In this example, the service combinatorial path has 8, and is as shown in table 4; Equivalent parameter the method according to this invention result of calculation of these 8 service combinatorial paths is also as shown in table 4.Suppose in example, it is that price is smaller or equal to 8 that the user needs the requirement to composite services, time delay is smaller or equal to 8, reliability is greater than 0.5 words, the service combinatorial path of finding out so is that sequence number is 1 and 7 path, from wherein finding out what make that CPU usage adds the bandwidth usage minimum more then is 7 service combinatorial path for sequence number, and this path is the optimal service combinatorial path; The combination service execution path that is configured to according to this optimal service combinatorial path is: S
1I
2+ S
2I
2﹠amp; S
3I
1+ S
4I
1, LIST SERVER sends to this combination service execution path first atomic service S is provided on this path
1I
2Service node SN2.
Table 4
| Sequence number | The service combinatorial path | Price | Time delay | Reliability | CPU usage | Bandwidth usage |
| 1 | (S 1I 1、S 2I 1、S 3I 1、S 4I 1) | 8 | 8 | 0.58 | 0.5 | ?0.6 |
| 2 | (S 1I 1、S 2I 1、S 3I 1、S 4I 2) | 7 | 9 | 0.39 | 0.5 | ?0.5 |
| 3 | (S 1I 1、S 2I 2、S 3I 1、S 4I 1) | 7 | 9 | 0.58 | 0.3 | ?0.6 |
| 4 | (S 1I 1、S 2I 2、S 3I 1、S 4I 2) | 6 | 10 | 0.39 | 0.4 | ?0.3 |
| 5 | (S 1I 2、S 2I 1、S 3I 1、S 4I 1) | 9 | 7 | 0.58 | 0.5 | ?0.6 |
| 6 | (S 1I 2、S 2I 1、S 3I 1、S 4I 2) | 8 | 8 | 0.39 | 0.5 | ?0.5 |
| 7 | (S 1I 2、S 2I 2、S 3I 1、S 4I 1) | 8 | 8 | 0.58 | 0.4 | ?0.6 |
| 8 | (S 1I 2、S 2I 2、S 3I 1、S 4I 2) | 7 | 9 | 0.39 | 0.4 | ?0.4 |
Claims (9)
1. composite services system that realizes that network payload is optimized, it is characterized in that: described system includes but not limited to:
Gateway, reception user's composite services solicited message is carried out necessary format conversion to service request information, sends to LIST SERVER then; After composite services carry out to finish, gateway received the composite services execution result that service node returns, execution result is carried out necessary format conversion after, send to the user;
LIST SERVER receives and stores the log-on message of atomic service that service node provides, and LIST SERVER is divided into different atomic service set according to the function of atomic service, classifies and stores and management; Receive and the service quality QoS lastest imformation of storage atomic service that service node provides and the network information at service coverage of living in place; Receive user's composite services requirement that gateway sends over,, produce service combination set of paths at first according to the functional requirement of user's composite services; According to the non-functional requirement of user's composite services, from service combination set of paths, select optimum service combinatorial path then, optimum service combinatorial path is sent to the service node that first atomic service is provided in this path;
Service node provides atomic service, registers the atomic service that it provides to LIST SERVER, and log-on message comprises the function information and the non-functional information of atomic service; According to the cycle of setting, regularly send the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place to LIST SERVER; Receive the optimal service combinatorial path that LIST SERVER and/or other service nodes send over, carry out the wherein current atomic service that is required, after being finished, execution result and optimal service combinatorial path are transmitted to the next service node of appointment in the optimal service combinatorial path;
Service coverage is connected into service coverage by the nerve of a covering link between gateway, LIST SERVER, the service node, provides composite services to the user; Wherein said nerve of a covering link be meant connect between gateway and the LIST SERVER, the logical links between LIST SERVER and the service node, between service node and the service node, between gateway and the service node, actual corresponding the one or more actual physical link of each bar nerve of a covering link.
2. a kind of composite services system that realizes that network payload is optimized according to claim 1, it is characterized in that: described LIST SERVER comprises:
Message resolution module receives the composite services request message from gateway, is transmitted to the services selection module after resolving; Reception is from the message of service node, send to the service catalogue module after resolving, include but not limited to: the nerve of a covering network information that the service quality QoS updating message that atomic service registration that service node sends or logout message, service node regularly send, service node regularly send from the message of service node;
The service catalogue module, the service information table of the atomic service that the stores service node is provided, the service information table canned data includes but not limited to: the function of the title of atomic service, the ID that the service node of atomic service is provided, atomic service, the qos parameter of atomic service; The qos parameter of atomic service includes but not limited to the price of atomic service, the maximum delay of atomic service, the reliability of atomic service; The network information table of stores service nerve of a covering, the network information table canned data includes but not limited to: the ID of the ID of service node, nerve of a covering link, service node always calculate the total bandwidth and the current bandwidth of ability and current computing capability, nerve of a covering link;
The services selection module, the solicited message of user's composite services that the reception message resolution module sends over, service information table that stores in the inquiry service catalogue module and network information table, according to functional requirement in the composite services solicited message and non-functional requirement, calculate the optimal service combinatorial path that obtains to satisfy this composite services request, and this optimal service combinatorial path is sent to message transmission module;
Message transmission module receives the information from service catalogue module and services selection module, is configured to send to gateway or service node after the message according to the form of setting.
3. composite services method that realizes that network payload is optimized, it is characterized in that: described method comprises following operating procedure:
(1) service node carries out the registration or the cancellation of atomic service to LIST SERVER, and according to the cycle of setting, regularly sends the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place to LIST SERVER; LIST SERVER is divided into different atomic service set according to the function of atomic service, classifies and stores and management;
(2) gateway receives user's composite services request, carry out corresponding format conversion after, request message is sent to LIST SERVER;
(3) LIST SERVER calculates and obtains an optimal service combinatorial path according to user's composite services solicited message, at last this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
(4) each service node is carried out corresponding atomic service successively according to named order in the optimal service combinatorial path;
(5) after all atomic service all are finished, execution result is sent to gateway by the service node of carrying out last atomic service;
(6) after gateway carries out corresponding format conversion to the execution result of composite services, send to the user.
4. a kind of composite services method that realizes that network payload is optimized according to claim 3, it is characterized in that: described step (3) further comprises the steps:
(31) message resolution module of LIST SERVER is transmitted to user's composite services solicited message the services selection module of LIST SERVER;
(32) the services selection module of LIST SERVER is according to the functional requirement of user's composite services, and service information table that stores in the inquiry service catalogue module and network information table produce service combination set of paths;
(33) for ease of computation optimization, the services selection module of LIST SERVER is carried out service quality QoS parameter conversion process of equal value respectively to serial structure, parallel organization, choice structure, loop structure in the service combinatorial path, serial structure, parallel organization, choice structure, loop structure are changed into cellular construction with equivalent service quality Q oS parameter, thereby all the service combinatorial paths in the service combination set of paths that is produced all are converted to unified serial service combinatorial path, constitute a serial service combination set of paths; Described service quality QoS parameter includes but not limited to service price, service time-delay, service reliability, service node CPU usage and nerve of a covering link bandwidth occupancy;
(34) target of optimizing according to the network payload of setting, the services selection module of LIST SERVER is passed through computation optimization, from described serial service combination set of paths, pick out an optimal service combinatorial path, then this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path.
5. a kind of composite services method that realizes that network payload is optimized according to claim 4 is characterized in that: the services selection module of LIST SERVER to the concrete grammar that serial structure, parallel organization, choice structure, loop structure in the service combinatorial path carry out service quality QoS conversion process of equal value respectively is in the described step (33):
(331) for serial structure, the equivalent service price parameter that converts to behind the cellular construction is the price sum of selected atom service in the former serial structure; The equivalent service delay parameter is the time-delay sum of selected atom service in the former serial structure; The equivalent service dependability parameter is that selected atom reliability of service parameter is long-pending in the former serial structure; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former serial structure; The nerve of a covering link bandwidth occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former serial structure;
(332) for parallel organization, the equivalent service price parameter that converts to behind the cellular construction is the price sum of selected atom service in the former parallel organization; The equivalent service delay parameter is the maximum delay value in the selected atom service in the former parallel organization; The equivalent service dependability parameter is that selected atom reliability of service parameter is long-pending in the former parallel organization; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former parallel organization; The nerve of a covering link bandwidth occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former parallel organization;
(333) for choice structure, the equivalent service price parameter that converts to behind the cellular construction is the price of selected atom service in the former choice structure; The equivalent service delay parameter is the time-delay of selected atom service in the former choice structure; The equivalent service dependability parameter is a selected atom reliability of service parameter in the former choice structure; The CPU usage parameter of equal value of cellular construction is the CPU usage that the service node of selected atom service is provided in the former choice structure; The nerve of a covering link occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link occupancy that the service node of selected atom service is provided in the former choice structure;
(334) for loop structure, be provided with N circulation, N is the natural number greater than 1, convert equivalent service price parameter behind the cellular construction to and be once circulate in the former loop structure selected atom service the price sum N doubly; The equivalent service delay parameter be once circulate in the former loop structure selected atom service the time-delay sum N doubly; The equivalent service dependability parameter is that the selected atom reliability of service parameter that once circulates in the former loop structure is long-pending; The CPU usage parameter of equal value of cellular construction is the maximum of CPU usage that the service node of selected atom service is provided in the former loop structure; The nerve of a covering link occupancy parameter of equal value of cellular construction is the maximum of input and output nerve of a covering link bandwidth occupancy that the service node of selected atom service is provided in the former loop structure.
6. according to claim 4 and 5 described a kind of composite services methods that realize that network payload is optimized, it is characterized in that: the network payload optimization aim particular content of setting in the described step (34) is:
Under the requirement of satisfying price, time-delay and the reliability of user to composite services, the CPU usage of equal value of optimal service combinatorial path and the weighted average of nerve of a covering link occupancy of equal value are minimum or inferior little; The CPU usage of equal value of described optimal service combinatorial path is meant the maximum of the CPU usage of equal value of the cellular construction that constitutes the optimal service combinatorial path, and the nerve of a covering link occupancy of equal value of described optimal service combinatorial path is meant the maximum of the nerve of a covering link occupancy of equal value of the cellular construction that constitutes the optimal service combinatorial path; The price of equal value of optimal service combinatorial path otherwise greater than the price of the composite services that the user proposed, the price of equal value of described optimal service combinatorial path is meant the price sum of equal value of the cellular construction that constitutes the optimal service combinatorial path; The equivalence of optimal service combinatorial path time-delay otherwise greater than the time-delay of the composite services that the user proposed, the equivalence time-delay of described optimal service combinatorial path is meant the equivalence time-delay sum of the cellular construction that constitutes the optimal service combinatorial path; The reliability of equal value of optimal service combinatorial path otherwise less than the reliability of the composite services that the user proposed, the reliability of equal value of described optimal service combinatorial path is meant that the reliability of equal value of the cellular construction that constitutes the optimal service combinatorial path is long-pending.
7. a kind of composite services method that realizes that network payload is optimized according to claim 3, it is characterized in that: the content of operation of described step (1) specifically comprises:
(11) service node carries out the registration operation of atomic service to LIST SERVER, can realize that the concrete form of service registry SR message header is by increase service registry SR message header in the registration REGISTER of initial session protocol SIP message:
SR：service_name
；description
；service_node_id
；input
；output
；cost
；delay
；reliability
Wherein service_name is the atomic service name, description is the functional descriptions of atomic service, service_node_id is service node ID number that atomic service is provided, input is an input parameter, output is atomic service output result, cost is the price of atomic service, and delay is the service time-delay of atomic service, and reliability is the reliability of atomic service; After succeeding in registration, LIST SERVER for this atomic service distribute one atomic service ID number;
(12) service node carries out the cancellation operation of atomic service to LIST SERVER, can realize that the concrete form that the SU message header is nullified in service is by increase service cancellation SU message header in the NOTIFY of initial session protocol SIP:
SU：service_id
；service_node_id
；status＝stop
Wherein service_id is atomic service ID number, and service_node_id is service node ID number that atomic service is provided, and status is the atomic service state, and stop is the service of nullifying, and LIST SERVER is deleted it;
(13) the service quality QoS lastest imformation of the atomic service that provides regularly is provided to LIST SERVER service node, can realize that the concrete form that service quality QoS upgrades the QU message header is by in the NOTIFY of initial session protocol SIP, increasing service quality QoS renewal QU message header:
QU：service_id
；cost
；delay
；reliability
Wherein service_id is atomic service ID number, and cost is the price of atomic service, and delay is the service time-delay of atomic service, and reliability is the reliability of atomic service;
(14) service node regularly sends the network information at service coverage of living in place to LIST SERVER, can realize that the concrete form of network information NI message header is by increase network information NI message header in the NOTIFY of initial session protocol SIP:
NI：service_node_id
；CPU
；BW
Wherein service_node_id is service node ID number that atomic service is provided, and CPU is the CPU usage of this service node, and BW is the nerve of a covering link occupancy of this service node.
8. according to claim 3 and 4 described a kind of composite services methods that realize that network payload is optimized, it is characterized in that described optimal service combinatorial path is when carrying out, LIST SERVER can construct combination service execution path according to the optimal service combinatorial path, then this combination service execution path is sent to the service node that first atomic service is provided in this path.
9. a kind of composite services method that realizes that network payload is optimized according to claim 8, it is characterized in that LIST SERVER according to the concrete grammar in optimal service combinatorial path tectonic association service execution path is: combination service execution path is made of serial structure, parallel organization and loop structure; Serial structure adopts ID number of atomic service that "+" character carries out order to connect successively according to carrying out in proper order; Parallel organization adopts “ ﹠amp; " character connects ID number of the atomic service of execution arranged side by side; Loop structure adopts " N * (atomic service ID) " or " N * (serial structure) " or " N * (parallel organization) " to represent, wherein N is a natural number, the number of times of expression circulation, N * (atomic service ID) expression is carried out N time certain atomic service circulation, N * (serial structure) expression is to serial structure circulation execution N time, and N * (parallel organization) expression circulates to parallel organization and carries out N time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101485383A CN102201995B (en) | 2011-06-03 | 2011-06-03 | Combination service method for realizing network load optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101485383A CN102201995B (en) | 2011-06-03 | 2011-06-03 | Combination service method for realizing network load optimization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102201995A true CN102201995A (en) | 2011-09-28 |
| CN102201995B CN102201995B (en) | 2013-12-04 |
Family
ID=44662396
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011101485383A Expired - Fee Related CN102201995B (en) | 2011-06-03 | 2011-06-03 | Combination service method for realizing network load optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102201995B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102523269A (en) * | 2011-12-08 | 2012-06-27 | 杭州电子科技大学 | High-reliability service composition method in dynamic network environment |
| CN103268523A (en) * | 2013-05-28 | 2013-08-28 | 北京邮电大学 | Service combination method for achieving meeting multiple performance index requirements simultaneously |
| CN103338269A (en) * | 2013-07-19 | 2013-10-02 | 中国人民解放军信息工程大学 | Data transmission method and device |
| CN104022951A (en) * | 2014-06-18 | 2014-09-03 | 中国人民解放军信息工程大学 | Building method and system for network service path |
| CN104917629A (en) * | 2015-04-14 | 2015-09-16 | 中国人民解放军信息工程大学 | Multi-switching-node cooperation meta-ability scheduling method |
| CN104954232A (en) * | 2014-03-28 | 2015-09-30 | 杭州华为企业通信技术有限公司 | Method and device for service combination in network |
| CN105530312A (en) * | 2015-12-26 | 2016-04-27 | 中国人民解放军信息工程大学 | Network service path selection system and selection method |
| CN106201706A (en) * | 2015-04-30 | 2016-12-07 | 北大方正集团有限公司 | A kind of population method for service selection and system |
| CN106411623A (en) * | 2016-12-21 | 2017-02-15 | 国网江西省电力公司信息通信分公司 | Transaction combination based service quality performance forecasting method and device |
| CN107743074A (en) * | 2017-10-17 | 2018-02-27 | 海南大学 | A kind of degree of belief evaluation method of composite services |
| CN109040152A (en) * | 2017-06-08 | 2018-12-18 | 阿里巴巴集团控股有限公司 | A kind of service request and providing method based on service orchestration, device and electronic equipment |
| CN109962850A (en) * | 2017-12-14 | 2019-07-02 | 中国电信股份有限公司 | The method and controller and computer readable storage medium of realization Segment routing |
| CN111107113A (en) * | 2018-10-25 | 2020-05-05 | 中国移动通信集团广东有限公司 | Video data transmission method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1764183A (en) * | 2005-11-03 | 2006-04-26 | 西安交通大学 | QoS driven computer system for providing combined Web service based on computer network |
| CN101729521A (en) * | 2008-10-30 | 2010-06-09 | 华为技术有限公司 | Deploying method and deploying device for combined service |
| CN101820365A (en) * | 2010-01-04 | 2010-09-01 | 北京航空航天大学 | Service bus supporting dynamic optimization of QoS of composite service |
| CN101997731A (en) * | 2009-08-18 | 2011-03-30 | 华为技术有限公司 | Method, device and system for providing World Wide Web service |
-
2011
- 2011-06-03 CN CN2011101485383A patent/CN102201995B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1764183A (en) * | 2005-11-03 | 2006-04-26 | 西安交通大学 | QoS driven computer system for providing combined Web service based on computer network |
| CN101729521A (en) * | 2008-10-30 | 2010-06-09 | 华为技术有限公司 | Deploying method and deploying device for combined service |
| CN101997731A (en) * | 2009-08-18 | 2011-03-30 | 华为技术有限公司 | Method, device and system for providing World Wide Web service |
| CN101820365A (en) * | 2010-01-04 | 2010-09-01 | 北京航空航天大学 | Service bus supporting dynamic optimization of QoS of composite service |
Non-Patent Citations (1)
| Title |
|---|
| CHUN ZHANG,ET AL: "QoS-Aware Optimization of Composite-Service Fulfillment Policy", 《2007 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (SCC 2007)》, 13 July 2007 (2007-07-13), pages 11 - 19, XP031119452 * |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102523269B (en) * | 2011-12-08 | 2014-07-09 | 杭州电子科技大学 | High-reliability service composition method in dynamic network environment |
| CN102523269A (en) * | 2011-12-08 | 2012-06-27 | 杭州电子科技大学 | High-reliability service composition method in dynamic network environment |
| CN103268523B (en) * | 2013-05-28 | 2016-08-10 | 北京邮电大学 | A kind of realize multiple performance indications require simultaneously meet service combining method |
| CN103268523A (en) * | 2013-05-28 | 2013-08-28 | 北京邮电大学 | Service combination method for achieving meeting multiple performance index requirements simultaneously |
| CN103338269A (en) * | 2013-07-19 | 2013-10-02 | 中国人民解放军信息工程大学 | Data transmission method and device |
| CN103338269B (en) * | 2013-07-19 | 2016-12-28 | 中国人民解放军信息工程大学 | A kind of data transmission method and device |
| CN104954232A (en) * | 2014-03-28 | 2015-09-30 | 杭州华为企业通信技术有限公司 | Method and device for service combination in network |
| CN104022951A (en) * | 2014-06-18 | 2014-09-03 | 中国人民解放军信息工程大学 | Building method and system for network service path |
| CN104917629A (en) * | 2015-04-14 | 2015-09-16 | 中国人民解放军信息工程大学 | Multi-switching-node cooperation meta-ability scheduling method |
| CN104917629B (en) * | 2015-04-14 | 2018-08-17 | 中国人民解放军信息工程大学 | First ability method of combination of more switching node collaborations |
| CN106201706A (en) * | 2015-04-30 | 2016-12-07 | 北大方正集团有限公司 | A kind of population method for service selection and system |
| CN105530312A (en) * | 2015-12-26 | 2016-04-27 | 中国人民解放军信息工程大学 | Network service path selection system and selection method |
| CN105530312B (en) * | 2015-12-26 | 2018-08-14 | 中国人民解放军信息工程大学 | Network service path selects system and its selection method |
| CN106411623A (en) * | 2016-12-21 | 2017-02-15 | 国网江西省电力公司信息通信分公司 | Transaction combination based service quality performance forecasting method and device |
| CN109040152A (en) * | 2017-06-08 | 2018-12-18 | 阿里巴巴集团控股有限公司 | A kind of service request and providing method based on service orchestration, device and electronic equipment |
| CN107743074A (en) * | 2017-10-17 | 2018-02-27 | 海南大学 | A kind of degree of belief evaluation method of composite services |
| CN107743074B (en) * | 2017-10-17 | 2021-03-16 | 海南大学 | Trust degree estimation method of combined service |
| CN109962850A (en) * | 2017-12-14 | 2019-07-02 | 中国电信股份有限公司 | The method and controller and computer readable storage medium of realization Segment routing |
| CN111107113A (en) * | 2018-10-25 | 2020-05-05 | 中国移动通信集团广东有限公司 | Video data transmission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102201995B (en) | 2013-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102201995B (en) | Combination service method for realizing network load optimization | |
| Jiang et al. | Low-latency networking: Where latency lurks and how to tame it | |
| WO2022011862A1 (en) | Method and system for communication between o-ran and mec | |
| CN109863493A (en) | On-demand system information for aerogram | |
| JP6752281B2 (en) | Software Defined Topology for User Plane (SDT) | |
| CN101969469A (en) | Callback processing method and device in telecom capability opening | |
| CN101305560A (en) | Method and communication system for selecting a transmission mode for transmitting useful data | |
| CN102148828A (en) | Network system and method for realizing click to dial service based on capability open platform | |
| US10484486B2 (en) | Capability opening method and system, and capability opening function entity | |
| CN100527883C (en) | Method and system for insuring service chain service quality | |
| CN101237451B (en) | Middleware system of IP STB and its communication method | |
| CN113572864A (en) | Data processing method, network element equipment and readable storage medium | |
| CN103262563A (en) | Method for integrating functions of telecommunications network in data network | |
| CN101986606A (en) | Device and method for reconfiguration management of reconfigurable flexible network | |
| CN103686863B (en) | Realize the method and system of control signaling transmission | |
| CN101163106B (en) | Method of executing combined service in wireless self-organizing network | |
| Sagduyu et al. | Throughput optimal control for relay-assisted wireless broadcast with network coding | |
| CN101242548B (en) | A method for transmitting message via call service | |
| CN101632259A (en) | The 2nd layer management entity information receiving and transmitting framework in the network | |
| CN101163147B (en) | Adapting device and method of PARLAY gateway to wireless intelligent network protocol | |
| CN111416746B (en) | CDN-based data distribution method | |
| CN117440046B (en) | Data processing method and device for power computing network | |
| WO2022111311A1 (en) | Network slicing method and apparatus, electronic device, and storage medium | |
| Karmouch et al. | Capability reconciliation for virtual device composition in mobile ad hoc networks | |
| US20230308355A1 (en) | Systems and methods of visualizing data in a cellular network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131204 Termination date: 20150603 |
|
| EXPY | Termination of patent right or utility model |