Abstract: A communication node includes a token-start-right acquisition processor that issues a token-start-right acquisition frame containing specific information, determines a priority based on predetermined reference using specific information for other communication node and the specific information for the own communication node upon reception of a token-start-right acquisition frame from the other communication node, issues the token-start-right acquisition frame at a predetermined time interval when the own communication node has a higher priority than the other communication node, and stops issuing the token-start-right acquisition frame when the own communication node has a lower priority than the other communication node, to forward the token-start-right acquisition frame of the other communication node, and also includes a token start processor that passes the token frame to the ring upon reception of the token-start-right acquisition frame which is issued by the token-start-right acquisition processor and c

Abstract: A peer-to-peer network including a set of nodes distributed among a set of processing devices and arranged in a circular form in such a way that each node has a unique successor node. Each node has a memory to store data associated with keys and, on reception of a request containing a key, provides data associated with the key. Each data item stored in the memory of a first node is duplicated in the memory of a second node, different from said first node. The second node is chosen from among the nodes deployed on the set of processing devices different from the processing device on which the first node is deployed.

Abstract: A packet switching device comprises a network interface configured to send and receive data packets via a communication network, a plurality of string interfaces configured to transmit and receive data packets to/from a plurality of participants and a switching unit connected to the network interface and to the plurality of string interfaces. The a switching unit comprises a control unit configured to control a data throughput. The control unit comprises an interface association table which determines that data packets received via the network interface are mandatorily outputted via the string interfaces and the data packets received via the string interfaces are mandatorily outputted via the network interface.

Abstract: A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

Abstract: The deployment and scaling of a network of electronic devices can be improved by utilizing one or more network transpose boxes. Each transpose box can include a number of connectors and a meshing useful for implementing a specific network topology. When connecting devices of different tiers in the network, each device need only be connected to at least one of the connectors on the transpose box. The meshing of the transpose box can cause each device to be connected to any or all of the devices in the other tier as dictated by the network topology. When changing network topologies or scaling the network, additional devices can be added to available connectors on an existing transpose box, or new or additional transpose boxes can be deployed in order to handle the change with minimal cabling effort.

Abstract: A source application reads a body of data in data block sized units and calculates a checksum value for each data block before sending the data block, the calculated checksum value and the identifier. Upon receipt, a destination application independently calculates a checksum value for each received data block and compares the two checksums. Non-matching checksums indicate a network-induced error in the data block. Identifiers for the erroneous data blocks are transmitted to the source application after all of the data blocks have been initially transmitted. The source application thereafter resends only those data blocks identified. The destination application repeats the process of comparing checksums and transmitting identifiers to the source application until all of the data blocks of the body of data have been correctly received, and then uses the data blocks to recreate the body of data.

Abstract: Methods and apparatus for eliminating loops associated with interconnects between clusters are disclosed. According to one aspect of the present invention, a method for operating a cluster of an interconnect group that includes at least one node and is in communication with a plurality of interconnects includes broadcasting a first frame on the interconnects. The method also includes receiving a second frame, the second frame being received on only a first interconnect, and blocking the second frame from being broadcast on the first interconnect. Finally, the method includes broadcasting the received second frame throughout the cluster such that no node in the cluster receives more than one copy of the second frame.

Abstract: A communication device for implementing a system for remotely managing at least one item of equipment by a management application able to communicate via a telecommunication network with an application embedded in the item of equipment. The device includes a first communication interface allowing implementation of a local communication link with the embedded application, a second communication interface allowing access to the telecommunication network, and a communication management device configured to communicate with the embedded application via the first interface and with the management application via the second interface, serving as communication relay between the embedded application and the management application, and configured to transmit to one of the two applications a message received from the other application, according to predefined transfer rules and as a function of at least one parameter received with the message.

Abstract: Methods and structure are disclosed for improved processing of fast path I/O requests in a storage controller utilizing version information embedded in the fast path I/O requests. The version information allows the storage controller to determine if the mapping information utilized by the host system in generating a fast path I/O request specifies the mapping information utilized by the storage controller. The controller comprises a fast path I/O request processing circuit tightly coupled with host system drivers for fast processing of requests directed to storage devices of a logical volume. The controller also comprises a logical volume I/O processing software stack for processing I/O requests from a host system directed to a logical volume. If the mapping information utilized by the host does not match the mapping information utilized by the storage controller, fast path I/O requests are transferred to the I/O request processing stack for subsequent processing.

