Abstract: The invention concerns a method for determining priority of a data item, the data item being sent from at least one first terminal or service associable with the first terminal to a second terminal and evaluated using a set of first rules associable with the sender of a data item and a set of second rules associable with the recipient of a data item. The invention is characterized in that the data item is associated with at least one tag characterizing the data item, weight factor for the data item is maintained using the set of first rules and the value of the at least one tag, the weight factor of the data item is made adjustable by the set of second rules and the data item is rendered on the second terminal using at least the weight factor information. Also an arrangement implementing the method is disclosed.

Abstract: A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.

Abstract: A plurality of pieces of information about a link (hereinafter referred to as “link information”), which are stored in a common DB, are categorized in accordance with the VPN related to each piece of link information. VPNID, which is information for identifying each VPN, is added to each piece of link information which has been categorized. The link information for the same VPNID is extracted from the link information to which the VPNID for the common DB is added so as to be contained in the corresponding VPNDB. By doing this, it is possible to realize a path design for the customer easily by providing the network information in the VPN provider and the network information of the customer network while realizing a high scalability.

Abstract: A method of routing data from a source to one or more clients over a network, where the data conforms to a structured meta-language; in which the routing is performed by a server applying rules to the data itself, and not any address accompanying the data, to determine where to route that data to. The present invention is predicated on the counter-intuitive insight that data does not need to be concealed within a data envelope and given an address label in order to be routed effectively and efficiently. Instead, routing can be performed on the actual content of a message by applying simple routing rules to the data itself by intelligent ‘routing’ servers within the network which can unpack data from their message envelopes and intelligently filter/combine them with data unpacked from other messages to achieve a routing function.

Abstract: A method includes connecting a communications device to an Internet Multimedia Subsystem network. The method includes transmitting presence information indicating multimedia capabilities of the communications device and requesting multimedia content from a multimedia server to cause the multimedia server to transmit multimedia content. The method includes detecting connection of a peripheral device to the communications device and determining that the multimedia capabilities have increased due to the connection of the peripheral device. The method includes updating the presence information to indicate the increased multimedia capabilities and transmitting the updated presence information to cause the multimedia server to transmit the multimedia content adjusted for the increased multimedia capabilities indicated in the updated presence information.

Abstract: A method of determining compatibility of a virtual machine or virtual machine disk file with a host, including a storage host, is disclosed. A lookup matrix is created to provide a fast compatibility lookup for a group of computing objects and a group of hosts. To create the lookup matrix, computing object properties are retrieved from each of the plurality of computing objects. The computing object properties include resource requirements of each of the plurality of computing objects. Further, host properties are retrieved from each of the plurality of hosts. The method further includes creating a plurality of host logical groups of a subset of the plurality of hosts having substantially same host properties and creating a plurality of computing object logical groups of a subject of the plurality of computing objects having substantially same computing object properties.

Abstract: One or more techniques and/or systems are disclosed for providing efficient synchronized data access. A request to access data on a first data provider is received. The requested data on the first data provider is synchronized with a second data provider, such that the first and second data providers respectively comprise a same version of the requested data. A provider score can respectively be determined for the first data provider and for the second data provider, where the provider score utilizes heuristic data that may indicate a data access rate and/or a cost of data access, for the respective first data provider and second data provider. The request for data access can be routed to the data provider that comprises a desired provider score, where a desired provider score may indicate a desired rate of data access and/or cost of data access.

Abstract: An information processing apparatus communicable with an image processing apparatus. The information processing apparatus including a transmission unit configured to transmit a job that requests execution of image processing, a switching unit configured to automatically switch a transmission destination of the job to the image processing apparatus during a communication with the image processing apparatus, and a unit configured to revert the transmission destination of the job, after completion of the communication with the image processing apparatus, to a setting before the transmission destination of the job was switched by the switching unit.

Abstract: A policy based look up procedure enables a code division multiple access (CDMA) wireless network to modify a quality of service (QoS) level granted for an application packet flow in real time, e.g. in response to a customer service request, upon determination of a need to change network operations, periodically, or under other dynamic circumstances. The policy look up table identifies QoS levels and rules to identify an individual or group of users or types of applications and the associated packet flows that should be processed through a radio access network in accord with each applicable QoS level. In a typical implementation, a packet data serving node stores or has access to the carrier's QoS policy table to perform the look up and instruct a radio network controller or other element of the radio access network as to the applicable QoS level for each packet flow for a mobile station.

