System and method for monitoring link delays and faults in an IP network

1. A system for monitoring link delays and faults in an IP network, comprising:

a monitoring station identifier that computes a set of monitoring stations for a plurality of network trees that covers links, including at least one link that is not included in at least one of said network trees, in at least a portion of said network, wherein each of said monitoring stations monitors one network tree, at least one monitoring station also monitoring said at least one link; and wherein said set of monitoring stations is selected as a minimal set; and

a probe message identifier, coupled to said monitoring station identifier, that computes a set of probe messages to be transmitted by at least ones of said set of monitoring stations such that said delays and faults in specific links spanning said set of monitoring stations, including said at least one link, can be determined.

2. The system as recited in claim 1 wherein said set of probe messages is a minimal set.

3. The system as recited in claim 1 wherein said set of monitoring stations covers links in an entirety of said network.

4. The system as recited in claim 1 wherein said probe messages have a selected one of:

identical message costs, and

message costs that are based on a number of hops to be made by said probe messages.

5. The system of claim 1 , wherein said probe message identifier, coupled to said monitoring station identifier, employs polynomial-time approximation to compute said set of probe messages to be transmitted by at least ones of said set of monitoring stations such that said delays and faults can be determined.

6. The system as recited in claim 1 , wherein said minimal set of monitoring stations is an optimal set of monitoring stations.

7. A method of monitoring link delays and faults in an IP network, comprising:

computing a set of monitoring stations for a plurality of network trees that covers links, including at least one link that is not included in at least one of said network trees, in at least a portion of said network, wherein each of said monitoring stations monitors one network tree, at least one monitoring station also monitoring said at least one link, wherein said set of monitoring stations is selected as a minimal set; and

computing a set of probe messages to be transmitted by at least ones of said set of monitoring stations such that said delays and faults in specific links spanning said set of monitoring stations, including said at least one link, can be determined.

8. The method as recited in claim 7 wherein said set of probe messages is a minimal set.

9. The method as recited in claim 7 wherein said set of monitoring stations covers links in an entirety of said network.

10. The method as recited in claim 7 wherein said probe messages have a selected one of:

identical message costs, and message costs that are based on a number of hops to be made by said probe messages.

11. The method of claim 7 , wherein said computing said set of monitoring stations comprises employing polynomial-time approximation algorithms.

12. A system for monitoring link delays and faults in an IP network, comprising:

a monitoring station identifier that employs polynomial-time approximation algorithms to compute a selected minimal set of monitoring stations for a plurality of network trees that covers links, including at least one link that is not included in at least one of said network trees, in at least a portion of said network, wherein each of said monitoring stations monitors one network tree, at least one monitoring station also monitoring said at least one link; and

a probe message identifier, coupled to said monitoring station identifier, that employs polynomial-time approximation algorithms to compute a minimal set of probe messages to be transmitted by at least ones of said set of monitoring stations such that said delays and faults, including said at least one link, can be determined.

13. The system as recited in claim 12 wherein said set of monitoring stations covers links in an entirety of said network.

14. The system as recited in claim 12 wherein said probe messages have a selected one of:

identical message costs, and

message costs that are based on a number of hops to be made by said probe messages.

15. The system as recited in claim 12 wherein said minimal set of monitoring stations guarantees delay and fault monitoring of all active links in a presence of at most K-1 failures.

16. The system as recited in claim 12 wherein said minimal set of monitoring stations always covers said links in said at least said portion of said network.

17. A system for monitoring link delays and faults in an IP network, comprising:

a monitoring station identifier that computes a set of monitoring stations for a plurality of network trees that covers links, including at least one link that is not included in at least one of said network trees, in at least a portion of said network, wherein each of said monitoring stations monitors one network tree, at least one monitoring station also monitoring said at least one link, wherein said set of monitoring stations is a minimal set; and

a probe message identifier, coupled to said monitoring station identifier, that computes a set of probe messages to be transmitted by at least ones of said set of monitoring stations such that said delays and faults in specific links spanning said set of monitoring stations, including said at least one link, can be determined,

wherein said minimal set of stations satisfies at least two constraints:

a covering set constraint; and

a covering assignment constraint.

18. A method of monitoring link delays and faults in an IP network, comprising:

computing a set of monitoring stations for a plurality of network trees that covers links, including at least one link that is not included in at least one of said network trees, in at least a portion of said network, wherein each of said monitoring stations monitors one network tree, and at least one monitoring station monitors said at least one link, wherein said set of monitoring stations is a minimal set; and

computing a set of probe messages to be transmitted by at least ones of said set of monitoring stations such that said delays and faults in specific links spanning said set of monitoring stations, including said at least one link, can be determined

wherein said minimal set of stations satisfies at least two constraints:

a covering set constraint; and

a covering assignment constraint.