241documents trouvés
An efficient method for service level agreement assessment
R.SERRAL-GRACIA, M.YANNUZZI, Y.LABIT, P.OWEZARSKI, X.MASIP-BRUIN
UPC, OLC
Revue Scientifique : Computer Networks: The International Journal of Computer and Telecommunications Networking, Vol.54, N°17, pp.3144-3158, Décembre 2010 , N° 09817
Lien : http://hal.archives-ouvertes.fr/hal-00391702/fr/
Diffusable
Plus d'informations
Abstract
On-line end-to-end Service Level Agreement (SLA) monitoring is of key importance nowadays. For this purpose, recent researches have focused on measuring (when possible), or estimating (most of the times) network Quality of Service (QoS) and performance parameters. Up to now, all the proposed solutions have the drawback of requiring a huge amount of resources with low accuracy, generally leading to unscalable systems. We observe, however, that the accurate estimation of network QoS parameters is not necessarily required for SLA assessment. What is required is an efficient and scalable method to directly detect SLA violations. To this end, this paper makes the following contributions. First, we introduce a polynomial-complexity algorithm based on Hausdorff Distance that efficiently detects SLA violations. Second, we propose a Simplified Hausdorff Distance, which provides better accuracy at lower computational cost. Our solution works on simple to measure time seriesthe Inter-Packet Arrival Times (IPATs) received in our case. The validity of our proposal is confirmed by comparing with perfect knowledge of the QoS status as well as other existing alternatives in a real testbed.
Deliverable D4.1. Experimental scenarios including evaluation criteria and methodology
C.BARAKAT, P.CASAS HERNANDEZ, B.DONNET, M.HOERDT, A.KRIFA, Y.LABIT, S.LATRE, G.LEDUC, J.MAZEL, S.MELIS, P.OWEZARSKI, D.PAPADIMITRIOU, B.PUYPE, D.SAUCEZ, W.VAN DE MEERSSCHE, B.WILLEMAERS
INRIA Sophia, OLC, UCL, IBBT, ULg, ALB
Rapport de Contrat : ECODE FP7-ICT-2007-2-1.6-223936-D4.1, Novembre 2010, 47p. , N° 10701
Diffusable
123099Deliverable D3.3. Experimental evaluation of T01
A.KRIFA, I.LASSOUED, C.BARAKAT, P.CASAS HERNANDEZ, P.OWEZARSKI, J.MAZEL, Y.LABIT
INRIA Sophia, OLC
Rapport de Contrat : ECODE FP7-ICT-2007-2-1.6-223936-D3.3, Novembre 2010, 64p. , N° 10698
Diffusable
123082On the impact of monitoring router energy consumption for greening the internet
A.ADELIN, P.OWEZARSKI, T.GAYRAUD
OLC
Manifestation avec acte : IEEE/ACM International Conference on Grid Computing (Grid 2010), Bruxelles (Belgique), 25-29 Octobre 2010, pp.298-304 , N° 10489
Lien : http://hal.archives-ouvertes.fr/hal-00505509/fr/
Diffusable
122974Luth: composing and parallelizing midpoint inspection devices
I.ALBERDI, V.NICOMETTE, P.OWEZARSKI
OLC, TSF
Manifestation avec acte : International Conference on Network and System Security (NSS 2010), Melbourne (Australie), 1-3 Septembre 2010, pp.9-16 , N° 10291
Diffusable
Plus d'informations
Mots-Clés / Keywords
IPS; IDS; Firewall; Internet;
Rethinking iBGP routing
M.OPRESCU, M.MEULLE, S.UHLIG, C.PELSSER, O.MAENNEL, P.OWEZARSKI
OLC, Orange Labs, Deutsch Telekom Labs, IIJ
Manifestation avec acte : Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM 2010), New Delhi (Inde), 30 Août - 3 Septembre 2010, pp.411-412 , N° 10318
Lien : http://hal.archives-ouvertes.fr/hal-00487074/fr/
Diffusable
Plus d'informations
Abstract
The Internet is organized as a collection of administra- tive domains, known as Autonomous Systems (ASes). These ASes interact through the Border Gateway Protocol (BGP) that allows them to share reachability information. Adjacent routers in distinct ASes use external BGP (eBGP), whereas in a given AS routes are propagated over internal BGP (iBGP) sessions between any pair of routers. In large ASes where a logical full-mesh is not possible, confederations or route reflectors (RRs) are used. However, these somewhat scalable alternatives have introduced their own set of unpredictable effects (persistent routing oscillations and forwarding loops causing an increase of the convergence time) extensively addressed in the literature [1]. The solution we propose to these issues consists of a structured routing overlay holding a comprehensive view of the routes. We describe the design of a distributed entity that performs BGP route pre-computation for its clients inside a large backbone network and propagates the paths to the routers. Compared to the current iBGP routing, the advantage of the overlay approach is the separation between the responsibility of the control plane (route storage and best path computation) and the forwarding of the packets. One of the major improvements we bring is the divided routing table tackling the scalability concerns and allowing for parallel computation of paths.
Experience with monitoring electrical power consumed by routers
A.ADELIN, P.OWEZARSKI, T.GAYRAUD
OLC
Rapport LAAS N°10488, Août 2010, 5p.
Lien : http://hal.archives-ouvertes.fr/hal-00505510/fr/
Diffusable
1222640day anomaly detection made possible thanks to machine learning
P.OWEZARSKI, J.MAZEL, Y.LABIT
OLC
Conférence invitée : International Conference on Wired/Wireless Internat Communications (WWIC 2010), Lulea (Suède), 1-3 Juin 2010, pp.327-338 , N° 10213
Lien : http://hal.archives-ouvertes.fr/hal-00466317/fr/
Diffusable
121593Oday anomaly detection through machine learning
J.MAZEL, P.OWEZARSKI, Y.LABIT
OLC
Manifestation avec acte : Conférence sur la Sécurité des Architectures Réseaux et Systèmes d'Information (SAR-SSI), Menton (France), 18-21 Mai 2010, 18p. , N° 10132
Diffusable
121513Monitoring malware collection
I.ALBERDI, V.NICOMETTE, P.OWEZARSKI
OLC, TSF
Rapport LAAS N°10292, Mai 2010, 17p.
Diffusable
121385