WO2012110079A1 - Répartition de traitement de données - Google Patents

Répartition de traitement de données Download PDF

Info

Publication number
WO2012110079A1
WO2012110079A1 PCT/EP2011/052208 EP2011052208W WO2012110079A1 WO 2012110079 A1 WO2012110079 A1 WO 2012110079A1 EP 2011052208 W EP2011052208 W EP 2011052208W WO 2012110079 A1 WO2012110079 A1 WO 2012110079A1
Authority
WO
WIPO (PCT)
Prior art keywords
request
result
computational task
client node
data
Prior art date
Application number
PCT/EP2011/052208
Other languages
English (en)
Inventor
Vilho Ilmari RAISANEN
Original Assignee
Nokia Siemens Networks Oy
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Siemens Networks Oy filed Critical Nokia Siemens Networks Oy
Priority to PCT/EP2011/052208 priority Critical patent/WO2012110079A1/fr
Publication of WO2012110079A1 publication Critical patent/WO2012110079A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]

Definitions

  • the exemplary and non-limiting embodiments of this invention relate generally to communications networks, and more particularly to distribution of data processing in wireless communications .
  • REST Representational state transfer
  • REST is a style of software architecture for distributed hypermedia systems such as the world wide web (www) .
  • REST is a simple way to organize interactions between independent systems.
  • REST has influenced on the design of services such as the Twitter API.
  • REST allows interacting with minimal overhead with clients as diverse as mobile phones and other websites.
  • REST is usually implemented as a web. Basically, REST may be used wherever HTTP may be used.
  • a method for distribution of data processing comprising controlling the functioning of a network element by receiving, from a client node, a request to perform a computational task on structured data, the request
  • identifying a data collection and the requested task based on the request, performing the computational task by applying a first operation to the data collection, and, if needed, by applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and returning a result of the computational task.
  • an apparatus configured to receive, from a client node, a request to perform a computational task on structured data, the request identifying a data collection and the requested task; based on the request, perform the
  • computational task by applying a first operation to the data collection, and, if needed, by applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and return a result of the computational task.
  • a client node configured to transmit, to a server node, a request to perform a computational task on structured data, the request identifying a data collection and the requested task, the computational task including applying a first operation to the data collection, and, if needed, applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and receive, from the server device, a result of the
  • communications system configured to control the functioning of a network node by receiving, from a client device, a request to perform a computational task on
  • the request identifying a data collection and the requested task; based on the request, performing the computational task by applying a first operation to the data collection, and, if needed, by applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and returning a result of the
  • a computer-readable storage medium embodying a program of instructions executable by a processor to perform actions directed toward controlling the functioning of a network node by receiving, from a client device, a request to perform a computational task on structured data, the request identifying a data collection and the requested task; based on the request, performing the computational task by applying a first operation to the data collection, and, if needed, by applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and returning a result of the computational task.
  • a program of instructions executable by a processor to perform actions directed toward controlling the functioning of a network node by receiving, from a client device, a request to perform a computational task on structured data, the request identifying a data collection and the requested task; based on the request, performing the computational task by applying a first operation to the data collection, and, if needed, by applying one or more second operations to a result of a previous operation, wherein each operation is
  • Figure 1 shows a simplified block diagram illustrating exemplary system architecture
  • Figure 2 shows a simplified block diagram illustrating exemplary apparatuses
  • Figure 3 shows a messaging diagram illustrating an exemplary messaging event according to an exemplary embodiment
  • Figure 4 shows a schematic diagram of a flow chart according to an exemplary embodiment
  • Figure 5 shows a schematic diagram of a flow chart according to an exemplary embodiment.
  • map refers to a higher-order function that applies a given function element-wise to a list of elements and returns a list of results. Map establishes a set of values having a defined correspondence with the quantities or values of another set.
  • Reduce (which may also be referred to as fold, accumulate, compress, or inject) refers to a higher-order function that iterates an arbitrary function over a data structure in some order and builds up a return value. Reduce may deal with a combining function and a list of elements of a data structure. Reduce combines elements of the data structure using the function in a systematic way.
  • REST may be seen as a service- oriented alternative to RPC, which allows avoiding logic "image coding" which is typical to RPC.
  • the client is more free to decide on how to access data.
  • each unique state in a protocol state machine has its own URI. That is different from an RPC endpoint that maintains a black-boxed state machine at a single endpoint. Being able to do state transition processing at disparate locations is hugely powerful. A single process is able to span machines offering differing levels of scalability, reliability and security. In RPC, a more likely solution is to have multiple RPC interfaces to the different machines involved in the process and then tie their protocols
  • transition URIs may be embedded in the
  • a single URL is used to encode all transitions.
  • messages are not interpreted as serialized call- stacks.
  • the purpose of RPC is to copy a stack frame from one process to another, where it exists for the duration of a method call. That makes RPC natural to anyone used to invoking a method, but it also makes it very hard to alter one side of the system without altering the other. While
  • HTTP-based systems still use request/response messages, they are not call-stacks.
  • RPC uses HTTP merely as a proxy service for its own proprietary architecture, rather than taking advantage of the different properties , such as PUT, GET, DELETE etc.
  • RPC does not fit to the traditional web stack very well - a cache server in the middle does not work, for example, without knowing about the meaning of the contents of an RPC call.
  • large data volumes necessitate a massive processing power. This usually requires the use of multiple computers and hence requires distribution of computing.
  • Google MapReduce framework is based on a master node
  • the master node then combines the results of each worker node to achieve a total result. This approach requires the presence of a master node coordinating the computation and transfer of data.
  • Google MapReduce supports distributed computing on large data sets on clusters of computers. Map and reduce functions commonly used in functional programming resemble Google
  • MapReduce although their purpose in Google MapReduce is not quite the same as their original forms. MapReduce enables processing huge datasets on certain distributable problems by using a large number of computers (nodes), collectively referred to as a cluster. Computational processing may occur on the data stored either in a file system (unstructured) or within a database (structured) .
  • Databases such as SQL, support queries into their data, assuming that the data is indexed according to their schema.
  • "Map” and “reduce” operations may be defined as REST URLs, wherein the data federation is performed based on requests from REST clients.
  • the client sends a POST message to URI identifying a particular data collection and the operation requested.
  • the HTTP reply message returns the result of the operation application.
  • the operation in question may be "map” or "reduce”. Assuming that REST resources correspond to counters in a network element with domain name elem.nsn.com, and are identified by URIs /counter/cl, /counter/c2,
  • Map operation may be used to get the value of each counter with a function applied to it. For simplicity, assuming that one wishes to get the value of the counter times two.
  • the HTTP client may send HTTP POST message "x * 2" to http://elem.nsn.com/counter/map, which would trigger the application of multiplication operation to each counter, and the HTTP reply returns the values 2, 4, 6, 8 and 10.
  • a reduce operation may be used to compute a selected characteristic from the data set. Following the same example, HTTP POST "max" to h11p : /'/e1e in . ns n . co in,/counter,/red ce wou1d return value 5.
  • the described scheme may be applied
  • REST interface supporting the map and reduce operations, and used by the next higher level in the hierarchy.
  • the scheme provides a uniform interface based on a principle of control by the HTTP client. This approach enables building new federations of previous data easily.
  • Organization of the REST interface hierarchy enables the ability to perform the map and reduce operations in a sensible way. It may be useful to generate multiple parallel expositions of same data.
  • the operations such as "x * 2" and "max" above may be implemented by means of a parser. Alternatively, operation may be sent as a script using a suitable language, such as JavaScript. For complex data items, such as records, it is convenient to implement data accessor functions in the REST interface.
  • accessor /customer/12345/surname may be used by operations related to surnames of customers.
  • the actual REST interface for /map, /reduce, and accessors may be implemented with a web framework supporting dynamic HTML. Authentication for operations enables avoiding denial- of-service attacks against systems. This provides a simple means for controlling data processing distribution through a HTTP request, but is merely limited to one operation per request .
  • An exemplary embodiment relates to distribution of computing and data federation (processing large amounts of data to achieve desired results) .
  • Both topics may relate e.g. to cloud computing and operability.
  • An exemplary embodiment for data processing distribution with HTTP interfaces enables network load management by an HTTP server filtering the requests according to an operation coded in a uniform resource identifier (URI) .
  • URI uniform resource identifier
  • each system has its own data which is available via a uniform interface (e.g. HTTP) .
  • a client may request specific operations to be performed on the data by means of requests to the interface (e.g.
  • HTTP/REST HyperText Transfer Protocol/REST
  • a request such as POST "x * 2" to URI h_ttp_:_//nsn_. co /counter/c/map , returns the values of counters of type c multiplied by 2.
  • map perform a specified operation on resources
  • An exemplary embodiment avoids making several requests to achieve a specific result which requires multiple operations (see above example) .
  • the HTTP server is able to filter the requests to prevent requests from performing too heavy operations and overloading a network element or IT system. For example, reduce operations may only allow simple
  • resources under a particular URI conform to the same record format; it is merely required that the requested operations may be applied to each resource.
  • Resources do not necessarily need to have a unique identifier.
  • Shorthand format may be used for structured data so that record keys may directly be used in URIs when they do not collide with HTTP server's URIs.
  • the above examples may thus be shortened to:
  • Operation encoding may be performed by means of URI
  • intermediate result (s) may be cached for future requests to avoid re-computing of results.
  • An exemplary embodiment enables distribution of data
  • An exemplary embodiment enables managing the operation of a network element, such as a mobile switching centre MSC or any other element of a fixed or a wireless communications network .
  • the present invention is applicable to any user terminal, server, corresponding component, and/or to any communication system or any combination of different communication systems that support accessing data collections by means of
  • the communication system may be a fixed communication system or a wireless communication system or a communication system utilizing both fixed networks and wireless networks.
  • the protocols used, the specifications of communication systems, servers and user terminals, especially in wireless communication, develop rapidly. Such development may require extra changes to an embodiment. Therefore, all words and expressions should be interpreted broadly and they are intended to illustrate, not to restrict, the embodiment. In the following, different embodiments will be described using, as an example of a system architecture whereto the embodiments may be applied, without restricting the
  • the radio system is based on LTE network elements.
  • the invention described in these examples is not limited to the LTE radio systems but can also be implemented in other radio systems, such as UMTS
  • the presented solution may be applied between elements belonging to different but compatible systems such as LTE and UMTS.
  • a general architecture of a communication system is
  • Figure 1 is a simplified system architecture only showing some elements and functional entities, all being logical units whose implementation may differ from what is shown.
  • the connections shown in Figure 1 are logical connections; the actual physical connections may be different. It is apparent to a person skilled in the art that the systems also comprise other functions and
  • the exemplary radio system of Figure 1 comprises a network apparatus 104 of a network operator.
  • the network apparatus 104 may include e.g. a hypertext transfer protocol HTTP server and/or a representational state transfer REST server or any other network element, user equipment or a combination of network elements.
  • the network apparatus 104 may be connected to a client node 102 e.g. via a connection 105 (interface 105) .
  • the client node 102 may include e.g. a hypertext transfer protocol HTTP client and/or a
  • FIG. 1 shows the server node 104 operatively connected or integrated to a network element 103.
  • the network element may include an MSC server (MSS), serving GPRS support node, mobility management entity (MME) , home location register (HLR) , home subscriber server (HSS) , visitor location register (VLR) , a base station (node B, eNB) , access point (AP) , radio network controller (RNC) , or any other network element or a combination of network elements.
  • MSC server MME
  • MME mobility management entity
  • HLR home location register
  • HSS home subscriber server
  • VLR visitor location register
  • AP access point
  • RNC radio network controller
  • the network subsystem 101 may include e.g. an operation and maintenance
  • subsystem/base station system OSS/BSS or any other network element/subsystem or a combination of network
  • Figure 1 only illustrates a simplified example.
  • the net-work may include more servers and network elements .
  • the networks of two or more operators may overlap, the sizes and form of the cells may vary from what is depicted in Figure 1, etc.
  • the communication system may also be able to communicate with other networks, such as a public switched telephone network.
  • the embodiments are not, however,
  • connections between different network elements may be realized with internet protocol (IP) connections .
  • IP internet protocol
  • Figure 2 illustrates examples of apparatuses according to embodiments of the invention.
  • Figure 2 shows an apparatus 104 configured to be in connection with a client node 102.
  • the apparatus or HTTP server 104 comprises a controller 201 operationally connected to a memory 202 and an interface 203.
  • the controller 201 controls the operation of the apparatus 104.
  • the memory 202 is configured to store software and data.
  • the interface 203 is configured to setup and maintain the connection 105 with the client node 102.
  • the apparatus 104 may be operationally connected (directly or indirectly) or integrated into a further network element (not shown) of the communication system.
  • the further network element may be a MSC server (MSS) , serving GPRS support node, mobility management entity (MME) , home location register (HLR) , home subscriber server (HSS), visitor location register (VLR) , a base station (node B, eNB) , access point (AP) , and/or a radio network controller (RNC) , for example.
  • MSC server serving GPRS support node
  • MME mobility management entity
  • HLR home location register
  • HSS home subscriber server
  • VLR visitor location register
  • the apparatus 104 may also comprise various other components, such as a user interface, transceiver, camera, and media player. They are not displayed in the figure due to simplicity.
  • the client node or HTTP client 102 comprises a controller 204
  • the controller 204 controls the operation of the client node 102.
  • the interface 205 is configured to setup and maintain the connection with the apparatus 104.
  • the client node 102 may be operationally connected (directly or indirectly) or integrated into a further network element (not shown) of the communication system.
  • the further network element may be a an operation and maintenance subsystem/base station system
  • the client node 102 may also comprise various other components, such as a user interface, transceiver, camera, and media player. They are not displayed in the figure due to simplicity.
  • IP internet protocol
  • the memory may include volatile and/or non-volatile memory and typically stores content, data, or the like.
  • the memory may store computer program code such as software applications (for example for the detector unit and/or for the adjuster unit) or operating systems, information, data, content, or the like for the processor to perform steps associated with operation of the apparatus in accordance with embodiments.
  • the memory may be, for example, random access memory (RAM) , a hard drive, or other fixed data memory or storage device. Further, the memory, or part of it, may be removable memory detachably connected to the apparatus.
  • an apparatus implementing one or more functions of a corresponding mobile entity described with an embodiment comprises not only prior art means, but also means for implementing the one or more functions of a corresponding apparatus described with an embodiment and it may comprise separate means for each separate function, or means may be configured to perform two or more functions.
  • these techniques may be implemented in hardware (one or more apparatuses) , firmware (one or more apparatuses) , software (one or more modules), or combinations thereof.
  • implementation can be through modules (e.g., procedures, functions, and so on) that perform the functions described herein.
  • the software codes may be stored in any suitable, processor/computer-readable data storage medium(s) or memory unit(s) or article (s) of manufacture and executed by one or more processors/computers.
  • the data storage medium or the memory unit may be implemented within the processor/computer or external to the processor/computer, in which case it can be communicatively coupled to the processor/computer via various means as is known in the art.
  • User equipment may refer to any user communication device.
  • a term "user equipment” as used herein may refer to any device having a communication capability, such as a wireless mobile terminal, a PDA, a smart phone, a personal computer (PC), a laptop computer, a desktop computer, etc.
  • the wireless communication terminal may be an UMTS or GSM/EDGE smart mobile terminal.
  • the application capabilities of the device according to various embodiments of the invention may include native applications available in the terminal, or subsequently installed applications.
  • the messaging service center may be implemented in any network element, such as a server .
  • FIG. 2 is a block diagram of an apparatus according to an embodiment of the invention. Although the apparatus has been depicted as one entity, different modules and memory may be implemented in one or more physical or logical entities.
  • the functionality of the network apparatus 102, 104 is described in more detail below with Figures 3 to 5. It should be appreciated that the apparatus 102, 104 may comprise other units used in or for distributed computing and/or data federation. However, they are irrelevant to the actual invention and, therefore, they need not to be discussed in more detail here.
  • the apparatus may also be a user terminal which is a piece of equipment or a device that associates, or is arranged to associate, the user terminal and its user with a subscription and allows a user to interact with a communications system.
  • the user terminal presents information to the user and allows the user to input information.
  • the user terminal may be any terminal capable of receiving information from and/or transmitting in-formation to the network, connectable to the network wirelessly or via a fixed
  • the apparatus 102, 104 may generally include a processor, controller, control unit or the like connected to a memory and to various interfaces of the apparatus.
  • the processor is a central processing unit, but the processor may be an additional operation processor.
  • the processor may comprise a computer processor, application-specific
  • ASIC application-specific integrated circuit
  • FPGA field-programmable gate array
  • an apparatus implementing one or more functions of a corresponding mobile entity described with an embodiment comprises not only prior art means, but also means for implementing the one or more functions of a corresponding apparatus described with an embodiment and it may comprise separate means for each separate function, or means may be configured to perform two or more functions.
  • these techniques may be implemented in hardware (one or more apparatuses) , firmware (one or more apparatuses) , software (one or more modules), or combinations thereof.
  • firmware or software implementation can be through modules (e.g. procedures, functions, and so on) that perform the functions described herein.
  • the software codes may be stored in any suitable, processor/computer-readable data storage medium (s) or memory unit(s) or article (s) of manufacture and executed by one or more processors/computers.
  • the data storage medium or the memory unit may be implemented within the
  • processor/computer or external to the processor/computer, in which case it can be communicatively coupled to the
  • the signaling chart of Figure 3 illustrates the required signalling.
  • a first network apparatus 102 which may comprise e.g. a client node (HTTP client)
  • second network apparatus 104 which may comprise e.g. a server node (HTTP server)
  • HTTP client client node
  • second network apparatus 104 which may comprise e.g. a server node (HTTP server)
  • HTTP server server node
  • the request 301 is received in the second network apparatus 104 (i.e. a server node 104) .
  • the server node 104 Based on information received in the request 301, the server node 104 performs 302 the computational task by parsing the first URI element, and by applying 302 a first operation on the data collection in question.
  • the first operation may include e.g. a map and/or a reduce operation of functional programming.
  • the server node 104 then removes 302 the first URI element (i.e. the previously parsed URI element), and by applying 302 one or more second operations to a result of a previous operation.
  • the second operation may include e.g. a map and/or a reduce operation of functional programming. Each operation is encoded into a resource for the structured data.
  • the server node checks 302 whether there are URI elements left to be parsed.
  • the server node 104 parses the next URI element, performs the required operation on the data, removes the parsed URI element, until there are no URI elements left to be parsed regarding the HTTP request in question.
  • the server node 104 returns 302 the (final) result of the computational task.
  • the client node 102 may also return 302 one or more intermediate results, if more than one operations are subsequently performed.
  • the server node 104 (and/or the client node 102) may also be configured to store 302 the (final) result of the computational task and/or one or more intermediate results.
  • the server node 104 may then use 302 the (final) result for controlling the functioning of a network element (such as a mobile switching center) 103 using distributed data processing.
  • a response is transmitted from the server node 104 to the client node 102, the response 303 including information on the (final) result of the computational task.
  • the result of the computational task, included in the response message 303 may thus include, e.g. in the above example, the information found on the youngest employee at NSN' s Kunststoff site.
  • Figure 4 is a flow chart illustrating an exemplary
  • the apparatus 104 which may comprise e.g. a server node (HTTP server) , is configured to receive, in step 401, from a network apparatus 102, which may comprise e.g. a client node (HTTP client) , a request to perform a
  • the server node 104 Based on information received in the request, the server node 104 performs the computational task by parsing, in step 402, the first URI element, and by performing, in step 403, a first operation on the data collection.
  • the first operation may include e.g. a map and/or a reduce operation of functional programming.
  • the server node 104 removes the first (parsed) URI element, and checks, instep 405, based on the request (each (map/reduce) operation is encoded into a resource for the structured data) , whether a further
  • step 405 If it is found out in step 405 that a further operation is needed (i.e. there are one or more URI elements left), the server node is configured to return to step 402, and parse the next URI element, and perform, in step 403, a second operation to the data collection, (the second
  • Step 404 the URI element in question is removed in step 404.
  • Steps 402, 403, 404 and 405 are repeated until the required operations have been performed (i.e. until there are no URI elements left) .
  • the operations are encoded to URL (or URI) .
  • the server node 104 is configured to return 406 the (final) result of the computational task.
  • the server node 104 may also be configured to store the (final) result of the computational task and/or one or more
  • the server node may transmit 406 the (final) result (or one or more intermediate results) to the client node 102, and provide 406 a control signal to a network element (such as a mobile switching center 103) NE, to control the functioning of the network element 103 using distributed data processing.
  • a network element such as a mobile switching center 103
  • Figure 5 is a flow chart illustrating an exemplary
  • a network apparatus 102 which may comprise e.g. a client node (HTTP client), transmits 501, to a further network apparatus 104 which may comprise e.g. a server node (HTTP server) , a request to perform a computational task on structured data, the request identifying a data collection and the requested task.
  • HTTP client client node
  • server server node
  • the client node 102 receives a response including a result of the computational task, from the server node 104.
  • computational task received in step 502 may include, e.g. in the above example, the information found on the youngest employee at NSN' s Kunststoff site.
  • a method comprising controlling the functioning of a network element by receiving, from a client node, a request to perform a computational task on structured data, the request identifying a data collection and the requested task; based on the request, performing the computational task by applying a first operation to the data collection, and, if needed, by applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and returning a result of the computational task.
  • a method comprising receiving the request via a uniform interface .
  • a method comprising receiving the request in a representational state transfer server node from a
  • each operation is encoded into a uniform resource identifier for the structured data such that a record key is directly used in the uniform resource identifier, if the record key does not collide with a uniform resource identifier of the representational state transfer server node.
  • a method comprising recursive application of map and/or reduce operations to the structured data, wherein, if needed, the result of one operation is fed to another operation .
  • a method comprising storing, at least temporarily, the result and/or one or more intermediate results.
  • a method comprising using the result in the server node in order to manage the functioning of the network element .
  • an apparatus configured to receive, from a client node, a request to perform a computational task on structured data, the request identifying a data collection and the requested task; based on the request, perform the
  • computational task by applying a first operation to the data collection, and, if needed, by applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and return a result of the computational task.
  • said first operation includes a map and/or a reduce operation of functional programming
  • the second operation includes a map and/or a reduce operation of functional programming
  • an apparatus configured to receive the request via a uniform interface.
  • the uniform interface comprises a hypertext transfer protocol interface and/or a representational state transfer interface.
  • an apparatus configured to receive the request from a representational state transfer client node.
  • an apparatus configured to encode each operation into a uniform resource identifier for the structured data such that a record key is directly used in the uniform resource identifier, if the record key does not collide with a uniform resource identifier of the representational state transfer server node.
  • an apparatus configured to perform recursive application of map and/or reduce operations to the structured data and, if needed, feed the result of one operation to another operation.
  • an apparatus configured to store, at least
  • an apparatus configured to provide the result to the client node.
  • an apparatus configured to perform a map operation by performing a specified operation on a resource.
  • an apparatus configured to perform a reduce
  • an apparatus comprising a hypertext transfer protocol server node and/or a representational state transfer server node.
  • an apparatus configured to use the result to control the functioning of a network element.
  • a client node configured to transmit, to a server node, a request to perform a computational task on structured data, the request identifying a data collection and the requested task, the computational task including applying a first operation to the data collection, and, if needed, applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and receive, from the server node, a response message including a result of the computational task.
  • a client node configured to use the result to control the functioning of a network element.
  • a client node configured to transmit the request to several server nodes in order to distribute data processing in a communications network.
  • a client node comprising a hypertext transfer protocol client node and/or a representational state transfer client node.
  • a client node configured to transmit the request via a uniform interface, wherein the uniform interface comprises a hypertext transfer protocol interface and/or a
  • a communications system configured to control the functioning of a network element by receiving, from a client node, a request to perform a computational task on structured data, the request identifying a data collection and the requested task; based on the request, performing the
  • a computer-readable storage medium embodying a program of instructions executable by a processor to perform actions directed toward controlling the functioning of a network element by receiving, from a client device, a request to perform a computational task on structured data, the request identifying a data collection and the requested task; based on the request, performing the computational task by applying a first operation to the data collection, and, if needed, by applying one or more second operations to a result of a previous operation, wherein each operation is encoded into a uniform resource identifier for the structured data; and returning a result of the computational task.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

L'invention concerne un procédé pour la répartition de traitement de données. Le procédé comprend la commande du fonctionnement d'un nœud de réseau par la réception (401), à partir d'un dispositif client, d'une demande de réalisation d'une tâche calculatoire sur des données structurées, la demande identifiant un recueil de données et la tâche demandée. En fonction de la demande, la tâche calculatoire est réalisée par l'application (403) d'une première opération sur le recueil de données, ladite première opération comprenant une carte et/ou une opération de réduction de programmation fonctionnelle, et, si nécessaire, par l'application (403) d'une ou plusieurs secondes opérations sur un résultat d'une opération précédente, la seconde opération comprenant une carte et/ou une opération de réduction de programmation fonctionnelle. Chaque opération est codée dans une ressource pour les données structurées. Un dispositif de serveur renvoie (406) le résultat de la tâche calculatoire.
PCT/EP2011/052208 2011-02-15 2011-02-15 Répartition de traitement de données WO2012110079A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2011/052208 WO2012110079A1 (fr) 2011-02-15 2011-02-15 Répartition de traitement de données

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2011/052208 WO2012110079A1 (fr) 2011-02-15 2011-02-15 Répartition de traitement de données

Publications (1)

Publication Number Publication Date
WO2012110079A1 true WO2012110079A1 (fr) 2012-08-23

Family

ID=44625200

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2011/052208 WO2012110079A1 (fr) 2011-02-15 2011-02-15 Répartition de traitement de données

Country Status (1)

Country Link
WO (1) WO2012110079A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140214996A1 (en) * 2013-01-29 2014-07-31 Stg Interactive S.A. Distributed Computing Architecture
WO2014146441A1 (fr) * 2013-03-18 2014-09-25 Tencent Technology (Shenzhen) Company Limited Procédé, serveur et système pour traiter des données de tâche
US9280384B2 (en) 2013-03-18 2016-03-08 Tencent Technology (Shenzhen) Company Limited Method, server and system for processing task data
US9338234B2 (en) 2014-04-16 2016-05-10 Microsoft Technology Licensing, Llc Functional programming in distributed computing
CN107689968A (zh) * 2016-08-03 2018-02-13 阿里巴巴集团控股有限公司 任务的处理系统、方法及装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030028543A1 (en) * 2001-08-01 2003-02-06 Dusberger Dariusz T. Image storage and reference using a URL
EP1441281A2 (fr) * 2003-01-23 2004-07-28 Hewlett-Packard Development Company, L.P. Traitement de commande de contrôle d'une imprimante
US20080098370A1 (en) * 2006-10-20 2008-04-24 Marcus Felipe Fontoura Formal Language and Translator for Parallel Processing of Data

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030028543A1 (en) * 2001-08-01 2003-02-06 Dusberger Dariusz T. Image storage and reference using a URL
EP1441281A2 (fr) * 2003-01-23 2004-07-28 Hewlett-Packard Development Company, L.P. Traitement de commande de contrôle d'une imprimante
US20080098370A1 (en) * 2006-10-20 2008-04-24 Marcus Felipe Fontoura Formal Language and Translator for Parallel Processing of Data

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140214996A1 (en) * 2013-01-29 2014-07-31 Stg Interactive S.A. Distributed Computing Architecture
EP2951690A1 (fr) * 2013-01-29 2015-12-09 STG Interactive S.A. Architecture informatique distribuée
US9313087B2 (en) * 2013-01-29 2016-04-12 Stg Interactive, S.A. Distributed computing architecture
US9860192B2 (en) 2013-01-29 2018-01-02 Stg Interactive, S.A. Distributed computing architecture
WO2014146441A1 (fr) * 2013-03-18 2014-09-25 Tencent Technology (Shenzhen) Company Limited Procédé, serveur et système pour traiter des données de tâche
US9280384B2 (en) 2013-03-18 2016-03-08 Tencent Technology (Shenzhen) Company Limited Method, server and system for processing task data
US9338234B2 (en) 2014-04-16 2016-05-10 Microsoft Technology Licensing, Llc Functional programming in distributed computing
CN107689968A (zh) * 2016-08-03 2018-02-13 阿里巴巴集团控股有限公司 任务的处理系统、方法及装置

Similar Documents

Publication Publication Date Title
US10791190B2 (en) Systems and methods for avoiding server push of objects already cached at a client
US20200404068A1 (en) Managing mobile device user subscription and service preferences to predictively pre-fetch content
US9135629B2 (en) User targeting management, monitoring and enforcement
US10063653B2 (en) Distributed server architecture for supporting a predictive content pre-fetching service for mobile device users
US9705922B2 (en) Cloud-based user-level policy, reporting, and authentication over DNS
US8073810B2 (en) Shared view of customers across business support systems (BSS) and a service delivery platform (SDP)
US9313100B1 (en) Remote browsing session management
CN103685590B (zh) 获取ip地址的方法及系统
US20110214051A1 (en) Methods and apparatus to subscribe for change notifications in a document management system
US9172765B2 (en) Polling-based secure network message notification system and method with performance enhancing features
CN102291243A (zh) 业务处理服务器、系统和方法
US10798577B2 (en) Unified data repository proxy
US9952888B2 (en) Method and system to dynamically instantiate virtual repository for any services
US20220272010A1 (en) Network entities for supporting analytics generation
WO2012110079A1 (fr) Répartition de traitement de données
US20060259523A1 (en) System and method of synchronization of internal data cache with wireless device application data repositories
US7725489B2 (en) Node for providing a file service to a mobile terminal
US9237206B2 (en) Method and apparatus for updating personal information in communication system
EP4189997A1 (fr) Gestion de demande de service
CN101753561B (zh) 业务的集群处理方法及集群系统
CN106790176B (zh) 一种访问网络的方法及系统
CN104980329A (zh) 通讯录管理方法及装置、移动代理服务器
US9742674B1 (en) Methods for distributed application visibility and reporting and devices thereof
KR101196636B1 (ko) 리스트 조회를 이용한 프레즌스 관리 시스템 및 관리 방법
CN117880075A (zh) 数据管理方法、服务器端、客户端及系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11704965

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11704965

Country of ref document: EP

Kind code of ref document: A1