Abstract: A technique for broadcasting data across a network is provided. An originating participant sends data to another participant, which in turn sends the data that it receives from a neighbor participant to its other neighbor participants. Communication in the broadcast network is controlled by a contact module that locates the neighbor participants to which the seeking participant can be connected and by a join module that establishes the connection between the neighbor participants and the seeking participant. Data is numbered sequentially so that data that is received out of order can be queued and rearranged.

Abstract: Various components are provided to manage a clustered environment. These components include a System Registry that provides a global data storage; a Configuration manager that stores data locally on nodes of the clustered environment and globally within the System Registry; a Liveness component to provide status of communications paths of the cluster; a Group Services component that provides services to one or more other components of the clustered environment; and a Resource Management component that communicates with one or more resource controllers of the clustered environment. Each of the components of the clustered environment has one or more data and/or functional dependencies on one or more other components of the environment. However, relationships between the components are created such that the data and functional dependencies form an acyclic graph (i.e., a cycle of dependency relationships is avoided).

Abstract: Adaptively changing weights for fair scheduling in broadcast environments. In one embodiment, a computer-implemented method allocates bandwidth among a plurality of flows, such as nodes, sharing an output link, such as a network. The method includes adaptively determining a weight for each flow, based on a predetermined criterion, and allocating a portion of bandwidth to each flow proportionally to the weight for the flow. In one embodiment, the predetermined criterion takes into account an input rate of data packets for each flow, while in another embodiment, the predetermined criterion takes into account a queue size for each flow.

Abstract: A method, system, and computer program product for exchanging supplemental information fields between a client and server. This supplemental information can then be used by the server to complete a client's request for content stored at a particular location. For example, the supplemental information may be used to provide a customized response, or for access control to sensitive data. Preferably, the REDIRECT message of the Hypertext Transfer Protocol (HTTP) or the Wireless Session Protocol (WSP) is used to request the supplemental information, encoding a comma-separated list of attribute names in a request header for the desired supplemental information. This solution is designed to be backward-compatible.

Abstract: A system, method and computer program product are provided for detecting an unwanted message. First, an electronic mail message is received. Text in the electronic mail message is decomposed. Statistics associated with the text are gathered using a statistical analyzer. A neural network engine coupled to the statistical analyzer is taught to recognize unwanted messages based on statistical indicators. The statistical indicators are analyzed utilizing the neural network engine for determining whether the electronic mail message is an unwanted message.

Abstract: A computer network system for manipulating requests for shared data includes a plurality of groups and each group has a plurality of nodes and each node has a plurality of processors. The system further comprises a request outstanding buffer (ROB) for recording data requests, a remote access cache (RAC) for caching the results of prior memory requests which are remote to a requesting node, and a directory for recording a global state of a cache line in the system. The RAC supports only two states, Shared and Invalid, and caches only clean remote data. If the directory state is Modified/Exclusive, the line is indicated to not be in the RAC. The behavior of the RAC is described for two important cases: initial RAC does not have the line caches and initial RAC has the line cached.

Abstract: A network and method of providing near 100% availability of services is provided. According to one feature, redirectors are implemented to direct network traffic to any of two or more application processors providing the same service. The redirectors are provided in data paths at network access points and at data centers with the application processors. The redirectors re-route traffic to other application processors when one processor is unavailable and load balance between available processors. To load balance, the redirectors collect various network management statistics from the processors to determine the most responsive processor for receiving traffic. The various network management statistics are shared among the redirectors for efficient load balancing.

Abstract: An ultrasound information processing system is disclosed in which ultrasound image data is packetized into ultrasound information packets and routed to one or more of a plurality of processors for performing image processing operations on the ultrasound image data, the ultrasound information packets being routed according to entries in a host-programmable routing table. A common distribution bus is coupled between packetizing circuitry and dedicated input buffers corresponding to each processor for distributing the ultrasound information packets, and a common output bus to is used to transfer processed image data from the processors to an output device. The disclosed ultrasound information processing system architecture allows for a high throughput rate for accommodating real-time image processing operations, while also allowing for ready programmability and upgradability.

