Abstract: A method and system for providing protection of data communications in packet-based networks is provided, using a combination of unicast to multicast conversion and providing formation of virtual output queues (VOQs) which are separate for each pair of the target port and protection ports on the target network device. As a result, the system requires less bandwidth resources and reduces or eliminates network performance problems associated with other existing solutions.

Abstract: A reliable packet network is constructed with nodes and links where the nodes use a method for fast distribution of link state information. This permits a rapid update of the routing information at all nodes in case of a link failure, minimizing the number of lost packets.

Abstract: A communication network is provided having source and destination switching routers connected by two different communication paths. A primary label switched path is established on one of the communication paths and a secondary label switched path is established on the other label switched path. The source switching router can be enabled to place one or more data flows within the primary label switched path and can be enabled to place one or more of the same data flows within the secondary label switched path. The destination switching router stores a label identifying each data flow and a forwarding instruction and can be enabled to reference data carried within the primary or secondary LSP with the appropriate data flow label.

Abstract: A method and system for allocating and controlling a hierarchy of labels in an MPLS network is provided. The hierarchy of labels, inserted into MPLS packets, is introduced so as to correspond to the hierarchy of sub-flows within a data flow. The labels have the established dependency so that positions of labels in the hierarchy identify a sequence of processing the labels and functions associated with the labels. The system for allocating and controlling the hierarchy of MPLS labels includes a first control plane mapper for releasing available labels, a first controller for assigning the released labels according to the hierarchy, means for transmitting the labels in the network, a second controller for detecting the labels, and a second control plane mapper for maintaining current label dependency within the hierarchy. If required, re-addressing of the hierarchy of labels may be performed to maintain flow-sub-flow association throughout two adjacent networks.

Abstract: A method of transmitting packets from the source edge router through the label switch router to the destination edge router, comprising the steps of: assigning different protocol type indicators at the source edge router to user MPLS packets and to non-user MPLS packets of at least one additional protocol type; at the label switch router, forwarding MPLS packets received from the source edge router or another label switch router in such a manner as to preserve the protocol type indicator of the packet transport protocol of each received MPLS packet; at the destination edge router, recognizing the protocol type indicator of the transport protocol of the MPLS packets received from the label switch router, and segregating the user MPLS packets from non-user MPLS packets. Preferably, user and non-user MPLS packets are assigned the same MPLS label and sent via the same label switched path. Corresponding enhanced MPLS network is also provided.

Abstract: An extension of a Link Aggregation Protocol (LAP) over the network allows current Ethernet point-to-point LAPs to operate across a Metropolitan Area Network (MAN). A maximum disjoint path algorithm allows selection of a plurality of alternative end-to-end physical routes between two data terminals. These physical routes share a minimum number of nodes and physical links. End-to-end logical links are then formed by a plurality of successive physical links between nodes containing protocol compatible devices, the physical links being selected based on their physical characteristics such as bandwidth and delay. Multiple logical links can be provisioned, without dedicating, between any two data terminals over the network. The logical links provide the virtual point-to-point links that the edge LAP devices require.

Abstract: A method and system for providing protection of data communications in packet-based networks is provided, using a combination of unicast to multicast conversion and providing formation of virtual output queues (VOQs) which are separate for each pair of the target port and protection ports on the target network device. As a result, the system requires less bandwidth resources and reduces or eliminates network performance problems associated with other existing solutions.

Abstract: An extension of a Link Aggregation Protocol (LAP) over the network allows current Ethernet point-to-point LAPs to operate across a Metropolitan Area Network (MAN). A maximum disjoint path algorithm allows selection of a plurality of alternative end-to-end physical routes between two data terminals. These physical routes share a minimum number of nodes and physical links. End-to-end logical links are then formed by a plurality of successive physical links between nodes containing protocol compatible devices, the physical links being selected based on their physical characteristics such as bandwidth and delay.

Abstract: In a MPLS packet network comprising a source edge router, a destination edge router and a label switch router connected by transmission links and using a packet transport protocol providing a protocol type indicator of the transported packet, a method of transmitting packets from the source edge router through the label switch router to the destination edge router, comprising the steps of:

Abstract: A communication network is provided which includes a primary label switched path having a plurality of switching routers. The communication network includes a secondary label switched path which extends from a selected primary path switching router, bypasses a section of the primary path and rejoins the primary path at a position downstream of the selected switching router. The selected switching router is conditioned to re-route data intended for transmission on the primary path, onto the secondary communication path in response to a fault on the section of the primary path which is bypassed by the secondary path to restore data transmission.

Abstract: A communication network is provided having source and destination switching routers connected by two different communication paths. A primary label switched path is established on one of the communication paths and a secondary label switched path is established on the other label switched path. The source switching router can be enabled to place one or more data flows within the primary label switched path and can be enabled to place one or more of the same data flows within the secondary label switched path. The destination switching router stores a label identifying each data flow and a forwarding instruction and can be enabled to reference data carried within the primary or secondary LSP with the appropriate data flow label.

Abstract: A method and system for allocating and controlling a hierarchy of labels in an MPLS network is provided. The hierarchy of labels, inserted into MPLS packets, is introduced so as to correspond to the hierarchy of sub-flows within a data flow. The labels have the established dependency so that positions of labels in the hierarchy identify a sequence of processing the labels and functions associated with the labels. The system for allocating and controlling the hierarchy of MPLS labels includes a first control plane mapper for releasing available labels, a first controller for assigning the released labels according to the hierarchy, means for transmitting the labels in the network, a second controller for detecting the labels, and a second control plane mapper for maintaining current label dependency within the hierarchy. If required, re-addressing of the hierarchy of labels may be performed to maintain flow-sub-flow association throughout two adjacent networks.

Abstract: A reliable packet network is constructed with nodes and links where the nodes use a method for fast distribution of link state information. This permits a rapid update of the routing information at all nodes in case of a link failure, minimizing the number of lost packets.