Abstract: A method of generating a segment key KSmt from a given basic key KmT and a given modification key K?MT in a key space with M*T keys. The basic key KMT is split into two parts LmT, RmT onto which a one-way function is applied M?m and T?t times, respectively, and the results are combined again to form a target basic key. A one-way function is applied to the modification key K?MT a number of times that corresponds to a distance value z between the given basic key and the segment key; in one preferred embodiment z=(M?m)+(T?t). This result is XOR-ed with the target basic key to obtain the segment key KSmtAlso provided is a device.

Abstract: A method comprises estimating a performance of a processing system using queueing theory wherein the processing system comprises a network that accepts at least one input message stream from a plurality of publishing clients, transforms the at least one input message stream into at least one output message stream utilizing the plurality of transforms distributed in a first assignment among the plurality of brokers, and delivers the at least one output message stream to at least one of the plurality of subscribing clients, performing optimization upon the assignment of the plurality of transforms using the estimated performance to produce a second assignment, and reassigning the plurality of transforms in accordance with the second assignment.

Abstract: Systems and methods relate to collaboration systems having multiple terminals per user. The collaboration system may include first and second collaboration agents, where the first collaboration agent is operable to transmit over a telecommunications network a collaboration call invitation from a first user first terminal associated with the first collaboration agent to a second user first terminal associated with a second collaboration agent; to connect a first communication session if the second user first terminal accepts the collaboration call invitation; to transmit a collaboration call handle to at least the first user first terminal and a first user second terminal associated with the first collaboration agent; to transmit a collaboration command from the first user second terminal to a second user second terminal associated with the second collaboration agent; and to connect a second communication session between the first user second terminal and the second user second terminal.

Abstract: An edge server in a distributed processing environment includes at least one process that manages incoming client requests and selectively forwards given service requests to other servers in the distributed network. According to the invention, the edge server includes storage (e.g., disk and/or memory) in which at least one forwarding queue is established. The server includes code for aggregating service requests in the forwarding queue and then selectively releasing the service requests, or some of them, to another server. The forward request queuing mechanism preferably is managed by metadata, which, for example, controls how many service requests may be placed in the queue, how long a given service request may remain in the queue, what action to take in response to a client request if the forwarding queue's capacity is reached, and the like.

Abstract: A system and method concerns a secure transmission of a file fragmentable into a plurality of fragments, and comprises (a) initially fixing a global encryption key; (b) encrypting the fragmentable file based on said global key to form a first encrypted file; (c) encrypting the global key by means of an asymmetric encryption algorithm using a public key to obtain a global encrypted key; (d) inserting values representing the global encrypted key among the fragments of said encrypted file to form a second encrypted file; and (e) transmitting the second encrypted file.

Abstract: There are introduced ways for retrieving or depositing a replica of an electronic document in a computer network. After having selected at least one replica number, a given function is applied. The function requires as input the replica number and a document identifier. The function returns as a result at least one entity identifier, each entity identifier representing an entity in the network that might provide the replica. In a next step, a document related request is addressed to at least one of the identified entities.

Abstract: A device and method of collision-free hashing of near-match inputs that includes the following components. An adder for receiving an input i, a check value cv, and outputs n, which is greater than or equal to the sum of i and cv. A checker for receiving a value n, a value d, a first polynomial, and an output at which the first polynomial appears if the checker determines that the first polynomial is of degree proportional to d and divides xn+1. A factorization block for factoring the first polynomial into a second polynomial and a third polynomial. A first division block for dividing an input of bit length i by the second polynomial to generate a first portion of the hash of the input. A second division block for dividing the input by the third polynomial to generate a second portion of the hash of the input.

Abstract: A method of collision-free hashing of near-match by selecting bit positions d that differ between a first input and a second input, selecting a degree of a first polynomial for a cyclic code proportional to d, selecting a bit length i of the first input and the second input, selecting a bit length cv of a check value greater than or equal to d, setting n>=i+cv, generating the first polynomial that divides xn+1, factoring the first polynomial into a second and a third polynomials, receiving the first input, dividing the first input by the second polynomial, dividing the first input by the third polynomial, and identifying the results of the last two steps as a hash of the first input.

Abstract: The invention provides one or more modules that may be used to automatically configure a computing device to communicate over a network. When a polling computer is connected to a network, it monitors network traffic to determine the protocols being used on the network. These protocols are then installed and loaded onto the polling computer. The polling computer may find voting computers on the network and send queries to the voting computers to discover network information such as network settings and network resources. The polling computer stores the results in a data structure, which may be sorted and is searchable to find the most popular network settings and resources used on the network. Network settings and resources may be automatically applied to the polling computer or the user may be provided with a user interface allowing the user to select particular settings and/or resources.

Abstract: When performing distributed processing in processing devices connected to a network and a processing managing device for managing the processing devices, it is possible to eliminate the overhead of the processing management device. The processing management device (PU) (203) managing processing devices (SPU) (207) under its control lists the network address of the SPU (207) and other SPU connected to the network and resource information indicating the current task execution ability of the SPU in a resource list. When one of the SPU transmits a task request to the PU (203), the PU (203) specifies one or more SPU capable of performing the task request in the resource list and requests the specified SPU to execute a task including the execution result specification destination, thereby enabling execution result transmission/reception not using the PU (203).