Abstract: A flexible multi-processor communications system supports variable message lengths and variable groups and application designations at respective processors. The receiving processors determine what action, if any, needs to be taken in response to the combination of group and application information in the messages. The receiving processors can include pluralities of pre-stored groups and applications along with associated priorities and the functions to perform.

Abstract: Systems and methods for processing encoded messages within a wireless communication system. A server within the wireless communication system provides one or more indications to a mobile device as to certain conditions existing with respect to an encoded message. The mobile device performs a different message processing function based upon whether the indication is provided. The indications may include indicating whether a message exceeds a message size threshold and/or may indicate whether a partial message is being sent.

Abstract: For each one of a plurality of broadcast control channels, a mobile device measures a signal strength level of a radio frequency (RF) signal from a wireless communication network. The mobile device then repeats the measuring at least one time so that at least one other signal strength level of the RF signal on the broadcast control channel is identified. The mobile device also receives and decodes information which is broadcasted on the broadcast control channel, and stores this broadcasted information in memory. The acts of receiving, decoding, and storing are performed after measuring the signal strength level of the RF signal, but prior to completion of an averaging function for calculating an averaged signal strength level of the signal strength levels.

Abstract: A content delivery network (CDN) typically includes a mapping system for directing requests to CDN servers. One or more peer machines become associated with the CDN, and the CDN mapping system is then used to enable a given peer to locate another peer in the P2P network, and/or a CDN server. Using this hybrid approach, CDN customer content may be delivered from the CDN edge network, from the P2P network, or from both networks. In one embodiment, customer content is uploaded to the CDN and stored in the edge network, or in a storage network associated therewith. The CDN edge network is then used to prime the P2P network, which may be used to take over some of the content delivery requirements for the customer content. The decision of whether to use edge network or peer network resources for delivery may be based on load and traffic conditions.

Abstract: A data processing apparatus includes plural transmission units that transmits transmission data to one or more users, a storage part that stores a destination group table therein, the destination group table including a data structure in which data of one or more of the plural transmission units are associated with user data of the one or more users, a reception part that receives selection data indicating selection of the one or more users, receives designation data indicating designation of one or more of the plural transmission units, and extracts the user data from the storage part according to the selection data and the designation data, and a transmission request part that requests transmission of the transmission data to at least one of the plural transmission units according to the user data extracted by the reception part.

Abstract: A method for establishing routes to neighboring networks during an initialization sequence according to a prioritized order may include detecting a power-cycling event and accessing a plurality of identifiers stored in a memory device that persisted through the power-cycling event. Each of the plurality of identifiers may be associated with a network. The networks may include first networks that are coupled to network endpoints, and second networks that are capable of coupling to the one or more first networks. For each network, the method may further include accessing a priority field in the memory device that may be associated with the network. The respective priority field can be based on an order in which communications should be established with the network and application layer information. The method may also include attempting to establish communications with each of the plurality of networks in an order based on the priority fields.

Abstract: The present application relates to methods and systems for intelligently routing requests to one of a plurality of redundant servers. The methods and systems route the requests to a most highly ranked redundant server. The redundant servers are dynamically rank according to ranking information, wherein the ranking information may include server performance information, server response information, next step performance information, next step response information, historic information and other like information. Next step response information and next step performance information corresponds to information pertaining to servers the plurality of redundant servers depend upon. The methods and systems may further randomly re-rank the plurality of redundant servers. The methods and systems may further re-route unprocessed requests meeting non-performance criteria.

Abstract: A method for reliably transferring media over a network from a sending node to a receiving node. The method includes ascertaining at the sending node if the media to be transmitted is either time-sensitive or not time-sensitive. For media ascertained as non time-sensitive, the media is transmitted by adjusting the rate of transmission at the sending node based on network conditions. As the non time-sensitive media is received, the receiving node generates one or more low priority requests for the retransmission of any missing non time-sensitive media lost during the transmission. The method also includes transmitting the time-sensitive media from the sending node to the receiving node. As the time-sensitive media is received, the receiving node ascertains if a predetermined acceptable network transmission loss level is met. If met, the receiving node generates one or more low priority requests for the retransmission of any missing time-sensitive media lost during transmission.

