Abstract: A system and method for in-service migration for a Virtual Local Area Network, VLAN, service if a Provider Bridge Metro Ethernet Network, PB MEN, is upgraded to a Provider Backbone Bridge, PBB, MEN or an Internet Protocol/Multi Protocol Label Switching, IP/MPLS, MEN. After the deployment of the new PBB or IP/MPLS technology, a sequence of management actions are performed to configure PBB or IP/MPLS edge nodes to use the new technology as well as the old PB-based technology to support the VLAN service. Both old and new connectivity structures are maintained in the edge nodes during the entire migration process. Customer traffic is then redirected per edge node to the new technology. When each edge node entirely provides the VLAN service under the new technology, the migration is complete.

Abstract: A method that improves multi-area routed Ethernet network design, in which multipath implementation in each of the areas is independent of each other area to allow optimal network design in each area. The network implements a shortest path bridging medium access control (SPBM) protocol. The areas include a Level 2 (L2) routing area coupled to a Level 1 (L1) routing area via multiple area border bridges (ABBs). The L1 routing area including a backbone edge bridge (BEB) coupled to the ABBs via multiple L1 multipath instances identified by respective backbone VLAN identifiers (B-VIDs). The ABBs receive an advertisement from the BEB that indicates a set of BEB identifiers, each of which identifies the BEB and is associated with a respective B-VID. Each of the BEB identifiers is unique. The ABBs also advertise into the L2 routing area, and translate the B-VIDs based on service identifiers for frames transiting the ABBs.

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

Abstract: 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.

Abstract: A method is provided for use at a first node of a network. The first node (B) has an input path for receiving Ethernet frames destined for a second node of the network. The first node (B) also has a first output (working) path for forwarding the received Ethernet frames towards the second node. A failure along the first output (working) path is detected at the first node. Following such failure detection, the received Ethernet frames are caused, at the first node, to be re-routed along a second output (backup) path, different to the first output (working) path, towards the second node. The re-routing is performed by using (e.g. referring to and/or changing) respective indications (VLAN1) applied to the Ethernet frames to distinguish those Ethernet frames to be forwarded along the first output (working) path from those Ethernet frames to be forwarded along the second output (backup) path.

Abstract: A system (300), a network management system (306), and a method are described herein for avoiding a count-to-infinity problem in a network (304)(e.g., Provider Backbone Bridging) with bridges having network interface ports (2,4,)(e,g., Layer Two Gateway Ports) which are connected to an external network (302)(e.g., External Network to Network interface).

Abstract: A method of measuring loss in a multicast transmission in a network is described. Service frames including a service multicast destination address are sent from a source node towards a receiving node. A counter of the number of service frames sent is maintained at the source node. This counter is periodically read, and its value copied into a loss measurement OAM frame. The loss measurement OAM frame includes a unique identifier and an OAM destination address which is different to the service multicast destination address, and is sent from the source node towards the receiving node. Every time the sent frames counter is read, a measurement indicator frame is also sent from the source node towards the receiving node. The measurement indicator frame includes the unique identifier so that it can be related to the loss measurement OAM frame. The measurement indicator frame also includes the service multicast destination address, although the measurement indicator frame is distinguishable from the service frames.

Abstract: The present invention provides a process for forming a capping layer on a conducting interconnect for a semiconductor device, the process comprising: providing a substrate comprising one or more conductors in a dielectric layer, the conductors having an oxide layer at their surface; exposing the surface of the substrate to a vapor of ?-diketone or a ?-ketoimine; and depositing a capping layer on the surface of at least some of the one or more conductors. The present invention further provides an apparatus for carrying out this method.

Abstract: The invention discloses a method (200, 300, 400) for traffic control in a cellular telephony system (100) comprising a number of cells, each cell comprising at least one Radio Base Station, RBS, (170). The system (100) comprises at least one Radio Network Controller, RNC, (110 130 150), for the control of a number of Radio Base stations. The traffic between an RBS and an RNC comprises a number of flows. The invention is intended for the control of flows from the Radio Base Stations to their RNC. The method uses one control function for each flow from each of said Radio Base Stations, and also comprises a congestion detection function (220) which detects the presence or absence of congestion in the traffic from an RBS to an RNC, and which, upon detection of congestion reduces the bit rate of the congested traffic, and in the absence of congestion, increases the bit rate of the previously congested traffic.