Abstract: One or more users of a present state are notified of at least one property of an entity. A request message is received from a user over a first communications channel, the message containing information indicative of at least one property of an entity in which the user is interested. The present state of the at least one property is determined, as is an identifier of a second communications channel onto which future messages containing information relating to future changes of state of the at least one property of the entity will be transmitted. A reply message is transmitted to the user, the reply message containing information indicative of the present state of the at least one property and of the identifier of the second communications channel.

Abstract: The present invention is directed to a small size and light weight small form factor user system suitable for having TTNT connectivity which consumes minimum power to operate. The small form factor user system having TTNT connectivity may be capable of interacting in a low latency real time manner with airborne networks. The small form factor user system having TTNT connectivity may have significantly reduced radio power consumption and form factor size through maintaining core capabilities of the full size TTNT terminal while relaxing other capabilities. An encapsulated message structure may be utilized to simplify communication between the TTNT small form factor user system and the full size TTNT nodes.

Abstract: To measure the quality of service at the application level in a telecommunication network (N), a function (A) is provided for carrying out sessions at the application level on said network (N). Through this activation function (A), sessions are then carried out, measuring (F) and also storing (HK in a set of points (S1, . . . , Sk, Sn) of the network (N) data indicative of the behavior of said network. The possible occurrence of critical situations relating to quality of service is verified (B) and, upon the occurrence of a said critical situation, a trigger signal (Trigger) is generated. By effect of the generation of said trigger signal, the data indicative of the behavior of the network measured and stored in the aforesaid set of points of the network (N) are collected in centralized fashion (H). The data thus collected are indicative of the end-to-end quality of service of the network (N) itself. Preferential application to packet networks like mobile telephony network such as GPRS or UMTS networks.

Abstract: An object of the present invention is to provide a management method of network device, which can implement concentrate management of a large number of network devices with a small amount of IP resources, and thereby reducing maintenance workload and facilitating network management.

Abstract: An event driven, network enabled off-site management listening system (“Listener”) manages remote devices by listening to unsolicited events communicated from devices connected to the Internet, and from a Mission Controller. The Listener listens for messages, decrypts them, and writes the message to the message queue where a Message Decoder retrieves the message. The Message Decoder decodes the messages and updates the database with location and device specific status information. The Listener also takes messages from the Mission Controller to be executed in a specific sequence, and transmits those messages over the Internet to the specific locations and devices as specified by the Mission Controller. Web-based applications allow end users to monitor and control any device or component connected to the Home Central system from any Internet-enabled device or public communications network.

Abstract: Association control is utilized for associating wireless local area network users with at least one wireless local area network access point and thereby achieving simultaneous fairness and load balancing. In the present method, a network operation center receives user parameters from each user in the wireless network via the access points. It then sets out both to determine a set of associations between each user and one or more access points based on the user parameters using fractional load balancing and produce a second set of associations by rounding so that, in said second set, each user is associated with only one access point. The present method achieves close to optimal load balancing and max-min fairness while outperforming commonly-used heuristic approaches.

Abstract: A method comprises estimating a performance of a processing system using queuing theory wherein the processing system comprises a network that accepts at least one input message stream from a plurality of publishing clients, transforms the at least one input message stream into at least one output message stream utilizing the plurality of transforms distributed in a first assignment among the plurality of brokers, and delivers the at least one output message stream to at least one of the plurality of subscribing clients, performing optimization upon the assignment of the plurality of transforms using the estimated performance to produce a second assignment, and reassigning the plurality of transforms in accordance with the second assignment.

Abstract: A system and method for facilitating a consistent point-in-time copy (PITC). A data provider offers access to data by one or more clients. A client issues a PITC request for a set of data to the data provider, or the provider initiates its own request. The data provider instructs one or more clients, particularly clients accessing the set of data, to flush any pending updates involving the files. The clients acknowledge the flush request, flush their data, and notify the data provider when their flushes are complete. Post-consistency updates are deferred (e.g., using a write-aside buffer). If a client fails to acknowledge the flush request or notify of flush completion, the data provider may abort the PITC or continue because the data may not be consistent or consistency may not be assured. If not aborted, the PITC may be marked to indicate that it is incomplete.

Abstract: There is provided a system for resolving a proxy server name for a web browser request issued by a user device in a network. The user device has a browser configured with the proxy server name. The system includes a Domain Name System (DNS) server and a web server. The DNS server generates a private Internet Protocol (IP) address associated with the user device in response to a non-resolvable DNS query from the user device that specifies the proxy server name, and creates a one-to-one mapping that relates the private IP address to the proxy server name. The web server receives a web browser request from the user device. The web browser request has been redirected to the web server and has an original destination IP address equal to the private IP address. The web server identifies the proxy server name from the private IP address using the one-to-one mapping.

Abstract: The present invention provides Web Services over a mail transport. In particular, the present invention sends Web Service messages using MAPI (Messaging Application Program Interface) mail applications in order to support offline communications and extended processing time of service requests without creating additional infrastructure for such message exchanges. A custom layer transport is configured to: identify that a Web Service message is to be sent across a mail transport; use the MAPI application to generate a mail message; and include the Web Service message and other identifiers within the mail message. The message is then sent to the outgoing mailbox of the MAPI application for subsequent delivery to an endpoint. Upon receiving the mail message, the endpoint can extract the Web Service message and process it accordingly. Other example embodiments also provide for requesting NPDL (Network Protocol Description Language) data structures (e.g., WSDL documents) by a similar process.