- Complex Network Analysis Techniques
- Opportunistic and Delay-Tolerant Networks
- Network Traffic and Congestion Control
- Mobile Ad Hoc Networks
- Human Mobility and Location-Based Analysis
- Network Security and Intrusion Detection
- Caching and Content Delivery
- Graph theory and applications
- Advanced Graph Neural Networks
- Internet Traffic Analysis and Secure E-voting
- Computability, Logic, AI Algorithms
- Opinion Dynamics and Social Influence
- Peer-to-Peer Network Technologies
- Energy Efficient Wireless Sensor Networks
- Software-Defined Networks and 5G
- Cellular Automata and Applications
- Interconnection Networks and Systems
- Wireless Networks and Protocols
- Image and Video Quality Assessment
- Cooperative Communication and Network Coding
- Video Coding and Compression Technologies
- Wireless Communication Networks Research
- Distributed and Parallel Computing Systems
- Topological and Geometric Data Analysis
- Gene Regulatory Network Analysis
Laboratório Nacional de Computação Científica
2014-2024
Universidade Tecnológica Federal do Paraná
2021
Brazilian Computer Society
2021
Netherlands Aerospace Centre
2011-2021
Karolinska Institutet
2020-2021
Universidade de Fortaleza
2019
Universidade Federal de Minas Gerais
2015-2018
National Energy Research Scientific Computing Center
2018
Sorbonne Université
2001-2012
Universidade Federal do Rio de Janeiro
2001-2004
Geolocation of Internet hosts enables a new class location-aware applications. Previous measurement-based approaches use reference hosts, called landmarks, with well-known geographic location to provide the estimation target host. This leads discrete space answers, limiting number possible estimates adopted landmarks. In contrast, we propose Constraint-Based (CBG), which infers using multilateration distance constraints establish continuous answers instead one. However, in Internet,...
We present a novel and complete tool-set for evaluating the delivery quality of MPEG video transmissions in simulations network environment. This is based on EvalVid framework. extend connecting interfaces to replace its simple error simulation model by more general simulator like NS2. With this combination, researchers practitioners can analyze through performance real streams, i.e. taking into account semantics, under large range scenarios. To demonstrate usefulness our new tool-set, we...
Graph-based models form a fundamental aspect of data representation in Data Sciences and play key role modeling complex networked systems. In particular, recently there is an ever-increasing interest dynamic networks, i.e. networks which the topological structure (nodes edges) may vary over time. this context, we propose novel model for representing finite discrete Time-Varying Graphs (TVGs), are typically used to We analyze structures built from our proposed demonstrate that, most practical...
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer time-varying networks, as well higher-order while also having property being isomorphic to directed graph. In particular, we show that, consequence properties associated with structure, can be represented in matrix form. Moreover, that any possible function (algorithm) obtained from this matrix-based representation. This an important theoretical...
Despite the growing interest in cryptocurrencies, delays incurred to confirm transactions are one of factors that hamper wide adoption systems such as Bitcoin. Bitcoin usually confirmed short periods (minutes), but still much larger than conventional credit card (seconds). In this work, we propose a framework encompassing machine learning and queueing theory model (i) identify which will be confirmed; (ii) characterize confirmation time transactions. The proposed accounts for activity blocks...
Abstract The unprecedented size of the human population, along with its associated economic activities, has an ever‐increasing impact on global environments. Across world, countries are concerned about growing resource consumption and capacity ecosystems to provide resources. To effectively conserve biodiversity, it is essential make indicators knowledge openly available decision‐makers in ways that they can use them. development deployment tools techniques generate these require having...
Detection is a crucial step towards efficiently diagnosing network traffic anomalies within an autonomous system (AS). We propose the adoption of nonextensive entropy - one-parameter generalization Shannon to detect in AS. Experimental results show that our approach based on outperforms previous ones classical while providing enhanced flexibility, which enabled by possibility fine-tuning sensitivity detection mechanism.
There is an ever-increasing interest in investigating dynamics time-varying graphs (TVGs). Nevertheless, so far, the notion of centrality TVG scenarios usually refers to metrics that assess relative importance nodes along temporal evolution dynamic complex network. For some scenarios, however, more important than identifying central under a given node definition key time instants for taking certain actions. In this paper, we thus introduce and investigate TVGs. Analogously centrality,...
Geolocation of Internet hosts enables a diverse and interesting new class location-aware applications. Previous measurement-based approaches use reference hosts, called landmarks, with well-known geographic location to provide the estimation target host. This leads discrete space answers, limiting number possible estimates adopted landmarks. In contrast, we propose Constraint-Based (CBG), which infers using multilateration distance constraints, thus establishing continuous answers instead...
Grids are likely to be the mainstay of distributed computing. Grid was firstly applied as a concept for sharing computing resources among wired nodes, but there has been growing interest in extending this mobile environments. Although significant work done towards grids, much it followed centralized approaches based on infrastructure wireless networks. We believe that less restrictive, decentralized approach supports collaboration ad-hoc networks can cater novel grid applications. To address...
The failure of legacy packet markers such as the Single Rate Three Color Marker (SRTCM) and Two (TRTCM) to distinguish important less data renders them unsuitable for MPEG video transmission in a DiffServ network. Therefore, we propose Markers System (TMS) improve delivery quality streams. We use authentic MPEG4 traffic traces compare performance proposed TMS system with those markers. Results show that outperforms terms delivered
Network managers face nowadays a challenging problem to detect traffic from Skype, very popular application for VoIP communications. If no restrictive firewalls are adopted, Skype uses UDP as its preferred transport protocol, but it is known that due high capacity of adaptation, can operate behind many and network proxies without user configuration. Behind firewalls, Web TCP ports (80 or 443) fallback mechanism delude other elements. This strategy renders disguised quite difficult by...
Distributed denial of service attacks currently represent a serious threat to the appropriate operation Internet services. To deal with this threat, we propose an overlay network that provides IP-traceback scheme at level autonomous systems. Our proposed system-level system contrasts previous works because it does not require priori knowledge topology and allows single-packet traceback incremental deployment. first contribution is new extension Border Gateway Protocol update-message...
The ever-increasing usage of mobile phones challenges carriers to evolve and improve their services based on users' behavior. Nevertheless, it remains uncommon the data about human mobility for discovering patterns which could support dynamic resource allocation in urban areas. In particular, occasional large scale events impose that may strongly differ from those observed daily routines. this paper, we present a methodology characterize workload dynamics phone network during events. Our...
We propose a method for the Distributed Assessment of Closeness CEntrality Ranking (DACCER) in complex networks. DACCER computes centrality based only on localized information restricted to given neighborhood around each node, thus not requiring full knowledge network topology. show that node ranking computed by is highly correlated with traditional closeness centrality, which requires high computational costs and This outcome quite useful vast potential applicability seldom applied...