000154045 001__ 154045
000154045 005__ 20180913060038.0
000154045 037__ $$aCONF
000154045 245__ $$aVerifiable Network-Performance Measurements
000154045 269__ $$a2010
000154045 260__ $$c2010
000154045 336__ $$aConference Papers
000154045 520__ $$aIn the current Internet, there is no clean way for affected parties to react to poor forwarding performance: to detect and assess Service Level Agreement (SLA) violations by a contractual partner, a domain must resort to ad-hoc monitoring using probes. Instead, we propose "Network Confessional," a new, systematic approach to the problem of forwarding-performance verification. Our system relies on voluntary reporting, allowing each network domain to disclose its loss and delay performance to its customers and peers and, potentially, a regulator. Most importantly, it enables verifiable performance measurements, i.e., domains cannot abuse it to significantly exaggerate their performance. Finally, our system is tunable, allowing each participating domain to determine how many resources to devote to it independently (i.e., without any inter-domain coordination),  exposing a controllable trade-off between performance-verification quality and resource consumption. Our system comes at the cost of deploying modest functionality at the participating domains' border routers; we show that it requires reasonable resources, well within modern network capabilities.
000154045 6531_ $$aNetwork performance
000154045 6531_ $$aSLA verification
000154045 700__ $$0243542$$aArgyraki, Katerina$$g176638
000154045 700__ $$aManiatis, Petros
000154045 700__ $$aSingla, Ankit
000154045 7112_ $$aACM International Conference on emerging Networking EXperiments and Technologies (CoNext)$$cPhiladelphia, PA, USA$$dNovember 30 - December 3, 2010
000154045 773__ $$tProceedings of the 6th ACM International Conference on emerging Networking EXperiments and Technologies  (CoNext)
000154045 8564_ $$s250181$$uhttps://infoscience.epfl.ch/record/154045/files/NetworkConfessionalConext2010_1.pdf$$yPublisher's version$$zPublisher's version
000154045 909C0 $$0252412$$pNAL$$xU12550
000154045 909CO $$ooai:infoscience.tind.io:154045$$pconf$$pIC
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 917Z8 $$x176638
000154045 937__ $$aEPFL-CONF-154045
000154045 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000154045 980__ $$aCONF