Abstract:
A link aggregation method, device, MAC frame receiving/sending method and system are disclosed. The link aggregation method includes that the systems at both terminals of link transmit the information of ports owned VLAN in the local terminal system to the opposite terminal system by interchanging the message; the systems at both terminals of link determines link owned VLAN separately according to the received information of port owned VLAN in the opposite terminal system and the local terminal system, and aggregate the link according to the link owned VLAN. The MAC frame receiving/sending method includes that the sending terminal obtains VLAN information of the MAC frame, and VLAN information of link in the link aggregation group; the sending terminal selects the link sending MAC frame in the link which has the same VLAN with the MAC frame, and sends the MAC frame to the receiving terminal by said selected link; the receiving terminal sends the MAC frame received to MAC client. The implement of the solution improves the netting flexibility and the facility of network design and maintenance and management; and MAC frame with VLAN tag can be distributed on the corresponding VLAN link quickly, correctly, conveniently.
Abstract:
The present disclosure discloses a network device and/or method for enhanced VLAN pooling assignments in a wireless network. The disclosed network device receives a message from a wireless client in the wireless network. The network device identifies a virtual local area network (VLAN) based at least on a size of the VLAN and a number of active wireless clients associated with the VLAN. Next, the network device assigns the wireless client to the identified VLAN. In some embodiments, the network device assigns a wireless client to a VLAN if the radio between the number of active wireless clients and the size of the VLAN does not exceed a predetermined value. In some embodiments, the network device assigns a wireless client to a previously assigned VLAN or a VLAN corresponding to an identified home network device, if the wireless client is a roaming client.
Abstract:
A first aggregation node in communication with the first network and the second network, the source node and internal nodes of the first network only having knowledge of each other and of the first aggregation node. The system includes a second aggregate node in communication with the second network and the third network, the internal nodes of the second network only having knowledge of ea other and the first and second aggregate nodes, the destination node and the internal nodes of the third network only having knowled of each other and the second aggregation node, the first and second aggregation nodes only having knowledge of each other, the destination node receiving the data from the source node using a link state routing protocol and shortest path bridging through the first second and third networks and the first and second aggregation nodes.
Abstract:
A technique efficiently manages bandwidth (BW) registration for multiple spanning tree options in a computer network. According to the novel technique, an entry bridge determines multiple spanning tree paths to other bridges of the network (namely, one or more available spanning trees rooted at one or more bridges of the network) and determines a utilized (registered) BW on each of those paths. Upon receiving a request to initiate BW registration for a data flow to a destination end point, e.g., from an application source end point, the entry bridge selects one of the spanning tree paths to utilize for the data flow. Selection of the spanning tree path from among the multiple available paths may be based on (i) available bandwidth of the paths, (ii) a shortest of the paths, and (iii) a lowest bridge identifier ID for the bridge root for the path. The entry bridge sends a registration message for the data flow towards the destination end point along the selected spanning tree path. If successful, the data flow is transmitted on the selected path. If not, the entry bridge attempts to register the data flow on a next best alternate spanning tree, e.g., until a successful registration or until a determination that no further alternate spanning trees exist.
Abstract:
A VPLS model is implemented in a network-facing provider edge (n-PE) device configured to receive a packet from an access network the packet having a first Virtual Local Area Network (VLAN) tag of a first predetermined bit length The n-PE device mapping the service instance identifier of the first VLAN tag into a second VLAN tag of a second predetermined bit length greater than the first predetermined bit length, the second VLAN tag identifying a Virtual Private LAN Service (VPLS) instance The n-PE device then sends the packet with the second VLAN tag across a service provider (SP) core network via a pseudowire (PW) that functions as a logical link to another PE device
Abstract:
A Layer 2 device configured for providing at least one of bridging and switching functionality in a local area network comprising computer readable instructions for providing GVRP functionality and computer-readable instructions for limiting the number of dynamic VLANs that the GVRP functionality creates on a Layer 2 device of a local area network and on all ports of a data plane card of the Layer 2 device.
Abstract:
A Layer 2 device configured for providing at least one of bridging and switching functionality in a local area network comprising computer readable instructions for providing GVRP functionality and computer-readable instructions for limiting the number of dynamic VLANs that the GVRP functionality creates on a Layer 2 device of a local area network and on all ports of a data plane card of the Layer 2 device.
Abstract:
A technique efficiently manages bandwidth (BW) registration for multiple spanning tree options in a computer network. According to the novel technique, an entry bridge determines multiple spanning tree paths to other bridges of the network (namely, one or more available spanning trees rooted at one or more bridges of the network) and determines a utilized (registered) BW on each of those paths. Upon receiving a request to initiate BW registration for a data flow to a destination end point, e.g., from an application source end point, the entry bridge selects one of the spanning tree paths to utilize for the data flow. Selection of the spanning tree path from among the multiple available paths may be based on (i) available bandwidth of the paths, (ii) a shortest of the paths, and (iii) a lowest bridge identifier ID for the bridge root for the path. The entry bridge sends a registration message for the data flow towards the destination end point along the selected spanning tree path. If successful, the data flow is transmitted on the selected path. If not, the entry bridge attempts to register the data flow on a next best alternate spanning tree, e.g., until a successful registration or until a determination that no further alternate spanning trees exist.
Abstract:
A method of operation for a provider edge device of a core network includes receiving a customer frame from an access network; the customer frame having a first Virtual Local Area Network (VLAN) tag of a first predetermined bit length. The first VLAN tag including a service instance identifier. The service instance identifier of the first VLAN tag is then mapped into a second VLAN tag of a second predetermined bit length greater than the first predetermined bit length. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.