Abstract: Disclosed is a method for aggregating parallel data links connecting two end-point devices into a logical link. If one of the parallel data links is a multi-point link, then an end-point device can still access that link to route traffic to an end station on the link (that is, to a device other than the other end-point device of the logical data link). In the terminology of this disclosure, the logical aggregated link is accessed through an “aggregated port” on an end-point device, while the constituent multi-point link is accessed directly through a “singleton port.” By assigning a smaller cost to the aggregated port than to the singleton port, embodiments avoid creating routing loops. In some embodiments, the aggregation is performed at Layer 2 of the Open System Interconnection seven-layer protocol model. Then, the methods of the present invention work well with existing IEEE 802.1 bridging architectures and protocols.

Abstract: A system for facilitating bandwidth management in a routing domain is presented. In the system, area bandwidth managers are coupled to a domain bandwidth manager and arranged in accordance with an Open Shortest Path First (OSPF) hierarchical routing topology with the domain bandwidth manager at an upper level of the topology. Each area bandwidth manager is located in a different area of the routing topology in at least one lower level of the topology. The domain bandwidth manager and the area bandwidth managers cooperatively coordinate admission control to a routing domain for facilitating a communication session between a source device and a destination device.

Abstract: Disclosed is a method for aggregating parallel data links connecting two end-point devices into a logical link. If one of the parallel data links is a multi-point link, then an end-point device can still access that link to route traffic to an end station on the link (that is, to a device other than the other end-point device of the logical data link). In the terminology of this disclosure, the logical aggregated link is accessed through an “aggregated port” on an end-point device, while the constituent multi-point link is accessed directly through a “singleton port.” By assigning a smaller cost to the aggregated port than to the singleton port, embodiments avoid creating routing loops. In some embodiments, the aggregation is performed at Layer 2 of the Open System Interconnection seven-layer protocol model. Then, the methods of the present invention work well with existing IEEE 802.1 bridging architectures and protocols.

Abstract: A bandwidth manager sets a target packet loss probability under the assumption that the channel is perfect. A real-time estimation of an effective probability of packet loss caused by collisions (referred to as load-specific packet loss probability) is then determined by filtering out statistics relating to packet loss probability that exceeds the target packet loss probability. The probability of packet loss caused by channel impairments (referred to as impairment-specific packet loss probability) is computed after the estimates of both the load-specific packet loss probability and an overall packet loss probability is estimated. The channel quality is then estimated in terms of the impairment-specific packet loss probability by considering the overhead due to retransmissions of lost packets caused by channel impairments.

Abstract: The method of the present invention provides efficient aggregation of link metrics for a subnetwork in a communication network having a plurality of interconnected subnetworks that consist of nodes and links. The method includes: selecting, by a predetermined subnetwork leader, a subset of nodes in the subnetwork to be exposed nodes; for each link metric, generating, by the subnetwork leader, a spanning tree virtual topology connecting the exposed nodes; and assigning link metric values to the virtual links on the spanning tree and advertising the metric values in a topology broadcast by the subnetwork leader.

Abstract: A device (500) and method (300) provide for management of resource allocation on selected links in a connection-oriented communication network such that existing connections may share the burden of freeing up resources for accommodating new connections. The rate of a connection is dynamically adjusted, on a connection-by-connection basis, using information on the status of each link broadcast throughout the network. Links are marked based on control information in the link state, and the in-call rate adjustment is based on negotiable Quality of Service, QOS, parameters.

Abstract: A novel resource constraint merge scheme combines the requested and acceptable resource constraint sets for an efficient solution to the problem of consolidating preferential resource constraints. This solution is particularly useful in consolidation of preferential resource constraints in ATM cell relay networks, especially LANs and WANs.

Abstract: A method (800, 900, 1000) provides dynamic connection management in integrated communication networks such that an acceptable quality of service (QOS) over an entire duration of a connection is maintained. For example, the present invention facilitates adjustment of the QOS towards a requested level for a permanent voice call, holding a connection intact until a desired path is obtained. Where possible, a new path for the connection provides at least one agreed value that is renegotiated to a more desirable value without degrading the other agreed values.

Abstract: A mechanism and method control software overloads in a communication network system to preserve the throughput capacity of the system in a simple and efficient manner. System load is regulated by accepting, deferring or rejecting work that the system is requested to perform. The criteria used to accept, defer or reject work is based on the relevance of the request and availability of system resources.

Abstract: A fallback strategy for a system (700) and method (200) is provided for rerouting a call that fails to be established utilizing a first set of constraints in a communication network system. This strategy enables the communication network system to utilize a look-around-first type of preemption that avoids unnecessary preemption and provides alternate routing for a call according to predetermined constraints selected by a user.