413 results about "Spanning tree" patented technology

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.

The present invention provides a method in which the physical connection information and the logical network configuration information are kinked to the status of spanning tree, and the status of spanning tree is displayed with the physical connection and the logical network configurations. The method can provide the better recognition about not only intended the physical and logical configurations but the status of spanning tree to a network administrator. Therefore, the network administrator can integrally recognize the status of the network and the failure in the network will be analyzed easily to recover the network to normal state in shorter time.

The present invention provides improved unicast routing, multicast routing and unicast load sharing as compared with conventional methods. Preferred implementations of the invention provide improvements to IEEE 802.1Q. According to preferred aspects of the invention, each bridge is the root of its own multiple spanning tree instance (“MSTI”). Preferred implementations of the invention require no learning of media access control (“MAC”) addresses on the backbone of a network. Some methods of the invention can resolve spanning tree asymmetries. Preferred implementations of the invention require a very low computational load for control protocols.

System and methods for confining multicast routing trees to within single zones of a multi-zone communication systems, thereby enabling faster convergence of the trees relative to trees spanning multiple zones. Separate multicast routing trees are established using different multicast addresses in a source zone and one or more listening zones. Packets for a call distributed by routers (104, 116) of a packet network within the source zone via a source zone multicast address are received by a source zone packet duplicator (132). The source zone packet duplicator forwards the packets, via routers (116, 118, 120, 122) of the packet network using unicast routing, to various listening zone packet duplicators (136, 138). The listening zone packet duplicators, upon receiving the packets, separately distribute the packets within their respective zones via the packet network using different multicast addresses of the listening zones. The source zone and listening zones may be redefined during the call as the source changes or moves to different zones.

An Ethernet switch includes a plurality of ports, wherein the switch is configured to be operable within a temperature range of at least between approximately 0° C. and approximately 60° C. The switch is further configured to be operable within a non-condensing humidity range of at least between approximately 10% and approximately 95%. The switch is further configured to support at least one of a Virtual Local Area Network (VLAN), a Quality of Service (QoS), a Remote Monitoring (RMON), and a Spanning Tree, and the switch is configured to be upgradeable using a plug in device.

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.

A network protocol for low-cost, low-power devices coupled to a self-organizing wireless network using a spanning tree backbone architecture is described. In this protocol, physical and logical network construction and maintenance operations, which supports efficient data routing in the network, are performed. The construction phase in conjunction with the maintenance phase insures the self-organizing capability of the network. At the same time, the maintenance operations provide a self-healing mechanism so that the network can recover from node failures and a self-updating mechanism so that the network can expand as more nodes enter the system. Also, the logical backbone hierarchy will facilitate multi-hop communication. The construction of a logical layered spanning tree backbone architecture from an underlying physical topology allows seamless data communication routing between all nodes in the network.

A spanning tree cross-route protocol for establishing mesh-like cross routes in an underlying wireless spanning tree topology. A cross route spans branches of the tree topology to provide a more optimal route between any two nodes in the wireless network. The cross route can span multiple spanning trees. Each mesh node maintains a cross route table. When a packet is received, the node determines whether there is an entry for the destination node in the cross route table. If there is an entry for the destination node in the cross route table, the packet is forwarded via the cross route; otherwise, the packet is forwarded via the spanning tree.

A system and method for automatically configuring a network so that each switch in the network is aware of the Multiple Spanning Tree Instances (MSTI) of each other switch and the Virtual Local Area Network (VLAN) that each switch uses. This is achieved through the use of controllers connected to each switch. A master switch is elected and the master switch monitors messages to determine if a switch should be using an alternative MISTI. If so, the master switch instructs a switch to use an alternative MSTI. Either a switch or a node connected to the switch may determine which VLAN to use in sending messages, subject to configuration from the controller of the master switch. Messages are periodically sent by each controller to educate other controllers to aid in learning which node is part of a group connected to a switch, the switch in turn connected to a controller.

Disclosed is a method for efficiently distributing content by leveraging the use of a peer-to-peer network infrastructure. In a network of peers, a handful peers can receive content from centralized servers. These peers can then flood this content out to more clients who in turn can send the content along to others. Ultimately, a request for content can be fulfilled by locating the closest peer and obtaining the content from that peer. In one embodiment the method can be used to distribute content by creating content distribution groups of one or more client computing devices and redirecting requests for content from the server to the content distribution group. A further contemplated embodiment efficiently streams time sensitive data through the use of a spanning tree architecture of peer-to-peer clients. In yet another embodiment the present invention provides for more efficient use of bandwidth for shared residential broadband connections.

