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: Methods, apparatus, and programming recorded in machine readable memory are provided for the index, search and retrieval of objects on a global network. This inventive system embeds a distributed index in a routing layer to enable fast search. The method provides dynamic insertion, lookup, retrieval, and deletion of participating nodes, objects and associated metadata in a completely decentralized fashion. Nodes can dynamically join and leave the network. This infrastructure can be applied to content networks for publishing, searching, downloading, and streaming.

Abstract: Techniques for provisioning single or multistage networks using Ethernet Service Instances (ESIs). In one embodiment, an ESI is a logical entity or object that stores information that may be used to provision a network. An ESI may represent a logical entity that identifies a grouping of elements of a network or network device and associated attributes. Hierarchical relationships may be created between ESIs. The hierarchical relationships are used to perform packet-level processing including performing network packet encapsulations.

Abstract: In one embodiment, a management device, such as a root node, monitors Internet Protocol (IP) overhead (e.g., IP header sizes during source-routing or route table sizes) within a directed acyclic graph (DAG) in a computer network. If it is determined that the IP overhead is above a configured threshold, then in response, a trigger is initiated to have devices within the DAG label-switch downward traffic directed away from the root node within the DAG. In another embodiment, a device communicating within a DAG stores IP routes corresponding to upward traffic from the device directed toward a root of the DAG, and IP-routes upward traffic based on the IP routes. Conversely, the device also stores labels corresponding to downward traffic from the device directed away from the root of the DAG, and label-switches downward traffic based on the labels, accordingly.

Abstract: A supervisor entity comprises an entity status module for maintaining status of its subordinate entities and updating the supervisor entity with status updates for itself and the subordinate entities. The entity status module comprises an entity status controller for receiving a status message from a first subordinate entity, a subordinate determination module for determining a second subordinate entity that is subordinate to the first subordinate entity, a status update module for updating the status of the second subordinate entity based on the received status message from the first subordinate entity, a status reporting module for reporting the updated status of the second subordinate entity to a supervisor entity and a status storage for storing the status of the second subordinate entity.

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: Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scatterv module installed on the node, the portion of the data for the node; determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.

Abstract: A network device may receive an Ethernet frame from a first leaf user-to-network (UNI) interface in a tree. The tree includes the first leaf UNI, a second leaf UNI, and a root UNI. In addition, the network device may look up, in a table, source and destination media access control (MAC) addresses in the Ethernet frame and a field value in a virtual local area network (VLAN) tag in the Ethernet frame. The destination MAC address is associated with the second leaf UNI. In addition, the network device may identify, based on the lookup, an output port via which the Ethernet frame is to be sent from the network device. Furthermore, the network device may send, through the output port, the Ethernet frame toward the second leaf UNI in the tree via a network path that includes the first leaf UNI and the second leaf UNI. The network path does not include the root UNI of the tree.

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: Hybrid tree/mesh overlays for data delivery involve using a tree overlay network and a mesh overlay network to delivery a data stream via a push mechanism and a pull mechanism, respectively. In an example embodiment, a network node enters a mesh overlay network and attaches to a tree overlay network. In operation, the network node receives data blocks of a data stream over the tree overlay network via a push mechanism. The network node ascertains if a data block is not received over the tree overlay network. If a data block is missing, the network node retrieves the missing data block over the mesh overlay network via a pull mechanism. In another example embodiment, the tree overlay network includes a subset of nodes forming a tree-based backbone. Network nodes that are identified as being stable may join the backbone and provide the data stream to other nodes.

Abstract: A subtree within a global tree of nodes is created by determining a predicate condition. The predicate condition is disseminated to the nodes in the global tree. For each node in the global tree, a determination of whether the node belongs to the subtree is performed, and an indication of whether the node belongs to the subtree is stored. After the subtree is created, a query corresponding to the subtree is put to the subtree for resolution.

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: A method for generating spanning trees (ST1,ST2,ST3) in a network (NW2). The network has nodes (A-K) interconnected by links (L2) and the trees are used for handling link and node failures. For handling link failures there is for each link (L2) at least one tree (ST1,ST2) that does not include that link. For node failures there is for each node (A-K) at least one spanning tree (ST1-ST3) to which the particular node is connected by a single link (L2). The first spanning tree (ST1) connects all nodes (A-K) and from each node one link is left unconnected. The second tree (ST2) includes all nodes and all the unconnected links. None of the links is included in both the trees (ST1,ST2). If node B is broken, node A cannot communicate with nodes C and D so the third tree (ST3) is needed. The method has the advantage of giving a low number of trees also for big networks of any topology and can be implemented off-line.