Abstract: A network device may be configured to filter network traffic using multiple filters bound to different interfaces, such as different ports or other logical interfaces associated with the network device. Multiple filters may be merged to obtain a number of merged filter sets. A rank may be calculated for the merged filter sets and used to maintain a required ordering of the merged filter sets when performing a lookup.

Abstract: A system for data exchange in multiprocessor computer system is disclosed. The system includes at least one processing module adapted to communicate with at least one of a plurality of routing modules or a plurality of buffer modules or both and at least one communicating interfaces to facilitate data exchange in multiprocessor computer system.

Abstract: The flow of information to or from an application on a host machine is regulated by a trusted agent operating in conjunction with at least one security element, such as a firewall or a policy server. When a communication to or from the application is detected by the trusted agent, the trusted agent gathers information about the attempted communication, and formulates and sends a message based upon the gathered information to at least one security element. The security element makes a decision to permit or block at least part of the attempted communication based upon the message received from the trusted agent.

Abstract: The present invention is directed to mechanisms for content-aware redirection and content exchange/content discovery that permit a request for content to be redirected to a particular advantageous server that can serve the content.

Abstract: A method and system for communicating serialized data provides a mechanism for ordering the data in response to a priority. In an embodiment, a server sending the data uses the priority to order the data in a message send queue for sending the data to a requesting device. The server may comprise a gateway and the second device a wireless device communicating with the gateway. The wireless device may send a priority indication in association with a request for the data to facilitate the ordering.

Abstract: The present invention extends to methods, systems, and computer program products for organizing resources into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace.

Abstract: An energy management system for a data center network may include a central computer to establish an energy use policy for the computer data center network. The system may also include computer nodes in the computer data center network to receive a packet which is a query that obtains energy information from the nodes and/or a transmission reservation that provides instructions for the energy use policy to be implemented at the computer nodes. The computer nodes may reallocate data traffic on the computer data center network based on the energy use policy to improve energy consumption of the computer data center network.

Abstract: Systems and methods are provided for calculating a distribution of a quantity over receiver objects. In one implementation, a data processing system is provided that comprises application programs adapted to generate a distribution request, storage means for storing rules adapted for distribution of the quantity and storing an assignment of a sub-set of the rules to each application program, each rule having an assigned priority of execution and each sub-set of rules having an assigned identifier. The system may also comprise means for receiving the request comprising the identifier of the sub-set of rules assigned to the one of the application programs, the quantity to be distributed, and the identifiers of receiver objects, the distribution calculation means adapted to access the storage means for execution of the sub-set of rules assigned to the one of the application programs.

Abstract: A bandwidth monitoring device for use in a network for transferring priority packets in preference to non priority packets as far as the amount of the priority packets is within a contract bandwidth established between a network user and a network operator, comprising a bandwidth check result decision unit for detecting whether the bandwidth of the priority packets is less than the contract bandwidth, and a DSCP decision unit for determining that a non priority packet may be transferred as a priority packet when the bandwidth of the priority packets is less than the contract bandwidth thereby to sufficiently use the contract bandwidth.

Abstract: In one embodiment, a more capable device (MCD) in a computer network may determine one or more a critical destinations (CDs), and may transmit an unsolicited reactive routing route request (RREQ) message to each CD. The MCD may then receive a route reply (RREP) message from the CDs having a route from the MCD to the CD, and may store the route at the MCD. Subsequently, the MCD may transmit a RREP message of its own to one or more less capable devices (LCDs) to provide the route from each respective LCD to the CD via the MCD.

Abstract: An electronic signature device includes a processor, a memory, a user input device including a first biometric input device, and a device interface, all communicatively connected by at least one bus. A method of personalizing the electronic signature device to a user includes receiving a digitized biometric signature of the user via the first biometric input device. A cryptographic key is generated. A biometric electronic template is generated based on the digitized biometric signature. The cryptographic key and the biometric electronic template are stored in the memory.

