![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/2F9D4415-EB7F-49E3-B2C4-87DD564E6E20 | - |
| Identifier | https://doi.org/10.1109/INFCOM.2001.916285 | - |
| Identifier | http://www.comp.nus.edu.sg/~chancy/infocom01.pdf | - |
| Language | en | - |
| Extent | 12 pages | en |
| Title | Efficiently monitoring bandwidth and latency in IP networks | en |
| Creator | Breitbart, Y | en |
| Creator | Chan Chee-Yong | en |
| Creator | Garofalakis Minos | en |
| Creator | Γαροφαλακης Μινως | el |
| Creator | Rastogi Rajeev | en |
| Creator | Silberschatz Avi | en |
| Publisher | Institute of Electrical and Electronics Engineers | en |
| Content Summary | Effective monitoring of network utilization and performance indicators is a key enabling technology for proactive and reactive resource management, flexible accounting, and intelligent planning in nextgeneration IP networks. In this paper, we address the challenging problem of efficiently monitoring bandwidth utilization and path latencies in an IP data network. Unlike earlier approaches, our measurement architecture assumes a single point-of-control in the network (corresponding to the Network Operations Center) that is responsible for gathering bandwidth and latency information using widely-deployed management tools, like SNMP, RMON/NetFlow, and explicitly-routed IP probe packets. Our goal is to identify effective techniques for monitoring (a) bandwidth usage for a given set of links or packet flows, and (b) path latencies for a given set of paths, while minimizing the overhead imposed by the management tools on the underlying production network. We demonstrate that minimizing overheads under our measurement model gives rise to new combinatorial optimization problems, most of which prove to be ✂✁-hard. We also propose novel approximation algorithms for these optimization problems and prove guaranteed upper bounds on their worst-case performance. Our simulation results validate our approach, demonstrating the effectiveness of our novel monitoring algorithms over a wide range of network topologies. | en |
| Type of Item | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Type of Item | Conference Full Paper | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-12-01 | - |
| Date of Publication | 2001 | - |
| Subject | Data management | en |
| Bibliographic Citation | Y. Breitbart, C-Y Chan, M. Garofalakis, R. Rastogi and A. Silberschatz, "Efficiently monitoring bandwidth and latency in IP networks", in Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, Apr. 2001, pp. 933-942. doi: 10.1109/INFCOM.2001.916285 | en |
Copyright © DIAS 2013
