CN102201995B - Combination service method for realizing network load optimization - Google Patents
Combination service method for realizing network load optimization Download PDFInfo
- Publication number
- CN102201995B CN102201995B CN2011101485383A CN201110148538A CN102201995B CN 102201995 B CN102201995 B CN 102201995B CN 2011101485383 A CN2011101485383 A CN 2011101485383A CN 201110148538 A CN201110148538 A CN 201110148538A CN 102201995 B CN102201995 B CN 102201995B
- Authority
- CN
- China
- Prior art keywords
- service
- atomic
- parameter
- node
- path
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (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 method that realizes that network payload is optimized, belong to areas of information technology, particularly belong to the multimedia communication technology field based on internet.
Background technology
Development along with information technology, especially the intelligent business that the development of technique of internet and telecommunication technology more and more has a characteristics of the multimedia 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.Generally by some, basic Services Composition forms in composite services, and these basic services are called as atomic service.Composite services can be regarded a service chaining consisted of atomic service as, are collectively referred to as in the present invention " Services Composition path ".Under the condition of market competition, the same atomic service can be provided by different service providers, is deployed on different network-node servers, has the QoS parameter QoS such as different prices, reliability, service time delay, the network bandwidth.Propose some composite services for the user, realize that just there are a lot of bars in the Services Composition path of the composite services that this is concrete, when composite services become complicated, the selectable scope of atomic service while becoming large, the number in Services Composition path can sharply expand.Under the requirement that meets the preconditions such as price, reliability and service time delay of user to composite services, how from the Services Composition path of enormous amount, select the Services Composition path of an optimum or suboptimum, make the load ratio of network optimize a technical barrier that becomes the solution of current 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 method that realizes that network payload is optimized, under the requirement that meets the preconditions such as price, reliability and service time delay of user to composite services, guarantee load equalization and the optimization of network.
In order to achieve the above object,
The invention provides a kind of composite services method that realizes that network payload is optimized, the method comprises following operating procedure:
(1) service node carries out registration or the cancellation of atomic service to LIST SERVER, and, according to the cycle of setting, regularly to LIST SERVER, sends the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place; LIST SERVER, according to the function of atomic service, is divided into different atomic service set, classifies and stores and management;
Described service node carries out the registration operation of atomic service to LIST SERVER, can realize by increasing service registry SR message header in the registration REGISTER message at initial session protocol SIP, and the concrete form of service registry SR message header is:
SR：service_name
；description
；service_node_id
；input
；output
；cost
；delay
；reliability
Wherein service_name is the atomic service name, the functional descriptions that description is atomic service, service_node_id is No. ID, service node that atomic service is provided, input is input parameter, output is the atomic service Output rusults, the price that cost is atomic service, the service time delay that delay is atomic service, the reliability that reliability is atomic service; After succeeding in registration, LIST SERVER distributes an atomic service No. ID for this atomic service;
Described service node carries out the cancellation operation of atomic service to LIST SERVER, can realize by increasing service cancellation SU message header in the NOTIFY at initial session protocol SIP, and the concrete form that the SU message header is nullified in service is:
SU：service_id
；service_node_id
；status＝stop
Wherein service_id is No. ID, atomic service, and service_node_id is No. ID, service node 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.
The service quality QoS lastest imformation of the atomic service that provides regularly is provided to LIST SERVER described service node, can realize by increasing service quality QoS renewal QU message header in the NOTIFY at initial session protocol SIP, the concrete form that service quality QoS upgrades the QU message header is:
QU：service_name
；cost
；delay
；reliability
Wherein service_name is the atomic service name, the price that cost is atomic service, the service time delay that delay is atomic service, the reliability that reliability is atomic service.
Described service node regularly sends the network information at service coverage of living in place to LIST SERVER, can realize by increasing network information NI message header in the NOTIFY at initial session protocol SIP, and the concrete form of network information NI message header is:
NI：service_node_id
；CPU
；BW
Wherein service_node_id is No. ID, service node 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.
(2) gateway receives user's composite services request, after carrying out corresponding format conversion, request message is sent to LIST SERVER;
(3) LIST SERVER, according to user's composite services solicited message, calculates and obtains an optimal service combinatorial path, finally this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
(4) each service node, according to the order of appointment in the optimal service combinatorial path, is carried out corresponding atomic service successively;
(5), after all atomic service all are finished, by the service node of carrying out last atomic service, execution result is sent to gateway;
(6) after gateway carries out corresponding format conversion to the execution result of composite services, send to the user;
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 the service information table stored in the inquiry service catalogue module and network information table, produce the Services Composition set of paths;
(33) for ease of optimizing, calculate, the services selection module of LIST SERVER is carried out respectively service quality QoS parameter conversion process of equal value to the serial structure in the Services Composition path, parallel organization, choice structure, loop structure, serial structure, parallel organization, choice structure, loop structure are changed into to the cellular construction with equivalent service quality Q oS parameter, thereby all Services Compositions path in produced Services Composition set of paths all is converted to unified serial Services Composition path, forms a serial Services Composition 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 calculated by optimization, pick out an optimal service combinatorial path from described serial Services Composition set of paths, then this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
The concrete grammar that in described step (33), the services selection module of LIST SERVER is carried out respectively service quality QoS conversion process of equal value to the serial structure in the Services Composition path, parallel organization, choice structure, loop structure is:
(331), for serial structure, the equivalent service price parameter converted to after cellular construction is the price sum of selected atom service in former serial structure; The equivalent service delay parameter is the time delay sum of selected atom service in former serial structure; The equivalent service dependability parameter is that in former serial structure, selected atom reliability of service parameter 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 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 former serial structure;
(332), for parallel organization, the equivalent service price parameter converted to after cellular construction is the price sum of selected atom service in former parallel organization; The equivalent service delay parameter is the maximum delay value in the selected atom service in former parallel organization; The equivalent service dependability parameter is that in former parallel organization, selected atom reliability of service parameter 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 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 former parallel organization;
(333), for choice structure, the equivalent service price parameter converted to after cellular construction is the price of selected atom service in former choice structure; The equivalent service delay parameter is the time delay of selected atom service in former choice structure; The equivalent service dependability parameter is selected atom reliability of service parameter in 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 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 former choice structure;
(334) for loop structure, be provided with N circulation, N is greater than 1 natural number, convert equivalent service price parameter after cellular construction to and be in former loop structure, once circulate the selected atom service the price sum N doubly; The equivalent service delay parameter be in former loop structure, once circulate 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 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 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 former loop structure;
The network payload optimization aim particular content of setting in described step (34) is:
Under the requirement that meets 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 refers to the maximum of the CPU usage of equal value of the cellular construction that forms the optimal service combinatorial path, and the nerve of a covering link occupancy of equal value of described optimal service combinatorial path refers to the maximum of the nerve of a covering link occupancy of equal value of the cellular construction that forms the optimal service combinatorial path; The price of equal value of optimal service combinatorial path will be not more than the price of the composite services that the user proposes, and the price of equal value of described optimal service combinatorial path refers to the price sum of equal value of the cellular construction that forms the optimal service combinatorial path; The time delay of equal value of optimal service combinatorial path will be not more than the time delay of the composite services that the user proposes, and the time delay of equal value of described optimal service combinatorial path refers to the time delay sum of equal value of the cellular construction that forms the optimal service combinatorial path; The reliability of equal value of optimal service combinatorial path will be not less than the reliability of the composite services that the user proposes, and the reliability of equal value of described optimal service combinatorial path refers to that the reliability of equal value of the cellular construction that forms 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 consists of serial structure, parallel organization and loop structure; Serial structure adopts "+" character connecting successively according to carrying out in proper order for No. ID the atomic service of order execution; Parallel organization adopts “ & " character connected for No. ID 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 mean, wherein N is natural number, the number of times that means circulation, N * (atomic service ID) means certain atomic service circulation is carried out N time, N * (serial structure) means that circulation is carried out N time to serial structure, and N * (parallel organization) means that circulation is carried out N time to parallel organization;
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 again the network payload equalize trend, thereby improve the service quality of network in general, improve user's service experience.
The accompanying drawing explanation
Fig. 1 be the present invention realize composite services method that network payload is optimized based on the schematic diagram of service coverage.
Fig. 2 be the present invention realize composite services method that network payload is optimized based on the structural representation of LIST SERVER.
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 of serial structure in Services Composition of the present invention path.
Fig. 5 is the schematic diagram of parallel organization in Services Composition of the present invention path.
Fig. 6 is the schematic diagram of choice structure in Services Composition of the present invention path.
Fig. 7 is the schematic diagram of loop structure in Services Composition of the present invention 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, below in conjunction with accompanying drawing, the present invention is described in further detail.
Referring to Fig. 1, introduce the present invention realize the network payload optimization method based on the composite services system, this system includes but not limited to:
Gateway, reception user's composite services solicited message, carry out necessary format conversion to service request information, then sends to LIST SERVER; After composite services are carried out and finished, gateway receives the composite services execution result that service node returns, and after execution result is carried out to necessary format conversion, sends to the user;
LIST SERVER, receive and store 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, at first, according to the Functional Requirement of user's composite services, produce the Services Composition set of paths; Then according to the non-functional requirement of user's composite services, select optimum Services Composition path from the Services Composition set of paths, optimum Services Composition path is sent to the service node that first atomic service is provided in this path;
Service node, provide atomic service, to LIST SERVER, registers the atomic service that it provides, and log-on message comprises function information and the non-functional information of atomic service; According to the cycle of setting, regularly to LIST SERVER, send the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place; Receive the optimal service combinatorial path that LIST SERVER and/or other service nodes send over, carry out the wherein current atomic service be 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, be connected into service coverage by the nerve of a covering link between gateway, LIST SERVER, service node, to the user, provides composite services; Wherein said nerve of a covering link refer to connect between gateway and LIST SERVER, the logical links between LIST SERVER and service node, between service node and service node, between gateway and service node, actual corresponding the physical link of one or more reality of each nerve of a covering link;
Referring to Fig. 2, introduce composite services method that the present invention realizes that network payload is optimized based on LIST SERVER, this LIST SERVER comprises as lower module:
Message resolution module, receive the composite services request message from gateway, is transmitted to the services selection module after being resolved; Reception is from the message of service node, send to the service catalogue module after being resolved, include but not limited to from the message of service node: the nerve of a covering network information that the service quality QoS updating message that the atomic service registration that service node sends or logout message, service node regularly send, service node regularly send;
The service catalogue module, the service information table of the atomic service that the stores service node provides, 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 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 mean by 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 receipt message parsing module sends over, the service information table stored in the inquiry service catalogue module and network information table, according to the Functional Requirement in the composite services solicited message and non-functional requirement, calculate acquisition and meet the optimal service combinatorial path of this composite services request, and this optimal service combinatorial path is sent to message transmission module;
Message transmission module, receive the information from service catalogue module and services selection module, according to the form of setting, is configured to send to gateway or service node after message;
Referring to Fig. 3, introduce the composite services method that the present invention realizes that network payload is optimized, the method comprises following operating procedure:
(1) service node carries out registration or the cancellation of atomic service to LIST SERVER, and, according to the cycle of setting, regularly to LIST SERVER, sends the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place; LIST SERVER, according to the function of atomic service, is divided into different atomic service set, classifies and stores and management;
Described service node carries out the registration operation of atomic service to LIST SERVER, can realize by increasing service registry SR message header in the registration REGISTER message at initial session protocol SIP, and the concrete form of service registry SR message header is:
SR：service_name
；description
；service_node_id
；input
；output
；cost
；delay
；reliability
Wherein service_name is the atomic service name, the functional descriptions that description is atomic service, service_node_id is No. ID, service node that atomic service is provided, input is input parameter, output is the atomic service Output rusults, the price that cost is atomic service, the service time delay that delay is atomic service, the reliability that reliability is atomic service; After succeeding in registration, LIST SERVER distributes an atomic service No. ID for this atomic service;
Described service node carries out the cancellation operation of atomic service to LIST SERVER, can realize by increasing service cancellation SU message header in the NOTIFY at initial session protocol SIP, and the concrete form that the SU message header is nullified in service is:
SU：service_id
；service_node_id
；status＝stop
Wherein service_name is No. ID, atomic service, and service_node_id is No. ID, service node 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.
The service quality QoS lastest imformation of the atomic service that provides regularly is provided to LIST SERVER described service node, can realize by increasing service quality QoS renewal QU message header in the NOTIFY at initial session protocol SIP, the concrete form that service quality QoS upgrades the QU message header is:
QU：service_id
；cost
；delay
；reliability
Wherein service_id is No. ID, atomic service, the price that cost is atomic service, the service time delay that delay is atomic service, the reliability that reliability is atomic service.
Described service node regularly sends the network information at service coverage of living in place to LIST SERVER, can realize by increasing network information NI message header in the NOTIFY at initial session protocol SIP, and the concrete form of network information NI message header is:
NI：service_node_id
；CPU
；BW
Wherein service_node_id is No. ID, service node 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.
(2) gateway receives user's composite services request, after carrying out corresponding format conversion, request message is sent to LIST SERVER;
(3) LIST SERVER, according to user's composite services solicited message, calculates and obtains an optimal service combinatorial path, finally this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
(4) each service node, according to the order of appointment in the optimal service combinatorial path, is carried out corresponding atomic service successively;
(5), after all atomic service all are finished, by the service node of carrying out last atomic service, execution result is sent to gateway;
(6) after gateway carries out corresponding format conversion to the execution result of composite services, send to the user;
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 the service information table stored in the inquiry service catalogue module and network information table, produce the Services Composition set of paths;
(33) for ease of optimizing, calculate, the services selection module of LIST SERVER is carried out respectively service quality QoS parameter conversion process of equal value to the serial structure in the Services Composition path, parallel organization, choice structure, loop structure, serial structure, parallel organization, choice structure, loop structure are changed into to the cellular construction with equivalent service quality Q oS parameter, thereby all Services Compositions path in produced Services Composition set of paths all is converted to unified serial Services Composition path, forms a serial Services Composition 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 calculated by optimization, pick out an optimal service combinatorial path from described serial Services Composition set of paths, then this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
The concrete grammar that in above-mentioned steps (33), the services selection module of LIST SERVER is carried out respectively service quality QoS conversion process of equal value to the serial structure in the Services Composition path, parallel organization, choice structure, loop structure is:
(331), for serial structure, the equivalent service price parameter converted to after cellular construction is the price sum of selected atom service in former serial structure; The equivalent service delay parameter is the time delay sum of selected atom service in former serial structure; The equivalent service dependability parameter is that in former serial structure, selected atom reliability of service parameter 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 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 former serial structure;
Referring to Fig. 4, the serial structure shown in figure is comprised of two atomic service, by service node 1 and 2, is provided respectively, design parameter is: the price of atomic service 1 is 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.After converting cellular construction to, its equivalent parameter is: 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 RMB is divided; Timer also can be come to select according to the actual needs, as millisecond.
(332), for parallel organization, the equivalent service price parameter converted to after cellular construction is the price sum of selected atom service in former parallel organization; The equivalent service delay parameter is the maximum delay value in the selected atom service in former parallel organization; The equivalent service dependability parameter is that in former parallel organization, selected atom reliability of service parameter 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 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 former parallel organization;
Referring to Fig. 5, parallel organization shown in figure is comprised of two atomic service, by service node 1 and 2, provided respectively, design parameter is: the price of atomic service 1 is 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.After converting cellular construction to, its equivalent parameter is: 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 RMB is divided; Timer also can be come to select according to the actual needs, as millisecond.
(333), for choice structure, the equivalent service price parameter converted to after cellular construction is the price of selected atom service in former choice structure; The equivalent service delay parameter is the time delay of selected atom service in former choice structure; The equivalent service dependability parameter is selected atom reliability of service parameter in 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 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 former choice structure;
Referring to Fig. 6, choice structure shown in figure is comprised of two atomic service, by service node 1 and 2, provided respectively, design parameter is: the price of atomic service 1 is 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, convert cellular construction to after its equivalent parameter be: price is 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, 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 RMB is divided; Timer also can be come to select according to the actual needs, as millisecond.
(334) for loop structure, be provided with N circulation, N is greater than 1 natural number, convert equivalent service price parameter after cellular construction to and be in former loop structure, once circulate the selected atom service the price sum N doubly; The equivalent service delay parameter be in former loop structure, once circulate 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 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 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 former loop structure;
Referring to Fig. 7, the loop structure shown in figure is comprised of two atomic service, by service node 1 and 2, is provided respectively, and cycle-index is 2.Design parameter is: the price of atomic service 1 is 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 serving the 2 link bandwidth occupancies to service 1 is 0.8.After converting cellular construction to, its equivalent parameter is: 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 RMB is divided; Timer also can be come to select according to the actual needs, as millisecond.
The input nerve of a covering link of service node recited above refers to 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 refers to 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 described step (34) be:
Under the requirement that meets 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 refers to the maximum of the CPU usage of equal value of the cellular construction that forms the optimal service combinatorial path, and the nerve of a covering link occupancy of equal value of described optimal service combinatorial path refers to the maximum of the nerve of a covering link occupancy of equal value of the cellular construction that forms the optimal service combinatorial path; The price of equal value of optimal service combinatorial path will be not more than the price of the composite services that the user proposes, and the price of equal value of described optimal service combinatorial path refers to the price sum of equal value of the cellular construction that forms the optimal service combinatorial path; The time delay of equal value of optimal service combinatorial path will be not more than the time delay of the composite services that the user proposes, and the time delay of equal value of described optimal service combinatorial path refers to the time delay sum of equal value of the cellular construction that forms the optimal service combinatorial path; The reliability of equal value of optimal service combinatorial path will be not less than the reliability of the composite services that the user proposes, and the reliability of equal value of described optimal service combinatorial path refers to that the reliability of equal value of the cellular construction that forms 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 consists of serial structure, parallel organization and loop structure; Serial structure adopts "+" character connecting successively according to carrying out in proper order for No. ID the atomic service of order execution; Parallel organization adopts “ & " character connected for No. ID 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 mean, wherein N is natural number, the number of times that means circulation, N * (atomic service ID) means certain atomic service circulation is carried out N time, N * (serial structure) means that circulation is carried out N time to serial structure, and N * (parallel organization) means that circulation is carried out N time to parallel organization;
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 mobile phone by short message mode.Referring to Fig. 8, for these composite services, LIST SERVER, according to the function of its business, is decomposed into following four atomic service to it: language and characters conversion atomic service, search the hotel atomic service, search restaurant the service atom, word is 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 the LIST SERVER atomic service composed atom set of service identical function, and there is the atomic service more than each atomic service set the inside.In this example, the situations such as function of atomic service set, atomic service and the atomic service related 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 word 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 hotel; Atomic service S
3I
1At atomic service S set S
3In, its function is to subscribe restaurant; Atomic service S
4I
1, S
4I
2At atomic service S set S
4In, its function is that the designated tone word is sent to mobile phone;
The parameter of above-mentioned each atomic service is as described in table 2 and 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 Services Composition path has 8, as shown in table 4; Equivalent parameter the method according to this invention result of calculation in these 8 Services Composition paths is also as shown in table 4.Suppose in example, the user need be that price is less than or equal to 8 to the requirement of composite services, time delay is less than or equal to 8, the words that reliability is greater than 0.5, the Services Composition path of finding out so is the path that sequence number is 1 and 7, from wherein finding out again the ，Ci path, Services Composition path that is 7 for sequence number that makes CPU usage add the bandwidth usage minimum, it is the optimal service combinatorial path; The combination service execution path be configured to according to this optimal service combinatorial path is: S
1I
2+ S
2I
2& S
3I
1+ S
4I
1, LIST SERVER sends to this combination service execution path on this path first atomic service S is provided
1I
2Service node SN2.
Table 4
| Sequence number | The Services Composition 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 (6)
1. a 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 registration or the cancellation of atomic service to LIST SERVER, and, according to the cycle of setting, regularly to LIST SERVER, sends the service quality QoS lastest imformation of the atomic service that provides and the network information at service coverage of living in place; LIST SERVER, according to the function of atomic service, is divided into different atomic service set, classifies and stores and management;
Described service node carries out the registration operation of atomic service to LIST SERVER, can realize by increasing service registry SR message header in the registration REGISTER message at initial session protocol SIP, and the concrete form of service registry SR message header is:
SR：service_name
；description
；service_node_id
；input
；output
；cost
；delay
；reliability
Wherein service_name is the atomic service name, the functional descriptions that description is atomic service, service_node_id is No. ID, service node that atomic service is provided, input is input parameter, output is the atomic service Output rusults, the price that cost is atomic service, the service time delay that delay is atomic service, the reliability that reliability is atomic service; After succeeding in registration, LIST SERVER distributes an atomic service No. ID for this atomic service;
Described service node carries out the cancellation operation of atomic service to LIST SERVER, can realize by increasing service cancellation SU message header in the NOTIFY at initial session protocol SIP, and the concrete form that the SU message header is nullified in service is:
SU：service_id
；service_node_id
；status＝stop
Wherein service_id is No. ID, atomic service, and service_node_id is No. ID, service node 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;
The service quality QoS lastest imformation of the atomic service that provides regularly is provided to LIST SERVER described service node, can realize by increasing service quality QoS renewal QU message header in the NOTIFY at initial session protocol SIP, the concrete form that service quality QoS upgrades the QU message header is:
QU：service_id
；cost
；delay
；reliability
Wherein service_id is No. ID, atomic service, the price that cost is atomic service, the service time delay that delay is atomic service, the reliability that reliability is atomic service;
Described service node regularly sends the network information at service coverage of living in place to LIST SERVER, can realize by increasing network information NI message header in the NOTIFY at initial session protocol SIP, and the concrete form of network information NI message header is:
NI：service_node_id
；CPU
；BW
Wherein service_node_id is No. ID, service node 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;
(2) gateway receives user's composite services request, after carrying out corresponding format conversion, request message is sent to LIST SERVER;
(3) LIST SERVER, according to user's composite services solicited message, calculates and obtains an optimal service combinatorial path, finally this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path;
(4) each service node, according to the order of appointment in the optimal service combinatorial path, is carried out corresponding atomic service successively;
(5), after all atomic service all are finished, by the service node of carrying out last atomic service, execution result is sent to gateway;
(6) after gateway carries out corresponding format conversion to the execution result of composite services, send to the user.
2. a kind of composite services method that realizes that network payload is optimized according to claim 1, 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 the service information table stored in the inquiry service catalogue module and network information table, produce the Services Composition set of paths;
(33) for ease of optimizing, calculate, the services selection module of LIST SERVER is carried out respectively service quality QoS parameter conversion process of equal value to the serial structure in the Services Composition path, parallel organization, choice structure, loop structure, serial structure, parallel organization, choice structure, loop structure are changed into to the cellular construction with equivalent service quality Q oS parameter, thereby all Services Compositions path in produced Services Composition set of paths all is converted to unified serial Services Composition path, forms a serial Services Composition 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 calculated by optimization, pick out an optimal service combinatorial path from described serial Services Composition set of paths, then this optimal service combinatorial path is sent to the service node that first atomic service is provided in this path.
3. a kind of composite services method that realizes that network payload is optimized according to claim 2, it is characterized in that: the concrete grammar that in described step (33), the services selection module of LIST SERVER is carried out respectively service quality QoS conversion process of equal value to the serial structure in the Services Composition path, parallel organization, choice structure, loop structure is:
(331), for serial structure, the equivalent service price parameter converted to after cellular construction is the price sum of selected atom service in former serial structure; The equivalent service delay parameter is the time delay sum of selected atom service in former serial structure; The equivalent service dependability parameter is that in former serial structure, selected atom reliability of service parameter 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 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 former serial structure;
(332), for parallel organization, the equivalent service price parameter converted to after cellular construction is the price sum of selected atom service in former parallel organization; The equivalent service delay parameter is the maximum delay value in the selected atom service in former parallel organization; The equivalent service dependability parameter is that in former parallel organization, selected atom reliability of service parameter 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 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 former parallel organization;
(333), for choice structure, the equivalent service price parameter converted to after cellular construction is the price of selected atom service in former choice structure; The equivalent service delay parameter is the time delay of selected atom service in former choice structure; The equivalent service dependability parameter is selected atom reliability of service parameter in 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 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 former choice structure;
(334) for loop structure, be provided with N circulation, N is greater than 1 natural number, convert equivalent service price parameter after cellular construction to and be in former loop structure, once circulate the selected atom service the price sum N doubly; The equivalent service delay parameter be in former loop structure, once circulate 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 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 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 former loop structure.
4. a kind of composite services method that realizes that network payload is optimized according to claim 2, it is characterized in that: the network payload optimization aim particular content of setting in described step (34) is:
Under the requirement that meets 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 refers to the maximum of the CPU usage of equal value of the cellular construction that forms the optimal service combinatorial path, and the nerve of a covering link occupancy of equal value of described optimal service combinatorial path refers to the maximum of the nerve of a covering link occupancy of equal value of the cellular construction that forms the optimal service combinatorial path; The price of equal value of optimal service combinatorial path will be not more than the price of the composite services that the user proposes, and the price of equal value of described optimal service combinatorial path refers to the price sum of equal value of the cellular construction that forms the optimal service combinatorial path; The time delay of equal value of optimal service combinatorial path will be not more than the time delay of the composite services that the user proposes, and the time delay of equal value of described optimal service combinatorial path refers to the time delay sum of equal value of the cellular construction that forms the optimal service combinatorial path; The reliability of equal value of optimal service combinatorial path will be not less than the reliability of the composite services that the user proposes, and the reliability of equal value of described optimal service combinatorial path refers to that the reliability of equal value of the cellular construction that forms the optimal service combinatorial path is long-pending.
5. a kind of composite services method that realizes that network payload is optimized according to claim 1 and 2, 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.
6. a kind of composite services method that realizes that network payload is optimized according to claim 5, 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 consists of serial structure, parallel organization and loop structure; Serial structure adopts "+" character connecting successively according to carrying out in proper order for No. ID the atomic service of order execution; Parallel organization adopts “ & " character connected for No. ID 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 mean, wherein N is natural number, the number of times that means circulation, N * (atomic service ID) means certain atomic service circulation is carried out N time, N * (serial structure) means that circulation is carried out N time to serial structure, and N * (parallel organization) means that circulation is carried out N time to parallel organization.
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 CN102201995A (en) | 2011-09-28 |
| CN102201995B true 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) |
Families Citing this family (13)
| 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 |
| CN103268523B (en) * | 2013-05-28 | 2016-08-10 | 北京邮电大学 | A kind of realize multiple performance indications require simultaneously meet service combining method |
| 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 |
| CN104022951B (en) * | 2014-06-18 | 2018-03-23 | 中国人民解放军信息工程大学 | A kind of method for building up and system in network service path |
| 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 |
| 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 |
| CN109040152B (en) * | 2017-06-08 | 2022-05-31 | 创新先进技术有限公司 | Service request and providing method and device based on service arrangement and electronic equipment |
| CN107743074B (en) * | 2017-10-17 | 2021-03-16 | 海南大学 | Trust degree estimation method of combined service |
| CN109962850B (en) * | 2017-12-14 | 2021-10-22 | 中国电信股份有限公司 | Method and controller for implementing segment routing and computer readable storage medium |
| CN111107113A (en) * | 2018-10-25 | 2020-05-05 | ***通信集团广东有限公司 | Video data transmission method and device |
Family Cites Families (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 |
| CN101729521B (en) * | 2008-10-30 | 2013-04-17 | 华为技术有限公司 | 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 |
| CN101820365B (en) * | 2010-01-04 | 2012-07-04 | 北京航空航天大学 | Service bus supporting dynamic optimization of QoS of composite service |
-
2011
- 2011-06-03 CN CN2011101485383A patent/CN102201995B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN102201995A (en) | 2011-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102201995B (en) | Combination service method for realizing network load optimization | |
| WO2022011862A1 (en) | Method and system for communication between o-ran and mec | |
| CN109863493A (en) | On-demand system information for aerogram | |
| KR101011994B1 (en) | Apparatus and method for providing end-to-end qos guarantee within service network | |
| JP6752281B2 (en) | Software Defined Topology for User Plane (SDT) | |
| CN101989913B (en) | Method and device for enabling network equipment in local area network to acquire service content | |
| CN101305560B (en) | Method and communication system for selecting a transmission mode for transmitting useful data | |
| CN101184082B (en) | Cluster user login method, state updating method, processing equipment, IMS network entity and communication system | |
| CN109845298A (en) | Use the wireless telecommunications method and device of system information values label | |
| CN100527883C (en) | Method and system for insuring service chain service quality | |
| CN101237451B (en) | Middleware system of IP STB and its communication method | |
| Zhong et al. | Joint optimal multicast scheduling and caching for improved performance and energy saving in wireless heterogeneous networks | |
| EP2627044A1 (en) | Path constructing device and path constructing method | |
| JP2009060608A (en) | METHOD OF PROCESSING CALL DURING PoC JOB AND PRESENCE INFORMATION RESERVED SUBSCRIPTION METHOD | |
| CN103686863B (en) | Realize the method and system of control signaling transmission | |
| CN101997887A (en) | Method for sending, receiving and transmitting service signaling and terminal | |
| Chini et al. | Dynamic resource allocation based on a TCP‐MAC cross‐layer approach for DVB‐RCS satellite networks | |
| CN112584193B (en) | Method for constructing real-time streaming media cluster scheduling by utilizing UDP (user datagram protocol) characteristics | |
| CN101163106B (en) | Method of executing combined service in wireless self-organizing network | |
| CN102802197A (en) | Method and device for transmitting application data | |
| CN111416746B (en) | CDN-based data distribution method | |
| CN105162618A (en) | Device interconnection method and device interconnection system based on Smart PnP protocol | |
| Noh et al. | Flexible communication-bus architecture for distributed multimedia service in cloud computing platform | |
| Zhao et al. | BSS: A Burst Error‐Correction Scheme of Multipath Transmission for Mobile Fog Computing | |
| Karmouch et al. | Capability reconciliation for virtual device composition in mobile ad hoc networks |
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 |