Abstract: In some embodiments, a method and routing system parameterize a routing policy and apply the parameterized-routing policy to a route. Parameters are assigned to at least some policy statements of the policy. The parameterized policy may be called with parameters stored in a parameter table. In some embodiments, common blocks of the policy may be identified and assigned parameter sets. A commonized routing policy may be reused within more than one policy. In some embodiments, a method and routing system may evaluate a configuration file to determine relationships between route attributes. The relationships may be expressed in one or more mathematical functions, and when a route is received from a peer, the attributes of the route may be modified based on the mathematical functions. In some embodiments, a router and method for implementing routing policy and traffic engineering are provided.

Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: The present disclosure relates to an example of a method for a first router to adaptively determine status within a network. The network may include the first router, a second router and a third router. The method for the first router may comprise determining status information regarding the second router located in the network, and transmitting the status information to the third router located in the network. The second router and the third router may be indirectly coupled to one another.

Abstract: Various technologies for sharing digital images within an instant messaging (IM) session between two users. In one implementation, a first user uploads a set of images to the second user. The set of images may be displayed as thumbnails on the displays of both users. By clicking on one of the thumbnails, either user may make the associated image appear as a larger image on both users' displays. In the event that both users click on different images simultaneously, or near-simultaneously, a protocol may be employed that selects which image is displayed.

Abstract: A system and method for managing private information while using semi-trusted interfaces is described. In an embodiment, an intermediate node may receive a first and second communication between a semi-trusted node and a trusted node. In managing private information, the intermediate node may append private information to the first communication sent from the semi-trusted node to the trusted node, and remove private information from the second communication sent from the trusted node to the semi-trusted node.

Abstract: Peer-to-peer approaches to servicing subscriptions to information feeds are generally disclosed. Network nodes may exchange information about information feeds that they can provide to other nodes, and other information about information feeds to which they may be interested in subscribing. Any of a variety of techniques may then be applied to allow the nodes to negotiate for feeds to which they may be interested in subscribing. For example, each node may apply algorithms that service feed subscriptions of other nodes on a prioritized basis, prioritized for example based on which other nodes service subscriptions in return.

Abstract: Systems and methods for performing storage operations over multi-stream data paths are provided. A first agent receives a request for a storage operation from a storage manager, identifies folders of a client computing device based on one or more file types of files in the folders of the client computing device, weights the folders based on the amount of data in the folders, and groups the folders into two or more sets of folders based at least in part on a file type of one or more of the files in the folders and the weight of the folders. A second agent transmits data from each of the two or more sets of folders to one or more storage devices in via at least one of two or more streaming communications paths based on pathway characteristics.

Abstract: The present invention extends to methods, systems, and computer program products for organizing resources into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace.

Abstract: The computer system of the present invention has a plurality of SAS target devices, an SAS initiator device, and a service delivery subsystem that is connected to each SAS target device by means of a physical link that is physical wiring and connected to the SAS initiator device by means of a wide link constituted by a plurality of physical links. The SAS initiator device controls how many physical links in the wide link are allocated to a particular SAS target device, whereby access from the SAS initiator device to the SAS target device is made via a physical link that is allocated to the SAS target device and is not made via a physical link that is not allocated to the SAS target device.

Abstract: A communications system may include at least one destination server for hosting email message boxes, and communications devices for generating email messages each associated with a respective message box. A delivery server may have a plurality of queues and a controller. The controller may store the email messages in a first queue, and attempt to send the stored email messages to the destination server at a first sending rate. The controller may also move email messages stored in the first queue to a second queue based upon a delivery failure. Email messages may be sent from the second queue at a second sending rate less than the first sending rate. The controller may also move email messages from the second queue to the first queue having a common characteristic with a successfully delivered email message.

Abstract: In an embodiment, an apparatus is provided that may include circuitry to generate, at least in part, and/or receive, at least in part, at least one request to access at least one portion of data. The at least one request may indicate, at least in part, at least one subset of the at least one portion of the data that is of relatively higher importance than one or more other subsets of the at least one portion of the data that are of relatively lower importance. The at least one request may be to request, at least in part, that the at least one subset be accessed prior to the one or more other subsets are accessed. The at least one request may be comprised, at least in part, in at least one packet in accordance with a protocol that permits variable packet size.

Abstract: A method, system and computer program product for pushing contents to client devices is disclosed. The method, system, and computer program product handles group pushes, manages different content priorities, prevents one content push from starving others, and handles different transport mechanisms for different clients.

Abstract: The present invention creates an electronic marketplace where owners of Internet domain names can have multiple parties compete for the right to lease their domain names. A marketplace provider supplies a technology for redirecting Internet traffic from leased domain names to domain names specified by parties that win the right to lease domain names.

