Abstract: A data communication system dynamically selects timer durations to ensure delivery of data at a desired bit rate. A source or proxy source transmits data, such as streaming media, to a destination according to a dynamic bit rate timer, where the timer regulates the transmission frequency and/or the packet size of the data being transmitted. The timer dynamically adapts the transmission frequency or packet size according to the relative positioning of data pointers in a buffer and effectively changes the rate of data delivery. In this way, data may be delivered at the desired average bit rate to the destination despite network capacity fluctuations.

Abstract: An apparatus and method to provide a portable networking interface for distributed switching systems. Two Application Program Interfaces (APIs) are defined for communication to a Forwarding Database Distribution Library (FDDL). The FDDL sits between network client applications and the switch device driver in order to provide a uniform interface to the switch device driver. Towers may be added to the FDDL to provide additional functionality specific to certain client applications.

Abstract: An apparatus and method to provide a portable networking interface for distributed switching systems. Two Application Program Interfaces (APIs) are defined for communication to a Forwarding Database Distribution Library (FDDL). The FDDL sits between network client applications and the switch device driver in order to provide a uniform interface to the switch device driver. Towers may be added to the FDDL to provide additional functionality specific to certain client applications.

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: When Internet Protocol (IP) packets or Layer-2 MAC Protocol packets are encapsulated in a MultiProtocol Label Switching (MPLS) packet, one or more labels are assigned to identify the routers of the MPLS network through which the packet has passed. From this information, the underlying protocol (e.g., IP, MAC) can be inferred. In one embodiment, the value assigned to the one or more labels is selected to identify the underlying protocol. In one embodiment, IP packets have label values in a first range and MAC packets have label values in a second range. When the MPLS-encapsulated packets are switched within a load sharing environment, the ranges of the label values indicate the underlying protocol of the packet being switched. Knowing the underlying protocol enables a hash function to be selected that will both preserve packet ordering and effectively load share traffic received from a higher-speed source link across multiple lower-speed links.

Abstract: When Internet Protocol (IP) packets or Layer-2 MAC Protocol packets are encapsulated in a MultiProtocol Label Switching (MPLS) packet, one or more labels are assigned to identify the routers of the MPLS network through which the packet has passed. From this information, the underlying protocol (e.g., IP, MAC) can be inferred. In one embodiment, the value assigned to the one or more labels is selected to identify the underlying protocol. In one embodiment, IP packets have label values in a first range and MAC packets have label values in a second range. When the MPLS-encapsulated packets are switched within a load sharing environment, the ranges of the label values indicate the underlying protocol of the packet being switched. Knowing the underlying protocol enables a hash function to be selected that will both preserve packet ordering and effectively load share traffic received from a higher-speed source link across multiple lower-speed links.