Abstract: An efficient media streaming method utilizing a globally load balanced overlay network. This method makes use of capacity per out-degree values to construct and maintain an overlay network for media streaming in a Peer-to-Peer environment.

Abstract: A network including a hierarchical structure of nodes is described. The structure of nodes includes n layers including n?1 layers of switch nodes and 1 layer of computational nodes. Each layer in the structure can include mn-L nodes grouped into units, where m represents a number of nodes in a unit and L represents a layer in the structure, where L=0 represents a lowest layer and L=n?1 represents a highest layer. Each node in a layer other than the computational layer can include a switch node for a unit in a next lower layer. For each unit, each node can be connected to each other node by a point to point link and to a local switch node for the unit by a point to point link. Each node can be connected to each other node and to the local switch node by a local broadcast network for the unit.

Abstract: A star network (1) having a star coupler (14) and at least a first and second network branch (112, 122), wherein each network branch (112, 122) comprises at least one network node (110, 120) and a bus driver (11, 12) connected between the star coupler (14) and the at least one network node (110, 120). A first bus driver (11) of the first network branch (112) is adapted to detect a symbol pattern comprising at least two predetermined equal control symbols, which are transmitted from the first network node (110) to the second network node (120), wherein a control symbol is part of a control pattern. The control pattern is used to force at least the second network node (120) to switch into a predetermined state. The first bus driver (11) is disabling the first network branch (112) from the star network (1) based on whether the transmitted symbol pattern is detected. By using the protection mechanism a reliable detection of babbling idiots is provided.

Abstract: A system for performing storage operations using hierarchically configured storage operation cells. The system includes a first storage manager component and a first storage operation cell. The first storage operation cell has a second storage manager component directed to performing storage operations in the first storage operation cell. Moreover, the first storage manager component is programmed to instruct the second storage manager regarding performance of storage operations in the first storage operation cell.

Abstract: A technology is disclosed for providing a connection status notifying method and the like that can infer that a new connection will become usable shortly based on a predetermined action, and give notification thereof. The technology includes a step at which a mobile node 1000 receives information stating that connection will be broken from a base station that is a current connection destination, a step at which the mobile node starts a predetermined process with a base station that is a new connection destination, and a step at which the mobile node generates a predetermined notification message and transmits the generated predetermined notification message when the predetermined process is judged to be completed, the predetermined notification message being used to give notification to a predetermined component part within the mobile node or to another communication node that a connected state is established with the base station of the new connection destination at an early stage.

Abstract: Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session.

Abstract: Multiple computers in a cluster maintain respective sets of identifiers of neighbor computers in the cluster for each of multiple named resource. A combination of the respective sets of identifiers define a respective tree formed by the respective sets of identifiers for a respective named resource in the set of named resources. Upon origination and detection of a request at a given computer in the cluster, a given computer forwards the request from the given computer over a network to successive computers in the hierarchical tree leading to the computers relevant in handling the request based on use of identifiers of neighbor computers. Thus, a combination of identifiers of neighbor computers identify potential paths to related computers in the tree.

Abstract: A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Abstract: When a failure occurs in a network or in a network apparatus, a connection state of the network is changed. There is provided a network configuration estimating apparatus for knowing logical route information quickly after a failure occurrence in accordance with information collected from network apparatuses, although it is conventionally difficult to know this information quickly. The network configuration estimating apparatus executes: a process of generating network configuration information such as physical and logical topologies from information collected in advance; a process of monitoring a network failure; a process of calculating a network configuration to be estimated after a network failure occurrence, from the network configuration information generated in advance and network failure information; a process of visually displaying the calculated network configuration; and a process of managing history of calculated network configurations.

