Abstract: A system and method for adaptive congestion management uses measurements of usage of each edge network segment both per-customer and for each edge network segment as a whole. The technique then processes these measurements to determine what changes to make to allowed transfer rates to alleviate congestion. Adaptive congestion management also uses these measurements to determine when to remove any restrictions on transfer rates in the case that the edge network segment is no longer congested.

Abstract: An improved method of hierarchical output queueing of packets for a network scheduler of a network gateway that determines delays needed to conform to applicable rate shaping, and enqueues the packets based on the delay. Queues are associated with different classes of service (CoS), and within each class, each queue has a different scheduled time upon which it becomes available for dequeuing. A single set of CoS queues can support a large number of devices, improving the efficiency of software-based queuing by reducing the number of queues and simplifying queue polling.

Abstract: A system and method for adaptive congestion management uses measurements of usage of each edge network segment both per-customer and for each edge network segment as a whole. The technique then processes these measurements to determine what changes to make to allowed transfer rates to alleviate congestion. Adaptive congestion management also uses these measurements to determine when to remove any restrictions on transfer rates in the case that the edge network segment is no longer congested.

Abstract: A system and method for adaptive congestion management uses measurements of usage of each edge network segment both per-customer and for each edge network segment as a whole. The technique then processes these measurements to determine what changes to make to allowed transfer rates to alleviate congestion. Adaptive congestion management also uses these measurements to determine when to remove any restrictions on transfer rates in the case that the edge network segment is no longer congested.

Abstract: An improved method of hierarchical output queueing of packets for a network scheduler of a network gateway that determines delays needed to conform to applicable rate shaping, and enqueues the packets based on the delay. Queues are associated with different classes of service (CoS), and within each class, each queue has a different scheduled time upon which it becomes available for dequeuing. A single set of CoS queues can support a large number of devices, improving the efficiency of software-based queuing by reducing the number of queues and simplifying queue polling.

Abstract: An improved method of hierarchical output queueing of packets for a network scheduler of a network gateway that determines delays needed to conform to applicable rate shaping, and enqueues the packets based on the delay. Queues are associated with different classes of service (CoS), and within each class, each queue has a different scheduled time upon which it becomes available for dequeuing. A single set of CoS queues can support a large number of devices, improving the efficiency of software-based queuing by reducing the number of queues and simplifying queue polling.

Abstract: An improved method of hierarchical output queuing of packets for a network scheduler of a network gateway that determines delays needed to conform to applicable rate shaping, and enqueues the packets based on the delay. Queues are associated with different classes of service (CoS), and within each class, each queue has a different scheduled time upon which it becomes available for dequeuing. A single set of CoS queues can support a large number of devices, improving the efficiency of software-based queuing by reducing the number of queues and simplifying queue polling.

Abstract: An improved method of hierarchical output queueing of packets for a network scheduler of a network gateway that determines delays needed to conform to applicable rate shaping, and enqueues the packets based on the delay. Queues are associated with different classes of service (CoS), and within each class, each queue has a different scheduled time upon which it becomes available for dequeuing. A single set of CoS queues can support a large number of devices, improving the efficiency of software-based queuing by reducing the number of queues and simplifying queue polling.

Abstract: An improved method of hierarchical output queuing of packets for a network scheduler of a network gateway that determines delays needed to conform to applicable rate shaping, and enqueues the packets based on the delay. Queues are associated with different classes of service (CoS), and within each class, each queue has a different scheduled time upon which it becomes available for dequeuing. A single set of CoS queues can support a large number of devices, improving the efficiency of software-based queuing by reducing the number of queues and simplifying queue polling.

Abstract: A pre-paid service system configured to provide a subscriber interface to a Subscriber and receive a service level selection from the subscriber, wherein the service level selection includes a capacity limit and/or a time limit. Upon authorization of a payment, the system activates the Subscriber's service. The system also monitors the Subscriber's usage data and time of activation. When the Subscriber's usage data amount or time of activation meets or exceeds the selected service level, the system may deactivate the Subscriber's service.

