Abstract: A Point to Point Protocol (“PPP”) link running PPP Multilink Protocol with multi-class extensions (“Multilink-Extension”) having both peers on the PPP link support a number of egress priority queues negotiated during the Multilink-Extension negotiation. Each peer also establishes a number of classes equal to the negotiated number of egress priority queues. Thus, communication devices that have a different default number, or different maximum number, of egress priority queues can interoperate in a manner that ensures packets have the same per-hop behavior (“PHB”). The present invention is both memory efficient and processing time efficient because only the minimum number of egress priority queues necessary are instantiated.

Abstract: A first node includes ports and a controller to receive a test packet at a first one of the ports. The first node determines whether the received test packet has a destination address that matches one or more predefined addresses associated with a second node. Presence of a loop in a communications network in which the first and second nodes are located is indicated in response to detecting receipt of the test packet containing the matching destination address.

Abstract: Described are a method and a device for efficiently switching multicast data flows from a shared distribution tree to a shortest path distribution tree. The method achieves an efficient and scalable tree switch that reduces the latency of multicast data transmitted from the source to receivers. A determination is made for each source group (S,G) entry in a portion of a forwarding plane database of a router as to whether a byte count for that entry exceeds a threshold value. A message sent from the forwarding plane to the router control plane indicates the (S,G) entries determined to have byte counts exceeding the respective threshold values. For each message entry, the respective shared distribution tree is switched to a shortest path distribution tree. The method achieves a substantial reduction in the number of inter-process messages exchanged between the control plane and the forwarding plane compared to conventional tree switchover techniques.

Abstract: Method for wireless communications network self-configuration. A preferred embodiment comprises determining a state for communications links in the communications network, entering a normal operating mode, and periodically repeating. The determining of communications link state creates a set of shortest paths connecting each access point in the communications network to a wired access point. If a change in the communications network is detected, the connectivity of each access point to the wired access point is verified and the method is repeated to create a potentially new set of shortest paths. Automatic configuration is enabled to provide a measure of fault tolerance.

Abstract: A method and system enables policy-based traffic forwarding in a data network by implementing policy-based control over propagation of LSA messages through the data network. A route tag is asserted in respect of a link state advertisement (LSA) message advertising a network address. Propagation of the LSA through the data network is controlled using the asserted internal route tag. At each hop, a policy decision affecting the forwarding of the LSA is made. Exemplary policy decisions include, Pass and Discard. In addition, the forwarding table may be updated using the route and address information contained in the LSA. In this case, routes entered in the forwarding table may be tagged as an inclusion route or an exclusion route. This may be based on the value of an exclusion route flag, which can, for example, be provided as a binary “0” or “1” inserted into an unused portion of the options field of the LSA.

Abstract: According to the principles of the invention, there is provided a conferencing system that dynamically assigns calls to DSP resources. The system may attempt to process each audio conference on a single DSP node, so that information about conference participants does not need to be shared across DSP nodes. Further, the mapping of call channels to resources within a DSP node may be automated so that it is transparent to a conferencing system control application. Where more than one DSP node is required for a particular conference, there is further provided a system for linking DSP nodes. There are also provided methods for managing audio conferencing resources.