Abstract: A method is provided for determining the integrity of a domain defined in a network. The method includes processes and systems to facilitate the discovery a conceptual ring topology of the domain in the network, and the determination of the integrity of the domain based on the conceptual ring topology that was discovered.

Abstract: A system and method of management of communication in a potentially unreliable wide-area network that contains one or more nodes connected to said network, each potentially having access to one or more inputs and/or outputs and capable of evaluating said inputs and directing said outputs, a global address space (GAS) accessible by said nodes, and a communication system using said GAS that provides communications between said nodes.

Abstract: In the case where an audio network system that performs transport of audio signals between a plurality of processors is constructed such that the plurality of processors each including two sets of transmission I/Fs and reception I/Fs are connected in series, and a TL frame generated by a master node is circulated along a ring transmission route formed among the processors in each fixed period, the TL frame including a plurality of storage regions for audio signals, when one of the processors is required to be the master node, the one processor resets in sequence processors which are connected on both sides thereof and processors behind the processors connected on both sides to once remove each of those processors from a ring transmission route if it belong to any ring transmission route, then incorporates the processors into a ring transmission route in which the one processor belongs to.

Abstract: Efficient and highly-scalable network solutions are provided that each utilize deployment units based on Clos networks, but in an environment such as a data center of Internet Protocol-based network. Each of the deployment units can include multiple stages of devices, where connections between devices are only made between stages and the deployment units are highly connected. In some embodiments, the level of connectivity between two stages can be reduced, providing available connections to add edge switches and additional host connections while keeping the same number of between-tier connections. In some embodiments, where deployment units (or other network groups) can be used at different levels to connect other deployment units, the edges of the deployment units can be fused to reduce the number of devices per host connection.

Abstract: The present invention extends to methods, systems, and computer program products for optimizing access to federation infrastructure-based resources. Various different layers within a federation infrastructure can signal location change events indicating the hosting location and/or access location for a resource is to be optimized. In response to a location change event, redirection information for accessing the resource is updated within the federation infrastructure. The redirection information is used to redirect resource access requests to appropriately optimized locations within the federation infrastructure. Redirecting resource access requests reduces communication within the federation infrastructure.

Abstract: Several different embodiments of a massively scalable object storage system are described. The object storage system is particularly useful for storage in a cloud computing installation whereby shared servers provide resources, software, and data to computers and other devices on demand. In several embodiments, the object storage system includes a ring implementation used to associate object storage commands with particular physical servers such that certain guarantees of consistency, availability, and performance can be met. In other embodiments, the object storage system includes a synchronization protocol used to order operations across a distributed system. In a third set of embodiments, the object storage system includes a metadata management system. In a fourth set of embodiments, the object storage system uses a structured information synchronization system. Features from each set of embodiments can be used to improve the performance and scalability of a cloud computing object storage system.

Abstract: XML appliances/routers may be organized to implement one or more XML distribution rings to enable XML documents/messages to be distributed efficiently. The rings may be logical or physical. The XML distribution rings enable the XML documents/messages to be exchanged without requiring the XML appliances/routers to run a routing protocol to determine how XML documents/messages should be distributed through the network. Documents may be transmitted in one way on the ring or may be transmitted in both directions around the ring to enable the ring to tolerate failure of an XML appliance/router. Each XML appliance/router will receive all XML documents/messages and will make routing decisions for those clients that have provided the XML appliance/router with XML subscriptions. The subscriptions may be formed according to the XPath standard or in another manner.

Abstract: A communication apparatus (100) includes: a communication unit (10) connectable to one end of a cable (50); a first detection unit (111) which detects a maximum transmission capability of an external device based on a communication standard with which the external device complies, the external device being connected to an other end of the cable (50) connected to the communication unit (10); a second detection unit (112) which detects a maximum transmission capability of the cable (50) connected to the communication unit (10); and an alert output unit (114) which outputs an alert when the maximum transmission capability of the cable (50) is smaller than the maximum transmission capability of the external device, the maximum transmission capability of the cable having been detected by the second detection unit (112), and the maximum transmission capability of the external device having been detected by the first detection unit (111).

Abstract: An advanced processor comprises a plurality of multithreaded processor cores each having a data cache and instruction cache. A data switch interconnect is coupled to each of the processor cores and configured to pass information among the processor cores. A messaging network is coupled to each of the processor cores and a plurality of communication ports. In one aspect of an embodiment of the invention, the data switch interconnect is coupled to each of the processor cores by its respective data cache, and the messaging network is coupled to each of the processor cores by its respective message station. Advantages of the invention include the ability to provide high bandwidth communications between computer systems and memory in an efficient and cost-effective manner.

