Browsing by Author "Demeester, Piet M.A."
Iterative research method applied to the design and evaluation of a dynamic multicast routing scheme Papadimitriou, Dimitri; Coras, Florin-Tudorel; Rodríguez Natal, Alberto; Carela Español, Valentín; Careglio, Davide; Fàbrega, Lluís; Vila, Pere; Demeester, Piet M.A. (Springer-Verlag Berlin Heidelberg, 2013)
Restricted access - publisher's policyFollowing the iterative research cycle process, this chapter elaborates a methodology and documents the steps followed for the design of a dynamic multicast routing algorithm, referred to as Greedy Compact Multicast Routing. ...
Papadimitriou, Dimitri; Fàbrega Soler, LLuís; Vilà Talleda, Pere; Careglio, Davide; Demeester, Piet M.A. (Springer, 2013)
Open AccessAiming at creating a dynamic between elaboration, realization, and validation by means of iterative cycles of experimentation, Future Internet Research and Experimentation (FIRE) projects have been rapidly confronted to ...
Papadimitriou, Dimitri; Careglio, Davide; Demeester, Piet M.A. (Institute of Electrical and Electronics Engineers (IEEE), 2014)
Open AccessThis 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 ...
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)
Open AccessA 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 ...