Abstract: A method of operation of a Multiprotocol Label Switching network involves, in an active node of the network, receiving a first data packet from a source node and forwarding the first data packet to a destination node. At the same time, the active node measures a residence time of the first data packet in the active node. The active node then sends a further data packet containing residence time information.

Abstract: A method of operation of a Multiprotocol Label Switching network involves, in an active node of the network, receiving a first data packet from a source node and forwarding the first data packet to a destination node. At the same time, the active node measures a residence time of the first data packet in the active node. The active node then sends a further data packet containing residence time information.

Abstract: A method of operation of a Multiprotocol Label Switching network involves, in an active node of the network, receiving a first data packet from a source node and forwarding the first data packet to a destination node. At the same time, the active node measures a residence time of the first data packet in the active node. The active node then sends a further data packet containing residence time information.

Abstract: A method of operation of a Multiprotocol Label Switching network involves, in an active node of the network, receiving a first data packet from a source node and forwarding the first data packet to a destination node. At the same time, the active node measures a residence time of the first data packet in the active node. The active node then sends a further data packet containing residence time information.

Abstract: Systems and methods of transporting internal radio base station (RBS) interface information over a packet network are presented. In one exemplary embodiment, in an interworking function (IWF) for communicating packets between a radio equipment (RE) and a radio equipment controller (REC) of a radio base station (RBS), a method may include receiving a packet sent from another IWF and having internal RBS interface information and residence time measurement (RTM) information that characterizes an asymmetry between processing times on links in different directions between the RE and the REC. Further, the method may include determining an asymmetry compensation that compensates for the asymmetry using the RTM information. Also, the method may include applying the asymmetry compensation to a timestamp of the internal RBS interface information to obtain an updated internal RBS interface information.

Abstract: Systems and methods of transporting internal radio base station (RBS) interface information over a packet network are presented. In one exemplary embodiment, in an interworking function (IWF) for communicating packets between a radio equipment (RE) and a radio equipment controller (REC) of a radio base station (RBS), a method may include receiving a packet sent from another IWF and having internal RBS interface information and residence time measurement (RTM) information that characterizes an asymmetry between processing times on links in different directions between the RE and the REC. Further, the method may include determining an asymmetry compensation that compensates for the asymmetry using the RTM information. Also, the method may include applying the asymmetry compensation to a timestamp of the internal RBS interface information to obtain an updated internal RBS interface information.

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: A method is implemented in a network element of a service network. The network element executes a packet processing element (PPE) of a plurality of PPEs, where each PPE in the plurality of PPEs executes a stage of packet processing for the service network and where the plurality of PPEs are connected to one another by a plurality of switch fabrics. The PPEs self-select a subset of a set of equivalent service chains to service with each service chain defining a subset and sequence of the plurality of PPEs. Each PPE self-selects the subset of equivalent service chains to process based upon knowledge of the plurality of PPEs servicing that stage of the full set of service chains such that there is spreading of load across all available PPEs in that stage. There is no single point of failure and minimal reassignment of PPEs for a set of equivalent data flows traversing the plurality of PPEs of the service network for changes in topography of the plurality of PPEs in the service network.

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 each other and the first and second aggregate nodes, the destination node and the internal nodes of the third network only having knowledge 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 network element acting as a forwarding plane within a software-defined network to reduce negative effects of slow-path packet processing is described. The network element, upon receiving a first packet, determines whether it matches any flow entry within a set of flow tables. When the first packet does not match any flow entry of the set of flow tables, the network element performs a miss procedure including inserting at least a portion of the first packet into a packet miss table of the network element, which is accessed by a controller. The controller may access the packet miss table using a pull mechanism. The miss procedure may also include accessing a configurable default rule table of the network element, which includes rules enabling limited forwarding for those packets that do not match any entry of the set of flow tables.