Abstract: Efficient and highly-scalable network solutions are provided that each utilize deployment units based on Clos networks, but in an environment such as a data center of Internet Protocol-based network. Each of the deployment units can include multiple stages of devices, where connections between devices are only made between stages and the deployment units are highly connected. In some embodiments, the level of connectivity between two stages can be reduced, providing available connections to add edge switches and additional host connections while keeping the same number of between-tier connections. In some embodiments, where deployment units (or other network groups) can be used at different levels to connect other deployment units, the edges of the deployment units can be fused to reduce the number of devices per host connection.

Abstract: The present invention relates to methods and arrangements for locating services in a structured peer-to-peer distributed hash table, DHT, based, overlay communication network (310). The invention comprises two inter-related methods and nodes. The first method is used by a service node (321) to “advertise” to the overlay network (310) that it is providing a particular service (S1). This is done by distributing instances (351,352,353) of a service object (O1) that are stored in different nodes (331,332,333) in the overlay network (310) and where the instances (351,352,353) comprise an address to the service node (321). The other method is to locate at least one of these instances (351,352,353) with a predetermined probability and with a predetermined number of location request messages (390) from a user node (311) wishing to use the particular service (S1).

Abstract: Methods and systems are provided for modeling a multiprocessor system in a graphical modeling environment. The multiprocessor system may include multiple processing units that carry out one or more processes, such as programs and sets of instructions. Each of the processing units may be represented as a node at the top level of the model for the multiprocessor system. The nodes representing the processing units of the multiprocessor system may be interconnected to each other via a communication channel. The nodes may include at least one read element for reading data from the communication channel into the nodes. The node may also include at least one write element for writing data from the nodes into the communication channel. Each of the processing unit can communicate with other processing unit via the communication channel using the read and write elements. Code may be generated to simulate each node and communication channel in the modeled multiprocessor system.

Abstract: A method for planning a network having a plurality of nodes. The method may include determining all possible rings in the network satisfying a predetermined condition and calculating a utilization score for each possible ring based on a combination of predetermined selection criteria. The method may include selecting the possible ring with the highest utilization score and determining whether there are remaining nodes among the plurality of nodes that are not included in the selected possible ring. The method may further include selecting another possible ring if it is determined there are remaining nodes.

Abstract: A method provides a communication path in a ring network having a plurality of communication nodes. The method includes: setting transfer information of data in each of the plurality of communication nodes by making the transfer information correspond to connection information for identifying a connection within the ring network to provide a first communication path; determining whether to update the transfer information in each of the communication nodes according to the position where the fault occurs; and updating the transfer information according to the position where the fault occurs in one or more of communication nodes to provide a second communication path. Each of the plurality of communication nodes transfers input data by using the first or second communication path according to transfer information corresponding to connection information attached to the input data.

Abstract: A method and system for steganography and steganalytic techniques are provided for effecting embedded communications in a variety of communication environments. One aspect may include an embedded transmitter for inserting embedded data into a packet and an embedded receiver for receiving the packet via, for example, a packetized communication network such as the Internet. Various aspects of the present invention provide robust communications with optimized throughput and may include various error handlers to maximize performance and ensure transfer of incorrupt data. A method for identifying and blocking embedded communications is also provided.

Abstract: Systems and methods that provide for joining a node to a federation. A link component facilitates joining such node thru three phases of join, introduce and advise. A plurality of messages and replies are exchanged between nodes in form of introduce, advise, and response messages. Such messages contain the sending node's full neighborhood.

Abstract: An asynchronous communication network in an integrated circuit is described. The asynchronous communication network comprises a plurality of circuit elements enabling the transmission of tokens, each circuit element having a component interface comprising: a routing network coupled to a first adjacent circuit element of the plurality of circuit elements; and a control circuit coupled to the routing network, the control circuit having a first input coupled to receive a first command requesting a detection of a token received at a second input of the control circuit, and a first acknowledgement output coupling a first acknowledgement signal indicating whether the first command is received at the first input. Methods of enabling asynchronous communication in an integrated circuit are also disclosed.

