| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 370408000 | Nodes interconnected in hierarchy to form a tree | 39 |
| 20080212597 | Method and apparatus for filtering data packets - Disclosed is a method and apparatus for filtering received data packets. A hierarchical tree is maintained. The tree includes nodes organized in a plurality of levels. Each level above a root node of the tree has one or more of the nodes, with each of the one or more of the nodes corresponding to a particular value of a segment of an Internet Protocol (IP) address. The segment is the same for each node of a particular level of the tree. Each node at a particular level of the tree stores a number representative of the number of received packets having the same value for the segment of the IP address associated with the particular level. Some of the received data packets are filtered out based on the hierarchical tree. | 09-04-2008 |
| 20080219278 | METHOD FOR FINDING SHARED SUB-STRUCTURES WITHIN MULTIPLE HIERARCHIES - Shared sub-structures are found within a collection of multiple hierarchies. A label is associated with each node in the collection of hierarchies, and an inverted index mapping node labels to lists of hierarchies is created. Each pair of hierarchies in each hierarchy list is iterated over in a certain order, and a shared substructure is found between a pair of hierarchies using the node labels. When more than one shared substructure is found, the substructures are merged into a shared subtree. | 09-11-2008 |
| 20080240138 | Tree type broadcast system, connection target determination method, connection management device, connection management process program, and the like - A connection management device for managing connection mode between node devices in a tree type broadcast system formed by participation of all or a part of a plurality of node devices included in a distributed content storing system where a plurality of content data are distributed and stored in the plurality of node devices and each of the plurality of node devices provides content data stored in the own node through a network in response to a request from the other node devices, to thereby sequentially transfer the content data broadcasted by the broadcasting device from the node devices on upper hierarchies to the node devices on lower hierarchies, the connection management device including:
| 10-02-2008 |
| 20080247408 | Reliable Broadcast Protocol and Apparatus for Sensor Networks - A method for broadcasting messages in an ad hoc wireless network having a tree-based architecture is provided. When a node receives a broadcast message for re-broadcasting to other nodes in the network, it builds a list of identifiers of other nodes in the network from which the node requires reception of a broadcast message as an implicit acknowledgment that said other nodes in the network have received said broadcast message. The node builds this implicit acknowledgment list based on stored data pertaining to an existing tree-based topology of the network. After this list is built, the node re-broadcasts the broadcast message. Each node in the network executes this broadcasting protocol and in so doing a broadcast message quickly and efficiently propagates through the network with minimal redundancy and impact on the topology of the network. | 10-09-2008 |
| 20080273544 | MANAGEMENT OF PROTOCOL INFORMATION IN PNNI HIERARCHICAL NETWORKS - Described is a method for managing flow of protocol information in a node of a hierarchical network in which the protocol information is communicated between network nodes in topology state elements. The method comprises checking topology state elements generated by the node to identify protocol information encapsulated therein, and selectively allowing transmittal of the topology state elements from the node to lower levels of the network based on the protocol information identified. | 11-06-2008 |
| 20080279205 | Packet preclassification using search tree algorithms - An information packet preclassification system and method are provided. The method receives a packet of information and differentiates the packet into segments. Using a decision tree with multiple levels, segments in the packet are compared to a node at a tree level, where each node includes a plurality of node reference segments and corresponding node comparison operators. The reference segment may be a different segment from the packet, or a predetermined segment value stored in memory. One, or more classification attributes are accessed in response to comparing segments, and the classification attributes are assigned to the packet. Then, the packet is processed in response to the classification attributes. | 11-13-2008 |
| 20080279206 | Tree-type broadcast system, method of participating and withdrawing tree-type broadcast system, node device, and node process program - A node device having a plural hierarchy levels in a tree-like shape while placing a broadcast device at a top of the levels and connecting the node devices through a communication means, wherein content data is sequentially transferred from the node device at an upper hierarchy level to that at a lower hierarchy level, including:
| 11-13-2008 |
| 20090003367 | PATH MANAGEMENT DEVICE AND PROGRAM STORING MEDIUM - A path management device of the present invention manages information about communication paths in a communication network, the communication network including a plurality of routers mutually connected by means of a communication line, link states between the plurality of routers being shared among each of the plurality of routers by means of link state advertisement messages that are announced from each of the plurality of routers, and routing tables being created in each of the plurality of routers based on shortest path trees, and the path management device includes: a receiving unit that receives the link state advertisement messages; a routing table creation unit that reproduces the shortest path trees and the routing tables of each of the plurality of routers based on the link state advertisement messages; and a routing table recording unit that records the reproduced routing tables of each of the plurality of routers. | 01-01-2009 |
| 20090010272 | Root node shutdown messaging for multipoint-to-multipoint transport tree - In one embodiment, a method comprises registering, by a first label switching router having been identified as a root of a prescribed transport tree for transport of a prescribed group of data packets, at least two next hop label switching routers as belonging to the prescribed transport tree based on receiving respective label mapping messages; detecting by the first label switching router a prescribed condition indicating the first label switching router is to be removed from service as the root of the prescribed transport tree; and outputting, by the first label switching router, label distribution protocol messages for the prescribed transport tree to each of the next hop label switching routers determined as belonging to the prescribed transport tree, each label distribution protocol message indicating the first label switching router is to be removed from the service as the root of the prescribed transport tree. | 01-08-2009 |
| 20090016369 | ACCESSING DATA PROCESSING SYSTEMS BEHIND A NAT ENABLED NETWORK - A method, system, and program for accessing data processing systems behind a NAT enabled network are provided. According to one aspect of the present invention, a NAT data processing system is located behind a NAT enabled network with a NAT device as a gateway to the NAT enabled network. A client system located outside the NAT enabled network queries the NAT device for the address of the NAT data processing system located behind the NAT enabled network. The query is automatically routed through the NAT device to a DNS server. The DNS server then returns an address for the NAT data processing system and source routing for the NAT device. The NAT device forwards the address and source routing to the client system. Then, the client system sends packets to the NAT data processing system at the address with source routing through the NAT device, such that the NAT data processing system behind the NAT enabled network is directly accessed by the client system from outside the NAT enabled network. | 01-15-2009 |
| 20090086745 | Method and a system for matching between network nodes - A multi-node network that comprises a plurality of nodes, at least one of the nodes comprises a local cache for storing a plurality of matching indications at least some of which associated with a potential node. A receiving node of the plurality of nodes that is configured for receiving a matching request having a requested matching indication associated with an address of an additional node of the plurality of nodes. The receiving node is configured for identifying a match between the receiving node and at least one of the associated potential nodes by matching the requested matching indication and the stored matching indications and for informing one or more of the receiving nodes and the associated nodes about the match. | 04-02-2009 |
| 20090154482 | ROUTING METHOD IN SENSOR NETWORK - Provided is a routing method capable of expanding a conventional tree routing to perform the efficient and safe key management in a sensor network environment that requires the symmetric key based key management. Each sensor node transmits a Route Reverse message to a sink node to set a reverse tree routing path. Therefore, it is possible to provide efficient and safe key management mechanism and communication environment by providing a bidirectional communication between a sink node and sensor nodes through an expanded tree routing such that a user is provided with a safe sensor network. | 06-18-2009 |
| 20090238196 | NETWORK SYSTEM AND RELAY DEVICE - when a network system of the present invention performs a bandwidth-guaranteed communication, a terminal device collects information on one or more relay devices on a path to another terminal device via a bandwidth request packet transmitted to the another terminal. When the bandwidth cannot be allocated, a detour path is searched according to the collected relay device information so as to perform the bandwidth-guaranteed communication via the detour path. | 09-24-2009 |
| 20090274160 | Tree-shaped broadcasting system, packet transmitting method, node device, and computer-readable medium - A lost packet in a plurality of packets broadcasted from a broadcasting apparatus is detected. Packet complement request information indicative of a packet complement request for complementing the lost packet is transmitted to a device in a high hierarchical level, and a dummy packet for holding transmission of the packet complement request information for a predetermined hold time is transmitted in place of the lost packet to a node device connected in a low hierarchical level. | 11-05-2009 |
| 20090323709 | Determining and Distributing Routing Paths for Nodes in a Network - Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means associated with determining and distributing routing paths for nodes in a network. For each route computational node of multiple route computational nodes in a network: a tree of paths between itself and each of multiple nodes in the network is determined. A particular tree of paths is determined for a particular node of these multiple nodes to the other nodes based on at least two of the determined trees of paths for the route computational nodes. The particular node then sends a packet towards a destination based on the particular tree of paths determined for the particular node. | 12-31-2009 |
| 20100034211 | Network system, information processor, connection destination introducing apparatus, information processing method, recording medium storing program for information processor, and recording medium storing program for connection destination introducing apparatus - A distribution system is provided, which is capable of distributing content more stably as compared with the case where connection is newly changed after distribution of content is stopped. | 02-11-2010 |
| 20100085979 | MODELS FOR ROUTING TREE SELECTION IN PEER-TO-PEER COMMUNICATIONS - Peer-to-peer communications sessions involve the transmission of one or more data streams from a source to a set of receivers that may redistribute portions of the data stream via a set of routing trees. Achieving a comparatively high, sustainable data rate throughput of the data stream(s) may be difficult due to the large number of available routing trees, as well as pertinent variations in the nature of the communications session (e.g., upload communications caps, network link caps, the presence or absence of helpers, and the full or partial interconnectedness of the network.) The selection of routing trees may be facilitated through the representation of the node set according to a linear programming model, such as a primal model or a linear programming dual model, and iterative processes for applying such models and identifying low-cost routing trees during an iteration. | 04-08-2010 |
| 20100142547 | Link data transmission method, node and system - Link data transmission to a plurality of nodes includes: establishing a tree connection among the plurality of nodes; receiving data to be transmitted at a current node; in the event that the current node receiving the data to be transmitted has at least one child node; sending by the current node the data to be transmitted to one of the at least one child node, and in the event that the current node receiving the data to be transmitted has at least one sibling node that has not obtained the data to be transmitted, sending by the current node the data to be transmitted to one of the at least one sibling node. | 06-10-2010 |
| 20100208744 | System and method for compressing internet protocol rounting tables - A networking device connects to a router and to an autonomous system (AS). The networking device receives a routing table from the router, exchanges routing information with the AS, updates the routing table in response to exchanging information with the AS, coalesces the updated routing table into a compressed routing table, and sends the compressed routing table back to the router. The compressed routing table causes the router to forward data in a manner that is identical to the received routing table. | 08-19-2010 |
| 20100215051 | NETWORK ROUTING WITH PATH IDENTIFIERS - One embodiment of the present invention provides a system that communicates a data packet in a network to a target node. In doing so, the system receives a node identifier for the target node, and determines a first positional label, based in part on the node identifier, for reaching a first anchor node from a root node in the network. The first anchor node stores a second positional label for reaching the target node from the root node in the network, which comprises a number of nodes coupled to the root node in a tree topology. The system then retrieves the second positional label from the first anchor node, and communicates the data packet to the target node based in part on the second positional label. | 08-26-2010 |
| 20100260197 | IN-BAND SIGNALING FOR POINT-MULTIPOINT PACKET PROTECTION SWITCHING - A method and system provide in-band protection switch signaling in a communication system arranged as a point-to-multipoint tree. The point-to-multipoint tree includes a root node communicatively coupled to a plurality of leaf nodes through both a working link and a protection link. Data is transferred through a current link of the point-to-multipoint tree. The current link is either the working link or the protection link. A fault is detected in the current link in the point-to-multipoint tree. Each leaf node in the point-to-multipoint tree is notified of the fault using the current link. Upon receiving the notification, the root node and each leaf node switch to the other link of the working link and the protection link. | 10-14-2010 |
| 20100290480 | METHOD FOR SCALABLE ROUTING WITH GREEDY EMBEDDING - A method and apparatus is disclosed herein for scalable routing with greedy embedding. In one embodiment, the method comprises storing log(n) coordinates in a routing table, where n is the number of nodes in a network, and further wherein the log(n) coordinates are generated by constructing a greedy embedding that embeds a graph topology depicting connections between n nodes of a network into a geometric space so as to use greedy forwarding by generating a spanning tree out of a connection graph representing the connections between the n nodes of the network, decomposing the tree into at most n branches, assigning a set of geometric coordinates to vertices in the tree in an n-dimensional space, and projecting the set of geometric coordinates onto a k-dimensional space, where k is less than n, to create the log(n) coordinates; and routing packets via nodes of the network using the log(n) coordinates in the routing table. | 11-18-2010 |
| 20100296517 | NETWORK ROUTING USING INDIRECT NEXT HOP DATA - A router maintains routing information including (i) route data representing destinations within a computer network, (ii) next hop data representing interfaces to neighboring network devices, and (iii) indirect next hop data that maps a subset of the routes represented by the route data to a common one of the next hop data elements. In this manner, routing information is structured such that routes having the same next hop use indirect next hop data structures to reference common next hop data. In particular, in response to a change in network topology, the router need not change all of the affected routes, but only the common next hop data referenced by the intermediate data structures. This provides for increased efficiency in updating routing information after a change in network topology, such as link failure. | 11-25-2010 |
| 20110044351 | TECHNIQUES FOR EFFICIENTLY UPDATING ROUTING INFORMATION UPON SHORTEST PATH TREE COMPUTATION - Techniques for efficiently updating routing information in a network device such as a router. According to an embodiment of the present invention, information is stored identifying one or more nodes and leaves owned or advertised by the nodes. When a change occurs in a network environment, information is stored identifying one or more nodes and leaves that have changes associated with them. The routing information in the network device is then updated for only those nodes and leaves that have changes associated with them. | 02-24-2011 |
| 20110044352 | TECHNIQUE FOR DETERMINING A POINT-TO-MULTIPOINT TREE LINKING A ROOT NODE TO A PLURALITY OF LEAF NODES - A method is provided for determining a point-to-multipoint tree connecting a root node to a plurality of leaf nodes (some nodes in different domains) used by a path calculation entity associated with a current domain. The method comprises receiving from at least one other path calculation entity associated with a downstream domain at least one message including a first set of identifiers including at least one identifier of a bunch of branches comprising at least one branch and a respective cost associated with said bunch, the bunch comprising at least one branch enabling connection to leaf nodes in downstream domains, and determining at least one new bunch of branches comprising at least one branch as a function of said at least one first set received, said new bunch of branches having a minimum cost and making it possible also to contact the leaf nodes of the current domain. | 02-24-2011 |
| 20110170557 | System and Method for Traversing a Treelet-Composed Hierarchical Structure - A method for performing node traversal operations of a treelet-composed hierarchical structure includes allocating a queue for each of the plurality of treelets, each queue operable to store ray-states entering a respective one of the treelets. The method additionally includes determining that a ray-state exits a first treelet of the hierarchical structure and enters a second treelet of the hierarchical structure. The method further includes forwarding the ray-state entering the second treelet to a processing element for processing therein, wherein the queue allocated to store ray-states entering the second treelet is bypassed. | 07-14-2011 |
| 20110188509 | ETHERNET FRAME BROADCAST EMULATION - A method to facilitate the broadcast of frames between a set of Edge Nodes of a transport network, where nodes of the transport network forward frames using labels added to the frames at ingress Edge Nodes. The method comprises, at each of said Edge nodes and at intermediate nodes in the paths between said Edge Nodes, installing an entry or entries into a forwarding table mapping frame labels to output forwarding ports such that said entries together form a single forwarding construct such that frames labelled by any of the Edge Nodes of said set are transmitted to all other Edge Nodes of the same set. Upon receipt of a frame at one of said Edge Nodes or intermediate nodes, the provided forwarding table is used to map the frame label of the frame to one or more forwarding ports. Frames are then sent via the identified forwarding port(s). | 08-04-2011 |
| 20120307837 | MULTIPOINT-TO-POINT PSEUDOWIRE - A method is provided for transmitting a data stream from a plurality of terminating (leaf) devices toward another terminating (root) device, the leaf and root devices forming the ends of a multipoint-to-point pseudowire based on a packet switched network to which the terminating devices belong, the method comprising: receiving, by a switching device, also belonging to the packet switched network, a first data stream sent by a first leaf device toward the root device, receiving, by the switching device, a second data stream sent by a second leaf device toward the root device, aggregating the first and second data streams into a third data stream, the switching device having been configured to aggregate the first and second data streams via a parameter called the aggregation parameter, included in a pseudowire establishment request, and transmitting the third data stream toward the root device. | 12-06-2012 |
| 20130010803 | PACKET FORWARDING SYSTEM, CONTROL DEVICE, FORWARDING DEVICE AND METHOD AND PROGRAM FOR PREPARING PROCESSING RULES - In a method and a configuration for forming a processing rule, number of entries for packet processing, maintained by a forwarding node, may be decreased. The processing rule includes processing contents and information to become a matching key to identify a packet to be applied with the processing contents. An aggregation tree is used which has a depth corresponding to a length of information that becomes matching key in the processing rule. A plurality of nodes branched from a root of the aggregation tree and levels of nodes represent value of the matching key and mask length, respectively. The processing rule or the policy is registrable in each of the individual nodes. The policy is registered in a relevant node of the aggregation tree. For each received packet, processing contents and ad-hoc matching key to identify the packet to be applied with the processing contents are determined by having reference to the policy. Then, based on the ad-hoc matching key, the aggregation tree is traced from its root downwards to find a node beyond which along the depth of the tree there is no policy registered. The processing rule having the node as the matching key is then formed. | 01-10-2013 |
| 20130114620 | SYSTEM AND METHOD FOR PROVIDING DEADLOCK FREE ROUTING BETWEEN SWITCHES IN A FAT-TREE TOPOLOGY - A system and method can support routing packets between a plurality of switches in a middleware machine environment, thereby supporting Internet Protocol (IP) based management traffic via enabling IP over Infiniband (IPoIB) communication in the middleware machine environment. The plurality of switches can perform routing for inter-switch traffic in the middleware machine environment using a first routing algorithm. Then, a switch in the middleware machine environment can be selected as a hub switch for inter-switch traffic that can not reach destination using the first routing algorithm. Furthermore, a routing table associated with the hub switch can be updated when a path exists between a source switch and a destination switch via the hub switch. | 05-09-2013 |
| 20140233581 | SWITCH AND SWITCH SYSTEM - A disclosed switch includes: ports that include a first port to be connected to another switch included in a first domain that includes plural switches to be virtually integrated, and a second port that is other than the first port; a first processing unit configured to obtain data of a switch included in the first domain through the first port; and a second processing unit configured to obtain data of switches included in a second domain that is adjacent to the first domain through the second port and obtain data of switches included in the second domain from the another switch included in the first domain to identify, from among the ports, plural ports that are connected to the second domain, perform a setting for the identified plural ports, and perform a first processing to make plural domains that include the first and second domains a tree structure. | 08-21-2014 |
| 20140321472 | METHOD FOR IMPLEMENTING E-TREE SERVICE AND PROVIDER EDGE DEVICE - The present invention discloses a method for implementing an E-tree service and a provider edge device, and relates to the field of network communications technologies. A local PE device obtains leaf PE attribute information of a peer provider edge PE device; when the leaf PE attribute information of the peer PE device indicates that the peer PE device is a leaf PE device and the local PE device is a leaf PE device, the local PE device forbids a pseudo-wire connection between the local PE device and the peer PE device. The technical solution of the present invention implements effective isolation between leaf nodes supporting an E-Tree service and therefore implements the E-Tree service in a VPLS network. | 10-30-2014 |
| 20150023363 | OBTAINING DATA RECEPTION PARAMETERS ON-DEMAND IN A MULTIPLE INTERFACE NETWORK - In a multi-PHY, low power and lossy network comprising a plurality of nodes, a sender determines that a dwell time threshold limit for transmission of data will be exceeded by transmission of the data over a first network interface or that the recipient is unknown. The sender determines transmission parameters for the transmission of the data over the first network interface and transmits the transmission parameters to a receiver device over a second network interface that is different than the first network interface. The sender determines a channel on the first network interface for transmission of the data and transmits the determined channel with the transmission parameters to the receiver, or the receiver determines the channel on the first network interface for transmission of the data and transmits an indication of the determined channel to the sender in response to receiving the transmission parameters. | 01-22-2015 |
| 20150063365 | DYNAMIC FRAME SELECTION WHEN REQUESTING TONE MAP PARAMETERS IN MESH NETWORKS - In a multiple interface, low power and lossy network comprising a plurality of nodes, a sender node dynamically selects a data packet for setting a transmission parameter request in response to determining that an age value for a set of transmission parameters associated with a recipient device has expired or is expiring. The sender node selects an desired data packet for sending a transmission parameter request and transmits the selected data packet to the recipient device. The sender node receives a transmission parameter response from the recipient node comprising updated transmission parameters for that recipient node and then updates the current transmission parameters associated with the recipient node accordingly. | 03-05-2015 |
| 20160014023 | FORWARDING TABLE PERFORMANCE CONTROL IN SDN | 01-14-2016 |
| 20160014050 | ARBITRATING AND MULTIPLEXING CIRCUITRY | 01-14-2016 |
| 20160191299 | INFORMATION PROCESSING SYSTEM AND CONTROL METHOD FOR INFORMATION PROCESSING SYSTEM - A disclosed system includes plural switches, a node, and a management apparatus. The node includes: a transmitter that transmits an assignment request whose destination is the management apparatus. The management apparatus includes: a determination unit that determines whether an identifier can be assigned to the node, based on the assignment request; and a transmitter that transmits a response including an identifier assigned to the node. And a first switch that is a switch of the plural switches and relays the assignment request and the response includes: a making unit that makes settings for relaying a packet whose destination is the node; and a transmitter that transmits, to other switches belonging to a domain to which the first switch belongs, a setting request including the information on the logical link that received the assignment request and the identifier included in the response. | 06-30-2016 |
| 20160380885 | APPARATUS AND METHOD FOR HARDWARE-ACCELERATED PACKET PROCESSING - Devices and techniques for hardware accelerated packet processing are described herein. A device can communicate with one or more hardware switches. The device can detect characteristics of a plurality of packet streams. The device may distribute the plurality of packet streams between the one or more hardware switches and software data plane components based on the detected characteristics of the plurality of packet streams, such that at least one packet stream is designated to be processed by the one or more hardware switches. Other embodiments are also described. | 12-29-2016 |
| 20190149461 | SYSTEM AND METHOD OF COMPUTING ETHERNET ROUTING PATHS | 05-16-2019 |