There is disclosed a method of helping mobile stations such as voice over IP devices to roam between wireless access points, by each access point transmitting the MAC address of a spanning tree algorithm root switch of the local network domain. This MAC address is used by mobile stations to detect if two access points are in a common network domain.

Provided in the EoE technique are the node, the network, the correspondence relationship generating method and the frame transfer program to avoid traffic concentration on a specific link to improve throughput of the network as a whole by realizing optimum path transfer. The frame switching unit includes the frame analysis unit for analyzing an input frame kind and the like, the table search unit for obtaining frame rewriting information and output port information, the forwarding table storage unit for managing an output port of a frame, the MAC learning unit for executing MAC address learning, the EoE-MAC learning unit for learning a relationship between a MAC address and an EoE-MAC address, the STP control unit for executing processing of a spanning tree, and the like.

The invention provides a method for achieving dynamic multicast spanning tree path adjustment based on OpenFlow. An OpenFlow technology is utilized to solve the problems in a multicast service of a host entering or leaving a multicast set, multicast spanning tree path dynamic adjustment and distributed multicast spanning tree strategies. According to the OpenFlow technology, a traditional packet forwarding process completely controlled by a router or a switch is converted into the process together completely by the OpenFlow switch and the controller, and therefore separation of forwarding logics and specific forwarding operation is achieved.

Systems involving generations of a complex node respresentation of a PNNI peer group are provided. Use is made of a set of restrictive costs, such as a transition matrix, defining the restrictives costs of paths between pairs of border nodes of the peer group. The complex node representation generation method is based on the group evolution process of the logical group representation of a peer group, and use is also made of the spanning tree representation of a network. Complex node representations generated by the disclosed possible number of exception bypasses.

Broadcast storm due to topology loop may result from end-user mis-configurations, faulty ports, cabling problems, faulty spanning-tree algorithm implementations, and others. This loop detection mechanism helps detecting topology loops and eliminates them. It operates as a watchdog independent of the spanning-tree algorithm. The feature is aiming at enhancing the values of SO-LOS.

A method and apparatus that provide for a Layer 2 path determination are disclosed. In one embodiment of the invention, a Layer 3 path between a source device and destination device is first determined in order to identify contiguous pairs of Layer 3 devices. A subpath is then determined for each contiguous pair of Layer 3 devices based on VLAN and spanning tree information associated with the contiguous pair. The Layer 2 path is a concatenation of the subpaths of all the contiguous pairs in the Layer 3 path.

Restricting the assignment of VLANs so that a unique VLAN or set of VLANs must be assigned to each link for a particular network circuit (NC) or group of NCs. NCs are prevented from being assignd a particular VLAN if the addition of the VLAN assignment will create a mix-match topology, which may either create a loop or prevent a loop from being able to be properly blocked without inadvertently blocking a link of another NC. Restriction of VLAN assignment allow a single conventional spanning tree to be run to ensure that there are no layer 2 forwarding loops exist while at the same time not inadvertently blocking the path of another NC.

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.

Modifications to the spanning tree algorithm allow bad news to propagate quickly by providing that protocol entities on bridges process inferior information sent by the designated bridge for each LAN. In addition, bridges use per port hello timers to stimulate information propagation, setting it to suit local link characteristics. No changes to the format of bridge protocol data units (BPDUs) as specified in the IEEE Standard 802.1D are required, and the algorithm for computing the topology of the network remains unchanged. Techniques have been adopted for expiring information and recomputing the spanning tree upon detection of link failure, upon receipt of a message having a message age greater than its accompanying maximum age, or if the port hello time algorithm detects a loss of link. Rules for propagating information are provided allowing rapid propagation of changes. Finally, techniques for burning out information in a configuration message are adopted.

Improved apparatus for a radio communication system having a multiplicity of mobile transceiver units selectively in communication with a plurality of base transceiver units which, in turn, communicate with one or more host computers for storage and manipulation of data collected by bar code scanners or other collection means associated with the mobile transceiver units. A network controller and an adapter which has a simulcast and sequential mode provide selective interface between host computers and base transceivers. A scheme for routing data through the communication system is also disclosed wherein the intermediate base stations are organized into an optimal spanning-tree network to control the routing of data to and from the RF terminals and the host computer efficiently and dynamically. Additionally, redundant network and communication protocol is disclosed wherein the network utilizes a polling communication protocol which, under heavy loaded conditions, requires that a roaming terminal wishing to initiate communication must first determine that the channel is truly clear by listing for an entire interpoll gap time. In a further embodiment, a criterion used by the roaming terminals for attaching to a given base station reduces conflicts in the overlapping RF regions of adjacent base stations.