Abstract: A data-transmitting method for wireless sensor network includes: constructing a wireless sensor network having a plurality of nodes for information sensing and a sink for quest raising and data collecting; clustering the nodes to form a plurality of groups, with one of the nodes in each group being identified as a kernel; identifying one of all the nodes as a summit dissemination node and the kernels in all the groups as first level dissemination nodes; and transmitting data between the quest-raising sink and one of the first level dissemination nodes or summit dissemination node to collect information sensed by a source that is one of the nodes.

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: A network may include a first set of routers at a first level of a multi-protocol label switched tunneling hierarchy and a second set of routers at a second level of the multi-protocol label switched tunneling hierarchy, the second set of routers connected to the first set of routers in a partially meshed topology. The network may also include a hierarchical segmented label switched path. The hierarchical segmented label switched path may include a forwarding adjacency label switched path including a subset of the first set of routers, and a label switched path coupled to the forwarding adjacency label switched path, the label switched path including a subset of the second set of routers.

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 system that incorporates teachings of the present disclosure may include, for example, a system having a controller to deliver broadcast channels by way of interactive TV (iTV) edge routers using multicast virtual private networks, share a same multicast state for the broadcast channels and share a same multicast delivery tree for the broadcast channels. Other embodiments are disclosed.

Abstract: A method for inferring end-to-end network topology and to accurately determine a layer-3 routing tree between one sender and a set of receivers in the presence of anonymous routers in a network.

Abstract: The invention is a system for distributing content data over a computer network and a method of arranging receiver nodes in a computer network such that the capacity of the server is effectively multiplied many times over, and may even be increased exponentially. The invention takes advantage of the excess capacity many receiver nodes possess, and uses them as repeaters. The distribution system includes nodes having databases which indicate their ancestors and descendants so that reconfiguration of the distribution network may be accomplished without burdening the system's primary sever. The invention includes a process for configuring a computer information distribution network having a primary server node and user nodes docked in a cascaded relationship, and reconfiguring the network in the event that a user node departs from it.

Abstract: Described is a method for improving both the bandwidth efficiency and bit rate of data streams flowing through binary tree networks. In an embodiment, the invention provides a method for efficiently utilizing end-consumer computers possessing a variety of upstream bandwidth capabilities to deliver online streaming video in a distributed manner.

Abstract: A method is provided of planning routes and allocating route identifiers in a managed frame-forwarding network. The network comprises a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of an identifier and a network address carried by a received data frame and forwarding instructions stored at the node. A first step of the method identifies a sub-set of nodes which are core nodes of the network. The remaining nodes are termed outlying nodes. A spanning tree is then built off each of the identified core nodes, with the spanning tree stopping one link short of any other core node. Each spanning tree defines a loop-free path between a core node at the root of the spanning tree and a set of outlying nodes. Connections are planned between roots of the spanning trees and a different identifier is allocated to each planned connection between a pair of spanning trees.

Abstract: Full-mesh WDM transmission units, each of which includes n number of interfaces and is capable of establishing a bidirectional full-mesh communication between all of the interfaces using wavelength paths based on a wavelength division multiplexing technique, are connected in a multistage tree-shaped structure by internetwork connection units through edge-packet transfer units connected to the respective interfaces. Therefore, it is possible to hold a direct communication between user terminals connected to the edge-packet transfer units of the same full-mesh WDM transmission unit, and to realize scalability by a multistage connection configuration.

Abstract: A storage network structure comprises a primary distributed storage network (a cluster distributed storage network or a DHT (Distributed Hash Table)-based peer-to-peer storage network) and a Peterson graph-based storage network. The storage network structure provides different reliability classes for applications and combines the advantages of a peer-to-peer based distributed network storage with Peterson graph-based network storage, solve the problem of a large quantity of data migrating by utilizing the better media data migrating non-movable property from the Peterson graph-based network storage, and screen the single failure of the cluster storage structure and avoid performance degradation of peer-to-peer wide area storage by combining with the availability and robustness of Distributed Hash Table.

