Ara es mostren els items 12-16 de 16

    • Nonparametric statistical methods to analyze the internet connectivity reliability 

      Papadimitriou, Dimitri; Careglio, Davide (Institute of Electrical and Electronics Engineers (IEEE), 2015)
      Text en actes de congrés
      Accés obert
      Facing computational complexity when modeling network reliability by means of parametric models and corresponding statistical methods, in the present study, we apply nonparametric statistical methods, such as the Kaplan-Meier ...
    • On the experimentation of the novel GCMR multicast routing in a large-scale testbed 

      Careglio, Davide; Papadimitriou, Dimitri; Agraz Bujan, Fernando; Sahhaf, Sahel; Perelló Muntan, Jordi; Tavernier, Wouter (Institute of Electrical and Electronics Engineers (IEEE), 2014)
      Comunicació de congrés
      Accés obert
      Originally defined in the 90s, multicast is nowadays (re)gaining interest given the increasing popularity of multimedia streaming/content traffic and the explosion of cloud services. In fact, multicast yields bandwidth ...
    • Path-vector routing stability analysis 

      Papadimitriou, Dimitri; Coras, Florin-Tudorel; Cabellos Aparicio, Alberto (2011-12)
      Article
      Accés restringit per política de l'editorial
      In this paper, we define a set of metrics that characterize the local stability properties of path-vector routing protocols such as BGP (Border Gateway Protocol). By means of these stability metrics, we propose a method ...
    • Performance analysis of multicast routing algorithms 

      Papadimitriou, Dimitri; Careglio, Davide; Demeester, Piet M.A. (Institute of Electrical and Electronics Engineers (IEEE), 2014)
      Text en actes de congrés
      Accés obert
      This paper provides a theoretical performance analysis of different classes of multicast routing algorithms, namely the Shortest Path Tree, the Steiner Tree, compact routing and greedy routing. Our motivation is to determine ...
    • Routing at large scale: advances and challenges for complex networks 

      Sahhaf, Sahel; Tavernier, Wouter; Papadimitriou, Dimitri; Careglio, Davide; Kumar, Alok; Glacet, Christian; Coudert, David; Nisse, Nicolas; Fàbrega Soler, LLuís; Vila, Pere; Camelo, Miguel; Audenaert, Pieter; Colle, Didier; Demeester, Piet M.A. (2017-07-01)
      Article
      Accés obert
      A wide range of social, technological and communication systems can be described as complex networks. Scale-free networks are one of the well known classes of complex networks in which nodes' degrees follow a power-law ...