Abstract: The goal of the present invention is to improve the useful data efficiency and reliability in the use of commercially available ETHERNET controllers, in a distributed real time computer system, by a number of node computers communicating via one or more communication channels by means of TT ETHERNET messages. To achieve this goal, a distinction is made between the node computer send time (KNSZPKT) and the network send time (NWSZPKT) of a message. The KNSZPKT must wait for the NWSZPKT, so that under all circumstances, the start of the message has arrived in the TT star coupler at the NWSZPKT, interpreted by the clock in the TT star coupler. The TT star coupler is modified, so that a message arriving from a node computer is delayed in an intelligent port of the TT star coupler until the NWSZPKT can send it precisely at the NWSZPKT into the TT network.

Abstract: Systems and methods of device identifier selection are disclosed. In a particular embodiment, a method includes receiving an enumeration message via a host interface of a device operatively coupled to a host device as well as to one or more other devices and identifying the enumeration message as a command originated by the host device or as a response message from one of the other devices. The method includes, in response to identifying the enumeration message as a command, selectively sending an enumeration response message to the host device. The enumeration response message indicates a distinctive device identifier value. The method also includes, in response to identifying the enumeration message as a response message from one of the other devices, reading from the response message an identifier value used by such other device and at least temporarily storing this identifier value at the device to enable the device to select the distinctive device identifier value.

Abstract: A network device of is a network device that transfers frames by repeating, in a constant cycle, a reserved transfer interval and a free transfer interval. The network device includes a transmission port, a cycle timer, a mode switching control unit that monitors a transfer state of the transmission port and selects a store-and-forward system when the transmission port is in the transfer process and selects a cut-through system when the transmission port is not in the transfer process, and a transfer prohibition control unit that selects the cut-through system as a transfer system when a non-reserved frame is transmitted and switches a transfer method of the non-reserved frame to the store-and-forward system when a reserved transfer interval is established, with reference to the cycle timer.

Abstract: A system and integrated circuit chips used in the system utilize a bus in the form of a ring to interconnect nodes of individual components for transfer of data and commands therebetween. An example system described is a memory having one or more re-programmable non-volatile memory cell arrays connected to each other and to a system controller by a ring bus.

Abstract: A communication node includes a token-start-right acquisition processor that issues a token-start-right acquisition frame containing specific information, determines a priority based on predetermined reference using specific information for other communication node and the specific information for the own communication node upon reception of a token-start-right acquisition frame from the other communication node, issues the token-start-right acquisition frame at a predetermined time interval when the own communication node has a higher priority than the other communication node, and stops issuing the token-start-right acquisition frame when the own communication node has a lower priority than the other communication node, to forward the token-start-right acquisition frame of the other communication node, and also includes a token start processor that passes the token frame to the ring upon reception of the token-start-right acquisition frame which is issued by the token-start-right acquisition processor and c

Abstract: A reconfigurable hardware architecture, in the form of a System-on-Chip 1, includes an ASIC (19) and an embedded FPGA (18) which define static and reconfigurable parts of an IC architecture (15) respectively. Incoming Ethernet, or other format, packets are applied to a packet filter (14), which detects those packets containing reconfiguration data. The reconfiguration data is used to update the FPGA (18).

Abstract: A peer-to-peer (P2P) network system and a method of operating the P2P network system based on region are provided. If an edge peer storing a resource information list of a super peer migrates to a different super peer and is registered and connected with the different super peer, the edge peer transfers the resource information list to the different super peer to share the resource information list. Resources may be searched based on a region information list into which resource information lists of adjacent super peers are integrated.

Abstract: XML appliances/routers may be organized to implement one or more XML distribution rings to enable XML documents/messages to be distributed efficiently. The rings may be logical or physical. The XML distribution rings enable the XML documents/messages to be exchanged without requiring the XML appliances/routers to run a routing protocol to determine how XML documents/messages should be distributed through the network. Documents may be transmitted in one way on the ring or may be transmitted in both directions around the ring to enable the ring to tolerate failure of an XML appliance/router. Each XML appliance/router will receive all XML documents/messages and will make routing decisions for those clients that have provided the XML appliance/router with XML subscriptions. The subscriptions may be formed according to the XPath standard or in another manner.

Abstract: A method of determining proximity between a root node and a leaf node in a network is presented. The method comprises computing a link proximity value between any two mutually connected nodes in the network. At an initial node, a proximity computation request message is sent containing a proximity counter to an intermediate node to which the initial node is connected. At an intermediate node, being connected to a first node and to a second node, upon receipt of the proximity computation request message containing a proximity counter from the first node, the computed link is added to a proximity value and passed on the proximity computation request message to the second node. At a final node, upon receipt of the proximity computation request message, the proximity between the root node and the leaf node is determined as the value indicated by the proximity counter.

