Efficiently monitoring bandwidth and latency in IP networks

Breitbart, Yuri; Chan, Chee-Yong; Garofalakis, Minos; Rastogi, Rajeev; Silberschatz, Abraham

doi:10.1109/infcom.2001.916285

Cited by 84 publications

(84 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are, however, applications of the vertex covering problem and other, closely related optimization problems [2,3] to a huge number of real-world network problems, examples are the monitoring of Internet traffic [4], the prevention of denial-of-service attacks [5] and immunization strategies in networks [6]. Another technically related network problem is the one of counting loops in networks, recently analyzed on the basis of statistical-physics methods [7].…”

Section: Introductionmentioning

confidence: 99%

Message passing for vertex covers

2006

View full text Add to dashboard Cite

Constructing a minimal vertex cover of a graph can be seen as a prototype for a combinatorial optimization problem under hard constraints. In this paper, we develop and analyze message passing techniques, namely warning and survey propagation, which serve as efficient heuristic algorithms for solving these computational hard problems. We show also, how previously obtained results on the typical-case behavior of vertex covers of random graphs can be recovered starting from the message passing equations, and how they can be extended.

show abstract

Section: Introductionmentioning

confidence: 99%

Message passing for vertex covers

2006

View full text Add to dashboard Cite

show abstract

“…Essentially, due to the small number of paths actually monitored, it is possible for errors to be introduced when round-trip times between tracers are used to approximate arbitrary path latencies. Recently, in [7], the authors propose a monitoring scheme where a single network operations center (NOC) performs all the required measurements. In order to monitor links not in its routing tree, the NOC uses the IP source routing option to explicitly route probe packets along the link.…”

Section: A Related Workmentioning

confidence: 99%

“…Each router along the path followed by the packet then decrements the TTL value by one until it reaches zero. When a router decrements the TTL field to zero, it discards the packet and sends an ICMP "time expired" reply to the packet's source node 7 . Now suppose that we would like link e = (u, v) ∈ T s to be monitored by station s ∈ S, and let node v be the node that is further from s. Our strategy is to appropriately set the TTL values in the two probe messages m(s, u) and m(s, v) that measure link e's delay, such that the probes can also detect changes in T s due to e's failure.…”

Section: A Detecting a Network Link Failurementioning

confidence: 99%

Robust monitoring of link delays and faults in IP networks

Bejerano¹,

Rastogi²

IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37

106

135

View full text Add to dashboard Cite

-In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach attempts to minimize both the monitoring infrastructure costs as well as the additional traffic due to probe messages. In the first phase of our approach, we compute the locations of a minimal set of monitoring stations such that all network links are covered, even in the presence of several link failures. Subsequently, in the second phase, we compute a minimal set of probe messages that are transmitted by the stations to measure link delays and isolate network faults. We show that both the station selection problem as well as the probe assignment problem are NP-hard. We then propose greedy approximation algorithms that achieve a logarithmic approximation factor for the station selection problem and a constant factor for the probe assignment problem. These approximation ratios are provably very close to the best possible bounds for any algorithm.

show abstract

“…In efficient reactive monitoring [11], global polling is combined with local event driven reporting to monitor IP networks. Breitbart et al [6] use probing-based techniques where path latencies and bandwidth are measured by transmitting probes from a single point of control. They find the optimal number of probes using vertex cover solutions.…”

Section: Network Tomography and Violation Detectionmentioning

confidence: 99%