Abstract: In order to constitute a domain name system obtained by providing and utilizing a DNS service by using a self-supporting (not rented) DDNS server in a dynamic IP address environment, a DDNS server inside a network of a central site and routers which are DDNS clients inside networks of other sites are provided. The DDNS server includes: a means for registering a relationship between domain names of the DDNS clients and global addresses of the DDNS client; a means for responding to a request for resolving a name from the DDNS client; and a means which, at a time when a global address of the DDNS server is updated, notifies DDNS server information including the global address of the DDNS server to the DDNS client. Moreover, the DDNS client includes: a means for registering (updating) the global address of the DDNS server when the DDNS server information is notified; and a means for issuing a request for resolving a name to the DDNS server.

Abstract: A cluster of architecture having a star topology with the central services node at its center. Application server instances are organized in a star topology with the central services node at its center. The central services node may include services such as a messaging server for interinstance cluster communications. A locking server may also be provided to provide cluster wide locking to facilitate changes and updates within the cluster. A database may also be shared by all instances in the cluster, thereby reducing the need for data replication. In one embodiment, the message server has no persistent state. In such an embodiment, if the message server fails, it can merely be restarted without any state recovery requirement.

Abstract: A method and system for data transmission by computational devices in a wireless network (100) are disclosed. A computational device (102) organizes the wireless network in a hierarchical topology having at least one root node and updates a list of interferers and a list of descendents. Then, the computational device allocates a Contention Free Period (CFP) slot to each computational device in the wireless network based on at least one of the list of interferers and the list of descendents and transmits data during the allocated CFP slot.

Abstract: Presented is a method and system for determining network topology of a Virtual Private Network (VPN) in a Wide Area Network (WAN). The method includes obtaining a list of CE (customer edge) routers in a network, obtaining a list of prefixes advertised by each CE router, iterating, for each prefix, the list of prefixes advertised by all CE routers, verifying, in case a potential hub CE router already exists, whether the second CE router and the potential hub CE router are same, marking, in case a potential hub CE router does not exist, the second CE router as the potential hub CE router, and marking, if there exists a potential hub CE router that advertises every other prefix in the network, the potential hub CE router as hub site and other CE routers as spoke sites.

Abstract: A method and device for protecting Ethernet Tree (E-Tree) services are disclosed. An ID is configured for each branch of the E-Tree. The method includes: determining a branch that needs to perform switching; notifying the ID of the branch that needs to perform switching to a work E-Tree through a root UNI of a protect E-Tree; and switching data over the branch that needs to perform switching from the work E-Tree to the protect E-Tree according to the ID of the branch that needs to perform switching. In the embodiments of the present invention, because an ID is configured for each branch of the E-Tree, the branch corresponding to the ID may be triggered to perform protection switching as required, thus implementing branch switching.

Abstract: A ring communication network according to an embodiment of the present invention includes a plurality of nodes in which a single one of the nodes is configured for full channel conversion and the remaining nodes, other than the single node, are configured for no channel conversion. Links with no more than W channels couple the nodes. The ring communication network also may include N nodes and links connecting the nodes for carrying data in W channels such that N?2 log2 W?1 where W is a power of 2. Each of the N nodes includes switches connected such that each channel of a first one of the links adjacent to any one of the N nodes can be switched to no more than W?1 channels of another one of the links adjacent any one node.

Abstract: A system for performing storage operations using hierarchically configured storage operation cells. The system includes a first storage manager component and a first storage operation cell. The first storage operation cell has a second storage manager component directed to performing storage operations in the first storage operation cell. Moreover, the first storage manager component is programmed to instruct the second storage manager regarding performance of storage operations in the first storage operation cell.

Abstract: An operation management device manages the operations of managed devices, and includes: an information collection unit for acquiring communication data between the managed devices; and a calculation unit for calculating coordinates when the managed devices are arranged on a two-dimensional plane.

Abstract: A method and system for providing a multi-level interconnection network is provided. A multi-level interconnection network comprises basic cells that are aggregated into higher level cells at each level of the network. At the first level, the basic cells are aggregated into first level cells. Each first level cell is an aggregation of a number of basic cells that is one more than the number of devices in a basic cell. The basic cells of a first level cell are fully connected; that is, each basic cell has a first level link or connection to each other basic cell. In a first level cell, each device of a basic cell has a first level link to each other basic cell. The multi-level interconnection network has higher level cells that are aggregations of lower level cells in a similar manner.