Abstract: A switching hub for processing a VLAN frame transmitted through a transmission line of a ring network includes two ring ports connected to the transmission line of the ring network, and a forwarding processing mechanism for, when one of the two ring ports receives the frame and when a VLAN in which the received frame belongs is a VLAN only through both the ring ports, forwarding the frame to the other ring port without performing FDB learning on the frame.

Abstract: According to a particular embodiment, a method for automatically assigning dynamic IP addresses without user interaction includes maintaining at least one pool of unused IP addresses. An advertisement message is transmitted from a first network element to at least one additional network element in a transport ring. The advertisement message identifies the first network element as providing IP address assignment services. The IP address request message from a second network element in the transport ring is received at the first network element. In response to the IP address request message, an IP address is dynamically assigned from the at least one pool of unused IP addresses. The dynamically assigned IP address is transmitted from the first network element to the second network element.

Abstract: Disclosed is a wireless remote network management system for interfacing a series of remote devices (e.g., computers, servers, networking equipment, etc.) to one or more user workstations. The system is multifunctional to allow multiple users to control remote devices through serial access or keyboard, video, and cursor control device access via wireless and hard-wired connections. The remote devices are preferably coupled to a wireless-enabled remote management unit through a chain of computer interface modules, and each user workstation includes a wireless user station coupled to a keyboard, a video monitor and a cursor control device. The remote management unit and user stations preferably communicate via a wireless network, which enables a user workstation to access, monitor and control any of the remote devices.

Abstract: Systems and methods that ensure formation of a single ring from a seed node at any given time. A “bootstrap” phase is included in a node's life cycle, to mitigate adverse affects of split-brain conditions in a network. During such bootstrap phase, if an existing ring is found, the seed node can join the existing ring in a same manner as a non-seed node does. If no ring is detected, the bootstrap phase attempts to elect a seed node to be the “super-seed node”, wherein a new ring can then be formed with such new super-seed node as the first node.

Abstract: A system and method are disclosed for processing commands to network target devices through a SCSI router in a Fiber Channel network having a plurality of Fiber Channel hosts. The system and method are implemented in the SCSI router and include receiving a command from one of the plurality of Fiber Channel hosts and, if the command is for a transfer of data larger than a threshold size, streaming the data to the target device. If a preset size memory block is free, a data block is requested from the Fiber Channel host that issued the command. Otherwise, the method of this invention waits to request the data block until the preset size memory block is free. The SCSI router receives the data block and stores the data block in a FIFO queue. The method of this invention repeats until an initial number of data blocks are stored in the FIFO queue. The command and the first data block received are forwarded to the network target device.

Abstract: As apparatuses which construct a ring network, a structure including a monitoring apparatus and other relay apparatuses is employed. The monitoring apparatus monitors only a ring status of such a ring network to which the own monitoring apparatus belongs. The monitoring apparatus periodically transmits health check frames from ring ports thereof respectively so as to monitor whether or not the transmitted health check frame has been received by the ring port located opposite thereto. Also, in a structure of a multi-ring network having a shared link, auxiliary health check frames are periodically transmitted from two sets of shared apparatuses respectively with respect to a monitoring apparatus of a shared link non-monitored ring network. The monitoring apparatus also monitors the auxiliary health check frames in combination with the health check frames in order to avoid an occurrence of a loop which bridges a plurality of ring networks.

Abstract: The present invention discloses a method for implementing centralized control plane and distributed data plane and that comprises the following steps: the main control unit of the main board generates control information and delivers it to the adaptation layer of the main board; the adaptation layer of the main board transmits the control information to the adaptation layer of the service board(s); the adaptation layer of the service board(s) delivers the control information to the data plane and hardware engine of the service board(s). The present discloses a program and system for implementing centralized control plane and distributed data plane. The present invention provides a software architecture using an adaptation layer to implement centralized control plane and distributed data plane to ensure high performance and good scalability of the new architecture, reduce system complexity, and keep system simplicity and efficiency.

