Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Spanning tree

Subclass of:

370 - Multiplex communications

370254000 - NETWORK CONFIGURATION DETERMINATION

370255000 - Using a particular learning algorithm or technique

Patent class list (only not empty are listed)

Deeper subclasses:

Entries
DocumentTitleDate
20110176459METHOD FOR SCHEDULING TRANSMISSIONS OF GLOBAL BEACONS IN BODY AREA NETWORKS07-21-2011
20130044642METHODS AND SYSTEMS TO STORE AND FORWARD MULTICAST TRAFFIC - Methods and systems are described to store and forward multicast traffic. The method includes receiving a request to add a first node to a membership tree including a first plurality of nodes associated with a multicast group, identifying a second node in the first plurality of nodes, communicating a node identifier that identifies the first node over a network to the second node where the node identifier is stored at the second node to add the first node to the membership tree where the node identifier is stored in the membership tree to enable the second node to forward multicast traffic to the first node, and where the first and second nodes are separated from each other by at least one other node of the first plurality of node. The first node can be associated with a multicast member that has been added to the multicast group. Other embodiments are disclosed.02-21-2013
20100150029TOPOLOGY SPECIFYING METHOD AND TOPOLOGY SPECIFYING APPARATUS - A topology specifying apparatus 06-17-2010
20100054157Method And Apparatus For Network Tree Management - There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.03-04-2010
20080232276Load-Aware Network Path Configuration - Load-aware spanning tree reconfiguration includes determining volumes for information flows in an existing spanning tree in a network. The spanning tree is reconfigured based on the volumes to provide higher-volume information flows with shorter paths in the reconfigured spanning tree.09-25-2008
20130028143REDUCED TOPOLOGY ROUTING IN SHARED MEDIA COMMUNICATION NETWORKS - In one embodiment, a particular node in a shared communication network determines a current path cost in a routing topology from itself to a root node via a current parent node. The particular node also determines a respective path cost from each reachable potential parent node of the particular node to the root node via each potential parent and a respective link metric to each potential parent node. A set of acceptable parent nodes are determined from the potential parent nodes that have a respective path cost that is less than the current path cost plus an acceptable cost increase, and also have a respective link metric that is within an acceptable range. By determining a respective number of child nodes for each acceptable parent node, the particular node may then select a new parent node based on giving preference to those having a greater respective number of child nodes.01-31-2013
20100118738MULTICAST TREE DESIGNING DEVICE, METHOD, AND PROGRAM - A multicast tree design apparatus designs a multicast tree by mathematical programming. The multicast tree design apparatus is one for designing a multicast tree for transferring a packet from a source node to a plurality of destination nodes on a network that includes nodes and links connecting the nodes, the apparatus including a problem creating unit and a problem solving unit, and wherein: the problem creating unit includes a multiple route constraint creating unit for creating constraint expressions for constructing a plurality of routes that start from a source node and end at a plurality of destination nodes, a tree constraint creating unit for creating a constraint expression for superposing all the routes to construct a multicast tree, a confluence constraint creating unit for creating a constraint expression for preventing the plurality of routes from being superposed into a topology that causes a confluence of the routes, and an objective function creating unit for creating an objective function for minimizing an evaluation index pertaining to the links or the nodes that constitute the multicast tree; and the problem solving unit solves a mathematical programming problem including the constraint expressions and the objective function created by the problem creating unit to determine a set of links that constitute the multicast tree.05-13-2010
20100046400MULTICAST DISTRIBUTION TREE ESTABLISHMENT AND MAINTENANCE IN A WIRELESS MULTI-HOP RELAY COMMUNICATION SYSTEM - A method and apparatus for multicast communications in a multi-hop relay network are described including sending an extended request message, wherein the request message includes a multicast connection identification, multicast distribution tree information and a path identification and receiving an extended response message. Correspondingly, a method and apparatus for multicast communications in a multi-hop relay network are described including receiving an extended request message, wherein said request message includes a multicast connection identification, multicast distribution tree information and a path identification and sending an extended response message.02-25-2010
20120207062ASYNCHRONOUS COMMUNICATION METHOD FOR A WIRELESS SENSOR NETWORK - The present invention relates to an asynchronous communication method in a wireless sensor network comprising a tree structure. For each node of the network, the communication is organized as a sequence of time frames, each frame including a listening phase possibly followed by a receiving phase and/or a transmitting phase. The method, of the preamble sampling type, enables a node to make a time appointment to its child node to transmit them a time window allocation message, each child node then transmitting at least one data packet in the window it has been allocated to. By minimizing the collision risk between packets and by maximizing the time during which the sensors go to sleep, the communication method both reduces the latency and the consumption within the network.08-16-2012
20100110936METHOD AND SYSTEM FOR CLASSIFYING DATA PACKETS - Embodiments of the invention provide a method for building a classification tree based on a plurality of rules. Each rule includes multiple fields having different priority levels. The classification tree is built to provide for single pass classification of a received packet according to the multiple rules. The classification tree is built level-by-level, where each level represents one of the priority levels. Building a single level of the classification tree includes: creating, for each of the logical decision paths received from a next higher priority level, a respective sub-tree. The sub-tree includes only nodes and related logical decision paths that are necessary to satisfy rules associated with a respective next higher priority level node. Building of the single level further includes: creating, for each non-lowest priority level, logical decision paths from nodes within the current priority level to a next lower priority level.05-06-2010
20100110937Systems and Methods for Improving Multicast Communications - Systems and methods for improving multicast communications for media services in a network are provided. In this regard, a representative method, among others, includes receiving information related to consumers and at least one routing algorithm associated with the network; generating a multi-hop packet propagation tree based on the receive information related to the consumers and the at least one routing algorithm; receiving a data packet related to the network media services; and encoding the data packet with the multi-hop packet propagation tree.05-06-2010
20100110934OPTIMIZED CACHE CONSISTENCY ALGORITHM IN A POINT-TO-POINT INTERCONNECTED MULTIPLE PROCESSOR SYSTEM - A spanning tree is assigned to a processing node for each processing node in a point-to-point network that connects a plurality of processing nodes. The spanning tree uses the processing nodes as vertices and links of the network as edges. Each processing node includes input snoop ports that can be configured as either terminating or forwarding. According to the assigned spanning trees and the configuration of the input snoop ports, the network routes snoop messages efficiently and without conflicts.05-06-2010
20100039961OPTIMIZED FLUSH OPERATION IN RESPONSE TO TOPOLOGY CHANGES FOR SPANNING TREE PROTOCOLS - In one embodiment, in response to receiving a topology change notification at a network bridge having ports identified as either a network port or an edge port, address learning may be disabled on the network bridge. Once address learning is disabled, an association of all entries of a forwarding table of the network bridge having addresses previously forwarded on a particular network port of the network bridge may be changed to forward those addresses on all network ports of the network bridge (e.g., flooding the frames not addressed to edge ports on all network ports only). Subsequently, address learning may be enabled on the network bridge, thus repopulating the network port entries of the forwarding table in response to the topology change.02-18-2010
20120182904System and method for component substitution - Component substitution systems and methods are provided. An example of a method includes building a system tree having a plurality of nodes, each node in the system tree representing a characteristic of a component of a system under consideration. The method also includes comparing nodes of the system tree with nodes in other trees to identify common nodes. The method also includes generating a new tree for the system under consideration by replacing at least one of the common nodes in the system tree with at least one of the nodes in the other trees.07-19-2012
20130070649Virtual Switch Interconnect for Hybrid Enterprise Servers - Virtual switch interconnect for hybrid enterprise servers including a system for network configuration. The system includes a first processor coupled to a second processor via a network. The network includes a plurality of switches and links between the switches to offload processing from the first processor to the second processor. The switches include at least one virtual switch. The first processor is configured to perform a method that includes receiving network configuration data and switch state information for the network. It is detected that a first link and a second link provide two different paths between two of the switches. The first link is selected, at the computer, as a primary link based on contents of the network configuration data. The second link is deactivated in response to the selecting.03-21-2013
20130070648COMMUNICATIONS APPARATUS TRANSMITTING DATA ON CHANNELS ADAPTIVELY SWITCHABLE - In a communications apparatus, a communication controller transmits and receives signals on any of plural channels. A channel switching controller is responsive to channel switching information selectively defining plural reception-waiting periods using the channels to alter a channel to be used by the communication controller. A neighboring node channel controller exchanges channel switching information with other nodes to manage the channel switching information received from the other nodes. When transmitting transmission signals, a transmission controller refers to the channel switching information of the other nodes, and controls repetitive transmission of the transmission signals on the channel thus searched for.03-21-2013
20130058257METHOD FOR MANAGING E-TREE SERVICES IN MPLS NETWORKS - A method and device for managing E-tree services in an MPLS network having domains comprising network nodes and links, wherein the network is adapted to accommodate an E-tree structure formed by the network nodes for a specific E-tree service. The E-tree structure comprises a root point communicating with a number of leaf points, so that any network node of the E-tree structure is connected via its ports to links leading to a root point and/or a leaf point of said structure. The method comprises: marking ports of a specific node associated with links leading only to leaf points of the structure while marking differently ports of a specific node, associated with links leading to the root point; marking ports of a specific node connected to incoming or outgoing links of the same domain, and ensuring that traffic will not be returned thereby creating network loops.03-07-2013
20120224510SYSTEM AND METHOD FOR MANAGING TOPOLOGY CHANGES IN A NETWORK ENVIRONMENT - A method is provided in one example embodiment and includes receiving a spanning tree protocol topology change notification (STP TCN) in a network; removing topology data for a first plurality of gateways associated with a first network segment ID that is shared by a particular gateway that communicated the STP TCN; and communicating an edge TCN to a second plurality of gateways associated with a second network segment ID and for which topology data has not been removed based on the STP TCN.09-06-2012
20090232031RECEIVER-BASED CONSTRUCTION OF POINT-TO-MULTIPOINT TREES USING PATH COMPUTATION ELEMENTS IN A COMPUTER NETWORK - In one embodiment, a trigger to add a leaf node to a multicast group of a computer network is detected, and the leaf node may determine a root node of the multicast group to request a path between a tunnel tree and the leaf node of the multicast group. In response to the multicast group having an existing tree, a reply is received from the root node with a computed path to add the leaf node to the tree at a selected node of the tree. The leaf node may then be added to the multicast group tunnel tree over the computed path at the selected node.09-17-2009
20090232030OVERLAY LINK CALCULATION DEVICE, CALCULATION METHOD AND PROGRAM THEREOF - The overlay link calculation device which determines a link between nodes in an overlay network formed by layers of a higher order than a network layer, which includes a topology information obtaining unit which obtains topology information of the network layer and a link calculation which calculates an overlay link based on the obtained topology information.09-17-2009
20120113871SYSTEM AND METHOD FOR PROVIDING A LOOP FREE TOPOLOGY IN A NETWORK ENVIRONMENT - An example method is provided and includes executing an intermediate system to intermediate system (IS-IS) protocol for a first set of network links in a network. The method also includes executing a spanning tree protocol (STP) for a second set of network links, and generating a network topology that includes using a broadcast tree system identifier (ID) as a root bridge ID for the network. The method further includes communicating the root bridge ID to a neighboring network element. In more specific examples, an STP block is communicated to a redundant link, which connects a first switch and a second switch. The first and second switches can converge on the network topology using the broadcast tree system ID.05-10-2012
20120236759WIMAX CUSTOMER PREMISES EQUIPMENT AND METHOD FOR SETTING PARAMETER IDENTITIES THEREOF - A method for setting parameter identities of a worldwide interoperability for microwave access (WIMAX) customer premises equipments (CPE) which includes a plurality of parameter groups and a plurality of critical parameter groups correspondingly, each critical parameter group includes a plurality of critical parameter identities correlative to each other. The WIMAX CPE receives a setting package from a server and determines whether the setting package contains critical parameter identities of a critical parameter group. If the setting package contains critical parameter identities of the critical parameter group, the WIMAX CPE determines whether the setting package contains all critical parameter identities of the critical parameter group. If the setting package misses at least one critical parameter identities of the critical parameter group, the WIMAX CPE waits to receiving the missing critical parameter identities until receiving all critical parameter identities of the critical parameter group.09-20-2012
20130010648APPARATUS, SYSTEM AND METHOD FOR RELIABLE, FAST AND SCALABLE MULTICAST MESSAGE DELIVERY IN SERVICE OVERLAY NETWORKS - 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.01-10-2013
20110280159MULTI-CARD NETWORK DEVICE APPEARING AS SINGLE ENTITY IN SPANNING TREE NETWORK - Techniques are disclosed that may allow a network device comprising multiple line cards that are each executing a spanning tree algorithm to appear as a single spanning tree protocol entity to other network devices within a bridged local area network (LAN). In one example, a method includes determining, via a first processor on a first card of a network device, a first superior local port on the first card, transmitting, from the first card to a second card of the network device, a data unit specifying the determined first superior local port, and determining, via a second processor on the second card, a superior port on the network device among the first superior local port and a second plurality of ports on the second card based on a second plurality of BPDUs received via the second plurality of ports.11-17-2011
20130163474MULTI-PROTOCOL I/O INTERCONNECT ARCHITECTURE - Described are embodiments of methods, apparatuses, and systems for multi-protocol tunneling across a multi-protocol I/O interconnect of computer apparatus. A method for configuring a multi-protocol I/O interconnect may include identifying a plurality of switches of a switching fabric of a multi-protocol I/O interconnect, and configuring a path from a port of a first switch of the plurality of switches to a port of a second switch of the plurality of switches. Packets of a first protocol and packets of a second protocol, different from the first protocol, may be simultaneously routed over the path. Other embodiments may be described and claimed.06-27-2013
20090285128Using spanning tree protocol (STP) to enhance layer-2 network topology maps - Spanning Tree Protocol (STP) data is obtained via network switch (SNMP) queries to enhance identification of switch-to-switch links in Layer-2 mapping. In particular, by analyzing the STP data, ambiguity in determining switch uplink ports may be reduced. Specifically, the STP data can be used in conjunction with other topography data to provide Layer-2 connectivity for nodes on a network topology. Layer-2 address mapping tables are collected from a topology mapping, and STP data is collected, along with address translation tables (ARP) tables. Using this information, switches are identified using Layer-2 address tables. The STP data can be correlated by comparing data in switches, identifying switch ports directly connected to other switch ports, and eliminating direct switch-to-switch port connections from consideration for further Layer-2 node mappings.11-19-2009
20100290367 Method to Develop Hierarchical Ring Based Tree for Unicast and/or Multicast Traffic - The present invention provides a novel method for hierarchy of preplanned protected path for both node and link failure in the realm of Carrier Ethernet Technology. In the event of failure in a hierarchy, the traffic is switched from work (primary) path to protected (secondary) path. If such path does not exist within a given hierarchy then traffic is routed through multiple hierarchies until SLA is met YES or no path exists. Hierarchies make the network fault resilient.11-18-2010
20120008530Network Node for a Communication Network - A network node for a communication network comprising a first subnetwork and a second subnetwork connected to the first subnetwork, wherein the first subnetwork uses a spanning tree protocol and the second subnetwork uses a second protocol differing from the protocol of the first subnetwork, and the network node is configured as an element for the second subnetwork and is configured for communication within the second subnetwork. In addition, the network node configured by a spanning tree functionality as a spanning tree master node for checking and controlling the second subnetwork in such a way that the second subnetwork is handled or is able to be handled by the spanning tree protocol of the first subnetwork as a virtual network node.01-12-2012
20110299427METHOD AND APPARATUS FOR DISTRIBUTED MEDIA CONFERENCING - A capability for determining a media distribution tree for use in distributing content to a plurality of user devices is provided. Using the distributed content distribution capability, one or more of the user devices to which the content is to be distributed functions as a relay point that performs content replication and distribution functions for one or more other user devices. The content is distributed using a media distribution tree into which the user devices are arranged. A method for determining a media distribution tree for use in distributing content to a plurality of user devices includes grouping the user devices into a plurality of regions, determining, for each of the regions, a regional tree to be formed by the user devices grouped into the region, and connecting the regional trees to determine thereby the media distribution tree. By utilizing user devices as relay points within the media distribution tree, usage of network resources, such as ports at media servers, is significantly reduced.12-08-2011
20110299426Starting a Wireless Communications Network using wireless signal - Embodiments herein provide a method and system for switching a wireless device from low power consumption dormant mode to active mode in a wireless communication network (WCN) using a switch command frame (SCF). The SCF is transmitted repeatedly for continuous configurable period of time, long enough to provide multiple opportunities to the dormant nodes to listen to the same and change its mode appropriately. This invention improves the power efficiency of the node when it is not associated with any network.12-08-2011
20110134803CONFIGURING NETWORKS INCLUDING SPANNING TREES - A method may include receiving a reconfiguration to a first Virtual Local Area Network (VLAN)/spanning tree table, where the first VLAN/spanning tree table has a first identifier and is associated with a region of a network; updating the first VLAN/spanning tree table to generate a second VLAN/spanning tree table based on the reconfiguration; determining a second identifier of the second VLAN/spanning tree table; and generating a list of identifiers associated with the region of the network, the list including the first identifier and the second identifier.06-09-2011
20110134802Determining A Routing Tree For Networks With Different Routing Protocols - According to one embodiment, a routing tree may be determined by facilitating communication of a first network and a second network. The first network comprises first switches and uses a first routing protocol, and the second network comprises second switches and uses a second routing protocol. The intersection of the first and second switches comprises gateway switches. A gateway switch enables creation of a second routing tree of the second routing protocol. The second routing tree has virtual links and a virtual root switch representing a first root switch of the first network. The second switches generate minimum link cost tunnels using information from the second routing protocol. A first routing tree of the first routing protocol is extended with the tunnels to merge the first routing tree and the second routing tree.06-09-2011
20110292838PROVIDER LINK STATE BRIDGING (PLSB) COMPUTATION METHOD - A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.12-01-2011
20110292837COMMUNICATION MANAGEMENT APPARATUS, COMMUNICATION NODE, AND COMMUNICATION SYSTEM, AND DATA COMMUNICATION METHOD - The communication management apparatus includes a network-presence-check processing unit that performs network presence check processing for generating network presence information, a token-circulation-order determining unit that determines token circulation order using the network presence information, a setup processing unit that notifies each of communication nodes in the network of token circulation destination information, a token-frame processing unit that, after transmission of a data frame by a data-frame-communication processing unit, transmits, based on the token circulation order, a token frame including information concerning a transmission right acquiring apparatus that acquires a transmission right next and determines whether the transmission right acquiring apparatus of the transmission right acquiring apparatus information of the received token frame is the own apparatus, and the data-frame-communication processing unit that performs transmission and reception processing for a data frame for acquiring the transmission right.12-01-2011
20090161583CREATING MULTIPOINT-TO-MULTIPOINT MPLS TREES IN AN INTER-DOMAIN ENVIRONMENT - In one embodiment, a method is provided. A first root node of a first Multipoint-to-Multipoint (MP2MP) Multi-Protocol Label Switching (MPLS) tree, advertises to a second root node of a second MP2MP MPLS tree a first label for the second root node to use to send multicast traffic to the first MP2MP MPLS tree. The first root node receives a second label from the second root node for the first root node to use to send multicast traffic to the second MP2MP MPLS tree. Communications are carried out between the first MP2MP MPLS tree and the second MP2MP MPLS tree using the first label and the second label. In another embodiment, apparatus are also provided.06-25-2009
20090190504Multiple I-service registration protocol (MIRP) - In one embodiment, a method associated with a multiple I-service registration protocol (MIRP) includes receiving into an 802.1ah I-component an MVRP TCN from an 802.1ad component. The TCN may be received, for example, from an 802.1ad bridge. The TCN may identify an affected service using an S-VID. Therefore, the example method may include identifying the S-VID specified by the TCN. The method may also include identifying I-SIDs related to the S-VID. The I-SIDs may be identified by consulting an S-VID to I-SID translation table associated with the 802.1ah I-component. The method may also include providing an 802.1ah MIRP PDU to another 802.1ah component. The MIRP PDU may be based on the MVRP TCN and on the I-SID.07-30-2009
20090141659Method and Apparatus for Concurrent Topology Discovery - A method, system and computer-usable medium are disclosed for discovering the topology of a network by using multiple discovery agents operating in parallel. A NodeList containing information about known nodes in a target network is received. The number (‘K’) of discovery agents to be used is determined, where 1<=K<=TotalNumberOfNodes). The nodes are partitioned into node groups, each of which has a group identifier respectively assigning it to a discovery agent ‘M’ where 1<=M<=K. A GraphList is created to hold information about known and discovered nodes. Each entry in the NodeList list is processed by its assigned discovery agent ‘M’, which sends probe messages to the target node to determine the node identifiers of discovered neighboring nodes. If the discovered nodes are not listed in the NodeList, then they are assigned to a node group for processing. If the connections between the target and the discovered neighboring node nodes are not listed in the GraphList, then they are added. Once all node and connection information is collected by the ‘K’ node discovery agents ‘M’ and listed in the GraphList, a network topology is generated.06-04-2009
20080212498Systems for distributing data over a computer network and methods for arranging nodes for distribution of data over a computer network - Various embodiments of the present invention relate to a system for distributing data (e.g., content data) over a computer network and a method of arranging receiver nodes in a computer network such that the capacity of a server is effectively increased (e.g., the capacity of a server may be effectively multiplied many times over; the capacity of the server may be effectively increased exponentially). In one embodiment the present invention may take advantage of the excess capacity many receiver nodes possess, and may use such receiver nodes as repeaters. The distribution system may include node(s) having database(s) which indicate ancestor(s) and/or descendant(s) of the node so that reconfiguration of the distribution network may be accomplished without burdening the system's primary server. An embodiment of the present invention may include 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 the network. In one example (which example is intended to be illustrative and not restrictive), the process may include the steps of providing a new user node (or connection requesting user node) with a connection address list of nodes within the network, having the new user node (or connection requesting user node) go to (or attempt to go to) the node at the top of the connection address list, determine whether that node is still part of the distribution network, and connect thereto if it is, and if it is not, to go to (or attempt to go to) the next node on the connection address list. In another example (which example is intended to be illustrative and not restrictive), when a user node departs from the distribution network, a propagation signal may be transmitted to the nodes below it in the network, causing them to move up in the network in a predetermined order. In another example (which example is intended to be illustrative and not restrictive), the present invention may provide a decentralized approach which provides, to each new user node (or connection requesting user node) a path back to the root server.09-04-2008
20100118740SYSTEM AND METHOD FOR IDENTIFYING NON-MULTIPLE SPANNING TREE PROTOCOL CONTROL PLANES - A system, method, and node for identifying non-Multiple Spanning Tree Protocol control planes. The method includes the steps of identifying a specific non-Multiple Spanning Tree Protocol control plane instance, associating a General Control Plane Identification, GCPID, with the specific control plane instance, wherein the GCPID binds a Virtual Local Area Identifier, VID, with the specific control plane, and advertising the GCPID to identify the specific control plane instance.05-13-2010
20100118739Method and Apparatus for the Determination of Multiple Spanning Trees - A method of, and apparatus for, determining multiple spanning trees over a computer network, each spanning tree providing a particular arrangement of communication links between nodes of the computer network, and the method comprising increasing a cost associated with using a particular communications link if said communications link is included in a previously determined spanning tree.05-13-2010
20100085899SYSTEM AND METHOD FOR GENERATING SYMMETRICAL SPANNING TREES - In one embodiment, a network device receives on a first port a first spanning tree protocol (STP) control message including a first path-tracking field corresponding to a given spanning tree instance in a network. The first path-tracking field includes a value based on one or more other network devices that have propagated the first STP control message. The network device receives on a second port a second STP control message including a second path-tracking field corresponding to the given spanning tree instance. The second path-tracking field includes a value based on one or more other network devices that have propagated the second STP control message. The network device utilizes the values from the first path-tracking field and the second path-tracking field to select a root port for the given spanning tree instance.04-08-2010
20090168671Interworking an Ethernet Ring Network with a Spanning Tree Controlled Ethernet Network - To enable an Ethernet ring to be dual homed into a spanning tree protocol controlled Ethernet network, spanning tree control packets (Bridged Protocol Data Units or BPDUs) are transported as data frames over the Ethernet ring. This allows the Ethernet ring to appear as a single link to the spanning tree protocol so that the spanning tree can extend over the link. However, since the spanning tree does not have visibility as to the internal structure of the ring, the spanning tree cannot block links on the Ethernet ring network. Conversely, BPDUs from the Ethernet ring are not transmitted into the Ethernet domain that is implementing the spanning tree, so that the spanning tree is not affected by the control mechanism in place on the Ethernet ring network.07-02-2009
20090141658Network processing - A method and means for processing information across a network is provided, the network comprising a plurality of nodes. In one embodiment, the invention includes algorithm means for addressing the problem of efficient information distribution between nodes in the network. This invention addresses the problem by generating probabilistic models at the nodes in the network and by selectively distributing information between the nodes based on these models and by using a predetermined metric function in such a way as to reduce information differences between the nodes.06-04-2009
20090290514Sounding Reference Signal Cell Specific Sub-Frame Configuration - A method of wireless communication including a plurality of fixed basestations and a plurality of mobile user equipment with each basestation transmitting to any user equipment within a corresponding cell a sounding reference signal sub-frame configuration indicating sub-frames when sounding is permitted. Each user equipment recognizes the sounding reference signal sub-frame configuration and sounds only at permitted sub-frames. Differing cells may have differing sounding reference signal sub-frame configurations. There are numerous manners to encode the transmitted information.11-26-2009
20100110935Efficient Content Authentication In Peer-To-Peer Networks - A method and distributed network are provided. The method includes: providing an abstract tree structure having a root node, a plurality of tree nodes, and a plurality of leaf nodes, wherein each leaf node corresponds to at least a portion of data (box 05-06-2010
20080212497Method and system for span-based connection aggregation - The present invention provides a method and system for the restoration of an optical mesh network subsequent to the simultaneous failing of a large number of network connections due to a transmission failure. The system and method increase the restoration speed of a large number of failed network connections through connection aggregation. The system and method provide that connection aggregation is the logical bundling of a plurality of network connections across a network span. By enabling the bundling of these individual network connections transported over a particular span or spans, a network operator manages the bundle as if it were one network connection. The method and system provide that other network links support these bundled connections when the network segment that a managed bundle is traversing fails.09-04-2008
20100103846PROVIDER LINK STATE BRIDGING (PLSB) COMPUTATION METHOD - A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.04-29-2010
20120294194METHOD AND APPARATUS FOR PRESERVING EXTENSIONS IN MULTI-VENDOR TRILL NETWORKS - In one embodiment, a method includes identifying a current topology associated with a virtual local area network (VLAN) and determining whether the current topology of the VLAN is to be moved to a base topology associated with a Transparent Interconnection of Lots of Links (TRILL) protocol. The method also includes moving the current topology of the VLAN to the base topology if it is determined that the current topology of the VLAN is to be moved to the base topology.11-22-2012
20080239992METHODS AND APPARATUS FOR PERFORMING CHANNEL TREE OPERATIONS - Methods and apparatus for performing channel tree operations in a communication system are disclosed that order a channel tree to effect improved computation speed for channel tree operations for scheduling channel resources in the communication system. The disclosed methods include mapping each of one or more node identifiers of real nodes of a channel tree to corresponding virtual node identifiers based on a prescribed ordering scheme. After mapping, the methods include performing one or more operations on one or more of the real nodes of the channel tree using the virtual node identifiers. Corresponding apparatus configured to execute the disclosed methods are also disclosed.10-02-2008
20110199941Rate-Varying Multicast Transmission for Clock Distribution in Packet Networks - In at least some embodiments, the disclosure includes an apparatus a root node in a packet based network that multicasts a plurality of packets. The apparatus also includes an intermediary node coupled to the root node and a plurality of leaf nodes coupled to the intermediary node. The root node, the intermediary node, and the plurality of leaf nodes are arranged in a tree topology. The packets are received at the intermediary node from the root node at a data rate equal to the data rate of the leaf node having the maximum data rate. The packets are multicast from the intermediary node to each of the plurality of leaf nodes at a plurality of different data rates such that each particular one of the plurality of leaf nodes receives the packets at a data rate corresponding to the data rate for the particular one of the plurality of leaf nodes.08-18-2011
20080273474Network system, information processor, and information processing program recording medium - A content distribution system in which content is distributed from a broadcasting station via a plurality of nodes connected in a hierarchical tree structure, including: a base tree obtained by connecting the plurality of nodes in a hierarchical tree structure using the broadcasting station as an apex; an extension tree obtained by connecting the plurality of other nodes in a hierarchical tree structure using, as an apex, a first root node as any of the nodes included in the base tree; and a topology controller for controlling a topology of each of the nodes belonging to the base tree.11-06-2008
20110267982System And Method For Determining An Optimal Backbone For Robotic Relay Networks - A system and method for determining an optimal backbone for a robotic relay network are provided. A robotic relay network comprising a plurality of nodes including a base station node, one or more mobile relay nodes, and one or more user nodes is provided. A signal strength value for each pair-wise communication link between each of the nodes is identified. A weight function is applied to each communication link value to determine a communication link weight. An optimal backbone tree is determined from the communication link weights.11-03-2011
20110267983System And Method For Multiple Spanning Tree Protocol Domains In A Virtual Local Area Network - A system and method that modifies the behavior of the IEEE 802.1D STP standard to thereby decouple the one data domain from the one control domain involves managing multiple spanning tree protocol (STP) instances in a virtual local area network (VLAN). The method includes the step of assigning a unique set of ports within the VLAN to each of the multiple STP instances. Then, each of the multiple STP instances are managed to keep each of the multiple STP instances separate. Finally, when a topology change is detected in one of the multiple STP instances, entries that have been learned on the unique set of ports assigned to the STP protocol instance where the topology change is detected are fast-aged or transitioned from one state to another.11-03-2011
20090252065MULTI-HOP NETWORK TOPOLOGY SYSTEM AND METHOD - A wireless communication system and method for a network having a tree topology. An initial path from a base station to an end relay node is selected. The path selection includes an active communication path and a redundant communication path. The path selection is based on at least one policy factor. The at least one policy factor is monitored and the path is updated based on a change to the monitored at least one policy factor.10-08-2009
20090257365METHOD OF DISTRIBUTING FILES OVER NETWORK - The present invention discloses a method of distributing files over a network, which can attain a proper balance of transfer rates of active spanning trees used between a transmitting node and a receiving node and minimize the time taken for transferring a large file in a P2P (Peer-to-Peer) environment by forming an optimal set of distribution trees with reference to the link costs between the transmitting node and the receiving node and distributing chunk files through the optimal set of distribution trees. The method comprises the steps of: forming a set of spanning trees between a transmitting node and a receiving node and forming a minimum cost tree group by the sum of the link costs of links constituting each of the spanning trees; adjusting the transfer rate of each spanning tree belonging to the minimum cost tree group in accordance with the link cost of each spanning tree belonging to the minimum cost tree group; and transferring chunk files through the spanning trees whose transfer rate is adjusted.10-15-2009
20100265849SPANNING TREE ROOT SELECTION IN A HIERARCHICAL NETWORK - Communication apparatus includes a hierarchical network of switches, which includes at least a first plurality of spine switches, interconnected by a control channel, and a second plurality of edge switches having internal ports coupled to communicate via respective links with the spine switches and external ports for connecting to client devices. The spine switches are configured to detect, via the control channel, a partitioning of the hierarchical network into first and second partitions, including respective first and second numbers of the spine switches, wherein the first number is greater than the second number, and to assign respective priorities to the spine switches responsively to the first and second numbers so as to cause the larger of the partitions to be elected as a spanning tree root.10-21-2010
20100165886Self-Healing Communication Trees - Systems, methods, and apparatus, including computer program products, implementing protocols for building and maintaining multiple trees in a network and using the trees to route messages through the network. A node in the network initiates the building of a tree having itself as the root, and nodes in the network generally maintain representations of multiple trees, each tree having a distinct node as its root. A node can use the trees to route messages to the root nodes by sending the messages through root-ward ports for the respective trees.07-01-2010
20100165884Ethernet Spanning Tree Provision - A method and apparatus for providing a Spanning Tree to nodes on an Ethernet network. A Spanning Tree topology is calculated, and a Resource Reservation Protocol Traffic Extension path message is generated. The path message contains at least a part of the Spanning Tree topology. The path message is sent to bridges on the Ethernet network. The bridge nodes that receive the path message configure their port states depending on the information contained in the path message, and may also configure port Virtual Local Area Network membership.07-01-2010
20100189015Planning Routes and Allocating Identifiers to Routes in a Managed Frame-Forwarding Network - 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.07-29-2010
20100260071ROUTING METHOD AND ROUTING PATH RECOVERY MECHANISM IN WIRELESS SENSOR NETWORK ENVIRONMENT - The present invention discloses an asymmetric routing method and routing path recovery mechanism. The wireless sensor network environment includes at least a management unit, at least a gateway, and mobile nodes. When joining, each mobile node obtains an unique ID code and, additionally, a depth as the gradient to the management unit. Accordingly, a mobile node sends an uplink packet via a nearby node with lower depth to the management unit; while the management unit transmits a downlink packet to a mobile node by utilizing the source route method. When the parent node of a mobile node is damaged or moves to another position or said mobile node with its sub-tree descendants changes their position together, the uplink routing path is recovered via selecting a nearby node of the sub-tree as relay node and the downlink routing path is recovered via sending a control message to the management unit.10-14-2010
20090116413System and method for automatic topology determination in a hierarchical-temporal network - A system and method for automatically analyzing data streams in a hierarchical and temporal network to identify node positions and the network topology in order to generate a hierarchical model of the temporal or spatial data. The system and method receives data streams, identifies a correlation between the data streams, partitions/clusters the data streams based upon the identified correlation and forms a current level of a hierarchical temporal network by having each cluster of data streams be an input to a hierarchical temporal network node. After training the nodes, each of the nodes creates a new data stream and these data streams are correlated and partitioned/clustered and are input into a node at a next level. The process can repeat until a desired portion of the network topology is determined.05-07-2009
20090116412Tree-type broadcast system, reconnection process method, node device, node process program, server device, and server process program - A node device in a tree-type broadcast system having hierarchy levels of node devices while locating a broadcast device at its top, whereby information is sequentially transferred from a higher hierarchy level to a lower hierarchy level, the node device including:05-07-2009
20100214961FAST AND AUTOMATIC SELF-FORMING MESHING TOPOLOGY TO INTEGRATE WITH WIRED NETWORKS - The present invention applies management frame defined in IEEE 802.11 standard to a wireless distribution system (WDS) mode by adding an information element (IE) into the management frame, which enables any access point (AP) in WDS to maintain IE based on its own setting and state, then send IE via the management frame for providing state of the AP under WDS mode, determine whether a physical link (i.e., a wireless link between APs) should be established therewith based on received IE, and maintain the established physical link through the wireless management frame in a real time manner. Thus, the existence and necessity of the physical link between different APs in WDS can be determined correctly.08-26-2010
20090116411Mesh Tree Formation in Wireless Networks - A mesh tree formation system. In particular implementations, a method includes responsive to a selection of a channel potentially bearing a higher priority use, entering a silent state and initiating a channel scan of the selected channel for a period of time. The method also includes, responsive to receipt of an enabling signal, entering a limited transmission state that enables transmission of wireless frames on the selected channel. The method also includes, responsive to termination of the period of time of the channel scan wherein no higher priority use is detected, entering a full transmission state comprising transmission of enabling signals corresponding to the selected channel.05-07-2009
20100226285NETWORK DESIGN METHOD - A network design method for Ethernet-type networks exhibiting capacities sufficient for operation during normal periods as well those as periods when a single node or link has failed.09-09-2010
20090252064SEAMLESS TREE CREATION AND MOVEMENT - In an example embodiment, a beacon is sent on all available interfaces of a device comprising data indicating the operating parameters of all interfaces of the device. A beacon containing data about the configuration of a first interface and a second interface is sent on both the first interface and the second interface. The beacon may suitably comprise data indicating the protocol, channel, and spanning trees for the interface. If communication on the primary interface becomes unavailable, the data in the beacons can be used to facilitate switching communication to the secondary interface.10-08-2009
20090073897DETECTION OF DUPLICATE PACKETS - A packet is received from a network. The packet includes a field. The content of the field is compared to each element of a list. If the content of the field fails to match any element in the list, the packet is accepted and the content of the field is added to the list as an additional element of the list.03-19-2009
20090185509Network Configuration - A method of configuring a network comprising: creating, in the configuration system core, an overall configuration tree that describes all services available to the subscribers; and the location of each individual subscriber in the network and the particular services to which it subscribes; providing each cell with a local configuration tree comprising that part of the overall configuration tree that describes all services available to the subscribers connected to network elements in that cell; and the location of each individual subscriber in that cell and the particular services to which it subscribes; and configuring each network element according to the local configuration tree in its respective cell.07-23-2009
20110128892AVOIDING HIGH-SPEED NETWORK PARTITIONS IN FAVOR OF LOW-SPEED LINKS - In one embodiment, each network interface of a network device in a computer network may be classified as either a low-speed interface (e.g., wireless) or a high-speed interface (e.g., wired). Illustratively, then, low-speed interfaces may be configured (identified) as external interfaces to external links and high-speed interfaces may be configured (identified) as internal interfaces to internal links. By executing a multiple spanning tree (MST) protocol at the network device with other network devices in the computer network, network devices interconnected with internal links are in a same MST region and internal links within an MST region are preferred over external links between MST regions.06-02-2011
20100309820Preventing loss of network traffic due to inconsistent configurations within the network - In one embodiment, a method includes receiving at a processor at a node, notification of an error in a VLAN to topology mapping at the node, receiving a multi-destination packet from the VLAN in the VLAN to topology mapping, the multi-destination packet including a tree identifier associated with one of the topologies, and transmitting the multi-destination packet to all forwarding ports at the node in an unpruned tree corresponding to the tree identifier contained in the multi-destination packet. An apparatus is also disclosed.12-09-2010
20100309821METHOD AND NETWORK FOR COMBINED PROTECTION OF ETHERNET TRAFFIC - Technique for protecting different telecommunication services in an Ethernet network using two different loop avoiding traffic protection protocols, by concurrently utilizing the protocols in one and the same network on different loop free logical topologies of the network. The telecommunication services are preliminarily distributed in such a manner, that the services which can be better protected by one of the two protocols and the services better protectable by the other protocol, are carried via the different topologies.12-09-2010
20110026437Disseminating Link State Information to Nodes of a Network - Techniques are generally disclosed for disseminating link state information to one or more nodes of a network of nodes, the network of nodes interconnected via a plurality of communication channels.02-03-2011
20090034434Interior-Node-Disjoint Multi-Tree Topology Formation - A novel decentralized protocol for constructing a tree-based P2P live video streaming network with the Interior-Node-Disjoint (IND) multi-tree structure with the special Link-Level-Homogeneous property. The IND multi-tree structure recycles the wasted uploading capacities of leaf nodes in the tree-based P2P networks. The IND multi-tree structure also enhances the robustness of the tree-based P2P networks. Moreover, the special Link-Level-Homogeneous property eliminates the bottlenecks in the video delivery paths by ensuring that each downloading link in the network has identical bandwidth reserved. This special designed architecture greatly improves the downloading performance.02-05-2009
20090034435IP TELEPHONY NETWORK USING A CONFIGURATION MAP FOR ORGANIZING SITES IN A TREE-LIKE HIERARCHY - A system and method for managing an IP telephony network that uses a configuration map for organizing sites in a tree-like hierarchy. The system is capable of managing the addition, removal and movement of IP telephony elements within an IP telephony network and locating services and IP telephony elements within the IP telephony network in an efficient manner.02-05-2009
20110080855Method for Building Scalable Ethernet Switch Network and Huge Ethernet Switch - A method for building scalable Ethernet switch network and huge Ethernet switch is provided. The switch network is composed of a plurality of tiers of Ethernet switches forming a fat-tree topology. The bottommost tier connects to the end-stations. All switches except those in the top tier are typical IEEE802.1Q switches configured purposefully such that all packets from the end-stations are forwarded upstream to the top tier and are tagged with ingress port information. The top-tier switches possess a novel learning and forwarding capability such that a received packet is forwarded downstream to the destination end-station through one of a plurality of possible paths selected by a load balancing algorithm. Said method can also be applied to build an Ethernet switch of a large number of ports.04-07-2011
20090028070Node device, information process method, and recording medium recording node device program - Node device in a network formed by a plural node devices mutually connected to carry out giving and receiving of information, the respective node devices having inherent node identification information and being hierarchically classified into a tree diagram, including: 01-29-2009
20090028069METHOD AND SYSTEM FOR NETWORK DATA TRANSMITTING - A method and system for network data transmitting in a communication system includes transmitting a data from at least one transmission node to at least one receiving node of a transmission-receiving group among the plurality of communication nodes by utilizing a node ID, the node ID of communication node in the group is being assigned by a N-carry operation of a determined number N.01-29-2009
20120201170Backhaul Optimization For Traffic Aggregation - An apparatus and method for producing a traffic aggregation map for a telecommunications network where the network has at least one aggregation node and a plurality of access nodes. A computing device receives information regarding the identity of each node in the network and determines cost information relating to pairs of the nodes. The cost information may be calculated by the computing device or received as input, or a combination of the two. Cost information is also assigned for each pair consisting of an aggregation node and a super node, which is not one of the aggregation or access nodes. To produce the map, the computing device calculates a minimum spanning tree interconnecting all of the nodes including the super node. Disregarding in most cases the connections terminating at the super node, the remaining connections are displayed on a display device, preferably superimposed on a geographic map.08-09-2012
20110149807TECHNIQUES TO PROVIDE PHYSICAL RESOURCE ALLOCATION USING A TREE-BASED STRUCTURE AND COMMUNICATE A CHANNEL QUALITY INDICATOR - In a wireless network, simultaneous support of distributed and contiguous sub-carrier allocation may be accomplished in the same sub-frame or time zone. Techniques are described herein that can be used to allocate distributed and/or contiguous basic (physical) resource blocks to users by specifying a codebook index and parent node. Techniques are described herein that can be used to flexibly set a number of sub-channels over which a subscriber station indicates a channel quality indicator to a base station. Sub-channels may be represented as nodes and may be grouped to include a parent node and child nodes. By specifying a code book to use and a parent node, the channel quality indicator of the parent and children nodes can be indicated.06-23-2011
20110026438METHOD OF GENERATING SPANNING TREES - A method for generating spanning trees (ST02-03-2011
20100260072System And Method For Multiple Spanning Tree Protocol Domains In A Virtual Local Area Network - A system and method that modifies the behavior of the IEEE 802.1D STP standard to thereby decouple the one data domain from the one control domain involves managing multiple spanning tree protocol (STP) instances in a virtual local area network (VLAN). The method includes the step of assigning a unique set of ports within the VLAN to each of the multiple STP instances. Then, each of the multiple STP instances are managed to keep each of the multiple STP instances separate. Finally, when a topology change is detected in one of the multiple STP instances, entries that have been learned on the unique set of ports assigned to the STP protocol instance where the topology change is detected are fast-aged or transitioned from one state to another.10-14-2010
20080247335AD-HOC NETWORK ROUTING PROTOCOL INCLUDING THE USE OF FORWARD AND REVERSE MULTI-POINT RELAY (MPR) SPANNING TREE ROUTES - A method of operating an ad-hoc network having a plurality of wireless nodes includes operating the wireless nodes using a routing protocol, such as OLSR, so that the wireless nodes store forward multi-point relay (MPR) spanning tree routes and reverse MPR spanning tree routes. A first wireless node communicates with a second wireless node using a reverse MPR spanning tree route. The method further includes determining whether the reverse MPR spanning tree route has become unavailable between the first and second wireless nodes and that no other reverse MPR spanning tree route has yet become available, and, if so, using at least portions of a forward MPR spanning tree route for communication between the first and second wireless nodes. The symmetric OLSR approach may be effective in avoiding unnecessary route drops caused by the interaction between distribution-of-topology-change-information conditions and exclusively routing via the destination node's reverse-MPR-spanning tree.10-09-2008
20090190503EFFICIENT END-TO-END PROPOSAL/AGREEMENT MESSAGING FOR SPANNING TREE CONVERGENCE IN A COMPUTER NETWORK - In one embodiment, a bridge may receive a first convergence proposal on a root port from an upstream adjacent bridge of a computer network, and in response, may transmit a second convergence proposal downstream on each non-edge designated port of the bridge without syncing the non-edge designated ports. The bridge may then return a convergence agreement to the adjacent bridge in response to the non-edge designated ports having received a returned convergence agreement (or in response to having only edge designated ports). Also, according to embodiments, the adjacent bridge blocks a link to the root port until the convergence proposal(s) and agreement(s) travel end-to-end.07-30-2009
20080304428Method for Establishing a Loop-Free Tree Structure in a Data Transmission Network and Associated Network Element - The invention relates to, among other things, a method during which a network element (12-11-2008
20090022070Method and apparatus for quality of service (QoS) planning for an ethernet based network - A method for determining required routes through an Ether based network associated with VLANs by determining a set of spanning trees. The set of spanning trees is determined to provide a number of routes for consideration. Each spanning tree comprising a plurality of links, sorts the VLANs into an order based on one or more VLAN criteria for the network topology, and maps the sorted VLANs onto the set of spanning trees in an order to optimise one or more characteristics relating to the combination of spanning tree and VLAN to determine an optimised VLAN tree mapping for each set of spanning trees for each route. A best primary tree for each route is selected. Possible failures for each link in the best primary tree for each route are analyzed to derive for a backup tree optimised to determine one or more best backup trees in the event of a possible failure.01-22-2009
20090022069Preventing loops in networks operating different protocols to provide loop-free topology - A method and system for preventing loops in a network including network devices operating different protocols for providing loop-free topology are disclosed. In one embodiment, a method includes receiving link state information at a network device operating a first protocol and in communication with a network device operating a second protocol, creating at least one tunnel to one or more other network devices operating the first protocol and in communication with a network device operating the second protocol, receiving a proposal, blocking designated boundary ports in communication with network devices operating the second protocol, and transmitting an agreement.01-22-2009
20100329155method and apparatus for realizing source routing in the blocked cross network - The present invention discloses a method for realizing source routing in a blocking cross network. Link state advertisement information diffused in the network carries cross constraint characteristic information, and a call initiating node checks a path tree and gets a service path according to the cross constraint characteristic information included in the link state advertisement information in the network; the cross constraint characteristic information includes physical transmission link layer constraint information of a link in a node, which is called link switching constraint information, and constraint information of each wavelength channel in the link, which is called wavelength constraint characteristic information. The present invention also discloses an apparatus for realizing source routing in a blocking cross network. When a control connection request is initiated, the present invention can calculate a complete end-to-end path and a proposed wavelength of each link according to the link switching constraint information and the wavelength constraint characteristic information, and multi-level service scheduling is supported.12-30-2010
20080219187METHOD FOR DATA PROCESSING IN BRIDGED NETWORK, BRIDGE AND BRIDGED NETWORK - A method for data processing in a bridged network includes: spanning tree is generated in the bridged network, and a unicast forwarding table of the spanning tree is established by using a register packet by the bridge; when a data packet out of the bridge network arriving the bridge network, from an entrance bridge arrived by the data packet, the data packet is transferred basing on the unicast forwarding table along the spanning tree and the data packed is transmitted through an outer port of an exit bridge in the exit bridge. According to the method and system for data processing in the bridged network, the unicast forwarding table is established by the control protocol, original processing of address learning can be closed. Therefore, software may be upgraded easily and the burden of hardware processing is reduced.09-11-2008
20110096698SYSTEM AND METHOD FOR ROUTING SIGNALING MESSAGES IN A COMMUNICATION NETWORK - A system and method for routing signaling messages in a communication network includes an improved route engine having a plurality of dynamically loadable route trees encoded as standardized data files each provisioned for use according to a corresponding network service and having one or more nodes each encoded with logic to independently carry out processing for the service and return a corresponding route response.04-28-2011
20110080854Method And System For Controlled Tree Management - There is disclosed a method and apparatus for facilitating a network, such as an Ethernet LAN, for efficient forwarding of data traffic by collecting neighbor information, generating and distributing link state advertisements, populating a topology database for the network, and calculating trees for each bridge serving as a root bridge. In a preferred embodiment the method and system also prepare one or more backup topologies, and store them for use if they are needed due to a failure condition detected in the network. In a particularly preferred embodiment, probabilities are assigned to various potential failure conditions, and the probability values are used to decide which backup topologies to calculate, store, or use.04-07-2011
20100165885WIRELESS COMMUNICATION NETWORK AND ROUTING METHOD - A wireless communication network, including a destination node, a first node transmitting a first routing message, wherein the first node has a first routing table including a first entry for the destination node, and the first entry includes a first list field for child node(s). The network further includes a second node generating and transmitting a second routing message according to the first routing message, wherein the second routing message includes a second parent node field, and the second parent node field is marked as the first node that transmitted the first routing message. The first node further receives the second routing message and stores a first mark in the first list field for child node(s) of the first entry after determining that the second parent node field of the second routing message is marked as the first node, and the first mark denotes the second node.07-01-2010
20110261724SHARED VIRTUAL DEVICE PORTS - In one embodiment, a solution is provided wherein multiple virtual devices may be configured on the same physical port of a network device. For example, a first virtual device and a second virtual device may be configured to use the same physical port. A single internal spanning tree instance may be configured for both the first virtual device and the second virtual device.10-27-2011
20090175204GATEWAY SELECTION METHOD FOR WIRELESS MESH NETWORK - A gateway selection method for a wireless mesh network is provided for selecting an optimal gateway includes building a spanning routing tree to a given network. Reference factors of routers are calculated regarding the network to total network capacity in association with the spanning routing tree. A router is selected which has the greatest reference factor as being an optimal gateway of the network.07-09-2009
20090175202Method for Augmenting a Network - To augment a network by adding a network element, network services affected by the augmentation, and a temporary route for transmitting network services determined as affected by the augmentation via the temporary route are determined. A new route through the augmented network, and a spanning tree corresponding to the new route are determined. Memberships of a virtual local area network (VLAN) in ports of network elements of the temporary route are configured. Cost factors at these ports are changed such as to direct the network services determined as affected by the augmentation through the temporary route. A VLAN membership is calculated for each port in the new route for a network service that passes through the augmented network. The new route through the augmented network is re-calculated based on the spanning tree, and VLAN memberships in the ports of network elements which are no longer needed are deleted.07-09-2009
20110216673TOPOLOGY DETECTION METHOD AND TOPOLOGY DETECTION APPARATUS - A topology detection apparatus includes, in a network having a tree-type topology: a route overlap judgment part that judges an existence or non-existence of an overlap between: a first route between terminals whose connection position are known; and a second route between a terminal whose connection position is known and a terminal whose connection position is unknown; and a topology detection part which determines the network topology based on the existence or non-existence of the first route and the second route.09-08-2011
20110216672TECHNICAL ENHANCEMENTS TO STP (IEEE 802.1D) IMPLEMENTATION - An embodiment includes a method of minimizing the delay in convergence time for a complex STP topology following a topology change in the network system in the spanning tree protocol (STP) standard, including:09-08-2011
20110019591SYSTEMS FOR DISTRIBUTING DATA OVER A COMPUTER NETWORK AND METHODS FOR ARRANGING NODES FOR DISTRIBUTION OF DATA OVER A COMPUTER NETWORK - Various embodiments of the present invention relate to a system for distributing data (e.g., content data) over a computer network and a method of arranging receiver nodes in a computer network such that the capacity of a server is effectively increased (e.g., the capacity of a server may be effectively multiplied many times over; the capacity of the server may be effectively increased exponentially). In one embodiment the present invention may take advantage of the excess capacity many receiver nodes possess, and may use such receiver nodes as repeaters. The distribution system may include node(s) having database(s) which indicate ancestor(s) and/or descendant(s) of the node so that reconfiguration of the distribution network may be accomplished without burdening the system's primary server. An embodiment of the present invention may include 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 the network. In one example (which example is intended to be illustrative and not restrictive), the process may include the steps of providing a new user node (or connection requesting user node) with a connection address list of nodes within the network, having the new user node (or connection requesting user node) go to (or attempt to go to) the node at the top of the connection address list, determine whether that node is still part of the distribution network, and connect thereto if it is, and if it is not, to go to (or attempt to go to) the next node on the connection address list. In another example (which example is intended to be illustrative and not restrictive), when a user node departs from the distribution network, a propagation signal may be transmitted to the nodes below it in the network, causing them to move up in the network in a predetermined order.01-27-2011
20110116418Multiple Tree Registration Protocol - A registration protocol for setting up and updating a tree that defines the active topology in an Ethernet network includes a plurality of application components and a plurality of attribute declaration components corresponding to the application components, wherein the application components declare and register attribute values and the corresponding attribute declaration components make and withdraw registration of the attributes.05-19-2011
20090161584METHOD FOR A ROOT PATH CALCULATION IN A SHORTEST PATH BRIDGE - A method for root path calculation in a shortest path bridge, including: in the case that there are a plurality of equivalent paths whose total path cost to a root bridge is equal, determining a root path corresponding to the root bridge based on the minimum/maximum value of bridge ID in the plurality of equivalent paths. The method can generate symmetric paths for different root bridges under a multiple spanning tree circumstance of shortest path bridge.06-25-2009
20090219836DISTRIBUTED SPANNING TREE PROTOCOL ON A MULTI CHASSIS PORT CHANNEL - In one embodiment, a technique for routing traffic in networks represented by logical topologies, such as Multi Chassis Port Channel (MCPC) or Multi Chassis Ether Channel (MCEC) topologies, is provided. By modifying a port priority vector (PPV) to include an additional “Switch ID” field that identifies a designated bridge ID or a local switch ID, depending on whether the corresponding port is used as an MCT, a routing protocol designed to avoid loops in routing paths, such as STP, may avoid blocking MCT ports.09-03-2009
20120039218Assigning Slots in a Mesh Network - Assigning slots to nodes in a mesh network. Slot numbers are assigned to nodes in a wireless mesh network using a depth-first search combined with information on 2-hop neighborhoods for each node. Assigning slots using 2-hop neighborhood information allows slots to be safely reused. The slot assignment process may take process in parallel using different wireless channels for different subtrees rooted to a controller. Slot assignment may be repeated when the mesh topology changes. Reporting using the slot numbers allows for information from child nodes to be aggregated or filtered at parent nodes.02-16-2012
20090003244Information communication system, information communication method, node device included in information communication system and recording medium recording information process program - An information communication system formed by plural nodes, mutually connected through a communication route, the nodes including: 01-01-2009
20110064002Preventing loops in networks operating different protocols to provide loop-free topology - A method and apparatus for preventing loops in a network with network devices operating a spanning tree protocol and network devices operating a link state routing protocol to prevent loops are disclosed. In one embodiment, a method includes receiving from one of the network devices operating a link state protocol, a link state routing synchronization packet at a first network device in communication with one of the network devices operating the spanning tree protocol, blocking at the first network device, boundary ports in communication with the network devices operating the spanning tree protocol, transmitting a link state routing synchronization acknowledgement packet at the first network device after the boundary ports are blocked, and performing a loop-free topology convergence process at the first network device.03-17-2011
20110305169TERMINAL DEVICES AND PACKET TRANSMITTING METHOD - After a delivery tree is reorganized by a local processing, all terminal devices can recognize, in a short time, a delivery route as changed. In a local one of the terminal devices, if the local terminal device is a source node and further if the load of the CPU in any one of nodes exceeds a threshold value or the available band of the circuit line between nodes exceeds a threshold value, then a delivery tree organizing unit (12-15-2011
20110064001SYSTEM AND METHOD FOR ENABLING A REMOTE INSTANCE OF A LOOP AVOIDANCE PROTOCOL - A system and method which enables a provider network to run a loop detection protocol in a customer network communicably coupled to it. The provider network runs a loop detection protocol and the customer network either runs a different protocol or none. The provider network determines its root bridge, or designated customer bridge, which is used to control loop detection decisions for the customer network. A BPDU or other protocol packet received from the customer network is tunneled through the provider network to the designated customer bridge. The designated customer network then processes the received BPDU in accordance with a loop detection instance for the customer network. The designated customer bridge then produces control messages in response to the processing and forwards those messages to the customer network. The control messages may include port state controls for ports in the customer network.03-17-2011
20110158128EFFICIENT PROTECTION SCHEME FOR MPLS MULTICAST - An efficient protection scheme for MPLS multicast is disclosed for protection of Point-to-Multi-Point LSP connections. The efficient protection scheme for MPLS multicast includes a pair of Redundant Multicast Trees for each multicast connection which connects the source of a multicast LSP to all its destinations in such a way that in the event of a single link or node failure in the network, every destination node is still connected to the root node in at least one of the two trees. Furthermore, a method is disclosed that ensures that existing Redundant Multicast Trees can adapt to changes in the set of destination nodes and/or network topology changes without significant modifications. The efficient protection scheme for MPLS multicast is particularly useful for reducing the protection bandwidth requirements over protection methods known in the art.06-30-2011
20120044837DATA FRAME ROUTING METHOD AND NETWORK BRIDGE - A method operates at the data link level. Each bridge associates, during a guard time, the port through which a frame is first received with a source MAC address until a unicast reply frame confirms the matching two-way path between the source and destination addresses. Any frame from the same source received through another different port is discarded. Each bridge forwards the received broadcast frames through the rest of the ports, except those involving prohibited (down-up) turns, and deviates (or optionally returns) the unicast frames with an unknown or aged destination address through the spanning tree. The protocol can operate with encapsulation in the border bridges or without encapsulation, using in this case the replacement of universal MAC addresses in the border bridges with local MAC addresses. The establishment and control of paths can optionally be performed proactively by the border bridges, especially the bridges connected to servers.02-23-2012
20120014291COMMUNICATIONS NETWORK - A node for a communications network, the node comprising a plurality of ports and a processor. The processor configured to determine that a first status change signal, indicative of a topology status change in the network, has been received, and the processor configured to decide from at least an origin of the first status change signal to output a second status change signal to only a subset of possible destination nodes.01-19-2012
20090135738Method for routing and load balancing in communication networks - The invention concerns a method of configuring the topology of a communication network comprising a plurality of nodes (i, j, . . . , N), said communication network being organized as a forest structure comprising trees and subtrees, wherein at least one node i maintains a periodic timer and an expiration of said timer of said node i triggers the steps of: 05-28-2009
20120300675LINK INFERENCE IN LARGE NETWORKS BASED ON INCOMPLETE DATA - A network is partitioned into a set of independent partitions, and the topology of each partition is determined, then merged to form a topology of the entire network. Preferably, the partitioning is hierarchical, wherein the network is partitioned to form individual VLAN partitions, and each of the VLAN partitions is further partitioned based on the nodes that are simply connected to each port of one or more selected root switches within the VLAN partition. Simple connections to each port are efficiently determined based on an aggregate address forwarding table associated with each node. Ancillary information, such as spanning tree or CDP data, may be used to facilitate efficient partitioning and/or to validate inferences that are made with incomplete information.11-29-2012
20120170489Method And Apparatus For Network Tree Management - There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.07-05-2012
20100246446TREE-BASED NODE INSERTION METHOD AND MEMORY DEVICE - A tree-based node insertion method and a memory device are disclosed in embodiments of the present invention. The tree-based node insertion method includes: according to the key value of a node to be inserted, searching in a primary tree for the nearest node whose key value is smaller than and the most approximate to the key value of the node to be inserted; judging whether the current secondary tree is full, and if so, selecting a node from the current secondary tree as a split node, transferring all the nodes on the right of the split node in the current secondary tree to the new secondary tree, and if not, inserting the node to be inserted into the current secondary tree.09-30-2010
20120127894ENERGY EFFICIENT NETWORKING - Methods and systems for configuring networks are disclosed. For example, in an example of an embodiment, a network device includes a plurality of first ports each connected to a Local Area Network (LAN) segment, a network link circuit configured to generate network link notices conforming to a network forming protocol for establishing network links between the network device and other switches in the network so as to enable the other switches to select a network link by which to send packets to the network device, the generated link notices being based in part on a power consumption capability of one or more first ports in the network device, and transmit circuitry configured to transmit the network link notices to the other switches through one or more of the first ports.05-24-2012
20120134299AUTOMATED TOPOLOGY FORMATION IN DYNAMIC DISTRIBUTED ENVIRONMENTS - Automated topology formation in a dynamic distributed environment. The automatic topology formation includes receiving by an application of a first entity having an initial topology role, topology information from a master node. The first entity has an initial topology role and the received topology information varies based the initial topology role. A local topology representation information is derived from the received topology information wherein the local topology representation information comprises any one of: a first entity topology role as any one of a not-a-node, root node, a prime node or a leaf node for the topology; a list of entities that are parents of the first entity in the topology, or a list of entities that are subordinates to the first entity in the topology; and setting the local topology representation information at the first entity.05-31-2012
20090059816Topology aware manet for mobile networks - Systems and methods provide adaptability in a mobile ad hoc network (MANET), based on an existing protocol, such as adaptive hybrid domain routing (AHDR). The systems and methods are especially suited for fast changing topologies that may change after a reactive route discovery has been completed.03-05-2009
20100020726AUTOMATICALLY CONFIGURING MESH GROUPS IN DATA NETWORKS - In one embodiment, a method for setting up a flow-through mesh group (FTMG) for transmitting link-state packets (LSPs) in a network having a plurality of nodes interconnected by links. The FTMG is a combination of multiple spanning trees for the network through which LSPs are forwarded. FTMG set-up messages are received at ports of each node of the network from peer ports of linked nodes. FTMG set-up messages identify root nodes of the multiple spanning trees and the transmission modes of the peer ports. The FTMG set-up messages are used to determine (1) a root node for each spanning tree, (2) a root port on each node for each spanning tree, and (3) directionality of ports of the nodes. FTMG set-up messages are then used to determine the transmission mode of ports of the nodes and, subsequently, to update the spanning trees and transmission modes, as needed.01-28-2010
20100182937VPLS N-PE REDUNDANCY WITH STP ISOLATION - In one embodiment, a system includes a first network, a second network, and a core network connecting the first network to the second network. The first network includes a first set of two or more network devices, wherein the first network has a first spanning tree associated therewith. Similarly, the second network includes a second set of two or more network devices, wherein the second network has a second spanning tree associated therewith, wherein the second spanning tree is separate from the first spanning tree.07-22-2010
20120076052METHOD AND NODE FOR FINDING CONTENT IN A CONTENT DISTRIBUTION NETWORK, AND METHOD FOR CREATING A VIRTUAL REPRESENTATION OF A CONTENT DISTRIBUTION NETWORK - Embodiments of the present invention a method and a node for finding the shortest path to a cache node in a content delivery network (CDN) comprising requested content and a method for creating a virtual representation of a network. According to an embodiment of the present invention, the virtual representation is in the form of a virtual, hierarchical topology, and the cache nodes correspond to the cache nodes of the real network. All cache nodes are arranged at a first level and with the virtual nodes arranged at higher levels. In the virtual representation, all nodes (cache and virtual) are connected with virtual links such that there exist only one path between any two arbitrary cache nodes. Further, costs to the virtual links are assigned such that the path cost between any two arbitrary cache nodes in the virtual representation generally corresponds to the lowest path cost between corresponding cache nodes in the real network.03-29-2012
20100271981METHOD AND SYSTEM F0R DATA STREAMING - The present invention is a hybrid of a centralized solution and totally distributed peer-to-peer solution. It uses the load distribution idea of the peer-to-peer world. By splitting the multicast stream into a number of segments and transferring them through different trees, it overcomes the unbalanced resource usage faced by traditional single tree multicasting, thus improves the bandwidth efficiency of the network system and performance of the multicast application. In other words, it introduces the high resource efficiency of a peer-to-peer system into a network provider domain.10-28-2010
20100271980Pay-As-You-Grow Gradual Cutover Method To Scale A Provider Bridge Network To A VPLS Or Provider Backbone Bridging Network - A method and apparatus that operates two bridging protocols in a hybrid bridging node is described. The operation of the two bridging protocols in the hybrid node allows for an incremental transition of a provider bridging network from operating a legacy bridging protocol that shares MAC addresses to a bridging network that operates VPLS and/or PBB bridging protocols. The hybrid bridging node selectively broadcasts unicast packets with unknown MAC addresses from the nodes operating VPLS and/or PBB to nodes operating a legacy bridging protocol.10-28-2010
20090067348DYNAMIC UPDATE OF A MULTICAST TREE - In an example embodiment, a multicast tree is accessed. The multicast tree defines one or more destination label switch routers and paths from a source label switch router to the destination label switch routers. Multicast addresses are then transmitted to the destination label switch routers. In an example embodiment, upon receipt of the multicast addresses, a request to update the multicast tree is transmitted. The request includes the identifier of the label switch router that originated the request.03-12-2009
20090175203Method for protecting a network configuration set up by a spanning tree protocol - A method for protecting a network configuration set up by a spanning tree protocol, STP, by selecting one of a plurality of bridges (07-09-2009
20120082065WIRELESS NETWORK AND TERMINAL, AND NETWORK CONFIGURATION METHOD AND DEVICE - A tree topology in a multi-hop wireless network is configured by having each node other than the root node select a parent node within direct communication range, thereby becoming a child node of the selected parent node. Neighboring nodes provide selection values such as routing costs and local structural information indicating the existing topology in their vicinities, including parent-child relationships. The selection of the parent node is based on the received selection values, but the local structural information is used to bias the selection in favor of neighboring nodes with at least one other child node. This selection strategy reduces the number of parent nodes in the network and enables more nodes to operate as end nodes, which can then conserve power by carrying out sleep control.04-05-2012
20090016241Systems for distributing data over a computer network and methods for arranging nodes for distribution of data over a computer network - A system and method for preventing reconfiguring a binary tree topology network. The network includes a plurality of nodes, a root node and a first set of nodes, operatively networked together to provide a downtree communication path for data. A first node is docked downtree of, and with a parent node, and uptree of, and with a first and second child node. The first node, and the first and second child node, are each one of the first set of nodes, and the plurality of nodes includes each of the first set of nodes and the parent node. A please stand by message is sent from the first node to the first and second child nodes. The first and second child nodes are inhibited from reporting an issue with the performance of the first node for at least a predetermined period after the please stand by message is received.01-15-2009
20110235551RENDEZVOUSING RESOURCE REQUESTS WITH CORRESPONDING RESOURCES - The present invention extends to methods, systems, and computer program products for rendezvousing resource requests with corresponding resources. Doubly linked sorted lists are traversed using modulo arithmetic in both directions. Sorted lists can be partitioned based on a multiple proximity metrics. Node routing tables provide a logarithmic index to nodes within the ID space of the federation infrastructure to facilitate more efficient routing. Messages can be routed to nodes within a ring and proximally routed to nodes in other partitioned rings.09-29-2011
20100232323HIERARCHICAL DATA COLLECTION NETWORK SUPPORTING PACKETIZED VOICE COMMUNICATIONS AMONG WIRELESS TERMINALS AND TELEPHONES - A packet-based, hierarchical communication system, arranged in a spanning tree configuration, is described in which wired and wireless communication networks exhibiting substantially different characteristics are employed in an overall scheme to link portable or mobile computing devices. The network accommodates real time voice transmission both through dedicated, scheduled bandwidth and through a packet-based routing within the confines and constraints of a data network. Conversion and call processing circuitry is also disclosed which enables access devices and personal computers to adapt voice information between analog voice stream and digital voice packet formats as proves necessary. Routing pathways include wireless spanning tree networks, wide area networks, telephone switching networks, internet, etc., in a manner virtually transparent to the user. A voice session and associate call setup simulates that of conventional telephone switching network, providing well-understood functionality common to any mobile, remote or stationary terminal, phone, computer, etc.09-16-2010
20100232322NODE, NETWORK SYSTEM, FRAME TRANSFER METHOD, AND FRAME TRANSFER PROGRAM - For eliminating a reduction in throughput in a network as a whole according to optimum path transfer technique which is the expansion of spanning tree protocol, a frame switching unit of the network has an STP control unit for, when a port state of a spanning tree is changed, notifying a table control unit of an identifier of the spanning tree and a port number of a predetermined port among the respective ports, the table control unit for setting, in a forwarding table storage unit, a received port number of a predetermined port as an output port in an entry in which a node ID is equivalent to a spanning tree identifier, and a table search unit for determining an output destination from among output ports obtained by acquisition of received frame information from a frame analysis unit.09-16-2010
20100220633METHOD FOR ESTABLISHING A LOOP-FREE TREE STRUCTURE IN A DATA TRANSMISSION NETWORK AND ASSOCIATED NETWORK ELEMENT - The invention relates to, among other things, a method during which a network element (09-02-2010
20120287821DYNAMICALLY UPDATING ROUTING INFORMATION WHILE AVOIDING DEADLOCKS AND PRESERVING PACKET ORDER AFTER A CONFIGURATION CHANGE - A system for allowing dynamic changing of routing information of a network interconnect while avoiding deadlocks and preserving packet ordering. A network resiliency system detects when an error in the network interconnect occurs and dynamically generates new routing information for the routers that factors in the detected error. The network resiliency system then generates new routing information that factors in the failure. The network resiliency system then directs the network interconnect to enter a quiescent state in which no packets are transiting through the network interconnect. After the network interconnect enters the quiescent state, the network resiliency system directs the loading of the new routing information into the routing tables of the network interconnect and then directs the network interconnect to start injecting request packets into the network interconnect.11-15-2012
20130010649METHOD AND APPARATUS FOR SCALABLE VIRTUAL PRIVATE NETWORK MULTICASTING - In one embodiment, the present invention is a method and apparatus for scalable virtual private network multicasting. In one embodiment a service network builds a new data multicast distribution tree for each high-bandwidth multicast data flow (e.g., multicast data flows that require an amount bandwidth meeting or exceeding a predefined threshold). However, if the multicast data flow is a low-bandwidth flow (e.g., if the required amount of bandwidth falls below the predefined threshold), the multicast data flow is routed over an existing multicast distribution tree in order to minimize an amount of state information that must be maintained by service provider core routers in the backbone network.01-10-2013
20120243443System and Method for Topology Transparent Zoning in Network Communications - An Autonomous System domain comprising a topology transparent zone comprising a plurality of topology transparent zone nodes at least some of which are topology transparent zone edge nodes, wherein the topology transparent zone nodes are interconnected with one another via a plurality of internal links, and a plurality of neighboring external nodes connected to the topology transparent zone edge nodes via a plurality of external links, wherein no link state advertisements (LSAs) describing the internal links are distributed to the neighboring external nodes.09-27-2012
20120243442DIRECTING TRAFFIC IN AN EDGE NETWORK ELEMENT OPERABLE TO PERFORM LAYER 2 DATA FORWARDING AND SUPPORTING ANY OF VARIOUS SPANNING TREE PROTOCOLS - A method in a Layer 2 data forwarding network element deployed at an edge of a first network between the first network and a second network. The first network supports a link management protocol to provide redundant paths and avoid layer 2 loops. The second network does not support the link management protocol. The method includes determining to direct network traffic away from the network element while the network element is not operable to forward the network traffic to the second network, and responsively directing the network traffic away from the network element. The method also includes determining to cause further network traffic to come into the network element after the network element is operable to forward the further network traffic to the second network, and responsively causing the further network traffic to come into the network element. The method may help to reduce traffic loss.09-27-2012
20080232275Data-Type-Based Network Path Configuration - Data-type-based spanning tree reconfiguration includes determining volumes for one or more types of data transmitted in information flows in an existing spanning tree in a network. The spanning tree is reconfigured based on one or more of the volumes and the types of data transmitted in the flows.09-25-2008
20130176906TRAFFIC ENGINEERING IN FRAME-BASED CARRIER NETWORKS - The invention relates to enabling traffic engineering in frame-based networks such as Ethernet networks. There is described a method of and connection controller for establishing connections (07-11-2013
20130094404PEER-TO-PEER COMMUNICATIONS IN AMI WITH SOURCE-TREE ROUTING - Methodologies are provided for establishing peer-to-peer communications between nodes in a tree structured network having plural nodes including a root node. A source node seeking to send a message to a destination node will first request a most advantageous available path from the source to the destination node, and then the root node (or possibly another node within the network that has additional storage resources) will provide a routing path to one or both of the source and destination nodes. Messages may then be sent between the source and destination nodes that may or may not include addressing information in the packet headers without having to request routing information again for additional messages between the same nodes.04-18-2013
20130128775LINK DATA TRANSMISSION METHOD, NODE AND SYSTEM - Link data transmission to a plurality of nodes includes: receiving data to be transmitted at a current node; obtaining, using one or more computer processors, first registration information by a plurality of child nodes of the current node; selecting, based on the first registration information, a first child node that is one of the plurality of child nodes to register with the current node; sending the data to be transmitted to the first child node; obtaining second registration information by a plurality of sibling nodes of the current node; selecting, based on the second registration information, a first sibling node that is one of the plurality of sibling nodes to register with the parent node; and sending the data to be transmitted to the first sibling node.05-23-2013
20130128774SYSTEM AND METHOD FOR DISTRIBUTED INTERNET GROUP MANAGEMENT PROTOCOL PROCESSING - A method may include receiving, at a network interface of a first network element, an Internet Group Management Protocol (IGMP) message from a second network element. The method may also include updating first multicast group data associated with the network interface based on the received IGMP message, the first multicast group data including one or more entries setting forth a multicast group and one or more other network elements which are members of the multicast group. The method may additionally include determining whether the second network element is the sole member of its multicast group based on the IGMP message and the first multicast group data. The method may further include forwarding the IGMP message to a switching element of the first network element in response to determining that the second network element is the sole member of its multicast group, the switching element communicatively coupled to the network interface.05-23-2013
20110222440METHODS, SYSTEMS AND COMPUTER READABLE MEDIA FOR UTILIZING A STANDARD SPANNING TREE PROTOCOL TO INDICATE AN ACTIVE SWITCHING FABRIC IN A NETWORK NODE - Methods, systems, and computer readable media for utilizing a standard spanning tree protocol to designate an active switching device in a network node are disclosed. In one example, the method includes generating a virtual network topology representation that includes a payload processing device connected to each of a first switching device and a second switching device, which share a virtual link that indicates that the first and second switching devices provide the same network access in the virtual network topology representation. The method also includes transmitting, from each of the first and second switching devices to the payload processing device, a standard spanning tree protocol signaling message that contains the virtual network topology representation and a bridge root priority identifier, wherein the bridge root priority identifier has been derived using an algorithm that considers whether the transmitting switching device is a preferred active switching device or a preferred standby switching device. The method further includes receiving the transmitted spanning tree protocol signaling messages and utilizing a standard spanning tree protocol at the payload processing device to construct a logical spanning tree using the virtual network topology representation and to select the preferred active switching device as a root bridge of the logical spanning tree based on comparing the bridge root priority identifiers as required by the standard spanning tree protocol, wherein the payload processing device only communicates application data via a link to the switching device designated as the root bridge.09-15-2011
20080198769METHOD AND SYSTEM FOR A LOW-COMPLEXITY SPANNING TREE ALGORITHM IN COMMUNICATION NETWORKS - Aspects of a method and system for a low-complexity spanning tree algorithm in communication networks may comprise preventing loops in a communications network utilizing a distributed sequential algorithm in which there is a single token. Only a network node in possession of this single token may disable a network port. A spanning tree may be generated based on loop prevention. The network ports that may be disabled may be chosen from a port map, where the port map may be obtained by combining a port map identifying ports that are connected to loops with a port map indicating network ports that are to remain enabled. The loop prevention may be initiated by a root node and a token may be generated by the root node when completing the prevention. Network nodes may reduce ingress data rate during loop prevention.08-21-2008
20100284309Method and Apparatus for Multicast Implementation In a Routed Ethernet Mesh Network - Interest in multicast group membership may be advertised via a routing system on an Ethernet network along with an indication of an algorithm to be used by the nodes on the network to calculate the distribution tree or trees for the multicast. Each node, upon receipt of the advertisement, will determine the algorithm that is to be used to produce the multicast tree and will use the algorithm to calculate whether it is on a path between nodes advertising common interest in the multicast. Example algorithms may include shortest path algorithms and spanning tree algorithms. This allows multicast membership to be managed via the routing control plane, while enabling spanning tree processes to be used to forward multicast traffic. Since spanning tree is able to install multicast state per service rather than per source per service, this reduces the amount of forwarding state required to implement multicasts on the routed Ethernet mesh network.11-11-2010
20120275347DIFFERENTIATED SERVICES FOR UNICAST AND MULTICAST FRAMES IN LAYER 2 TOPOLOGIES - In one embodiment, a method includes receiving information on layer 2 topologies at a network device in a core network, mapping one or more Virtual Local Area Networks (VLANs) to the layer 2 topologies to provide differentiated services in said layer 2 topologies, defining multiple paths for each of the layer 2 topologies, and forwarding a packet received at the network device on one of the multiple paths. An apparatus and logic for providing differentiated services in layer 2 topologies is also disclosed.11-01-2012
20120275346NETWORK DEVICE AND POWER SAVING METHOD - A network device transmits broadcasting packets to other network devices in a local area network (LAN) after the network device is connected to the LAN, and receives response packets from the other network devices. The network devices determines whether the network device is a root bridge according to the response packets, and computes power consumption between the network device and each of the other network devices when the network device is the root bridge. The network device selects a path with the lowest power consumption from the network device to each of the other network devices, and builds a new spanning tree according to the selected path.11-01-2012
20120287822METHOD FOR PROVIDING INTER-PICONET MULTI-HOP MESH COMMUNICATION IN WIRELESS PERSONAL AREA NETWORK AND APPARATUS THEREOF - In the environment of a wireless personal area network (WPAN) with a plurality of piconets, to allow a tree-based routing service and an optimized routing service through repeatedly building parent-child piconets, an inter-piconet mesh communication device and method for providing a multi-hop communication function among a plurality of piconets is provided by defining a mesh sublayer between a frame convergence sublayer and a MAC sublayer and providing a mesh data service to the frame convergence sublayer through a mesh service access point, defining a mesh sublayer management entity between a device management entity and a MAC sublayer management entity and providing a mesh management service to a device management entity through a mesh sublayer management entity service access point.11-15-2012
20090109876NETWORK SYSTEM SUPPORTING SPANNING TREE PROTOCOL, RELAY APPARATUS THEREOF, AND METHOD OF CREATING SPANNING TREE TOPOLOGY THEREOF - Provided are a network system supporting a spanning tree protocol (STP), a relay apparatus thereof, and a method of creating a spanning tree. Proposed is a method of creating a tree topology, between AVB bridges, using a STP message including a group MAC address which is different from that used in a non-AVB (Audio Video Bridging) bridge (that is, a bridge without the function of AVB), in order to form a minimum number of AVB clouds. Therefore, it is possible to efficiently ensure transmission quality of a multimedia stream such as an AVB stream.04-30-2009
20120020251MODULARIZED SCHEDULING ENGINE FOR TRAFFIC MANAGEMENT IN A NETWORK PROCESSOR - Described embodiments provide for scheduling packets for transmission by a network processor. A traffic manager generates a scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. A finite state machine (FSM) enqueues the received task in the associated queue. The queue has a corresponding scheduler level M, with a corresponding parent scheduler at each of M−1 levels in the scheduling hierarchy, where M is a positive integer less than or equal to N. Nodes at each of the N scheduling levels send messages only with one node at a relative next higher level and with one or more nodes at a relative next lower level. Each node in the scheduling hierarchy updates corresponding statistics and control indicators based on messages received from the node at the next higher level and the one or more nodes at the next lower level.01-26-2012
20120020250SHARED TASK PARAMETERS IN A SCHEDULER OF A NETWORK PROCESSOR - Described embodiments provide sharing data between nodes in a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets, each task having a shared parameter ID. The traffic manager determines the shared parameter ID value of the received task and queues the received task in a queue of the scheduling hierarchy. The queue has a scheduler level M and a parent scheduler at each of M-1 levels in the scheduling hierarchy. The traffic manager determines a shared parameter ID value of the queue. The traffic manager loads, from a shared memory to a corresponding level one cache, one or more shared parameter values corresponding to at least one of the determined shared parameter ID value of the received task and the determined shared parameter ID value of the queue.01-26-2012
20120020249PACKET DRAINING FROM A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR - Described embodiments provide for controlling a state of each node in a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. A traffic manager enqueues received tasks in a queue of the scheduling hierarchy associated with a data flow. The traffic manager maintains scheduling data structures for each node in the scheduling hierarchy. The scheduling data structures include a backpressure indicator and a timer indicator. If the backpressure indicator is set, the traffic manager sets the node as unavailable for scheduling and removes the node from the scheduling hierarchy. If the timer indicator is set, the traffic managers sets the node as unavailable for scheduling. Otherwise, if neither the backpressure indicator nor the timer indicator is set, the traffic manager sets the node as available for scheduling.01-26-2012

Patent applications in class Spanning tree