Abstract: A method is implemented in a network element of a service network. The network element executes a packet processing element (PPE) of a plurality of PPEs, where each PPE in the plurality of PPEs executes a stage of packet processing for the service network and where the plurality of PPEs are connected to one another by a plurality of switch fabrics. The PPEs self-select a subset of a set of equivalent service chains to service with each service chain defining a subset and sequence of the plurality of PPEs. Each PPE self-selects the subset of equivalent service chains to process based upon knowledge of the plurality of PPEs servicing that stage of the full set of service chains such that there is spreading of load across all available PPEs in that stage. There is no single point of failure and minimal reassignment of PPEs for a set of equivalent data flows traversing the plurality of PPEs of the service network for changes in topography of the plurality of PPEs in the service network.

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: A network element disposed in a network, where the network element implements a process to manage load distribution across a plurality of network interfaces of the network. The network element redirects traffic flow directed toward the plurality of network interfaces in response to changes in configuration of the plurality of network interfaces, where each traffic flow is a set of protocol data units (PDUs), having an ordered delivery requirement, and where the PDUs are transmitted across the network between a source node and a destination node. The redirection process minimizes data traffic flow disruption when the load distribution is determined using a set of load distribution tables instead of a hashing algorithm.

Abstract: A network element acting as a forwarding plane within a software-defined network to reduce negative effects of slow-path packet processing is described. The network element, upon receiving a first packet, determines whether it matches any flow entry within a set of flow tables. When the first packet does not match any flow entry of the set of flow tables, the network element performs a miss procedure including inserting at least a portion of the first packet into a packet miss table of the network element, which is accessed by a controller. The controller may access the packet miss table using a pull mechanism. The miss procedure may also include accessing a configurable default rule table of the network element, which includes rules enabling limited forwarding for those packets that do not match any entry of the set of flow tables.

Abstract: A method provides load distribution that selects one of a set equal cost paths for each flow that minimizes imbalance in the distribution of flows across the set of equal cost paths. The method includes calculating the set of equal cost paths to each destination node, generating a set of next hop discriminators, each next hop discriminator to uniquely identify one of the equal cost next hops, populating the load distribution table by storing, according to a distribution mechanism, in each load distribution table entry one of the next hop discriminators from the set of next hop discriminators, receiving a first PDU from a first flow and performing a lookup of one of the next hop discriminators in the load distribution table by using values at the bit locations of the first PDU directly as an index into a CAM.

Abstract: A method to provide load distribution that selects one of a set equal cost paths for each flow that minimizes imbalance in the distribution of flows across the set of equal cost paths, the method including calculating the set of equal cost paths to each destination node, generating a set of next hop discriminators for the set of equal cost paths, each next hop discriminator in the set of next hop discriminators to uniquely identify one of the equal cost next hops, populating the load distribution table by storing, according to a distribution mechanism, in each load distribution table entry one of the next hop discriminators from the set of next hop discriminators, receiving a first PDU from a first flow and performing a lookup of one of the next hop discriminators in the load distribution table by using values at the bit locations of the first PDU directly as an index into a CAM.

Abstract: A network element disposed in a network, where the network element implements a process to manage load distribution across a plurality of network interfaces of the network. The network element redirects traffic flow directed toward the plurality of network interfaces in response to changes in configuration of the plurality of network interfaces, where each traffic flow is a set of protocol data units (PDUs), having an ordered delivery requirement, and where the PDUs are transmitted across the network between a source node and a destination node. The redirection process minimizes data traffic flow disruption when the load distribution is determined using a set of load distribution tables instead of a hashing algorithm.

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 each other and the first and second aggregate nodes, the destination node and the internal nodes of the third network only having knowledge 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 telecommunications system includes a first device having a plurality of interfaces, with each interface having a unique MAC address, the first device using the MAC addresses for forwarding frames. The system includes at least one bridge in communication with the first device. The system includes a second device in communication with the first device through the bridge having a plurality of interfaces with each interface having a unique MAC address, the first device forwarding frames to a first interface of the plurality of interfaces of the second device using the unique MAC address of the first interface of the second device. A method for communicating.

Abstract: A telecommunications system includes a source node. The system includes a plurality of destination nodes. The system includes a network having links and end stations. The system includes a plurality of switches that create paths along links between the source nodes and the destination nodes where there is 100% efficiency along the paths with the paths traversing any link only once to the corresponding destination node from the source node, and the path being a shortest path between the source node and the destination node, where each switch has a Dijkstra computation complexity of O(N) in regard to forming the shortest paths.