Abstract: Methods and apparatuses for private electronic information exchange are described herein. In one embodiment, when electronic information is received to be delivered to a recipient, the electronic information is transmitted over an electronic network with a private routing address. The private routing address is routable within a private domain, which is a subset of the electronic network. Other methods and apparatuses are also described.

Abstract: A method and apparatus are provided for establishing a split-terminated client-server communication connection through a stateful firewall, with network transparency. In an environment in which a pair of network intermediaries is employed to optimize client-server communications, a first intermediary intercepts a client request for a new connection. The first intermediary probes the network for a counterpart near the server, and opens an optimized communication session with a second intermediary that responds affirmatively. Some or all client-server communications that transit the intermediaries' session are accelerated or otherwise optimized. The first intermediary's probe uses the client's source address, but a different port number, while the optimized intermediary session is opened using the client's source address and source port. Therefore, a network monitoring tool can monitor the end-to-end connection, and the stateful firewall will not reject the optimized session.

Abstract: The device comprises a memory (3) for storing several user share parameters and several amounts capable of advancing. A decision means (6) allocates a chosen service slice of the resource to a user selected as possessing the least advanced amount. It subsequently advances his amount according to a chosen increment. A memory link means (5) defines user queues of “FIFO” type, such that the user having the least advanced amount in a queue appears at the head of this queue. According to the invention, the memory (3) stores a limited number of values of increments. The memory link means (5) associates one of these values of increments with each user and allocates an increment value to each queue.

Abstract: A distributed event detection system for detecting a complex event by a distributed detection process, includes a plurality of broker nodes for routing events and a route node for distributing the complex event, wherein the route node comprises a detection formula decomposing unit which decomposes a complex event detection formula for detecting the complex event into a plurality of complex sub-event detection formulae; a sub-route node assignment unit which assigns a broker node as a sub-route node with respect to each of the complex sub-event detection formulae decomposed by the detection formula decomposing unit; and a complex event detecting unit which detects the complex event based on a complex sub-event detected by the sub-route node assigned by the sub-route node assignment unit.

Abstract: An apparatus and method for verifying route and bandwidth settings of multiple services provided over networks. The apparatus has an extractor and a verifier. Based on input data describing services each having primary and secondary routes between specific locations, an available bandwidth of each network, and a guaranteed bandwidth of each service, the extractor selects a first network to be verified and extracts first services that use the first network as their respective primary routes. The extractor then selects at least one second network from among the networks that the first services specify as their respective secondary routes. The extractor extracts second services that use the second network as their primary routes and specify the first network as their secondary routes. The verifier sums up guaranteed bandwidths that the first and second services should provide, and determines whether the sum is smaller than an available bandwidth of the first network.

Abstract: Methods that perform message and real-time data and computational flow routing across networks comprised elements with a dynamic time-varying network topology and loading. The unique algorithms and protocols for allocation of network resources embodied in the present methods provide optimal performance for high precedence traffic while providing as good as possible performance for lower precedence traffic.

Abstract: With the advent of virtualization technologies, networks and routing for those networks can now be simulated using commodity hardware rather than actual routers. For example, virtualization technologies such as those provided by VMWare, XEN, or User-Mode Linux can be adapted to allow a single physical computing machine to be shared among multiple virtual networks by providing each virtual network user with one or more virtual machines hosted by the single physical computing machine, with each such virtual machine being a software simulation acting as a distinct logical computing system that provides users with the illusion that they are the sole operators and administrators of a given hardware computing resource. In addition, routing can be accomplished through software, providing additional routing flexibility to the virtual network in comparison with traditional routing. As a result, in some implementations, supplemental information other than packet information can be used to determine network routing.

Abstract: A communication routing arrangement includes two or more wireless routers coupled to a communication network, and a user device adapted to couple with the communication network through a communication path including at least one of the two or more wireless routers. The communication path between the user device and the communication network is selected based on available resources of the two or more wireless routers.

Abstract: Techniques are described for providing managed virtual computer networks that have a configured logical network topology with virtual networking devices, such as by a network-accessible configurable network service, with corresponding networking functionality provided for communications between multiple computing nodes of the virtual computer network by emulating functionality that would be provided by the virtual networking devices if they were physically present.