Abstract: Disclosed are various embodiments involving a container contract for data dependencies using representational state transfer (REST). A data resource is obtained by way of REST in response to determining that an application component has a dependency on the data resource. The application component is invoked to process the data resource. The data resource may be sent to the server by way of REST to effect a modification to the data resource in the server in response to determining that the application component has modified the data resource.

Abstract: Devices, methods and instructions encoded on computer readable medium for implementation of a dual-adjacency between edge devices of a network site. A first edge device comprises one or more local interfaces configured for communication, via a local network, with one or more network devices co-located in a first network site. The first edge device also comprises one or more overlay interfaces configured for communication, via a core network, with one or more network devices located in one or more other network sites connected to the core network. The first edge device comprises a processor configured to establish, via at least one of the local interfaces, a site communication channel with a second edge device co-located in the first network site. The processor is further configured to establish an overlay communication channel, via at least one of the overlay interfaces, with the second edge device.

Abstract: One or more event records associated with incidents that may occur in a network may be created and stored in an event sequence with other related event records. Whether the event records are related may be determined based at least in part on a dependency between network elements associated with the incidents. The one or more event records may be executed by event handlers to create additional event records, which may also be stored in an event sequence with related event records. A user may request event sequences for display at a user device. Event sequences may be processed to provide at least a portion of the sequences based at least in part on user-specific information. A user may interact with and/or respond to event records in the network. Such interactions or responses may also be stored as event records in an event sequence.

