WO2006087518A1 - Process configuration in a network - Google Patents
Process configuration in a network Download PDFInfo
- Publication number
- WO2006087518A1 WO2006087518A1 PCT/GB2006/000407 GB2006000407W WO2006087518A1 WO 2006087518 A1 WO2006087518 A1 WO 2006087518A1 GB 2006000407 W GB2006000407 W GB 2006000407W WO 2006087518 A1 WO2006087518 A1 WO 2006087518A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- providing
- service
- nodes
- network
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0663—Performing the actions predefined by failover planning, e.g. switching to standby network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
- H04L41/0826—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for reduction of network costs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5058—Service discovery by the service manager
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
Definitions
- the present invention relates to a method for setting up a process in a computer network and in particular for the location and selection of services to provide the process.
- the invention also extends to a suitable network.
- Web Services is a phrase used to describe the way in which services can be exposed and used on a network. Web Services concern the way in which software communicates. Software can come in many forms from a simple script on a personal computer, to an application on a networked server, through to a large operational support system running on a mainframe computer. These scripts, applications and software systems are examples of software components. Web services is based on software components that allow themselves to be used by other software components
- SOAP simple object access protocol
- WSDL web services description language
- UDDI Universal Description, Discovery, and Integration
- a Web Service can be described using WSDL, it can be located using UDDI and its functionality invoked using SOAP. These three technologies are built upon the common data description standard Extensible Mark-up Language (XML).
- XML is a standard specification for defining the content of a computer message and provides a common way to represent the content of a message sent between one software component and another. If a software application writes its output in XML any another application capable of interpreting XML can read the output and act on it.
- SOAP provides the means by which one software component can invoke the functionality of another, using message-passing between the two as the means of invocation.
- the specification for SOAP is a world-wide standard, administered by the W3C, currently at version 1.2 issued by the W3C in June 2004: available at http://www.w3.org/TR/SOAP or as an archive at http://www.w3.org/TR/2003/REC-soap12-part0-20030624.
- SOAP uses a request-response mechanism in which one software component makes a request to another software component which then provides a response. Both request and response are transported in the form of XML documents.
- XML and SOAP provide, along with HTTP, the means for one software component to invoke the functionality of another over the Internet.
- a WSDL file is an XML document that provides the information listed above about a software component.
- a software component can integrate with any of the available functions of a Web Service. With WSDL-aware tools, this process can be entirely automated, enabling applications to easily integrate new services with little or no manual code.
- WSDL is defined at http://www.w3.org/TR/wsdl or as an archive at http://www.w3.org/TR/2001/NOTE-wsdl-20010315.
- Web services have a wide range of applications including the provision of communications capability and services and business applications.
- UDDI provides this extension to the basic Web Services technologies by allowing the means to create a registry of Web Services. This takes Web Services into the realm of companies doing business with each other over the Internet.
- the UDDI specification enables companies to quickly, easily, and dynamically find and transact with one another.
- UDDI enables a company to:
- UDDI registry can be used to find a desired function.
- a request to the registry would be for a specific function and may include other requirements such as cost limits, security needs, performance criteria, etc.
- the registry would then propose one or more companies that provide such a function, allowing a choice of supplier.
- the specifications for UDDI allow, for example, the creation and use of a registry containing information about businesses and the services they offer.
- the specifications for UDDI are administered by the Organisation for the Advancement of Structured Information Standards (OASIS) and are available at http://uddi.org.
- OASIS Organisation for the Advancement of Structured Information Standards
- Web Services also have applications in communications networks, i.e. exposing network functionality as software services. Communications service providers can use Web Services to take advantage of the convergence of software and network technologies. For example, a video-on-demand Web Service may make use of a communication service that delivers the video stream (which may present itself as a Web Service).
- Grid computing allows the pooling of resources across multiple systems and their allocation on demand to provide the quality of service typically associated with a single large mainframe or supercomputer but at a lower price/performance ratio. It works by creating a resource access framework which applications can call for allocation of resources. These resources are used by the requesting application and then subsequently released.
- the grid environment is inherently distributed, and may include the systems of outside organisations.
- Grid implementations are typically constructed using a US-government sponsored, open source tool-kit known as Globus available at http://www.globus.org/.
- Globus available at http://www.globus.org/.
- OGSA Open Grid Services Architecture
- OGSA OGSA
- Any Web Services based platform to create transient services to undertake particular functions that could range from the setting up of conference calls to the large-scale manipulation of data. These services themselves could be Web Services enabled for ease of access.
- SOA service-oriented architecture
- the major technical problem given such an abstract process description is how to build a concrete realisation with the desired level of performance.
- a set of directories e.g. using the UDDI - Universal Description, Discovery and Integration protocol
- the directories would be queried to find instances of all the services required by the process specification. If grid services are in use the directories could also be queried for suitable nodes to instantiate the required services on.
- the present invention avoids the above problems by providing a method as set out in claim 1.
- the present invention also provides a network as set out in claim 20.
- Figure 1 shows a process in the form a of a flow chart
- FIG. 2 shows a network for implementing the invention
- Figures 3 and 4 illustrate a series of searches in the network of Figure 4 according to the present invention
- Figure 5 shows a decision graph derived form the searches of figures 3 and 4;
- Figure 6 shows the searches of figure 3 and 4 as a UML diagram.
- a first embodiment of the invention will now be described by way of example with reference to a user with access to a network supporting web services.
- the user wishes to set up a process using the resources of the network.
- Figure 1 shows a flow chart representation of part of a simple process related to a credit application in a series of stages requiring the use of a series of services represented here by boxes.
- the process is initiated by receipt of a request for quotes for a loan from the user who has an applicant seeking the loan.
- the first step is to obtain the loan applicant's social security number (SSN) based on identification supplied by the applicant and for this task service Retrieve SSN is selected. Once the social security number has been obtained, credit ratings for the loan applicant as identified by their SSN are obtained using service Get Credit Rating. Once a credit rating value is obtained, offers of credit are sought using service Collect Offers. From the offers of credit received a preferred offer is selected and forms the basis of a response to the user from service Confirmation Manager.
- SSN social security number
- Figure 2 shows a network capable of supporting web services.
- the network of Figure 2 consists of a plurality of nodes of which a representative number 10 - 36 are shown.
- the nodes are interconnected with each other in a partial mesh, i.e. not every node has a direct connection with every other node.
- node 10 is connected via connections 40, 41 , 42, 43 and 44 to nodes 12, 14, 16, 18, and 20, respectively.
- Node 20 has a further connection to node 26 that is itself further connected to node 24.
- Node 18 has further connections 45 and 46 to nodes 22 and 24, respectively.
- Node 24 has a further connection 47 to node 30.
- Node 30 is in turn connected to node 28 via connection 48 and is further connected to nodes 28 and 32.
- Node 28 is further connected to node 34.
- a first embodiment of the invention will now be described by way of example with reference to the above user who has access to the network through node 10.
- the user wishes to set up a process using the resources of the network.
- the user does not know whether sufficient resources are present on the local node 10 and so they invoke a web service to allow resources on various nodes to be located and combined, as appropriate, to provide the desired process. To do this they invoke a search process in the user's local node 10 to locate the necessary services.
- a typical service may, for example, be in the form of software, data or computer hardware.
- the use here of a web service is only one possibility.
- the user might access a local application interface, typically written in a language such as JAVA to start the search process which might then proceed through a peer to peer mechanism.
- the user might access a web portal and use a search portlet to initiate the search.
- each node in the network runs a process that listens on a well-known port and responds to queries.
- This process also maintains, or is able to obtain, a list of all services currently available on the node.
- This includes software services that are running (i.e. active) on that node and those that are not running (i.e. inactive) and can be started on that node, if desired.
- This may also include data or software that is not present on that node but may be accessed and installed on that node.
- the scheduling process has access to a node capability description.
- a node capability description is the grid service scheduling process. This process is also aware of each node's network neighbours and is able to send messages to them. The process participates in echo discovery, as described below.
- a process may be thought of and represented as a graph where the vertices are the component services and the arcs connecting them reflect dependencies or interaction (see for example, Figure 5). For example, consider a sequence of services that must be executed in order, possibly constrained by the output of one being the input to the next service (other structures such as parallel executions and choices may also be found.)
- a scheduler is responsible for instantiating an executable process from a process definition to meet performance and cost constraints. The scheduler is started by the user when they supply the definition of the desired process to the local search process in the user's local node. In order to instantiate the process the scheduler initiates a search for the first service in the sequence. This is illustrated in Figure 3 by the expanding circles 50 emanating from node 10.
- Each first service is located in a "first" node.
- two candidate first nodes 14 and 24 are located as a result of the first stage of the search.
- Node 14 is connected directly to node 10 via connection 41.
- Node 24 is connected to node 10 via node 18 and connections 43 and 46.
- a bounded echo is used for this search.
- the bounded echo searches initially over network nodes within a restricted area, the area expanding until a defined number of suitable services has been discovered.
- the characteristics of the discovered nodes and information on the connectivity to these nodes are returned to the scheduler at the user's node 10.
- the scheduler selects on the basis of criteria supplied by the user a number (a short list) of nodes providing an instance of the first service for potentially providing the first service.
- a search for the second service in the sequence is then remotely initiated from selected first nodes 14 and 24 providing an instance of the first service. This is represented in Figure 3 by the expanding circles 52 emanating from selected first node 24. Only one second-stage search is illustrated here for clarity, although searches may occur in parallel from a number of selected "first nodes".
- a plurality of "second nodes” are located that are able to provide the second service (only one second node 30 is shown in Figure 3 for clarity).
- the characteristics of the discovered "second" nodes, i.e. nodes for potentially providing the second service in the sequence, are returned to the scheduler.
- Information on the connectivity between the nodes able to provide the first service and the nodes able to provide and second service is also returned to the scheduler which then selects a short list of the second nodes.
- a search for the third service is started in a similar way, i.e. from selected nodes providing an instance of the second service. This is represented in Figure 3 by the expanding circles 54 emanating from selected second node 30. Other searches that may be taking place in parallel at this stage are not shown for clarity.
- a plurality of "third nodes" are located that are able to provide the third service (only one third node 36 is shown for clarity).
- a number of fourth, fifth, etc nodes able to provide a desired fourth, fifth, etc service are located in subsequent stages, as required (not shown). This process is repeated until a sufficient number of nodes providing an instance of each service in the sequence are found.
- Figure 4 shows part of the network of Figure 3 with only nodes selected as as result of the search shown to illustrate the searches of Figure 3 more clearly.
- arrow 49 represents the link between user node 10 and selected first node 24.
- the scheduler is able to build up a graph, as shown in Figure 5, where each path from apex (10) to an opposite extremity (e.g. 82) represents a viable instance of the process. Data on performance and cost is associated with each vertex (services 60 - 84) and arc (network connections 100 - 126) of the graph.
- User node 10 is connected to first services 60, 62 by network connections 100, 102.
- First service 60 is connected to second services 70, 72, 74 by network connections 110, 112 and 114, respectively.
- First service 62 is connected to second services 74, 76 by network connections 116 and 118, respectively.
- Second service 70 is connected to third service 80 by network connection 120.
- Second service 72 is connected to third service 82 by network connection 122.
- second services 74 and 76 both located the same single third service 84.
- second services 74 and 76 are connected to third service 84 by network connections 124 and 126, respectively.
- the decision graph would extend to further service instances connected via further network connections, until instances of all the required services and their interconnections were represented in the graph.
- arcs 100, 110 and 120 could relate to links 49, 47 and 48, respectively and services 60, 70 and 80 could relate to nodes 24, 30 and 36, respectively.
- the scheduler then chooses the most appropriate path to satisfy the end user's constraints, calculating the quality of each path based on the performance and cost data associated with the vertices and the arcs of each path.
- the scheduler can prune unpromising paths. For example, if one constraint is that a process consisting of a sequence of three services must be able to execute in 10 seconds and the time taken along one path to execute the first service instance, propagate results to the second and execute the second takes 11 seconds, there is no point in continuing with a search for an instance of the third service along that path.
- Costs that may be taken into account in choosing a path through the decision graph include but are not limited to connection bandwidth, proximity of service instances, network cost of transferring data between services, financial cost of using a resource, availability of resources, ownership of resources, security and the desire to prevent unauthorised access to information being processed.
- a request is generated for a sequence of services with appropriate quality metrics.
- each node providing one of the required services it initiates a bounded echo search for the next service in the sequence, without returning to the scheduler.
- the echo algorithm then aggregates the results and returns an ordered list of service instances to the scheduler together with the performance of the list against each metric.
- the aggregation is executed by an echo daemon that is present on each node.
- the echo daemon keeps a record of all active searches it has propagated and aggregates the returned results.
- the echo daemon is responsible for all communications involved in the echo pattern. Every node in the system has a software process running as part of the echo daemon that listens on a standard communication port for echo messages.
- the daemon will recognise if a message is a search or an echo. If it is a search it will check locally for the required service and if necessary pass the search message to its neighbours except the message originator. Before passing on the search message, the daemon will check a hop count to see if further propagation of the search is allowed.
- the hop count is a simple numeric count that is incremented every time the search is propagated, and is used to limit the extent of the search area, i.e. to provide a bounded search. The hop count starts at zero. Each time a node forwards a search message, the hop count is incremented. A node will only forward a search message if the hop count is less than a predetermined limit. If it is equal to the limit, the expansion phase of the algorithm ends and the node returns information on the search to the requesting node.
- the echo daemon keeps a list of its neighbours, and periodically maintains it. When responses to searches return, the daemon manages the aggregation process and passes the collected responses back to the search originator. When any customer starts a search they will preferably have access to a graphical interface that allows them to configure the search and generate the first search messages to be issued from the echo daemon on the local node.
- This embodiment is particularly appropriate for finding sequences rather than structures with more complex synchronisation (for example containing choices, parallel execution etc.).
- the two can be combined in a further embodiment with the scheduler explicitly directing the search in the more complex situations and relying on the echo daemon aggregation in other situations.
- the initial process design is carried out using an integrated development tool allowing graphical representation of the process, as illustrated in Figure 1.
- the representation based on WDSL may be produced using Oracle BPEL designer or other commercially available tool, is shown, by way of example, for the loan application described above.
- the same information may be made available in an XML-based file where partner links and orchestration logic describe the identity of the component services and the sequencing in the flow, for example:
- Invoke the synchronous creditRatingService Define a scope for handling faults from it and set the credit rating in the loan app bus doc if we get a credit rating back. In the case of a NegativeCredit exception, set it to -1000.
- the client node initiates a bounded echo search for the first service required, in the
- further refinements are introduced including adding identification and costing information to nodes and network links in the graph so that a fairly simple method that finds the lowest cost path through the graph will identify the best combination.
- Cost metrics used to annotate the graph can, for example, be related to the available computing resources, the performance of services if they already exist, the time-to-load for services that have to be started, and the performance of the connecting network links.
- the addition of annotations to the graph facilitates a process of pruning the graph as it is built, further simplifying the scheduling process.
- Figure.6 uses the Unified Modelling Language (UML) - trademarks of Object Management Group, Inc.
- UML Unified Modelling Language
- FIG. 6 shows a simplified UML sequence diagram highlighting some of the key features of the discovery process.
- Time starts in the top left hand corner and advances down the diagram, each of the boxes along the top ('.Application Schedule; :local echod; :remote echod 1 ; :remote echod 2; remote echod 3) represents a function.
- each of these functions is running on a separate node.
- the echoed search functions (:local echod; :remote echod 1; :remote echod 2; remote echod 3) are the pieces of code that handle search requests: accepting the search request messages, querying the local node accordingly, passing on the search request to subsequent nodes and returning results to the requesting scheduler.
- Each echoed search function has details of all local connections to its node and the origin of all live search requests.
- Workflow is a term used to describe the tasks, procedural steps, organizations or people involved, required input and output information, and tools needed for each step in a business process.
- Workflow is an IT technology which uses electronic systems to manage and monitor such processes. It allows the flow of work between individuals and/or departments, e.g. as implemented as transfers of data between computers in a network, to be defined and tracked.
- an application scheduler is created to handle the scheduling task (function :Application schedule).
- the scheduler is started by the user when they supply a workflow definition to the local search function in the user's local node.
- a workflow approach to analyzing and managing a process can be combined with an object-oriented programming approach, which tends to focus on documents and data. In general, workflow management focuses on processes rather than documents.
- Commercially available workflow automation products allow an organisation to create a workflow model and components such as online forms and then to use this product as a way to manage and enforce the consistent handling of work.
- the application scheduler looks for the first component of the workflow on the local node (function rlocal echod) by querying the local echoed search function (message "initiate search").
- the local echoed search function will test the local node (see arrow “local check” under function :local echod) and if the required component is not present it will forward the search (see message "propagate search") to the echoed search functions of it's neighbours (i.e. function :remote echod 1).
- Each neighbour echoed search function searches in turn its local node (see arrow "local check” under function :remote echod 1).
- the search is forwarded to the echoed search function of the neighbours' neighbours (message "propagate search" sent from remote echod 1 function to remote echod 2 function).
- remote echoed 2 search function locates the first service (or workflow component) on its local node and returns a positive response (not shown) to the application scheduler.
- the positive response may either be passed back through the echo chain, or passed directly to the originating application scheduler.
- the application scheduler When the application scheduler receives a positive response indicating the location for the first service it send a status checking request (message "request current status") that queries for the cost of that workflow component to the successful echoed search function ( ⁇ .remote echod 2). The successful function returns this value to the application scheduler (message "return status to scheduler" from :remote echod 2 to :application scheduler) where the scheduling decision graph is being built. The application scheduler then starts a search (message "initiate search” from rapplication scheduler to :remote echod 2) for the next service from all successful locations with an instance of the first service. This process continues until all required services are successfully located and their status determined. In a further preferred embodiment, as the scheduling decision graph is built the application scheduler periodically checks for potential duplication of sites and prunes the scheduling decision graph accordingly. When all components are located the application scheduler processes the scheduling decision graph and returns the optimum arrangement of connected services to the user.
- a status checking request (mes
- the invention provides for the setting up of parallel processing processes.
- the use of parallel approaches may be accommodated in a number of ways.
- the scheduler for a grid might expose a grid service interface that accepts a request involving parallel processing and then handles the distribution.
- parallel execution may be included in the workflow description, where the output of one service is sent to the input of multiple identical services.
- Grid computing is used extensively for parallel processing particularly in scientific research. However, grid computing is also applicable to business applications that do not require as much parallelism as scientific applications.
- the invention may be applied to web or grid services wherever they are used.
- a further advantage of the present invention is that it allows the scheduler to conduct a two-tier search. Conventional web services only use existing services.
- the present invention can advantageously allow the scheduler to also consider starting services on suitable nodes in order to meet the process requirements. This includes both starting services that are present on a node but not running and downloading the appropriate service code to a selected node so that it may be installed and run.
- Suitable software provisioning systems that allow instantiation on demand include grid computing and CORBA (the common object broker architecture). A new range of vi realisation and server-automation software is expected to allow similar instantiation on demand suitable for use with the present invention.
- the present invention provides a more robust solution than centralised directory based solutions and will advantageously allow continued operation in the face of network failure.
- Conventional approaches such as UDDI using registries will fail if the part of the network containing the directory becomes unreachable.
- the searches of the present invention are initiated by the user and radiate out to reach all parts of the network currently connected to the start point thus allowing full or partial progress to be maintained in the event of partial network failure. If parts of the network fail after the locations and costs of required services are acquired by the scheduler, any service that is in the failed area of the network will no longer be reachable and use of it will be denied.
- a second search may immediately be started to locate alternative instances of any services to which access is denied as a result of the problems with the network.
- the second search will inherently only collect data from nodes still connected to the originating node.
- the locations of alternate services found during the original search but not selected for use are stored against such network problems occurring. This allows the network to quickly switch to available working services in the event of partial network failure. Resilience is further enhanced by the lack of any central services at the highest level. If the scheduling process were to be centralised, failure of the single process could be fatal. According to a preferred embodiment, each scheduler is responsible for only one process which may fail without adversely affecting all the others which may still work. The system is therefore resilient at multiple levels, no central services at the highest level limits the effects of any failure, and storing the locations, for example as part of a selection graph, of multiple suitable services helps rapid recovery should failure occur.
- a video on demand process may be configured.
- a video on demand service may consist of a video service and a delivery service that may be represented as a simple two-stage workflow that the customer starts themself by supplying the name of the video and the delivery address (this may be obtained automatically in the background without user interaction).
- the first stage of the echo pattern sets out to find a video server capable of supplying the requested video.
- the second phase of the echo search then sets out to find suitable delivery services.
- the scheduler chooses a video source, and a delivery service that can in concert provide the video on demand service with the required levels of quality for a video.
- the present invention may be applied to the configuration of a network to support: the following
- Third-party call control is used to create and manage a call initiated by an application.
- application developers can invoke call-handling functions by providing the addresses (or telephone numbers) of two endpoints.
- a suitable application will be one that is invoked on either a busy or unavailable connection to the subscriber's PSTN line.
- An application could pick up this signal and provide to the called user the choice of sending the call to voicemail, diverting the call to another number or rejecting the call.
- the response made by the user is handled within the network.
- the service may also trigger an application whenever a certain number is dialled. This would be viable for many existing Intelligent Network service offerings.
- One example of the use of such a service is monitoring a particular stock price: when the price reaches a threshold value, the client application invokes a third-party call between one or more brokers and their corresponding customers to decide actions to be taken.
- a method of sending SMS messages from an application e.g. a client application (residing on a third-party platform, or in-house application platform) that is triggered by an external stimulus (such as a voicemail, traffic, weather or other information report, or e- mail message).
- the application invokes an SMS Web Service.
- the application provides the message (string of text), and the called user's details.
- the Web Service can then invoke a message directing the mobile SMS-C to send the message to the called user.
- the present invention allows a desired process to be efficiently built from diverse services spread in an unknown manner across a network.
- the services may be of various types including but not limited to software that is either running, installed but inactive or requiring installation; data that is either installed or requiring installation and processing power or storage as may be provided by devices such as computers, PDAs and mobile phones.
- This is achieved according to a preferred embodiment by the construction of a decision graph that allows rapid decision to be made as the most suitable service instances and connections. By exploiting a searching strategy that spreads out from the user the invention inherently tends to optimise speed while minimising connection costs.
- the present invention is not limited to processes comprising a sequence of services that must be executed in a set order but applies equally to other structures such as parallel execution and sequences with choices or decisions.
- the present invention is not limited to a particular form or topology of network but applies to ring, tree, partial and full mesh and other topologies implemented in electrical, optical or other electromagnetic media.
- the invention may also be applied without changing its essential character to services distributed across more than one network.
- the invention is not limited to any particular type of service but extends to business applications, communications services, manufacturing systems amongst other applications.
Abstract
Description
Claims
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA2596004A CA2596004C (en) | 2005-02-15 | 2006-02-06 | Process configuration in a network |
CN2006800048292A CN101120575B (en) | 2005-02-15 | 2006-02-06 | Process and network for positioning and selecting service to provide processing |
EP06709653A EP1849282B1 (en) | 2005-02-15 | 2006-02-06 | Process configuration in a network |
DE602006017172T DE602006017172D1 (en) | 2005-02-15 | 2006-02-06 | PROCESS CONFIGURATION IN A NETWORK |
AT06709653T ATE483311T1 (en) | 2005-02-15 | 2006-02-06 | PROCESS CONFIGURATION IN A NETWORK |
JP2007554629A JP5221151B2 (en) | 2005-02-15 | 2006-02-06 | Process configuration in the network |
US11/883,538 US8150905B2 (en) | 2005-02-15 | 2006-02-06 | Process configuration in a network |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB0503141.4 | 2005-02-15 | ||
GBGB0503141.4A GB0503141D0 (en) | 2005-02-15 | 2005-02-15 | Process configuration in a network |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006087518A1 true WO2006087518A1 (en) | 2006-08-24 |
Family
ID=34385531
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/GB2006/000407 WO2006087518A1 (en) | 2005-02-15 | 2006-02-06 | Process configuration in a network |
Country Status (9)
Country | Link |
---|---|
US (1) | US8150905B2 (en) |
EP (1) | EP1849282B1 (en) |
JP (1) | JP5221151B2 (en) |
CN (1) | CN101120575B (en) |
AT (1) | ATE483311T1 (en) |
CA (1) | CA2596004C (en) |
DE (1) | DE602006017172D1 (en) |
GB (1) | GB0503141D0 (en) |
WO (1) | WO2006087518A1 (en) |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9686183B2 (en) * | 2005-12-06 | 2017-06-20 | Zarbaña Digital Fund Llc | Digital object routing based on a service request |
CN102057647B (en) * | 2008-06-12 | 2014-07-02 | 爱立信电话股份有限公司 | Maintenance of overlay networks |
US8966314B2 (en) * | 2009-08-31 | 2015-02-24 | Red Hat, Inc. | Declarative test result validation |
US8433782B2 (en) * | 2010-04-06 | 2013-04-30 | Oracle International Corporation | Simplifying determination of dependencies among SOA services |
US9152461B1 (en) | 2011-12-20 | 2015-10-06 | Amazon Technologies, Inc. | Management of computing devices processing workflow stages of a resource dependent workflow |
US8738775B1 (en) | 2011-12-20 | 2014-05-27 | Amazon Technologies, Inc. | Managing resource dependent workflows |
US8788663B1 (en) | 2011-12-20 | 2014-07-22 | Amazon Technologies, Inc. | Managing resource dependent workflows |
US9128761B1 (en) | 2011-12-20 | 2015-09-08 | Amazon Technologies, Inc. | Management of computing devices processing workflow stages of resource dependent workflow |
US9158583B1 (en) | 2011-12-20 | 2015-10-13 | Amazon Technologies, Inc. | Management of computing devices processing workflow stages of a resource dependent workflow |
US8656002B1 (en) * | 2011-12-20 | 2014-02-18 | Amazon Technologies, Inc. | Managing resource dependent workflows |
US9152460B1 (en) | 2011-12-20 | 2015-10-06 | Amazon Technologies, Inc. | Management of computing devices processing workflow stages of a resource dependent workflow |
US10803089B1 (en) * | 2015-02-20 | 2020-10-13 | Amazon Technologies, Inc. | Grid based pathfinding |
US10347038B1 (en) | 2015-02-20 | 2019-07-09 | Amazon Technologies, Inc. | Determining visibility in virtual environments |
CN111083569B (en) * | 2018-10-18 | 2021-11-05 | 杭州海康威视数字技术股份有限公司 | Video playing method and device |
US10747658B2 (en) * | 2018-11-19 | 2020-08-18 | Paypal, Inc. | Systems and methods for testing online use-case scenarios in a staging environment |
CN111741513B (en) * | 2020-06-18 | 2023-04-07 | 深圳市晨北科技有限公司 | Network distribution method of Internet of things equipment and related equipment |
US20230275820A1 (en) * | 2022-02-28 | 2023-08-31 | Juniper Networks, Inc. | Successful connects metrics for monitoring and control of wireless or wired networks |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040220910A1 (en) | 2003-05-02 | 2004-11-04 | Liang-Jie Zang | System and method of dynamic service composition for business process outsourcing |
US20050021663A1 (en) | 2003-06-30 | 2005-01-27 | Knauerhase Robert C. | Transparent disconnected services discovery and use |
Family Cites Families (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6286047B1 (en) | 1998-09-10 | 2001-09-04 | Hewlett-Packard Company | Method and system for automatic discovery of network services |
US7280975B1 (en) * | 2000-07-24 | 2007-10-09 | Donner Irah H | System and method for determining and/or transmitting and/or establishing communication with a mobile device user for providing, for example, concessions, tournaments, competitions, matching, reallocating, upgrading, selling tickets, other event admittance means, goods and/or services |
US20030036917A1 (en) | 2001-04-25 | 2003-02-20 | Metallect Corporation | Service provision system and method |
US7177869B2 (en) | 2001-09-19 | 2007-02-13 | Fuji Xerox Co., Ltd. | Service retrieving apparatus and service retrieving method |
US7616961B2 (en) * | 2002-04-29 | 2009-11-10 | Harris Corporation | Allocating channels in a mobile ad hoc network |
US7467206B2 (en) | 2002-12-23 | 2008-12-16 | Microsoft Corporation | Reputation system for web services |
CN1195364C (en) * | 2002-12-30 | 2005-03-30 | 清华大学 | Adjustable heuristic routing method of quality of service based on width first search |
JP4057925B2 (en) * | 2003-01-29 | 2008-03-05 | 富士通株式会社 | Service management method and apparatus |
JP4254264B2 (en) * | 2003-02-17 | 2009-04-15 | 日本電信電話株式会社 | Network providing method, system, and server when using web service |
US7895338B2 (en) * | 2003-03-18 | 2011-02-22 | Siemens Corporation | Meta-search web service-based architecture for peer-to-peer collaboration and voice-over-IP |
JP2004287803A (en) * | 2003-03-20 | 2004-10-14 | Fujitsu Ltd | Distributed information processing system |
JP3947136B2 (en) * | 2003-05-30 | 2007-07-18 | 株式会社東芝 | Web service system, flow development support device, and flow development support program |
US7603464B2 (en) * | 2003-06-04 | 2009-10-13 | Sony Computer Entertainment Inc. | Method and system for identifying available resources in a peer-to-peer network |
JP2005010880A (en) * | 2003-06-17 | 2005-01-13 | Nippon Telegr & Teleph Corp <Ntt> | Information retrieval method, information retrieval program and information retrieval device |
US8260838B2 (en) * | 2004-07-23 | 2012-09-04 | International Business Machines Corporation | Extracting web services from resources using a web services resource programming model |
-
2005
- 2005-02-15 GB GBGB0503141.4A patent/GB0503141D0/en not_active Ceased
-
2006
- 2006-02-06 WO PCT/GB2006/000407 patent/WO2006087518A1/en active Application Filing
- 2006-02-06 US US11/883,538 patent/US8150905B2/en active Active
- 2006-02-06 AT AT06709653T patent/ATE483311T1/en not_active IP Right Cessation
- 2006-02-06 DE DE602006017172T patent/DE602006017172D1/en active Active
- 2006-02-06 EP EP06709653A patent/EP1849282B1/en active Active
- 2006-02-06 JP JP2007554629A patent/JP5221151B2/en active Active
- 2006-02-06 CN CN2006800048292A patent/CN101120575B/en active Active
- 2006-02-06 CA CA2596004A patent/CA2596004C/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040220910A1 (en) | 2003-05-02 | 2004-11-04 | Liang-Jie Zang | System and method of dynamic service composition for business process outsourcing |
US20050021663A1 (en) | 2003-06-30 | 2005-01-27 | Knauerhase Robert C. | Transparent disconnected services discovery and use |
Also Published As
Publication number | Publication date |
---|---|
GB0503141D0 (en) | 2005-03-23 |
EP1849282B1 (en) | 2010-09-29 |
CA2596004C (en) | 2013-12-17 |
US8150905B2 (en) | 2012-04-03 |
CN101120575B (en) | 2011-05-11 |
JP2008530674A (en) | 2008-08-07 |
CA2596004A1 (en) | 2006-08-24 |
US20080144529A1 (en) | 2008-06-19 |
CN101120575A (en) | 2008-02-06 |
ATE483311T1 (en) | 2010-10-15 |
JP5221151B2 (en) | 2013-06-26 |
DE602006017172D1 (en) | 2010-11-11 |
EP1849282A1 (en) | 2007-10-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1849282B1 (en) | Process configuration in a network | |
Michlmayr et al. | End-to-end support for QoS-aware service selection, binding, and mediation in VRESCo | |
US8196125B2 (en) | Optimization of policy enforcement | |
US8914804B2 (en) | Handling queues associated with web services of business processes | |
CN103430150A (en) | Technique for resource creation in a cloud computing system | |
Da et al. | Kalimucho: middleware for mobile applications | |
CN108509523A (en) | Structuring processing method, equipment and the readable storage medium storing program for executing of block chain data | |
Barker et al. | Orchestrating data-centric workflows | |
Padovitz et al. | Towards efficient selection of web services | |
US20100218202A1 (en) | Method and Apparatus for Case-Based Service Composition | |
Reiff-Marganiec et al. | Feature interactions in telecommunications and software systems VIII | |
US20080294728A1 (en) | Service Discovery for Electronic Messaging Clients | |
Dustdar et al. | VRESCo–Vienna Runtime Environment for Service-oriented Computing | |
Venezia et al. | Communication web services composition and integration | |
US9479599B2 (en) | Reroute of a web service in a web based application | |
Park et al. | Efficient execution of composite Web services exchanging intensional data | |
Hoschek | Web Service Discovery Processing Steps. | |
Mezghani et al. | Autonomic Coordination of IoT Device Management Platforms | |
van Gurp et al. | Service grid variability realization | |
Fidler | PADRES: a distributed content-based publish/subscribe system | |
Frank et al. | An approach to hosting versioned web services | |
EP2112601A1 (en) | System and method of application persistence | |
Yu et al. | A User-centric mobile service creation approach converging telco and IT services | |
Mukhija et al. | Dino: Dynamic and adaptive composition of autonomous services | |
Sahasrabudhe et al. | A load balancing scheme for ebXML registries |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2006709653 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 5754/DELNP/2007 Country of ref document: IN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2596004 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 11883538 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007554629 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200680004829.2 Country of ref document: CN |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWP | Wipo information: published in national office |
Ref document number: 2006709653 Country of ref document: EP |