Abstract: Nodes of the network are organized into a tree structure having a plurality of vertices. Each vertex of the tree structure comprises a group having a plurality of nodes. Membership information is maintained at each node. The membership information for a given node comprises information about a group to which the given node belongs and child groups of the group to which the given node belongs in the tree structure. The steps are performed at least in part by a processor.

Abstract: Provided is a multicast distribution system which can perform a multicast distribution by selecting a communication path satisfying a communication feature required by a multicast group. A distribution source router (Rs) performs a multicast distribution to routers (R1 to R5) constituting a multicast group based on an application via a mesh virtual network connected to a plurality of routers. When the CPU load ratio and the multicast group communication feature exceed threshold values, the distribution source router updates the number of branches and the depth of the multicast tree which distributes a packet from the router and starts reconfiguration of the multicast tree. When reconfiguring the multicast tree, the distribution source router references a path feature of the mesh virtual network, selects a communication path having a sufficient path feature with a higher priority, and generates a routing table based on the multicast tree.

Abstract: The invention provides multicast communication using distributed topologies in a network. The control nodes in the network build a distributed topology of processor nodes for providing multicast packet distribution. Multiple processor nodes in the network participate in the decisions regarding the forwarding of multicast packets as opposed to multicast communications being centralized in the control nodes.

Abstract: In one embodiment, a first switch at a border between a first network of a first protocol (P1 network) and a first network of a second protocol (P2 network) is interconnected via the first P1 network with a second switch between a second P1 network (interconnected with the first P1 network) and a second P2 network. In response to detecting a merge of the first and second P2 networks, the first switch may: i) block data packets from traversing P1 network boundary ports of the first switch; ii) allow protocol messages to flow between the first and second P1 networks through the P1 network boundary ports of the first switch; iii) allow the first and second P1 networks to discover each other through the protocol messages and to prevent loops; and in response, iv) unblock the P1 network boundary ports of the first switch to allow traversal of data packets.

Abstract: A traffic performance in a tree type multi-hop wireless network of a CSMA/CA method is evaluated easily and highly precisely. A traffic performance evaluation system in the multi-hop wireless network includes: a performance index estimation unit regarding the multi-hop wireless network as a combination of a plurality of single-hop wireless networks and estimating a traffic performance index around each node of the network; and a performance index determination unit determining a traffic performance index of the whole multi-hop wireless network based on an estimation result of all the nodes by the performance index estimation unit.

Abstract: In a hierarchical tree-based protection scheme, a node in a mesh network is designated as a root node of a spanning hierarchical protection tree and subsequently invites each adjacent node to become its child within the tree. If the inviting node provides a more capacious protection path to the root node than is currently enjoyed by the invitee, the invitee designates the inviting node as its primary parent and assumes a new tree position. Otherwise, the invitee designates the inviting node as a backup parent. A node assuming a new tree position invites all adjacent nodes except its parent to become its child. The invitations propagate throughout the network until a spanning hierarchical protection tree is formed. Upon a subsequent failure of a straddling link, the tree may be used to re-route data. Further, given a tree link failure, protection switching is quickly achieved at a disconnected node through use of a backup parent as the new primary parent.

Abstract: A coordinated channel change system. In particular implementations, a method includes receiving a prepare-to-change message, wherein the prepare-to-change message indicates instructions to prepare to change channels and includes a designated channel, and forwarding the prepare-to-change message to one or more child nodes. The method also includes receiving a ready-to-change message from the one or more child nodes, and transmitting a change-to-channel message to the one or more child nodes, wherein the change-to-channel message indicates instructions to switch to the designated channel. The method also includes receiving an acknowledgement message from the one or more child nodes, and changing to the designated channel.

Abstract: Disclosed are apparatus and methodology subject matters for upgrading firmware associated with one or more metrology devices and adjunct devices. Methods are disclosed for broadcast transmission of portions of a firmware image file from an originating device over a network connecting multiple devices to be upgraded. The entire image file may be transmitted as segments to be assembled by the end devices. Broadcast segments not properly received from the originating device may be retried directly from the originating device or from neighbors correctly receiving the segment. A viral propagation methodology is disclosed as an alternative to portions of the broadcast methodology.