Abstract: A dual loop (PLL/DLL) data synchronization system and method for plesiochronous systems is provided. A dual loop data serializer includes a phase lock loop (PLL) and a delayed lock loop (DLL) configured with a phase shifter in the feedback path of the PLL. The dual loop serializer locks to the input of the DLL instead of the local reference. Thus, the DLL adjusts the frequency from the PLL so that it matches the desired data rate. Each loop may be optimized for jitter tolerance with the net effect generating a synthesized clean clock (due to narrow bandwidth filtering) and VCO noise suppression (due to wide bandwidth filtering). A dual loop retimer includes a dual loop serializer (PLL/DLL) and a clock recovery DLL. The retimer resets the jitter budget to meet transmission requirements for an infinite number of repeater stages.

Abstract: A method and apparatus are provided for implementing system to system communication in a switchless non-InfiniBand (IB) compliant environment. IB architected multicast facilities are used to communicate between HCAs in a loop or string topology. Multiple HCAs in the network subscribe to a predetermined multicast address. Multicast messages sent by one HCA destined to the pre-determined multicast address are received by other HCAs in the network. Intermediate TCA hardware, per IB architected multicast support, forward the multicast messages on via hardware facilities, which do not require invocation of software facilities thereby providing performance efficiencies. The messages flow until picked up by an HCA on the network. Architected higher level IB connections, such as IB supported Reliable Connections (RCs) are established using the multicast message flow, eliminating the need for an IB Subnet Manager (SM).

Abstract: A communication node includes a token-start-right acquisition processor that issues a token-start-right acquisition frame containing specific information, determines a priority based on predetermined reference using specific information for other communication node and the specific information for the own communication node upon reception of a token-start-right acquisition frame from the other communication node, issues the token-start-right acquisition frame at a predetermined time interval when the own communication node has a higher priority than the other communication node, and stops issuing the token-start-right acquisition frame when the own communication node has a lower priority than the other communication node, to forward the token-start-right acquisition frame of the other communication node, and also includes a token start processor that passes the token frame to the ring upon reception of the token-start-right acquisition frame which is issued by the token-start-right acquisition processor and c

Abstract: Methods and apparatus for Fibre Channel interconnection is provided between a plurality of private loop devices through a Fibre Channel private loop device interconnect system. In the preferred embodiments, the Fibre Channel private loop device interconnect system is a fabric or an intelligent bridging hub. In one aspect of this invention, a Fibre Channel private loop device is connected to two or more Arbitrated Loops containing, or adapted to contain, one or more private loop devices. Preferably, the interconnect system includes a routing filter to filter incoming Arbitrated Loop physical addresses (ALPAs) to determine which Fibre Channel frames must attempt to be routed through the fabric. Numerous topologies of interconnect systems may be achieved.

Abstract: Communication modules are coupled in a communication ring and are operable to send and receive data from peripheral devices. The modules are operable to send and receive data streams on paths of the ring, and each module is operable, responsive to receiving a predetermined initialization signal, to operate as a master for initially blocking data in the first path and initially sending a block signal to a neighboring module downstream in the second path. The modules are operable, responsive to receiving the block signal in one of the paths, to block data in that one of the paths, so that responsive to initialization of one of the modules as a master, the master and the neighboring module create an inactive virtual link therebetween in order to prevent data from propagating around the ring more than once.

Abstract: The present invention provides a distribution system in which even in the case where the content distributability varies among content holders, desired content can be promptly and efficiently received by a requester. To index information recorded in a root node or cache node so that it can be referred to from the requester, in addition to content ID and IP address of a content holder, easiness information indicative of easiness of distribution of content from the content holder are added. When the requester determines a content holder as a distribution source, a content holder having high distributability is preferentially selected with reference to the easiness information and content is distributed from the selected content holder.

Abstract: A distributed messaging system and method allows servers in a network to share data, such as network status data associated with all of the servers in the network. In one embodiment, the distributed messaging system and method may be used in element management system (EMS) servers in a distributed network management system (NMS). The servers in the network share the data in a distributed manner by transmitting messages including the network status data, for example, using a star/broadcast method or a circular message queue (CMQ) method.

Abstract: The present invention extends to methods, systems, and computer program products for distributed aggregation on an overlay network. Embodiments of the invention utilize tiers of nodes that are cascaded in a layered system. Each tier reduces the size of data by orders of magnitude through pre-aggregation. Thus, high volume streams of messages can be reduced to lower volume streams at large scales, such as, for example, the Internet. No central coordination is used; thus there is no central point of failure or bottleneck. When a node fails, other nodes in the same tier as the failing node automatically take over the responsibilities of the failed node.