Abstract: A method of sending an email message having one or more attached files to a plurality of recipients allows customized treatment of each file as it is being sent to each recipient. Treatments may include different types of encryption, plain text transmission, security classification or user-defined treatments. The invention may be implemented in a client-server configuration with separate client and server programs or in a single integrated email program configuration for use on a single computer. The user is presented with a list of recipients, selects a recipient and then selects a treatment for each file to be used when that file is sent to the selected recipient. This process is repeated for each recipient and each file. A control file is generated by the client program, including the recipient information and the file treatment information for each recipient and each file. The client program sends a single copy of the email message, a single copy of each file and the control file to the server program.

Abstract: In order to access a distributed file system (DFS) of the present invention using a conventional protocol such as the one for an NFS or a CIFS without making a modification on a client side, a gateway unit for receiving a conventional protocol and performing processing in conformity the protocol is provided for a DFS server. The gateway unit emulates a directory structure in a file system such as the NFS or CIFS. When the DFS is a write-once read-many file system, update processing is converted into processing for creating a new generation file, and reference processing is converted into access to a latest generation file in a generation-managed file group. The gateway unit then accesses a DFS file via a DFS processing unit.

Abstract: The present invention provides extended precision in SIMD arithmetic operations in a processor having a register file and an accumulator. A first set of data elements and a second set of data elements are loaded into first and second vector registers, respectively. Each data element comprises N bits. Next, an arithmetic instruction is fetched from memory. The arithmetic instruction is decoded. Then, the first vector register and the second vector register are read from the register file. The present invention executes the arithmetic instruction on corresponding data elements in the first and second vector registers. The resulting element of the execution is then written into the accumulator. Then, the resulting element is transformed into an N-bit width element and written into a third register for further operation or storage in memory. The transformation of the resulting element can include, for example, rounding, clamping, and/or shifting the element.

Abstract: Users and devices in a peer-to-peer collaboration system can join a management domain in which members are administered as a group by a centralized management server operated by an enterprise. In response to a administrator request to join the management domain, the user downloads an injectible identity file containing a definition of the managed user/device into the user system. The user then joins the managed domain by associating the injected identity with their actual identity. Once a user or device is part of a management domain, that user or device receives license rights and policy restrictions that are associated with the domain. In return, the management server interacts with the individual peer-to-peer collaboration systems to enable the enterprise to monitor the usage of, and control the behavior of, that specific identity within the peer-to-peer collaboration system.

Abstract: A method for increasing server capacity may include causing a program to run in a browser in response to a session on a server. The program may be adapted to spawn a new browser window in response to a web page associated with the session being unloaded. The method may also include destroying all data associated with the session in response to a signal from the spawned browser window. The method may further include returning memory occupied by the data associated with the session to a memory pool.

Abstract: The present invention provides a scalable, highly available distributed network data storage system that efficiently and reliably provides network clients and application servers with access to large data stores, such as NAS units, and manages client and server requests for data from the data stores, thereby comprising a distributed storage manager. A storage manager constructed in accordance with the invention can receive and process network requests for data at a large, aggregated network data store, such as a collection of NAS units, and can manage data traffic between the network clients and NAS units.

Abstract: A mechanism for transferring state information in a computer cluster having a plurality of computer nodes is disclosed. In the method, heartbeat messages are sent periodically from a first computer node of the computer cluster to other computer nodes of the cluster. Each of the other nodes includes at least one resource for performing at least one cluster-specific task. In order that up-to-date state information may be collected even in large clusters about the ability of the resources to perform the cluster-specific tasks, without excessively loading the computer nodes and the network, current state information is returned in a heartbeat acknowledgment message to the node that sent the heartbeat message.

Abstract: This system includes a changer data base, in which a changer registers his or her own new address, relationally storing a new address disclosing condition for an inquirer who wishes to know the new address of the changer, a disclosure judge judging whether to disclose the new address to the inquirer based on the new address disclosing condition when the inquirer inquirers about the new address with the presentation of an old address of the changer, and a discloser disclosing the new address of the changer to the inquirer if the disclosure judge judges that the new address is disclosed. Hence, various responses, with a high degree of freedom, can be made depending on a changer's intention when an inquiry about the new address after change of the changer is sent from an inquirer.

Abstract: A multifunction peripheral includes a control portion, a LAN interface portion, and web servers. The web server manages information about components in the control portion, the user I/F portion, the printer, and the scanner. The web server manages information about components in the LAN interface portion. The web servers are configured for mutual transmission. The web server is connected to a LAN through a network control portion. When information that is managed by the web server is requested from a terminal that is connected to the LAN, then the web server functions as a proxy server to transfer the requested input from the LAN to the web server and to transmit information transferred from the web server to the requestor.

Abstract: A communication system includes a local unit that has a lower data link layer and a session layer running a data pass-through application and a user interface. The data pass-through application lets the data link layer in the local unit pass data through to a remote unit. The remote unit has a lower data link layer and a session layer executing a user interface. When the data link layer detects that the session layer is unstable and/or locked up, the data link layer transmits a disconnect request to the local unit's data link layer. All further user data sent to the local unit's data link layer is routed to the local unit's user interface.