Abstract: A communication system (30) may include a mobile wireless communications device (35a-35c) associated with an account including an ordered master set (80) of personal information manager (PIM) entries (81a-81c) for a type of PIM data. The mobile wireless communications device may be configured to store an ordered subset (85) corresponding to the ordered master set of PIM entries for the type of PIM data. The communication system may also include a synchronization server (32) configured to synchronize the mobile wireless communications device and the account by mapping an PIM entry (81d) from the ordered master set to fill the ordered subset responsive to deletion of a PIM entry (86c) from the ordered subset. For example, the PIM data can include notes, journal entries, address book contents, lists, tasks, memos, calendar content (e.g. birthdays, anniversaries, appointments and meetings), reminders, account information (e.g.

Abstract: A system is provided in which at least one first server comprises at least one data processor executing a business application platform providing various business applications for access by at least one remote client. In addition, at least one second server comprises at least one data processor executing an embedded business intelligence server (EBIS). The EBIS provides an interface to the platform to at least one business intelligence applications providing business intelligence functionality. With such a system, a unified interface can be rendered on the at least one remote client concurrently provides functionality from the platform and the at least one business intelligence client. Related apparatus, systems, techniques and articles are also described.

Abstract: A method for determining a location of a requested resource, comprising receiving a request for a resource, wherein the resource is identified by a hierarchically structured name, decomposing the hierarchically structured name into a plurality of segments, comparing each of the plurality of segments to parent nodes of a plurality of two-level treelets, wherein the comparing of at least two of the plurality of segments to parent nodes of the plurality of two-level treelets is performed in a parallel manner, wherein combinations of two-level treelets comprise a hierarchical name of a network resource, and determining a longest prefix match of the hierarchically structured name.

Abstract: The present invention provides a method for redistributing the license tokens to the traffic nodes to make the license tokens can be efficiently distributed to the traffic node. The method including: collecting usage information of each of the traffic nodes; determining a set of license tokens for each of the traffic nodes; and commanding a first group of traffic node(s) to release license tokens and commanding a second group of traffic node(s) to request license tokens based on the usage information and the set of license tokens. A moderator, used in a license controlling system which can efficiently redistribute the license tokens among the traffic nodes, is provided and a controlling system which including this moderator is also provided.

Abstract: According to one aspect of this disclosure, a data processing device is provided including a controller configured to open a logical channel with another data processing device and a receiver configured to receive a message from the other data processing device specifying a data link layer protocol data unit size to be used for exchanging data via the logical channel and further including a transceiver configured to exchange data with the other data processing device over the logical channel in accordance with the data link layer protocol data unit size wherein the data link layer protocol data unit size is constant for the logical channel until the logical channel is closed.

Abstract: A server rack system is provided, which includes a rack, a rack management module, a plurality of servers, and a management network connection module. The rack management module is located in the rack and coupled to a management network line (MNL). The servers are located in the rack. Each server includes a baseboard management controller (BMC), and each BMC is used to monitor a working status of the server where the BMC is located. The management network connection module is located in the rack and coupled to the MNL to be connected to the rack management module and the BMC through the MNL. The rack management module is used to allocate an Internet Protocol (IP) address to the BMC and manage each server through the BMC corresponding to each IP address.

Abstract: In at least one example embodiment, the invention relates to a computer-implemented method, a computer-implemented system and a computer program product for controlling the access to splittable resources in a distributed client server system operating in parallel. The resource control system is designed for a plurality of clients connected to the system and is used to maintain consistency of the data. When a client makes a first attempt to access a resource of the server, an exclusive lock for the requested resource is allocated to the accessing client, that blocks the access to the resource for other clients, said exclusive lock only being allocated for a pre-determinable period of time and then automatically discontinued.

Abstract: An information management apparatus may include a first collection unit that collects a measurement value measured by a measurement device connected to the information management apparatus via a network, a second collection unit that collects status information indicating statuses of the measurement device and the network, and a correction unit that correcting quality information indicating validity of the measurement value, which has been collected by the first collection unit, by using the status information that has been collected by the second collection unit.

Abstract: In a computer system according to an embodiment of the present invention, a first slave server includes copy management information associating a master file system identifier with an identifier of a slave server including a copy of the master file system identified by the master file system identifier. The first slave server acquires a copy of a part of a master file system. The copy includes a stub-state object (file or directory). The first slave server searches the copy management information for a slave server to be queried regarding information for materializing the stub-state object. If the slave server to be queried includes the information for materialization, the first slave server materializes the stub-state object using the information for materialization acquired from the queried slave server.

Abstract: In at least one embodiment, data relating to the usage and the operating status of a frontend module of a software application implemented on the client side is acquired continuously during the execution of the application by way of a monitoring frontend module implemented on the client side of a client/server system. This acquired usage and status data is transmitted by the monitoring frontend module to a monitoring backend module implemented on the server side. The usage and status data is stored by the monitoring backend module in a database on the server side. The usage and status data stored in the database is automatically analyzed by way of an analysis module. In the process, default settings of the software application are automatically modified by way of the analysis module on the basis of the result of the analysis in order to improve the performance of the application.

Abstract: A method of profiling communication traffic of users in a data network, comprising: monitoring communication traffic originated by a user of a communication terminal; and assigning to the user of the communication terminal a unique and anonymous user traffic identifier, wherein the user traffic identifier is related to a user address assigned to the communication terminal in the data network. Also, the user traffic identifier is adapted to be included in the communication traffic with respect to that user.

Abstract: According to embodiments described in the specification, a method, system and apparatus for processing calendar events are provided. The method comprises: receiving a calendar event invitation message addressed to at least one recipient device and storing the calendar event invitation message in a memory; determining, at a processor, whether to disable at least one recipient device function; when the determination is affirmative, generating a recipient policy including a recipient device function identifier, and a rule associated with the function identifier; and deploying the recipient policy for the at least one recipient device such that the function is disabled at the recipient device for at least a period of time.

Abstract: A method, an apparatus, and a computer program product for wireless communication are provided that may help account for scenarios in which a transport block size (TBS) for a retransmission may be determined based on a first grant, while a number of resource blocks (RBs) assigned for the retransmission may be determined from a second grant.

Abstract: Techniques for managing information exchange between business entities include identifying a plurality of routing rules stored in a database of a first business entity computing system; receiving a request for a business transaction through an application of a plurality of applications of the first business entity computing system; determining, based on the identified routing rules, an identifiable business context reference (IBCR) associated with a second business entity computing system, the IBC comprising a unique identifier associated with the second business entity and a first plurality of business data attributes associated with the second business entity; determining, based on the identified IBCR, a communication connection associated with the IBC and an identifiable business context (IBC) associated with the first business entity computing system; and initiating the business transaction between the first business entity computing system and the second business entity computing system through the deter

Abstract: A technology is disclosed that provides a handover method and the like capable of improving communication efficiency by reducing tunnel overhead between a mobile node and a home agent. The technology includes: a step of transmitting, by a mobile node (UE) 107, a message including a home address allocation request in a network 102 of the handover destination and an allocated first address, to a home agent (HA) via an access router 104 before a handover; and a step of performing, by the HA, a predetermined process based on the received message and transmitting to the UE, a response message including a home address in response to the allocation request.

Abstract: A universal platform for utility computing that allows service providers to charge clients for the services rendered according to a dimensionless cross-platform universal metric. The platform measures or monitors six metrics commonly used in software computing (MHz for CPU usage, Mbytes for memory usage, Kbytes/sec for I/O, Kbytes/sec for LAN, Kbits/sec for WAN and Gbytes for storage) and applies appropriate weighting and conversion factors to each consumption value to a value in the universal metric that can be applied agnostically to any system or application. The metric can also take other controllable variables into account, such as real estate cost, tax jurisdiction and electrical power. The metric effectively a metric makes diverse computing resources comparable. The total value of the resources consumed by a user determines the cost charged for the use of the computing services.

Abstract: In one embodiment, a node in a computer network represented by a directed acyclic graph (DAG) may receive advertisements of smoothed path costs to a root node of the DAG, where the advertisements contain a field for a virtual gain factor (VGF) indicative of a difference between the smoothed path cost and an actual best path cost to the root. The node may then determine a local smoothed path cost from itself to the root, and also a local VGF for each link of the node (for the path as a whole including the particular link) based on all of the received advertisements and VGFs, as well as corresponding actual link costs (e.g., based on selecting alternative parents or actual link costs being smoothed within a dual threshold). The node may then compute a resulting smoothed path cost to the root along with an associated (cumulative) VGF based on the locally determined cost and VGF.