Abstract: A content delivery system including a subscriber controller and cache, a source controller configured to transmit content to the subscriber controller and cache via a multicast transmission; and a network content delivery controller (NCDC) in communication with the subscriber controller and cache and source controller. A control plane is used to communicate the delivery of control information using Extensible Messaging and Presence Protocol (XMPP) between the subscriber controller and cache, source controller, and NCDC.

Abstract: A system and method for adaptive congestion management uses measurements of usage of each edge network segment both per-customer and for each edge network segment as a whole. The technique then processes these measurements to determine what changes to make to allowed transfer rates to alleviate congestion. Adaptive congestion management also uses these measurements to determine when to remove any restrictions on transfer rates in the case that the edge network segment is no longer congested.

Abstract: A pre-paid service system configured to provide a subscriber interface to a Subscriber and receive a service level selection from the subscriber, wherein the service level selection includes a capacity limit and/or a time limit. Upon authorization of a payment, the system activates the Subscriber's service. The system also monitors the Subscriber's usage data and time of activation. When the Subscriber's usage data amount or time of activation meets or exceeds the selected service level, the system may deactivate the Subscriber's service.

Abstract: A content delivery system including a subscriber controller and cache, a source controller configured to transmit content to the subscriber controller and cache via a multicast transmission; and a network content delivery controller (NCDC) in communication with the subscriber controller and cache and source controller. A control plane is used to communicate the delivery of control information using Extensible Messaging and Presence Protocol (XMPP) between the subscriber controller and cache, source controller, and NCDC.

Abstract: A technique for generating, distributing and maintaining a list of operational nodes in a network using a nonbroadcast communication medium, wherein the nodes first collectively agree on the identity of a designated node. Once the designated node is agreed on, the other nodes periodically send Hello messages to it and the designated nodes compiles a list of operational nodes based in part on the Hello messages it receives, and periodically sends a Hello message to each node on the list. The Hello message from the designated node includes a list of addresses of active neighbor nodes, so that every node periodically receives a list of operational neighbor nodes. The number of messages needed to implement this scheme is proportional to the number of nodes, rather than the square of the number of nodes as in a conventional approach in which each node advised every other node of its presence.

Abstract: A method of transferring foreign protocol information across a hierarchical backbone network is disclosed. The hierarchical backbone network operates according to a first protocol and includes multiple areas, some of which have a destination that operates according to a second protocol. Additionally, each area has at least one router located therein. The locations of the destinations in each area are identified to the router in that area. Information that identifies the locations of the destinations in each area is transferred to a router in each of the other areas regardless of whether the destinations are located in the same area as the router. Finally, information formatted according to the second protocol is transferred among any of the destinations.

Abstract: A communication network consists of end units (EUs) and distribution units (DUs) coupled together by links which may include local area networks (LANs). The units maintain neighbor tables by sending out Hello messages which indicate the unit type and contain the network service access point (NSAP) IDs or addresses of the units. Data messages (packets) mainly originate and end at EUs. An EU maintains only partial routing information about neighbors, while the DUs collectively maintain complete information about all NSAPs. So if an EU wants to send a packet to an EU which is not a neighbour (and sometimes even if it is), it need merely send it to a neighboring DU; that DU, along with the other DUs, must find a route to the destination EU. This invention provides a hybrid unit (HU), which acts as a DU to EUs but as an EU to DUs. The HU provides DU-like message forwarding but only on a local basis within a subnetwork of EUs and HUs.

Abstract: A method of merging networks across a common backbone network in which destinations are grouped into domains based on needs of network users to communicate with one another. Domain information is added to the level one routing control packets transmitted by the grouped destinations to identify the logical address (destination number coupled with domain number) of a specific destination. Additionally, routers in the network are configured with mapping information that relates the destination number of each associated destination with its logical address. Filtering information may be included in the configuration of the level one and level two routers. Filtering information identifies domains that associated destinations may transmit information to or receive information from. With filtering information, system routers can be configured to announce the reachability of specific destinations in selected domains based on overall system considerations.