Abstract: In one embodiment, a method includes identifying one or more channel queues associated with one or more RF channels, wherein the one or more RF channels are associated with a Data Over Cable System Interface Specification (DOCSIS) bonding group and wherein the DOCSIS bonding group receives downstream data from a first node, determining a data usage of the DOCSIS bonding group, determining that a data rate of the downstream data is to be modified based on at least one of the one or more channel queues or the data usage of the DOCSIS bonding group, and causing the first node to modify the data rate of the downstream data based on the determination.

Abstract: In one example, a Cable Modem Termination System (CMTS) determines target Radio Frequency (RF) bandwidth amounts for Data Over Cable System Interface Specification (DOCSIS) bonding groups according to the DOCSIS priority of active flows within the bonding groups. The CMTS then tunes bandwidth allocation amongst the DOCSIS bonding groups according to the target bandwidth amounts. The target bandwidth amounts can be recalculated at intervals, and the bandwidth allocation re-tuned at the intervals, to account for changes in flow activity or DOCSIS priority assignment.

Abstract: In one example, a bandwidth allocation device allocates physical channel bandwidth between local interfaces. Thereafter, at a polling time, the bandwidth allocation device determines whether there is communication activity between each local interface and the physical channel. The bandwidth allocation device can then dynamically reallocate the physical channel bandwidth at the polling time according to the communication activity determinations.

Abstract: In one example, a Cable Modem Termination System (CMTS) determines target Radio Frequency (RF) bandwidth amounts for Data Over Cable System Interface Specification (DOCSIS) bonding groups according to the DOCSIS priority of active flows within the bonding groups. The CMTS then tunes bandwidth allocation amongst the DOCSIS bonding groups according to the target bandwidth amounts. The target bandwidth amounts can be recalculated at intervals, and the bandwidth allocation re-tuned at the intervals, to account for changes in flow activity or DOCSIS priority assignment.

Abstract: A technique determines whether configured logical bandwidth allotments for logical channels are supported by maximum available physical bandwidths of physical channels assigned to those logical channels. The technique establishes a bandwidth-constraint directed acyclic graph (DAG) or “BCD” based on novel relationship rules between vertexes of the BCD that represent logical channels or unions of logical channels as well as the underlying physical channels and their maximum available bandwidth constraints. Once the BCD is established, the vertexes of the BCD may be traversed (e.g., from in-neighbor vertexes to out-neighbor vertexes) to determine whether their constraints are met.

Abstract: In one embodiment, a technique determines whether configured logical bandwidth allotments for logical channels are supported by maximum available physical bandwidths of physical channels assigned to those logical channels. The technique establishes a bandwidth-constraint directed acyclic graph (DAG) or “BCD” based on novel relationship rules between vertexes of the BCD that represent logical channels or unions of logical channels as well as the underlying physical channels and their maximum available bandwidth constraints. Once the BCD is established, the vertexes of the BCD may be traversed (e.g., from in-neighbor vertexes to out-neighbor vertexes) to determine whether their constraints are met.

Abstract: A new algorithm for clock offset estimation for resources distributed across a network (such as the Internet). By exchanging a sequence of time-stamped messages between pairs of network nodes and separately estimating variable delays for each message direction, present inventive embodiments provide estimates for clock offset between node pairs and the bias of such estimates, thereby to permit more accurate correction. Present inventive algorithms operate in a variety of peer and server network configurations while providing significant improvement in convergence speed and accuracy.

Abstract: A packet encapsulation scheme for multiplexing application sessions—Lightweight IP Encapsulation (LIPE)—is described. An LIPE packet comprises at least one multiplexing header (NH) and associated multimedia data packet (MDP). The LIPE packet uses UDP/IP as transport. An MH field further comprises a 16-bit a user identifier (UID) field, an 11 bit length indicator (LNG) field, a 1 bit “more” (M) field and an optional payload type/class of service (PT/CoS) field comprising 8 bits.

Abstract: An Internet Protocol (IP)-based network incorporates an application level switching server and a number of packet endpoints. A packet endpoint multiplexes application sessions destined for different packet endpoints into one multiplexed session that is terminated with the application level switching server. The latter extracts each application session (or packets associated therewith) and repackages, or switches, them into other multiplexed sessions such that at least two switched packets are transmitted to different packet endpoints. The multiplexed sessions utilize either RTP/UDP/IP or UDP/IP encapsulation.

Abstract: A new RSVP-based tunnel protocol establishes packet tunnels between a tunnel source point (TSP) and a tunnel destination point (TDP) such that guaranteed services to aggregated packet flows is provided. In particular, an end-to-end RSVP session is mapped using a receiver-oriented RSVP type of signaling such that the TDP determines tunnel mapping. As such, this new RSVP-type of protocol is compatible with the receiver-driven nature of RSVP. Subsequent to admitting RSVP sessions, a tunnel tuning procedure dynamically adapts existing RSVP tunnels to traffic conditions in order to improve bandwidth efficiency. This tunnel tuning procedure may result in RSVP tunnel re-assignment of some of the admitted end-to-end sessions.

Abstract: A new algorithm for clock offset estimation for resources distributed across a network (such as the Internet). By exchanging a sequence of time-stamped messages between pairs of network nodes and separately estimating variable delays for each message direction, present inventive embodiments provide estimates for clock offset between node pairs and the bias of such estimates, thereby to permit more accurate correction. Present inventive algorithms operate in a variety of peer and server network configurations while providing significant improvement in convergence speed and accuracy.

Abstract: A real-time method for routing subject to an acceptable delay constraint between nodes in high-speed data networks, such as PNNI protocol networks, uses an illustrative two-phase algorithm employing Dijkstra's algorithm at each phase. In an illustrative first phase, the Dijkstra SPF algorithm is used in seeking the shortest cumulative delay from the destination to the source, thereby generating cumulative delay labels from a node j to the destination node k. The delay results are then employed in the second phase, where the Dijkstra SPF algorithm is illustratively employed for determining administrative weight (AW) as the link metric subject to modification in accordance with results obtained in the first phase.