Flexible scheme for admission control of multimedia streams on integrated networks

• US 5,408,465 A
• Filed: 06/21/1993
• Issued: 04/18/1995
• Est. Priority Date: 06/21/1993
• Status: Expired due to Term

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Company (HP Inc.)
• Inventors: Ramanathan, Srinivas, Gusella, Riccardo
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): BLUM, RUSSELL
• Application Number:
  US08/080,606
• Time in Patent Office: 666 Days
• Field of Search: 370/17, 370/60, 370/60.1, 370/94.1
• US Class Current: 370/231
• CPC Class Codes: H04L 12/5602 Bandwidth control in ATM Networks, e.g. leaky bucket
• CPC Class Codes: H04L 2012/5619 Network Node Interface, e.g. tandem connections, transit switching
• CPC Class Codes: H04L 2012/5632 Bandwidth allocation
• CPC Class Codes: H04L 2012/5636 Monitoring or policing, e.g. compliance with allocated rate, corrective actions
• CPC Class Codes: H04L 2012/5638 Services, e.g. multimedia, GOS, QOS
• CPC Class Codes: H04L 2012/5651 Priority, marking, classes
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections
• CPC Class Codes: H04Q 2213/1307 Call setup
• CPC Class Codes: H04Q 2213/13095 PIN / Access code, authentication
• CPC Class Codes: H04Q 2213/13141 Hunting for free outlet, circuit or channel
• CPC Class Codes: H04Q 2213/1316 Service observation, testing
• CPC Class Codes: H04Q 2213/13166 Fault prevention
• CPC Class Codes: H04Q 2213/13209 ISDN
• CPC Class Codes: H04Q 2213/13274 Call rejection, call barring
• CPC Class Codes: H04Q 2213/13344 Overflow

Abstract

An admission control scheme for real-time traffic requests in communication networks is disclosed. The scheme monitors tile performance of each link and predicts the traffic guarantees that can be offered when certain dummy traffic (pseudo traffic) mimicking the behavior of real-time streams is added to the existing traffic. When an application requests connection to the network, it specifies a Quality of Service (QoS) bound that it desires. A routing subsystem of tile network makes use of the predicted values while attempting to find a path over which tile application'"'"'s QoS bound requirement will be satisfied. After the route is chosen, connection setup will involve verifying at each node along the route whether sufficient resources exist to support tile new connection. This explicit verification is likely to be necessary because the routing subsystem does not normally have up-to-date global state information. After admitting tile application, the network provides a soft guarantee that the QoS bound provided to it will be adhered to for most of the time. On the other hand, if no path through the network satisfies the QoS hound, tile application is denied connection to the network.

Claims

1. A method for monitoring performance of a link in a network having a plurality of nodes interconnected by links, each of the nodes having at least one queue associated with each of the links, said method comprising:

adding pseudo traffic to existing traffic through a queue associated with a link, but not on the link itself; and

predicting at least one performance guarantee that the link can offer to a connection request.

2. A method as recited in claim 1, wherein tile performance guarantee is predicted by determining whether the link can support the pseudo traffic without violating performance guarantees of the existing traffic on the link.

3. A method as recited in claim 1, wherein the performance guarantee is one of a delay guarantee and a loss guarantee.

4. An admission control method for admitting a connection request to a network, the network includes a plurality of nodes interconnected by links, each of the nodes having at least one queue associated with each of the links, said method comprising the steps of:

(a) inducing pseudo traffic into a plurality of the queues associated with the links, but not on the links themselves;

(b) subsequently measuring performance parameters of the queues; and

(c) determining whether to admit the connection request based on the measured performance parameters.

5. A method as recited in claim 4, wherein tile connection request is a real-time connection request, and wherein the queues are real-time queues.

6. A method as recited in claim 5, wherein said method firther comprises the steps of:

(d) determining, prior to step (c), the queues unable to handle the pseudo traffic and identifying the same as unavailable queues; and

(e) removing the pseudo traffic from the unavailable queues.

7. A method as recited in claim 6, wherein said determining step (d) determines the queues unable to handle the pseudo traffic by determining the queues that can no longer continue to satisfy their performance guarantees to existing connections after the pseudo traffic is induced.

8. A method as recited in claim 6, wherein the connection request specifies at least an end-end performance bound, a traffic contract, and a destination network host, and

wherein said determining step (c) comprises the steps of:

(c1) distributing the measured performance parameters and information on the unavailable queues to a routing system;

(c2) determining a proposed path for the connection request through the network from a source network host to the destination network host via only the queues that can handle the pseudo traffic;

(c3) determine whether the sum of the performance parameter measurements through the queues in the proposed path is not greater than the end-end performance bound of the connection request; and

(c4) deciding whether to admit the connecting request based on said determining step (c3).

9. A method as recited in claim 8, wherein the measured performance parameters are queue delays, and the end-end performance bound is an end-end delay bound.

10. A method as recited in claim 8, wherein the measured performance parameters are loss ratios, and tile end-end performance bound is an end-end loss bound.