Abstract: A memory system for a high performance IP processor is disclosed. The memory system allows the architecture for an IP processor that may provide capabilities to transport and process Internet Protocol (IP) packets from Layer 2 through transport protocol layer and may also perform packet inspection through Layer 7. An internal memory or local session database cache stores a session information database for a certain number of active sessions. The session information that is not in the internal memory is stored and retrieved to/from an additional memory. An application running on an initiator or target can in certain instantiations register a region of memory, which is made available to its peer(s) for access directly without substantial host intervention through RDMA data transfer.

Abstract: A method for performing a lookup of a packet against an access control list. In one example, the method includes receiving an access control list, partioning said list into two or more complementary sets, and for each set, forming a tree having one or more end nodes including filtering rules, and internal nodes representing decision points, thereby forming at least two trees. In one example, when a packet arrives, the two or more trees are traversed using the packet header information, wherein the decision points in the internal nodes are used to guide the packet selection down the trees to an end node.

Abstract: A system and method are provided for staggering the start time of scheduled actions for a group of networked addressable devices. A time period in which a scheduled action is to be performed may be determined. The time period may be divided into timeslots based on the number of addressable devices in the network. Based, at least in part, on a unique characteristic associated with each addressable device, a unique staggered start time may be assigned to each addressable device.

Abstract: Method and apparatus for RMI-IIOP implementation using Java serialization as a data encoding mechanism. Embodiments may provide a mechanism to use Java serialization rather than, or as an alternative to, CORBA Common Data Representation (CDR), for the marshaling and unmarshaling of data in RMI-IIOP message exchanges. In one embodiment, a server-side Object Request Broker (ORB) may be configured to support the encoding of data in RMI-IIOP messages in accordance with CDR encoding and Java serialization encoding. A client-side ORB may optionally use Java serialization or CDR as the data encoding format for RMI-IIOP messages to invoke the associated object on the server. Response messages from the server to the client may include data encoded according to Java serialization or CDR.

Abstract: System and method for multiplatform implementation of abstract software modules in peer-to-peer networking environments. A module class may have one or more module specifications. Each module specification may have one or more module implementations configured to execute within a particular execution environment. A unique module class identifier may be assigned to the module class. A unique module specification identifier may be assigned to each module specification of the module class. In one embodiment, a module specification advertisement may be generated for each module specification. A module implementation advertisement may be generated for each module implementation. In one embodiment, the module specification identifier of the corresponding module specification is included in each module implementation advertisement.

Abstract: A distributed system structure for a large-way, symmetric multiprocessor system using a bus-based cache-coherence protocol is provided. The distributed system structure contains an address switch, multiple memory subsystems, and multiple master devices, either processors, I/O agents, or coherent memory adapters, organized into a set of nodes supported by a node controller. The node controller receives transactions from a master device, communicates with a master device as another master device or as a slave device, and queues transactions received from a master device. Since the achievement of coherency is distributed in time and space, the node controller helps to maintain cache coherency. A transaction tag format for a standard bus protocol is expanded to ensure unique transaction tags are maintained throughout the system. A sideband signal is used for intervention and Reruns to preserve transaction tags at the node controller in certain circumstances.

Abstract: A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. In response to determining that the logical operator requires processing on the given physical processing node, the logical operator is pinned to the given physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus.

Abstract: A method for recovering information from electronic communications, including conveying an indication of a topic of interest, from a searcher on the topic, to a computing system storing a first set of the communications of a first communicator, and searching within the first set, in response to the indication, to identify one or more first communications on the topic of interest, thereby defining a primary sub-set of communications. The method further includes determining identities of one or more second communicators who participated in the primary sub-set, searching within a second set of the communications of the one or more second communicators, in response to the indication, to identify one or more second communications on the topic of interest, thereby defining a secondary sub-set of communications, the second set of the communications being stored in the computing system, and conveying information from the searches to the searcher.

Abstract: Data collection agents are assigned to storage area network nodes in a storage area network resource management system, such that the bandwidth and cost of data collection are equitably distributed among data collection agents. Data collection overlaps and load imbalances are eliminated across the data collection agents, creating approximately equal partitions of bandwidth and data collection for each data collection agent. Graph partitioning is used to accomplish load balancing. The assignment of data collection agents to storage area network nodes equitably distributes the bandwidth and processing costs among the data collection agents and ensures a load balance.

Abstract: A new architecture and operational techniques for supporting high quality live and on-demand streaming multimedia on a data network. By using Helper machines inside the network as data forwarding, caching, and buffering agents, and by forming meshes among Helper machines, advantages of homogeneous, synchronous multicast transmission and of heterogeneous, asynchronous reception are achieved. The architecture provides essentially transparently support to the receivers for near-zero start-up latency, improved playback quality, improved CR-like operations. These are achieved while reducing network and server load compared to today's multimedia networking techniques.