Abstract: The present invention comprises a method of relating characteristics gleaned by monitoring application transaction flows (and the decomposition thereof) to produce performance metrics useful to characterize the efficiency and performance of web transactions used in a web-based application. These metrics can assist application designers and developers in reorganizing their application content, programs, and transports to provide improved service to their consumer. Events are generated and composed into predefined activities on a web transaction basis. The performance metric is then derived that entails a relationship between at least two different activities that gives insight into the performance characteristics of the web transaction. By using the derived performance metrics, designers and developers of web pages can judge the effects of changes to their application relative to efficiency and performance. Different applications can also be compared and contrasted using these metrics.

Abstract: A method is disclosed for permitting devices connected to a network to identify characteristics of other devices connected to a network. The devices may automatically obtain information about the other devices in the network in a distributed manner without required a centralized management entity. This means that functions, such as device configuration, can be performed without a system administrator. This reduces the risk of system failure at the system administrator by reducing the reliance on the administrator. The disclosed method may be used in a network employing Ethernet or token-ring frame formats.

Abstract: A data processing system includes a plurality of nodes, which each contain at least one agent, and data storage accessible to agents within the nodes. The plurality of nodes are coupled by a non-hierarchical interconnect including multiple non-blocking uni-directional address channels and at least one uni-directional data channel. The agents, which are each coupled to and snoop transactions on all of the plurality of address channels, can only issue transactions on an associated address channel. The uni-directional channels employed by the present non-hierarchical interconnect architecture permit high frequency pumped operation not possible with conventional bi-directional shared system buses. In addition, access latencies to remote (cache or main) memory incurred following local cache misses are greatly reduced as compared with conventional hierarchical systems because of the absence of inter-level (e.g., bus acquisition) communication latency.

Abstract: A system, device, and method for distributing multicast routing information in a Protocol Independent Multicast (PIM) domain utilizes a PIM router in the PIM domain to collect and distribute multicast routing information. The PIM router collects interdomain multicast routing information from border routers, and distributes the interdomain multicast routing information by periodically sending a bootstrap message containing the interdomain multicast routing information. The PIM router may also send a bootstrap message containing any changed interdomain multicast routing information upon determining that one or more interdomain multicast routes have changed.

Abstract: A method is provided for a network including a plurality of nodes where a originating node broadcasts an address request or change PDU. When the PDU is received at a receiving node, the receiving node determines from a look-up routing table whether the broadcast PDU was received on an optimal interface, i.e. an interface which defines the shortest path between the originating and receiving nodes. If the interface was determined to be optimal, the receiving node forwards the request PDU along every interface belonging to the receiving node except the optimal interface, otherwise, the receiving node drops the request PDU. When node address information concerning the originating node cannot be obtained from the routing database of the receiving node, a unique medium node is located to assist in making the optimal interface determination. The method completely avoids the formation of loops thereby improving the performance of a telecommunication management network.

Abstract: Extending network capabilities for a network with a policy-based network management (PBNM) architecture. The method includes sending a first message from a policy enforcement point (PEP) to a policy decision point (PDP) in response to an external action, and sending a Java object in a second message from the PDP to the PEP in response to receiving the first message. The Java object may be executed on the PEP to implement a policy.

Abstract: Systems and methods for controlling the dissemination of data from a repository based on request mechanisms that are transparent to the requestor and the connection conveying the requests. The systems and methods are used by the repository to enforce one or more rule sets that implement varying levels of access privilege created by the repository designer. For each user requesting access to privileged data, the repository uses the systems and methods to manage novel information structures whose purpose is to apply the rule sets to the requestor's session. By incorporating into each request, a set of values herein named a “forresta” and a “destination”, the systems and methods exercise control over data access, assemblage and presentation. In addition, the systems and methods provide that clients require no enhancements to well-known methods or systems used to facilitate communications with repositories employing this invention.