11. A method as recited in claim 6, wherein the connection request specifies at least an end-end performance bound and a destination network host,

wherein said method further comprises the step of (t) determining, prior to step (c), a maximum amount of pseudo traffic which each of the queues can take on while still satisfying their performance guarantees to existing connections, and

wherein said determining step (c) comprises the steps of:

(c1) distributing tile measured performance parameters and the maximum amounts of pseudo traffic to a routing system;

(c2) determining a proposed path for the application request through the network from a source network host to the destination network host via only the links in which the queue associated therewith has sufficient bandwidth to support the connection request; and

(c3) deciding whether to admit the connection request based on whether the sum of the performance parameter measurements through the links in the proposed path is less than or equal to the end-end performance bound of the application request.

12. A method as recited in claim 11, wherein the connection request further specifies a traffic contract defined by a token-bucket descriptor (r, b), and the maximum amount of pseudo traffic is defined by a token-bucket descriptor (R, B), and

wherein step (c2) determines that the links have sufficient bandwidth to support the connection request when the token-bucket descriptor (r, b) of the connection request is less than or equal to the token-bucket descriptor (R, B) of the maximum amount of pseudo traffic.

13. A method as recited in claim 5,

wherein said inducing step (a) induces a plurality of streams of the pseudo traffic into the queue associated with each of the links,

wherein said method further comprises the step of (d) predicting a number of connection requests which each of the links can simultaneously admit to said network without violating performance commitments by said network to existing connections, and

wherein said determining step (c) includes determining whether to admit simultaneous connection requests based on the numbers predicted in step (d).

24. A method as recited in claim 4, wherein said inducing and said measuring occur before a connection request is received, and said determining occurs after the connection request is received.

14. A network node for an integrated network, comprising:

a connection circuit for passing traffic by operatively connecting an incoming link to an outgoing link;

a pseudo traffic controller for supplying pseudo traffic;

a first queue, operatively connected to said connection circuit and said pseudo traffic controller, for queuing the pseudo traffic and real-time traffic; and

a performance parameter prediction unit, operatively connected to said first queue, for predicting a performance parameter of said first queue,

wherein said connection circuit transmits the real-time traffic output from said first queue and discards the pseudo traffic output from said first queue.

15. A network node as recited in claim 14, wherein said network node further comprises admission means for determining whether to admit a connection request to the network based on the predicted performance parameter.

16. A network node as recited in claim 14, wherein said network node further comprises means for distributing the performance parameter predicted to a routing system.

17. A network node as recited in claim 14, wherein said node further comprises a second queue for queuing best-effort traffic, and wherein said connection circuit transmits the real-time traffic and the best-effort traffic.

18. A network node as recited in claim 17, wherein said connection circuit transmits the best-effort traffic in place of the pseudo traffic.

19. A network node as recited in claim 17, wherein tile traffic comprises packets of data, and

wherein said node further comprises:

a comparator for comparing a header of each packet of the traffic exiting said first queue with a predetermined pseudo traffic identifier; and

a selector for selecting a packet exiting said first queue for transmission by said connection circuit when said comparator indicates that the packet exiting said first queue is from the real-time traffic and for selecting a packet of the best-effort traffic from said second queue for transmission by said connection circuit when said comparator indicates that the packet exiting said first queue is from the pseudo traffic.

20. A network node as recited in claim 14, wherein said node comprises a plurality of said first queues for each of the links, each of said first queues corresponding to a different traffic class.

21. An admission control system for controlling admission of an additional connection to an integrated network, a connection request for the admission of the additional connection to the integrated network includes an end-to-end performance bound requirement, the integrated network having a plurality of nodes interconnected by links, each of the nodes having at least one queue associated with each of its outgoing links, said system comprising:

link-level admission control means for monitoring available network resources, said link-level admission control means including at least

means for inducing pseudo traffic into the queue of each of the outgoing links, but not on the links themselves,

means for measuring a performance parameter of the queue for each of the outgoing links, and

means for determining whether each of the outgoing links can handle the additional connection based on the measured performance parameters; and

network-level admission control means for deciding whether to accept or reject the additional connection, said network-level admission control means including at least

means for determining a potential path for the connection request in accordance with the measured performance parameters and the end-to-end performance bound requirement of the connection request,

means for determining a sum of the measured performance parameters for each of the outgoing link in the potential path, and

means for accepting the additional connection along the potential path when the sum of the measured performance parameters is not more than the end-to-end performance bound requirement of the connection request.

22. An integrated network, comprising:

a plurality of nodes interconnected by links, each of the nodes having at least one queue associated with each of the links for temporarily storing real-time traffic for the respective link;

means for inducing pseudo traffic into the queues associated with each of the links, but not on the links themselves; and

congestion detection means for measuring performance of the queues to proactively predict congestion of the links.

23. An integrated network as recited in claim 22, wherein said network provides performance commitments to connections admitted to said network, and

wherein said congestion detection means measures a performance parameter for each of the queues after the pseudo traffic has been induced and then predicts whether said network can continue to satisfy the performance commitments provided to connections already admitted to said network if a connection request is admitted to said network.