Abstract: Technique for controlling data forwarding in a computer network are provided. The network comprises a set of nodes for forwarding data, wherein a first node is associated with a primary tree and a backup tree, wherein the primary tree defines a default path for the first node to forward data to a second node and the backup tree defines another path for the data forwarding in case of a failure of the primary tree. The basic principle of the techniques is to notify the first node of a failure of the primary tree wherein the notification is provided by the second node. The techniques are particularly beneficial for computer networks offering multipoint services, such as SPB-controlled networks, because the techniques ensure the congruency of the forward and reverse paths even when the data forwarding has been switched from the primary tree to the backup tree.

Abstract: A process for the formation of a capping layer on a conducting interconnect for a semiconductor device is provided, the process comprising the steps of: (a) providing one or more conductors in a dielectric layer, and (b) depositing a capping layer on an upper surface of at least some of the one or more conductors, characterized in that the process further includes: (c) the step of, prior to depositing the capping layer, reacting the dielectric layer with an organic compound in a liquid phase, the said organic compound having the following general formula: (I) where X is a functional group, R is an organic group or a organosiloxane group, Y1 is either a functional group or an organic group or organosiloxane group, and Y2 is either a functional group or an organic group or organosiloxane group, and where the functional group(s) is/are independently selected from the following: NH2, a secondary amine, a tertiary amine, acetamide, trifluoroacetamide, imidazole, urea, OH, an alkyoxy, acryloxy, acetate, SH, an alky

Abstract: 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.

Abstract: A node and a method are described herein for computing forwarding trees to distribute traffic in a network. In addition, a network is described herein that has a plurality of nodes interconnected to one another by a plurality of network links, and each node is configured to perform multiple rounds of forwarding tree computations to distribute traffic load on one or more of the network links to the other nodes.

Abstract: A method of localizing a fault in a network is disclosed. The network comprises nodes (SW1 . . . SW4) links, and edge-nodes (EN1 . . . EN4) arranged as a plurality of spanning trees (T1, T2,T3), the spanning trees being partially disjoint. The network further comprises means for network management. The method comprising the steps of receiving information on the configuration of the plurality of tree topologies in the network; monitoring connectivity in the network; upon detection of a loss of connectivity in the network, identifying the failed tree(s), and determining the network elements common to the failed tree(s).

Abstract: A method and network for determining an interconnect node for establishing a forwarding path for service based data within a network system. The method includes assigning, interconnect node status information to network interconnect nodes, wherein a network interconnect node to which a passive status is assigned is only allowed to transmit service based data between an external link and another interconnect node of the network, or between two other interconnect nodes of the network. Only a network interconnect node with active status is allowed to send or receive service based data to or from the network. The method includes determining, for a given service, an interconnect node with active status for establishment of a forwarding path including the interconnect node with active status and an external link, wherein the determination is based on the respective status information assigned to the network interconnect nodes for the service.

Abstract: A flow classification process is used at the edge of the shortest path bridging network to determine a flow label for attachment to a client frame entering the network. Any of several flow labels can be assigned to a client frame traversing the network to a particular egress node, and the flow labels are used by forwarding nodes to select among multiple equal-cost paths. In several embodiments, the flow label is calculated as a function of the client frame contents, which provide an entropy source for randomizing the selection of the flow label. This entropy source comprises the Internet Protocol (IP) header in the client frame, in some embodiments, but may comprise other client frame content in other cases.

Abstract: 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.

Abstract: An upgraded edge node (e.g., enhanced PBB edge node, enhanced IP/MPLS edge node) and a method are described herein for providing a VLAN service for a customer in a metro network. In addition, a metro network is described herein which includes the upgraded edge nodes, traditional PB edge nodes, and a PB domain that has PB core nodes located therein.

Abstract: A method and apparatus for flushing port tables in an Ethernet network that includes a Root Bridge node (1) and a plurality of bridge nodes (2-7). A ring of bridge nodes affected by a change in the topology of the Ethernet network is identified from the plurality of, bridge nodes. The ring of bridge nodes (2-7) includes a branching bridge node (2) providing a connection to the Root Bridge node (1). Port tables are flushed only at the bridge nodes on the ring (2-7), rather than all of the bridge nodes in the Ethernet network, which greatly reduces the amount of signalling required during a relearning process.

Abstract: A method for forming a semiconductor device, the method includes providing a semiconductor substrate, applying a slurry to the semiconductor substrate, wherein the slurry was tested using a testing method includes taking a first undiluted sample from a top of the slurry; determining a first particle size distribution characteristic of the first undiluted sample; taking a second undiluted sample from a bottom of the slurry; determining a second particle size distribution characteristic of the second undiluted sample; and comparing a difference between the first particle size distribution characteristic and the second particle size distribution characteristics with a first predetermined value.