Abstract:
First and second quality of service translators (206, 210) receive resource constraint inputs from source (202) and destination (204) users respectively. The translators (206, 210) each produce a requested and acceptable resource constraint set that are merged in a quality of service consolidator (208). An acceptable path between the source and destination is selected by a routing function unit (212) receiving input from the quality of service consolidator (208). Resources along the acceptable path are then allocated by a network resource allocator (214) coupled to the routing function unit (212). The merge scheme 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:
The problem of allocating bandwidth on the upstream channel (26) of an HFC cable network (10) for contention-based transmission of requests that are used to reserve upstream bandwidth (26) for transmission of user data is solved by a method of allocation which dynamically adapts to the prevailing offered load of reservation requests. In one embodiment this is done by determining an appropriate size for a contention interval in each upstream transmission frame by attempting to balance the rates of flow of user data into and out of a virtual global data queue using a fluid approximation method that is based on a solution to a balanced equation relating the demand and supply of slots for data transmission within each frame.
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.
Abstract:
The method of the present invention provides efficient aggregation of link metrics for a subnetwork (102, 202, 302) in a communication network (100, 200, 300) having a plurality of interconnected subnetworks (102, 202, 302) that includes nodes (A, B, C, D) and links. Link metric values are summarized on a full-mesh topology (202) and encoded by a spanning tree topology (1004). The method encodes the link metric information contained in full-mesh topology with minimum compromise in the capability to recover it.
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 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 system, device, and method for scheduling data transmission opportunities for variable bit rate traffic provides data transmission opportunities at a peak cell rate when the end user is actively transmitting data, and provides data transmission opportunities at a lower rate when the end user has no data to transmit. When the end user has no data to transmit, any excess data transmission opportunities (i.e., data transmission opportunities from the lower rate up to the peak cell rate) are available for statistically multiplexing traffic from other end users. Various embodiments utilize a lower rate anywhere between a zero rate and a sustainable cell rate, inclusive. Alternative embodiments allocate a burst of data transmission opportunities equivalent to a maximum burst size at the peak cell rate when the end user has data to transmit, after which the end user is once again provided data transmission opportunities at the lower rate.
Abstract:
A method (300) and communication system (400, 500, 600, 1300, 1400) provide a remote procedure call from a client to a server via un unreliable communication channel using a plurality of retransmission timers. The method includes the client transmitting to the server a request (302) and waiting for a confirm message, and the client retransmitting the request after each of a predetermined sequence of time-out periods (308, 312) implemented by the plurality of retransmission timers until a confirm message (316) is received from the server.
Abstract:
First and second quality of service translators (206, 210) receive resource constraint inputs from source (202) and destination (204) users respectively. The translators (206, 210) each produce a requested and acceptable resource constraint set that are merged in a quality of service consolidator (208). An acceptable path between the source and destination is selected by a routing function unit (212) receiving input from the quality of service consolidator (208). Resources along the acceptable path are then allocated by a network resource allocator (214) coupled to the routing function unit (212). The merge scheme is particularly useful in consolidation of preferential resource constraints in ATM cell relay networks, especially LANS and WANS.